Adaptive contact probing mechanisms for delay tolerant applications

In many delay tolerant applications, information is opportunistically exchanged between mobile devices who encounter each other. In order to effect 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 trade-off between the probability of missing a contact and the contact probing frequency. First, via theoretical analysis, we characterize the trade-off 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 which adapts to the contact arrival process. Via trace driven simulations on our experimental data, we show that STAR consumes three times less energy when compared to a constant contact probing interval scheme.

[1]  Emiliano Miluzzo,et al.  People-centric urban sensing , 2006, WICON '06.

[2]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[3]  Vikram Srinivasan,et al.  PeopleNet: engineering a wireless virtual social network , 2005, MobiCom '05.

[4]  Jennifer C. Hou,et al.  An In-Depth, Analytical Study of Sampling Techniques for Self-Similar Internet Traffic , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[5]  Jan Beran,et al.  Statistics for long-memory processes , 1994 .

[6]  Pan Hui,et al.  Pocket Switched Networks: Real-world mobility and its consequences for opportunistic forwarding , 2005 .

[7]  Walter Willinger,et al.  On the Self-Similar Nature of Ethernet Traffic ( extended version ) , 1995 .

[8]  Catalin Drula Fast and Energy Efficient Neighbour Discovery for Opportunistic Networking with Bluetooth Abstract Fast and Energy Efficient Neighbour Discovery for Opportunistic Networking With , 2022 .

[9]  Imrich Chlamtac,et al.  Accelerating Bluetooth inquiry for personal area networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[11]  Alex Pentland,et al.  Social serendipity: mobilizing social software , 2005, IEEE Pervasive Computing.

[12]  Roger Wattenhofer,et al.  Community-Aware Mobile Networking , 2006, MSPE.

[13]  Vikram Srinivasan,et al.  Understanding Urban Interactions from Bluetooth Phone Contact Traces , 2007, PAM.

[14]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[15]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[16]  Thomas R. Gross,et al.  A mobility model based on WLAN traces and its validation , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Eyal de Lara,et al.  User mobility for opportunistic ad-hoc networking , 2004, Sixth IEEE Workshop on Mobile Computing Systems and Applications.

[18]  Alhussein A. Abouzeid,et al.  Stochastic Event Capture Using Mobile Sensors Subject to a Quality Metric , 2006, IEEE Transactions on Robotics.

[19]  Geoffrey M. Voelker,et al.  Access and mobility of wireless PDA users , 2003, MOCO.

[20]  Ahmed Helmy,et al.  Modeling Time-Variant User Mobility in Wireless Mobile Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[21]  Pan Hui,et al.  Pocket switched networks and human mobility in conference environments , 2005, WDTN '05.

[22]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[23]  Wei Tsang Ooi,et al.  Analysis and implications of student contact patterns derived from campus schedules , 2006, MobiCom '06.

[24]  Bo Xu,et al.  Search-and-Discover in Mobile P2P Network Databases , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[25]  Kuan-Ta Chen,et al.  Finding Self-Similarities in Opportunistic People Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[26]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[27]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[28]  Pan Hui,et al.  Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.