Xiang-Yang Li – författare

Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects brings together leading researchers and developers in the field of wireless sensor networks to explain the special problems and challenges of the algorithmic aspects of sensor and ad-hoc networks. The book also fosters communication not only between the different sensor and ad-hoc communities, but also between those communities and the distributed systems and information systems communities.The book defines and establishes a common infrastructure of the discipline and develops a consensus-based resource that will provide a foundation for implementation, standardization, and further research. The book identifies and defines fundamental concepts and techniques, resolves conflicts between certain approaches in the area and provides a common ground for advanced research and development in algorithmic aspects of sensor and ad-hoc networks, concentrating on the special challenges of the sensor and mobile and wireless environments. The topics that are addressed pertain to the sensors and mobile environment.

If you have to understand and optimize the performance of wireless ad hoc and sensor networks, this explanation provides you with the information and insights you need. It delivers an understanding of the underlying problems, and the techniques to develop efficient solutions and maximize network performance. Taking an algorithmic and theoretical approach, Li dissects key layers of a wireless network, from the physical and MAC layers (covering the IEEE 802.11 and 802.16 protocols, and protocols for wireless sensor networks and Bluetooth) through to the network routing layer. In doing so he reviews the practical protocols, formulates problems mathematically, solves them algorithmically and then analyses the performance. Graduate students, researchers and practitioners needing an overview of the various algorithmic, graph theoretical, computational geometric and probabilistic approaches to solving problems in designing these networks will find this an invaluable resource. Additional resources for this title are available online at www.cambridge.org/9780521865234.

Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects brings together leading researchers and developers in the field of wireless sensor networks to explain the special problems and challenges of the algorithmic aspects of sensor and ad-hoc networks. The book also fosters communication not only between the different sensor and ad-hoc communities, but also between those communities and the distributed systems and information systems communities.The book defines and establishes a common infrastructure of the discipline and develops a consensus-based resource that will provide a foundation for implementation, standardization, and further research. The book identifies and defines fundamental concepts and techniques, resolves conflicts between certain approaches in the area and provides a common ground for advanced research and development in algorithmic aspects of sensor and ad-hoc networks, concentrating on the special challenges of the sensor and mobile and wireless environments. The topics that are addressed pertain to the sensors and mobile environment.

This book constitutes the refereed proceedings of the Third International Conference on Algorithmic Aspects in Information and Management, AAIM 2007, held in Portland, OR, USA in June 2007. The 39 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on graph algorithms, combinatorics, scheduling, graph theory, network algorithms, game theory, option theory, computational geometry, graph theory and combinatorics, as well as networks and data.

This book constitutes the joint refereed proceedings of the 5th International Frontiers of Algorithmics Workshop, FAW 2011, and the 7th International Conference on Algorithmic Aspects in Information and Management, AAIM 2011, jointly held in Jinhua, China, in May 2011. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 92 submissions. The papers cover a wide range of topics in the areas of algorithmics, combinatorial optimization and their applications presenting current trends of research.