Much research has been done on wireless sensor networks. However, most protocols and algorithms for such networks are based on the ideal model Unit Disk Graph (UDG) model or do not assume any model. Furthermore, many results assume the knowledge of location information of the network. In practice, sensor networks often deviate from the UDG model significantly. It is not uncommon to observe stable long links that are more than five times longer than unstable short links in real wireless networks. A more general network model, the quasi unit-disk graph (quasi-UDG) model, captures much better the characteristics of wireless networks. However, the understanding of the properties of general quasi-UDGs has been very limited, which is impeding the design of key network protocols and algorithms. In this dissertation we study the properties for general wireless sensor networks and develop new topological/geometrical techniques for wireless sensor networking. We assume neither the ideal UDG model nor the location information of the nodes. Instead we work on the more general quasi-UDG model and focus on figuring out the relationship between the geometrical properties and the topological properties of wireless sensor networks. Based on such relationships we develop algorithms that can compute useful substructures (planar subnetworks, boundaries, etc.). We also present direct applications of the properties and substructures we constructed including routing, data storage, topology discovery, etc. We prove that wireless networks based on quasi-UDG model exhibit nice properties like separabilities, existences of constant stretch backbones, etc. We develop efficient algorithms that can obtain relatively dense planar subnetworks for wireless sensor networks. We also present efficient routing protocols and balanced data storage scheme that supports ranged queries. We present algorithmic results that can also be applied to other fields (e.g., information management). Based on divide and conquer and improved color coding technique, we develop algorithms for path, matching and packing problem that significantly improve previous best algorithms. We prove that it is unlikely for certain problems in operation science and information management to have any relatively effective algorithm or approximation algorithm for them.

Learn the fundamental algorithms and protocols for wireless and mobile ad hoc networks Advances in wireless networking and mobile communication technologies, coupled with the proliferation of portable computers, have led to development efforts for wireless and mobile ad hoc networks. This book focuses on several aspects of wireless ad hoc networks, particularly algorithmic methods and distributed computing with mobility and computation capabilities. It covers everything readers need to build a foundation for the design of future mobile ad hoc networks: Establishing an efficient communication infrastructure Robustness control for network-wide broadcast The taxonomy of routing algorithms Adaptive backbone multicast routing The effect of inference on routing Routing protocols in intermittently connected mobile ad hoc networks and delay tolerant networks Transport layer protocols ACK-thinning techniques for TCP in MANETs Power control protocols Power saving in solar powered WLAN mesh networks Reputation and trust-based systems Vehicular ad hoc networks Cluster interconnection in 802.15.4 beacon enabled networks The book is complemented with a set of exercises that challenge readers to test their understanding of the material. Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks is appropriate as a self-study guide for electrical engineers, computer engineers, network engineers, and computer science specialists. It also serves as a valuable supplemental textbook in computer science, electrical engineering, and network engineering courses at the advanced undergraduate and graduate levels.

This book provides a systematic treatment of the theoretical foundation and algorithmic tools necessary in the design of energy-efficient algorithms and protocols in wireless body sensor networks (WBSNs). These problems addressed in the book are of both fundamental and practical importance. Specifically, the book delivers a comprehensive treatment on the following problems ranging from theoretical modeling and analysis, to practical algorithm design and optimization: energy-efficient clustering-based leader election algorithms in WBSNs; MAC protocol for duty-cycling WBSNs with concurrent traffic; multi-channel broadcast algorithms in duty-cycling WBSNs; and energy-efficient sleep scheduling algorithms in WBSNs. Target readers of the book are researchers and advanced-level engineering students interested in acquiring in-depth knowledge on the topic and on WBSNs and their applications, both from theoretical and engineering perspective.

The Handbook of Algorithms for Wireless Networking and Mobile Computing focuses on several aspects of mobile computing, particularly algorithmic methods and distributed computing with mobile communications capability. It provides the topics that are crucial for building the foundation for the design and construction of future generations of mobile and wireless networks, including cellular, wireless ad hoc, sensor, and ubiquitous networks. Following an analysis of fundamental algorithms and protocols, the book offers a basic overview of wireless technologies and networks. Other topics include issues related to mobility, aspects of QoS provisioning in wireless networks, future applications, and much more.

A one-stop resource for the use of algorithms and protocols in wireless sensor networks From an established international researcher in the field, this edited volume provides readers with comprehensive coverage of the fundamental algorithms and protocols for wireless sensor networks. It identifies the research that needs to be conducted on a number of levels to design and assess the deployment of wireless sensor networks, and provides an in-depth analysis of the development of the next generation of heterogeneous wireless sensor networks. Divided into nineteen succinct chapters, the book covers: mobility management and resource allocation algorithms; communication models; energy and power consumption algorithms; performance modeling and simulation; authentication and reputation mechanisms; algorithms for wireless sensor and mesh networks; and algorithm methods for pervasive and ubiquitous computing; among other topics. Complete with a set of challenging exercises, this book is a valuable resource for electrical engineers, computer engineers, network engineers, and computer science specialists. Useful for instructors and students alike, Algorithms and Protocols for Wireless Sensor Networks is an ideal textbook for advanced undergraduate and graduate courses in computer science, electrical engineering,and network engineering.

This book constitutes the refereed proceedings of the 6th Annual International Conference on Wireless Algorithms, Systems, and Applications, WASA 2011, held in Chengdu, China, in August 2011. The 26 revised full papers and 13 invited papers presented were carefully reviewed and selected from numerous submissions. The papers address all current trends, challenges, and state of the art solutions related to various issues in wireless networks. Topics of interests include, but not limited to, effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and test bed validation, and new application exploration in wireless networks.

This book constitutes the proceedings of the 11th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2016, held in Bozeman, MT, USA, in August 2016.The 50 full papers and 9 invited papers presented werde carefully reviewed and selected from 148 submissions. WASA is designed to be a forum for theoreticians, system and application designers, protocol developers and practitioners to discuss and express their views on the current trends, challenges, and state-of-the-art solutions related to various issues in wireless networks. Topics of interests include, but not limited to, effective and efficient state-of-the-art algorithm design and analysis, reliable and secure system development and implementations, experimental study and testbed validation, and new application exploration in wireless networks.