One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.
This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions. The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms.
The State Of The Art Of Sensor Networks Written by an international team of recognized experts in sensor networks from prestigious organizations such as Motorola, Fujitsu, the Massachusetts Institute of Technology, Cornell University, and the University of Illinois, Handbook of Sensor Networks: Algorithms and Architectures tackles important challenges and presents the latest trends and innovations in this growing field. Striking a balance between theoretical and practical coverage, this comprehensive reference explores a myriad of possible architectures for future commercial, social, and educational applications, and offers insightful information and analyses of critical issues, including: * Sensor training and security * Embedded operating systems * Signal processing and medium access * Target location, tracking, and sensor localization * Broadcasting, routing, and sensor area coverage * Topology construction and maintenance * Data-centric protocols and data gathering * Time synchronization and calibration * Energy scavenging and power sources With exercises throughout, students, researchers, and professionals in computer science, electrical engineering, and telecommunications will find this an essential read to bring themselves up to date on the key challenges affecting the sensors industry.
This book constitutes the refereed proceedings of the 6th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2007, held in Morelia, Mexico, in September 2007. The 21 revised full papers were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on routing, topology control, security and privacy, protocols, as well as quality of service and performance.
This book surveys state-of-the-art optimization modeling for design, analysis, and management of wireless networks, such as cellular and wireless local area networks (LANs), and the services they deliver. The past two decades have seen a tremendous growth in the deployment and use of wireless networks. The current-generation wireless systems can provide mobile users with high-speed data services at rates substantially higher than those of the previous generation. As a result, the demand for mobile information services with high reliability, fast response times, and ubiquitous connectivity continues to increase rapidly. The optimization of system performance has become critically important both in terms of practical utility and commercial viability, and presents a rich area for research. In the editors' previous work on traditional wired networks, we have observed that designing low cost, survivable telecommunication networks involves extremely complicated processes. Commercial products available to help with this task typically have been based on simulation and/or proprietary heuristics. As demonstrated in this book, however, mathematical programming deserves a prominent place in the designer's toolkit. Convenient modeling languages and powerful optimization solvers have greatly facilitated the implementation of mathematical programming theory into the practice of commercial network design. These points are equally relevant and applicable in today’s world of wireless network technology and design. But there are new issues as well: many wireless network design decisions, such as routing and facility/element location, must be dealt with in innovative ways that are unique and distinct from wired (fiber optic) networks. The book specifically treats the recent research and the use of modeling languages and network optimization techniques that are playing particularly important and distinctive roles in the wireless domain.
This book constitutes the refereed proceedings of the Second International Conference on Ad-Hoc Networks and Wireless, ADHOiNOW 2003, held in Montreal, Canada in October 2003. The 23 revised full papers and 4 revised short papers presented were carefully reviewed and selected from 42 submissions. All current aspects of ad-hoc networking, mobile, wireless, and cooperating communication systems are addressed including network architectures, access control and discovery, multicasting protocols, performance, quality of service, QoS, routing protocols, scalability, security, and self-configuration.
This book provides essential future directions for IoT and Big Data research. Thanks to rapid advances in sensors and wireless technology, Internet of Things (IoT)-related applications are attracting more and more attention. As more devices are connected, they become potential components for smart applications. Thus, there is a new global interest in these applications in various domains such as health, agriculture, energy, security and retail. The main objective of this book is to reflect the multifaceted nature of IoT and Big Data in a single source. Accordingly, each chapter addresses a specific domain that is now being significantly impacted by the spread of soft computing
This book constitutes the thoroughly refereed post-proceedings of the IFIP TC6 5th International Workshop on Active Networks, IWAN 2003, held in Kyoto, Japan, in December 2003. The 24 revised full papers presented were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on high performance and network processors, high-level active network applications, low-level active network applications, self-organization of active services, experiences with service engineering for active networks, management in active networks, and selected topics in active networks.
Overview and Goals Wireless communication technologies are undergoing rapid advancements. The last few years have experienced a steep growth in research in the area of wireless sensor networks (WSNs). In WSNs, communication takes place with the help of spatially distributedautonomoussensornodesequippedtosensespeci?cinformation. WSNs, especially the ones that have gained much popularity in the recent years, are, ty- cally, ad hoc in nature and they inherit many characteristics/features of wireless ad hoc networks such as the ability for infrastructure-less setup, minimal or no reliance on network planning, and the ability of the nodes to self-organize and self-con?gure without the involvement of a centralized network manager, router, access point, or a switch. These features help to set up WSNs fast in situations where there is no existing network setup or in times when setting up a ?xed infrastructure network is considered infeasible, for example, in times of emergency or during relief - erations. WSNs ?nd a variety of applications in both the military and the civilian population worldwide such as in cases of enemy intrusion in the battle?eld, object tracking, habitat monitoring, patient monitoring, ?re detection, and so on. Even though sensor networks have emerged to be attractive and they hold great promises for our future, there are several challenges that need to be addressed. Some of the well-known challenges are attributed to issues relating to coverage and deployment, scalability, quality-of-service, size, computational power, energy ef?ciency, and security.
Link reversal is a versatile algorithm design technique that has been used in numerous distributed algorithms for a variety of problems. The common thread in these algorithms is that the distributed system is viewed as a graph, with vertices representing the computing nodes and edges representing some other feature of the system (for instance, point-to-point communication channels or a conflict relationship). Each algorithm assigns a virtual direction to the edges of the graph, producing a directed version of the original graph. As the algorithm proceeds, the virtual directions of some of the links in the graph change in order to accomplish some algorithm-specific goal. The criterion for changing link directions is based on information that is local to a node (such as the node having no outgoing links) and thus this approach scales well, a feature that is desirable for distributed algorithms. This monograph presents, in a tutorial way, a representative sampling of the work on link-reversal-based distributed algorithms. The algorithms considered solve routing, leader election, mutual exclusion, distributed queueing, scheduling, and resource allocation. The algorithms can be roughly divided into two types, those that assume a more abstract graph model of the networks, and those that take into account more realistic details of the system. In particular, these more realistic details include the communication between nodes, which may be through asynchronous message passing, and possible changes in the graph, for instance, due to movement of the nodes. We have not attempted to provide a comprehensive survey of all the literature on these topics. Instead, we have focused in depth on a smaller number of fundamental papers, whose common thread is that link reversal provides a way for nodes in the system to observe their local neighborhoods, take only local actions, and yet cause global problems to be solved. We conjecture that future interesting uses of link reversal are yet to be discovered. Table of Contents: Introduction / Routing in a Graph: Correctness / Routing in a Graph: Complexity / Routing and Leader Election in a Distributed System / Mutual Exclusion in a Distributed System / Distributed Queueing / Scheduling in a Graph / Resource Allocation in a Distributed System / Conclusion
