Message Dissemination in Intermittently Connected D2D Communication Networks
Authors:
- 16 April 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 13 (7) , 3978-3990
Abstract
Device-to-device (D2D) communications enable direct communications and information distribution among closely located devices in wireless networks. Many applications of D2D communications require message dissemination to a group of mobile users at certain locations. The challenges of message dissemination come from highly dynamic network environments due to movements of devices. Existing studies on message dissemination have focused on information propagation speed and latency, but the size of the area affected by message dissemination at time t is also critical to D2D communication applications that heavily depend on message dissemination among users in a geographic region. In this paper, we study the fundamental issues in D2D communications: how far the message dissemination can reach by time t (referred as dissemination distance) and how long the dissemination takes to inform nodes located at distanced (referred to as hitting time), especially in dynamic, intermittently connected networks. We first derive analytic bounds of dissemination distance and hitting time under different dissemination mechanisms, providing the spatial and temporal limits of message dissemination. Analytic results are further validated by simulation results of several corresponding dissemination algorithms. Finally, two application scenarios are provided to illustrate how our results serve as guidelines to choose or design appropriate dissemination methods for different D2D communication applications.Keywords
Funding Information
- NSF (CCF-0830680, CNS-1018447)
This publication has 31 references indexed in Scilit:
- Wave: A tutorialIEEE Communications Magazine, 2009
- Analysis and Design of Warning Delivery Service in Intervehicular NetworksIEEE Transactions on Mobile Computing, 2008
- Crossing over the bounded domain2007
- Analysis of multi-hop emergency message propagation in vehicular ad hoc networks2007
- Random Walk Based Routing Protocol for Wireless Sensor Networks2007
- Random walk for self-stabilizing group communication in ad hoc networksIEEE Transactions on Mobile Computing, 2006
- Random walks in peer-to-peer networks: Algorithms and evaluationPerformance Evaluation, 2006
- MANET simulation studiesACM SIGMOBILE Mobile Computing and Communications Review, 2005
- The broadcast storm problem in a mobile ad hoc network1999
- Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variablesJournal of Applied Probability, 1985