A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
New Metrics for Dominating Set Based Energy Efficient Activity Scheduling in Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
Distributed multicast routing, with end-to-end delay and delay variation constraints
Computer Communications
| Hi-index | 0.00 |
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, etc. For such ad hoc networks to fulfill their mission in a timely manner, they should be able to establish a connection between nodes and to maintain this connection until the communication halts. Establishing a connection is achieved by using a routing protocol, and maintaining it is achieved by having a resilient fault tolerant network. In this paper, we propose a network design scheme that incorporates these features. We first propose a special network topology that is unique in terms of how nodes are interconnected. After constructing the initial topology, we propose a distributed routing protocol that allows any two sites to communicate by traversing at most 2 nodes regardless of the network size. We conducted both simulation study and theoretical analysis; the results show that the proposed scheme is resilient to network dynamics and has high quality as well as efficient routing.