On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Convex Optimization
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
User Mobility for Opportunistic Ad-Hoc Networking
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
An In-Depth, Analytical Study of Sampling Techniques for Self-Similar Internet Traffic
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Social Serendipity: Mobilizing Social Software
IEEE Pervasive Computing
Access and mobility of wireless PDA users
ACM SIGMOBILE Mobile Computing and Communications Review
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
PeopleNet: engineering a wireless virtual social network
Proceedings of the 11th annual international conference on Mobile computing and networking
Search-and-Discover in Mobile P2P Network Databases
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Analysis and implications of student contact patterns derived from campus schedules
Proceedings of the 12th annual international conference on Mobile computing and networking
Stochastic event capture using mobile sensors subject to a quality metric
Proceedings of the 12th annual international conference on Mobile computing and networking
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
Adaptive contact probing mechanisms for delay tolerant applications
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Understanding urban interactions from bluetooth phone contact traces
PAM'07 Proceedings of the 8th international conference on Passive and active network measurement
Hi-index | 0.00 |
In many delay-tolerant applications, information is opportunistically exchanged between mobile devices that encounter each other. In order to affect such information exchange, mobile devices must have knowledge of other devices in their vicinity. We consider scenarios in which there is no infrastructure and devices must probe their environment to discover other devices. This can be an extremely energy-consuming process and highlights the need for energy-conscious contact-probing mechanisms. If devices probe very infrequently, they might miss many of their contacts. On the other hand, frequent contact probing might be energy inefficient. In this paper, we investigate the tradeoff between the probability of missing a contact and the contact-probing frequency. First, via theoretical analysis, we characterize the tradeoff between the probability of a missed contact and the contact-probing interval for stationary processes. Next, for time-varying contact arrival rates, we provide an optimization framework to compute the optimal contact-probing interval as a function of the arrival rate. We characterize real-world contact patterns via Bluetooth phone contact-logging experiments and show that the contact arrival process is self-similar. We design STAR, a contact-probing algorithm that adapts to the contact arrival process. Instead of using constant probing intervals, STAR dynamically chooses the probing interval using both the short-term contact history and the long-term history based on time of day information. Via trace-driven simulations on our experimental data, we demonstrate that STAR requires three to five times less energy for device discovery than a constant contact-probing interval scheme.