MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a new regime for time synchronization
ACM SIGCOMM Computer Communication Review
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Implementing software on resource-constrained mobile sensors: experiences with Impala and ZebraNet
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
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
Hierarchical power management in disruption tolerant networks using traffic-aware optimization
Computer Communications
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
Energy-efficient rate-adaptive GPS-based positioning for smartphones
Proceedings of the 8th international conference on Mobile systems, applications, and services
Heterogenous Quorum-Based Wake-Up Scheduling in Wireless Sensor Networks
IEEE Transactions on Computers
Bundle protocol mail convergence layer: leveraging legacy internet infrastructure for DTNs
Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Interest-based cloud-facilitated opportunistic networking
Proceedings of the 8th ACM MobiCom workshop on Challenged networks
Hi-index | 0.00 |
The rapid deployment of millions of mobile sensors and smartphones has resulted in a demand for opportunistic encounter-based networking to support mobile social networking applications and proximity-based gaming. However, the success of these emerging networks is limited by the lack of effective and energy efficient neighbor discovery protocols. While probabilistic approaches perform well for the average case, they exhibit long tails resulting in high upper bounds on neighbor discovery time. Recent deterministic protocols, which allow nodes to wake up at specific timeslots according to a particular pattern, improve on the worst case bound, but do so by sacrificing average case performance. In response to these limitations, we have designed Searchlight, a highly effective asynchronous discovery protocol that is built on three basic ideas. First, it leverages the constant offset between periodic awake slots to design a simple probing-based approach to ensure discovery. Second, it allows awake slots to cover larger sections of time, which ultimately reduces total awake time drastically. Finally, Searchlight has the option to employ probabilistic techniques with its deterministic approach that can considerably improve its performance in the average case when all nodes have the same duty cycle. We validate Searchlight through analysis and real-world experiments on smartphones that show considerable improvement (up to 50%) in worst-case discovery latency over existing approaches in almost all cases, irrespective of duty cycle symmetry.