MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
MobiClique: middleware for mobile social networking
Proceedings of the 2nd ACM workshop on Online social networks
U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
WiFace: a secure geosocial networking system using WiFi-based multi-hop MANET
Proceedings of the 1st ACM Workshop on Mobile Cloud Computing & Services: Social Networks and Beyond
Energy-efficient rate-adaptive GPS-based positioning for smartphones
Proceedings of the 8th international conference on Mobile systems, applications, and services
CrowdWatch: enabling in-network crowd-sourcing
Proceedings of the second ACM SIGCOMM workshop on Mobile cloud computing
Hi-index | 0.00 |
The rapid deployment of millions of handheld communication devices has resulted in a demand for physical proximity-based opportunistic networking. However, the success of these emerging ad hoc networks requires that a device should be able to search and find other devices in its vicinity without infrastructure support, without consuming too much battery power, and preferably without requiring clock synchronization. While approaches exist to solve this problem of energy-efficient asynchronous neighbor discovery, they present an unpleasant trade-off between good average-case performance (probabilistic approaches) and strict bound on worst-case discovery latency (deterministic approaches). In response to these limitations, we present Searchlight, an asynchronous neighbor discovery protocol that has both deterministic and probabilistic components, a novel combination that enables it to have both good average-case performance and the best worst-case bound for any given energy budget.