Theoretical and Algorithmic Foundations of Wireless Ad Hoc and Sensor Networks

Yu Wang, Xinbing Wang, Ping Ji, Peter Müller, Xiaohua Jia, Athanasios Vasilakos
2010 EURASIP Journal on Wireless Communications and Networking  
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
more » ... h 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. Coverage and Localization in Wireless Sensor Networks The first paper, entitled "Perimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover range" by Hung and Lui, studies the perimeter coverage problem in sensor networks, where the perimeter of an object needs to be monitored by multiple sensors, but each sensor can only cover a single continuous portion of the perimeter. The authors first show that the problem of finding optimal scheduling of sensors such that the network lifetime is maximized is NP-hard. They further identify the sufficient conditions for a scheduling algorithm to be a 2approximation solution to the general problem and propose a simple distributed 2-approximation solution with a small message overhead. The second paper, "Characterizing the path coverage of random wireless sensor networks" by Noori et al., investigates the path coverage of a randomly deployed sensor network, which aims to monitor a circular path and discover any
doi:10.1155/2010/313047 fatcat:ecpbqu4c4jcj7f24dmrw7qgc4u