Wireless Network Algorithms, Systems, and Applications
- PDF / 54,012 Bytes
- 3 Pages / 600.05 x 792 pts Page_size
- 94 Downloads / 209 Views
Editorial Wireless Network Algorithms, Systems, and Applications Benyuan Liu,1 Azer Bestavros,2 Jie Wang,1 and Ding-Zhu Du3 1 Department
of Computer Science, University of Massachusetts Lowell, Lowell, MA 01854, USA of Computer Science, Boston University, MA 02215, USA 3 Department of Computer Science, University of Texas at Dallas, TX 75083, USA 2 Department
Correspondence should be addressed to Benyuan Liu, [email protected] Received 3 February 2010; Accepted 3 February 2010 Copyright © 2010 Benyuan Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Advances in wireless communication and networking technologies proliferate ubiquitous infrastructure and ad hoc wireless networks, enabling a wide variety of applications ranging from environment monitoring to health care, from critical infrastructure protection to wireless security, to name just a few. The complexity and ramifications of the fast-growing number of mobile users and the variety of services intensify the interest in developing principles, algorithms, design methodologies, and systematic evaluation frameworks for the next-generation wireless networks. This special issue contains twelve papers selected from submissions through open calls and the technical program of the Fourth Annual International Conference on Wireless Algorithms, Systems, and Applications (WASA 2009), held in Boston, Massachusetts, USA, during August 16–18, 2009. These papers highlight some of the current research interests and achievements in the area of wireless communication and networking. The topics include routing, localization, scheduling, target detection and coverage, and privacy in mobile ad hoc networks and sensor networks. F. Li, S. Chen, and Y. Wang’s paper presents Circular Sailing Routing (CSR), a routing protocol that provides a load-balanced routing for wireless networks. Their method maps the network onto a sphere via stereographic projection and makes routing decision by “circular distance” on the sphere. They show that the distance traveled by packets in CSR is bounded above by a small constant factor of the length of the shortest path. J. Choi, B.-Y. Choi, S. Song, and K.-H. Lee’s paper presents a network quality-aware routing (NQAR) mechanism to avoid noisy paths with high possibility of collision, and thus save time from transmission backoffs and retransmissions. Their experiment results show that NQAR
effectively reduces the end-to-end delay and outperforms the direct diffusion mechanisms under error-prone environments. T. Le and Y. Liu’s paper studies the capacity of hybrid wireless networks with opportunistic routing. They present a linear programming method to calculate the end-toend throughput in a hybrid network. They show that opportunistic routing can efficiently utilize base stations and achieve significantly higher capacity than traditional unicast routing. C. Laurendeau and M. Barbeau
Data Loading...
