Theoretical and Algorithmic Foundations of Wireless Ad Hoc and Sensor Networks

Wireless ad hoc and sensor networks have attracted much attention in the past few years due to their widely potential applications such as airport, conference, hospital, battlefield, rescue, and monitoring scenarios.The ad hoc and sensor networks have their unique characteristics such as infrastructureless, self-organized, self-configured, and supporting interactions with environments, which make them different from classic computer networks and infrastructure-based wireless networks.While much work has been done in protocol and system design, simulation, and experimental study for wireless ad hoc and sensor networks, the theoretical research, however, falls short of the expectation of the future networking deployment.Recent research in mobile ad hoc networks and wireless sensor networks raises a number of interesting, and difficult, theoretical and algorithmic issues.The objective of this special issue is to gather recent advances in the areas of wireless ad hoc and sensor networks, with a focus of theoretical and algorithmic aspect.In particular, it is devoted to distributed algorithms, randomized algorithms, analysis and modeling, optimizations, and theoretical methods in design and analysis of networking protocols for wireless ad hoc and sensor networks.In this special issue, we selected 19 papers from 54 submissions.The selected papers may be classified into five categories: (1) coverage and localization in wireless sensor networks; (2) energy efficiency in wireless sensor networks;(3) link layer and physical layer issues; (4) performance optimization; (5) tracking, data gathering tree, and transport layer in wireless sensor networks.A detailed description of the corresponding selected works in each category is given below.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.