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
A mutual exclusion algorithm for ad hoc mobile networks
Wireless Networks
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
Distributed broadcast in radio networks of unknown topology
Theoretical Computer Science
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Tracking moving devices with the cricket location system
Proceedings of the 2nd international conference on Mobile systems, applications, and services
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 selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
CarTel: a distributed mobile sensor computing system
Proceedings of the 4th international conference on Embedded networked sensor systems
Efficient Node Discovery in Mobile Wireless Sensor Networks
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
An asynchronous leader election algorithm for dynamic networks
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Deterministic Collision Free Communication Despite Continuous Motion
Algorithmic Aspects of Wireless Sensor Networks
Neighbor discovery in mobile ad hoc networks using an abstract MAC layer
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Reliable neighbor discovery for mobile ad hoc networks
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
DISC'10 Proceedings of the 24th international conference on Distributed computing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We define a reliable neighbor discovery layer for mobile ad hoc networks and present two distributed algorithms that implement this layer with varying progress guarantees. First we describe a basic reliable region-based neighbor discovery protocol which does not guarantee communication links between nodes which are constantly crossing region boundaries. We next describe how to use this basic protocol (or any other protocol with the same properties) as a black-box to implement a reliable region-based neighbor discovery protocol that does guarantee communication links between nodes which are constantly crossing region boundaries. To achieve this we run multiple copies of the basic neighbor discovery protocol in parallel, each copy using a different region partition. We then show how the output of each of these protocols can be composed in a way as to not violate any of the guarantees of a reliable neighbor discovery layer, while at the same time attaining the stronger progress guarantees. In particular we study how this technique can be applied when the region partition is a regular square- or hexagonal-tiling of the plane. Finally we discuss an additional property of a neighbor discovery layer that we call coordination, and the potential trade-off between progress and coordination guarantees.