Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Chameleon-MAC: adaptive and self-algorithms for media access control in mobile ad hoc networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Gulliver: a test-bed for developing, demonstrating and prototyping vehicular systems
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Gossiping in one-dimensional synchronous ad hoc wireless radio networks
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Fast track article: Reliable networks with unreliable sensors
Pervasive and Mobile Computing
Reliable neighbor discovery for mobile ad hoc networks
Ad Hoc Networks
Hi-index | 0.00 |
We present a deterministic solution for nodes in a mobile wireless ad hoc network to communicate reliably and maintain local neighborhood information. The nodes are located on a two-dimensional plane and may be in continuous motion. In our solution we tile the plane with hexagons. Each hexagon is assigned a color from a finite set of colors. Two hexagons of the same color are located sufficiently far apart so that nodes in these two hexagons cannot interfere with each other's broadcasts. Based on this partitioning we develop a periodic deterministic schedule for mobile nodes to broadcast. This schedule guarantees collision avoidance. Broadcast slots are tied to geographic locations instead of nodes and the schedule for a node changes dynamically as it moves from tile to tile. The schedule allows nodes to maintain information about their local neighborhood. This information in turn is used to keep the schedule collision-free. We demonstrate the correctness of our algorithm, and discuss how the periodic schedule can be adapted for different scenarios.