Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.4108/ICST.VALUETOOLS2008.4510guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article
Free access

A survey of message diffusion protocols in mobile ad hoc networks

Published: 20 October 2008 Publication History

Abstract

For the last twenty years, mobile communications have experienced an explosive growth. In particular, one area of mobile communication, the Mobile Ad hoc Networks (MANETs), has attracted significant attention due to its multiple applications and its challenging research problems. On the other hand, the nodes mobility in these networks has introduced new challenges for the routing protocols, especially when the mobility induces multiple disconnections in the network. In this survey, we present an overview of this issue and a detailed discussion of the major factors involved. In particular, we show how messages can be efficiently disseminated in different types of MANETs.

References

[1]
Delay tolerant networks (DTN) research group. http://www.dtnrg.org.
[2]
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network. In Proc. of the ICDCS, Washington, DC, USA, 2001. IEEE Computer Society.
[3]
A. Al Hanbali, A. A. Kherani, R. Groenovelt, P. Nain, and E. Altman. Impact of mobility on the performance of relaying in ad hoc networks- extended version. Elsevier Computer Networks, 51(14):4112--4130, Oct. 2007.
[4]
A. Al Hanbali, A. A. Kherani, and P. Nain. Simple models for the performance evaluation of a class of two-hop relay protocols. In Proc. of IFIP Networking, Atlanta, GA, USA, May 2007.
[5]
A. Al Hanbali, P. Nain, and E. Altman. Performance of ad hoc networks with two-hop relay routing and limited packet lifetime. In Proc. of IEEE/ACM ValueTools, Pisa, Italy, Oct. 2006.
[6]
M. J. Appela and R. P. Russob. The connectivity of a graph on uniform points on {0, 1} d. Statistics and Probability letters, 60:351--357, 2002.
[7]
S. R. Ashish Goel and B. Krishnamachari. Sharp thresholds for monotone properties in random geometric graphs. ACM Symposium on Theory of Computing, 2004.
[8]
S. Basagni, M. Conti, S. Giordano, and I. Stojmenovi. Mobile Ad Hoc Networking. IEEE Press John Wiley, 2004.
[9]
C. Bettstetter, H. Hartenstein, and X. Pérez-Costa. Stochastic properties of the random waypoint mobility model. ACM/Kluwer Wireless Networks, Special Issue on Modeling and Analysis of Mobile Networks, 10(5):555--567, Sept. 2004.
[10]
H. Breu and D. G. Kirkpatrick. Unit disk graph recognition is NP-hard. Computational Geometry. Theory and Applications, 9(1--2):3--24, 1998.
[11]
E. Brewer, M. Demmer, B. Du, M. Ho, M. Kam, S. Nedevschi, J. Pal, R. Patra, S. Surana, and K. Fall. The case for technology in developing regions. IEEE Computer, 38:pp. 25--38, May 2005.
[12]
J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proc. of IEEE INFOCOM, April 2006.
[13]
S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss. Delay tolerant networking: an approach to interplanetary internet. IEEE Communications Magazine, 41:pp. 128--136, June 2003.
[14]
B. Burns, O. Brock, and B. Levine. MV routing and capacity building in disruption tolerant networks. In Proc. of IEEE INFOCOM, Miami, Florida, USA, Mar. 2005.
[15]
J. Carle, J. Cartigny, and D. Simplot. Stochastic flooding broadcast protocols in mobile wireless networks. Technical Report 2002--03, LIFL Univ. Lille 1, France, May 2002.
[16]
X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks, 42(4):202--208, 2003.
[17]
M. D. Colagrosso. Intelligent broadcasting in mobile ad hoc networks: Three classes of adaptive protocols. EURASIP Journal on Wireless Communications and Networking, 2007. Article ID 10216.
[18]
F. Dai and J. Wu. Performance analysis of broadcast protocols in ad hoc networks based on self-pruning. IEEE Trans. Parallel Distrib. Syst., 15(11):1027--1040, 2004.
[19]
J. Davis, A. Fagg, and B. Levine. Wearable computers as packet transport mechanisms in highly partitioned ad hoc networks. In Proc. of 5 IEEE Intl. Symp. on Wearable Computers, Zurich, Switzerland, 2001.
[20]
K. Fall. A delay tolerant network architecture for challenged internets. In Proc. of ACM Sigcomm, Karlsruhe, Germany, Aug. 2003.
[21]
R. M. G. Sharma and N. Shroff. Delay and capacity trade-offs in mobile ad hoc networks: A global perspective. In Proc. of IEEE Infocom, Barcelona, Spain, Apr. 2006.
[22]
A. Gamal, J. Mammen, B. Prabhakar, and D. Shah. Throughput-delay trade-off in wireless networks. In Proc. of IEEE INFOCOM, Hong Kong, Mar. 2004.
[23]
R. Groenevelt, P. Nain, and G. Koole. The message delay in mobile ad hoc networks. Performance Evaluation, 62(1--4):210--228, Oct. 2005.
[24]
M. Grossglauser and D. Tse. Mobility increases the capacity of ad hoc wireless networks. ACM/IEEE Transactions on Networking, 10(4):477--486, Aug. 2002.
[25]
P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, IT-46(2):388--404, Mar. 2000.
[26]
A. A. Hasson, D. R. Fletcher, and D. A. Pentland. A road to universal broadband connectivity. In Proc. of Development by Design, Dec. 2002.
[27]
W. R. Heinzelman, J. Kulik, and H. Balakrishnan. Adaptive protocols for information dissemination in wireless sensor networks. In Proc. MOBICOM, Seattle, 1999.
[28]
P. Hui and J. Crowcroft. Bubble rap: Forwarding in small world dtns in ever decreasing circles. Technical Report UCAM-CL-TR-684, Univ. of Cambridge, Computer Laboratory, May 2007.
[29]
M. Ibrahim, A. Al Hanbali, and P. Nain. Delay and resource analysis in manets in presence of throwboxes. Performance Evaluation, 64(9--12):933--947, Oct. 2007.
[30]
S. Jain, M. Demmer, R. Patra, and K. Fall. Using redundancy to cope with failures in a delay tolerant network. In Proc. of ACM Sigcomm, Philadelphia, PA, USA, Aug. 2005.
[31]
S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant networking. In Proc. of ACM Sigcomm, Portland, OR, USA, Aug. 2004.
[32]
S. Jain, R. C. Shah, W. Brunette, G. Borriello, and S. Roy. Exploiting mobility for energy-efficient data collection in sensor networks. In IEEE WiOpt, 2004.
[33]
T. Jin, K. Yunjung, and M. G. Yi. Efficient flooding in ad hoc networks: a comparative performance study, 2003.
[34]
E. P. Jones, L. Li, and P. A. Ward. Practical routing in delay-tolerant networks. In Proc. of ACM Sigcomm Workshop on Delay Tolerant Networking, Philadelphia, PA, USA, Aug. 2005.
[35]
P. Juang, H. Oki, Y. Wang, M. Martonosi, L.-S. Peh, and D. Rubenstein. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In Proc. of ASPLOS-X, San Jose, CA, Oct. 2002.
[36]
A. Khelil, C. Becker, J. Tian, and K. Rothermel. An epidemic model for information diffusion in manets. In Proc. of MSWiM, pages 54--60, New York, NY, USA, 2002. ACM Press.
[37]
A. Khelil, P. J. Marrón, C. Becker, and K. Rothermel. Hypergossiping: A generalized broadcast strategy for mobile ad hoc networks. Ad Hoc Netw., 5(5):531--546, 2007.
[38]
S. Khuller and S. Guha. Approximation algorithms for connected dominating sets. In European Symposium on Algorithms, pages 179--193, 1996.
[39]
S. Krishnamurthy, X. Chen, and M. Faloutsos. Distance adaptive (dad) broadcasting for ad hoc networks. In Proc. of MILCOM, Oct. 2002.
[40]
T. O.-N. Larsen, T. H. Clausen, and L. Viennot. Investigating data broadcast performance in mobile adhoc networks. In Proc. of WPMC, Oct. 2002.
[41]
J. Leguay, T. Friedman, and V. Conan. Evaluating mobility pattern space routing for DTNs. In Proc. of IEEE INFOCOM, Barcelona, Spain, Apr. 2006.
[42]
H. Li and J. Wu. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proc. of DiaLM, 1999.
[43]
X. Lin and I. Stojmenovic. Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks, 2001.
[44]
A. Lindgren, A. Doria, and O. Scheln. Probabilistic routing in intermittently connected networks. In Proc. of ACM MobiHoc (poster session), Maryland, USA, June 2003.
[45]
X. Lu and W. Peng. On the reduction of broadcast redundancy in mobile ad hoc networks. In Proc. of Mobihoc, 2000.
[46]
X. Lu and W. Peng. Ahbp: An efficient broadcast protocol for mobile ad hoc networks. Journal of Science and Technology, 2002.
[47]
M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Geometry based heuristics for unit disk graphs, 1994.
[48]
A. G. Miklas, K. K. Gollu, S. Saroiu, K. P. Gummadi, and E. de Lara. Exploiting social interactions in mobile systems. In Proc. of UBICOMP, Innsbruck, Austria, Sept 2007.
[49]
M. Mitzenmacher. Digital fountains: A survey and look forward. In Proc. of IEEE Information Theory Workshop, Texas, USA, Oct. 2004.
[50]
P. Nain, D. Towsley, B. Liu, and Z. Liu. Properties of random direction models. In Proc. of IEEE Infocom, Miami, FL, Mar. 2005.
[51]
M. J. Neely and E. Modiano. Capacity and delay tradeoffs for ad-hoc mobile networks. IEEE Transactions on Information Theory, 51(6), June 2005.
[52]
G. Neglia and X. Zhang. Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study. In Proc. of CHANTS, Pisa, Italy, Sep. 2006.
[53]
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In Proc. of MobiCom, pages 151--162, New York, NY, USA, 1999. ACM.
[54]
J. Ott and D. Kutscher. Drive-thru internet: IEEE 802.11b for automobile users. In Proc. of IEEE INFOCOM, Hong Kong, Mar. 2004.
[55]
N. Sarafijanovic-Djukic, M. Piorkowski, and M. Grossglauser. Island hopping: Efficient mobility-assisted forwarding in partitioned networks. In IEEE SECON 2006, Reston, VA, Sept. 2006.
[56]
V. Simon, L. Bacsï¿1/2rdi, S. Szabï¿1/2, and D. Miorandi. Bionets: A new vision of opportunistic networks. In Proc. of IEEE WRECOM, 2007.
[57]
T. Small and Z. J. Haas. The shared wireless infostation model: A new ad hoc networking paradigm. In Proc. of ACM MobiHoc, Annapolis, MD, USA, June 2003.
[58]
T. Small and Z. J. Haas. Resource and performance tradeoffs in delay-tolerant wireless networks. In Proc. of ACM Sigcomm Workshop on Delay Tolerant Networking, Philadelphia, PA, USA, Aug. 2005.
[59]
T. Spyropoulos, K. Psounis, and C. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proc. of ACM Sigcomm Workshop on Delay Tolerant Networking, Philadelphia, PA, USA, Aug. 2005.
[60]
R. S. Sutton. Learning to predict by the methods of temporal differences. Machine Learning, 3:9--44, 1988.
[61]
A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.
[62]
R. J. Vamsi, K. Paruchuria, and A. Durresib. Optimized flooding protocol for ad hoc networks.
[63]
E. Varga, T. Csvorics, L. Bacsï¿1/2rdi, M. Berces, V. Simon, and S. Szabï¿1/2. Novel information dissemination solutions in biologically inspired networks. In Proc. of ConTEL, Zagreb Croatia, Jun. 2007.
[64]
L. Viennot, A. Qayyum, and A. Laouiti. Multipoint relaying: An efficient technique for flooding in mobile wireless networks. Technical report, INRIA, 2000.
[65]
Y. Wang, S. Jain, M. Martonosi, and K. Fall. Erasure-coding based routing for opportunistic networks. In Proc. of ACM Sigcomm Workshop on Delay-Tolerant Networking, Philadelphia, PA, USA, Aug. 2005.
[66]
J. Widmer and J.-Y. Le Boudec. Network coding for efficient communication in extreme networks. In Proc. of ACM Sigcomm Workshop on Delay-Tolerant Networking, Philadelphia, PA, USA, Aug. 2005.
[67]
B. Williams and T. Camp. Comparison of broadcasting techniques for mobile ad hoc networks. In Proc. of MOBIHOC, pages 194--205, 2002.
[68]
J. Wu and F. Dai. Broadcasting in ad hoc networks based on self-pruning. Int. J. Found. Comput. Sci., 14(2):201--221, 2003.
[69]
X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance modeling of epidemic routing. In Proc. of Networking, pages 827--839, Coimbra, Portugal, May 2006.
[70]
W. Zhao and M. Ammar. Message ferrying: Proactive routing in highly-partitioned wireless ad hoc networks. In Proc. of the IEEE Workshop on Futrure Trends in Distributed Computing Systems, Puerto Rico, May 2003.
[71]
W. Zhao, M. Ammar, and E. Zegura. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proc. of ACM Mobihoc, Tokyo, Japan, May 2004.
[72]
W. Zhao, M. Ammar, and E. Zegura. Controlling the mobility of multiple data transport ferries in a delay-tolerant network. In Proc. of IEEE INFOCOM, Miami, Florida, USA, Mar. 2005.

