Journal of Computer and System Sciences
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Deterministic Superimposed Coding with Applications to Pattern Matching
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
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
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Distributed Token Circulation in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
On Scheduling and Real-Time Capacity of Hexagonal Wireless Sensor Networks
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Dynamic quorum systems in mobile ad-hoc networks
Dynamic quorum systems in mobile ad-hoc networks
Deterministic Collision Free Communication Despite Continuous Motion
Algorithmic Aspects of Wireless Sensor Networks
Maintaining information about nearby processors in a mobile environment
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Self-stabilizing deterministic TDMA for sensor networks
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Mobility versus the cost of geocasting in mobile ad-hoc networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
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. The periodic schedule, however, does not address the problem of initial neighbor discovery at start-up. We give a separate algorithm for this problem of initially discovering nodes present within communication range at start-up.