Crash failures can drive protocols to arbitrary states
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Elements of network protocol design
Elements of network protocol design
Fault-local distributed mending
Journal of Algorithms
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks
SIAM Journal on Computing
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
A transmission control scheme for media access in sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
ASCENT: Adaptive Self-Configuring sEnsor Network Topologies
ACM SIGCOMM Computer Communication Review
Antennas and Propagation for Wireless Communication Systems
Antennas and Propagation for Wireless Communication Systems
GS3: scalable self-configuration and self-healing in wireless networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
IEEE Transactions on Computers
LSRP: local stabilization in shortest path routing
IEEE/ACM Transactions on Networking (TON)
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
A access-based clustering protocol for multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Distributed topology construction of Bluetooth wireless personal area networks
IEEE Journal on Selected Areas in Communications
LSRP: local stabilization in shortest path routing
IEEE/ACM Transactions on Networking (TON)
'Ripples': message-efficient, coverage-aware clustering in wireless sensor and actor networks
International Journal of Communication Networks and Distributed Systems
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Improving grid service's QoS through self-configuring regulation
Engineering Applications of Artificial Intelligence
Run time assurance of application-level requirements in wireless sensor networks
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Energy efficient route recovery methods for wireless sensor networks using hybrid checkpointing
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
Hi-index | 0.00 |
We present GS3, a distributed algorithm for scalable self-configuration and self-healing in multi-hop wireless sensor networks. The algorithm enables network nodes in a 2D plane to configure themselves into a cellular hexagonal structure where cells have tightly bounded geographic radius and the overlap between neighboring cells is low. The structure is self-healing under various perturbations, such as node joins, leaves, deaths, movements, and state corruptions. For instance, the structure slides as a whole if nodes in many cells die at the same rate. Moreover, its configuration and healing are scalable in three respects: first, local knowledge enables each node to maintain only limited information with respect to a constant number of nearby nodes; second, local self-healing guarantees that all perturbations are contained within a tightly bounded region with respect to the perturbed area and dealt with in the time taken to diffuse a message across the region; third, only local coordination is needed in both configuration and self-healing.