Cited By

View all
  • (2014)Matching Information Requests with Node Profiles in Opportunistic Mobile NetworksProceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia10.1145/2684103.2684133(11-18)Online publication date: 8-Dec-2014
  • (2012)Improving performance in delay/disruption tolerant networks through passive relay pointsWireless Networks10.1007/s11276-011-0384-118:1(9-31)Online publication date: 1-Jan-2012
  1. A survey of message diffusion protocols in mobile ad hoc networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Guide Proceedings
      ValueTools '08: Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
      October 2008
      675 pages
      ISBN:9789639799318

      Sponsors

      • Create-Net

      Publisher

      ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)

      Brussels, Belgium

      Publication History

      Published: 20 October 2008

      Author Tags

      1. message delivery protocol
      2. mobile ad-hoc networks
      3. mobile computing
      4. opportunistic communications
      5. survey

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)18
      • Downloads (Last 6 weeks)6
      Reflects downloads up to 06 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2014)Matching Information Requests with Node Profiles in Opportunistic Mobile NetworksProceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia10.1145/2684103.2684133(11-18)Online publication date: 8-Dec-2014
      • (2012)Improving performance in delay/disruption tolerant networks through passive relay pointsWireless Networks10.1007/s11276-011-0384-118:1(9-31)Online publication date: 1-Jan-2012

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media