Skip to main content
Top
Published in: Mobile Networks and Applications 5/2012

01-10-2012

NER-DRP: Dissemination-based Routing Protocol with Network-layer Error Control for Intermittently Connected Mobile Networks

Authors: Yun Li, Zhun Wang, Xiaohu You, Qi-lie Liu, Weiyi Zhang

Published in: Mobile Networks and Applications | Issue 5/2012

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challenging work because the effective and reliable connection between the source and the destination can not be sustained. To reliably hand over data packets to the destination, many dissemination-based routing protocols are proposed. Dissemination-based routing protocols assure nodes including intermediate nodes and destinations have more chances to receive packets, which will increase the probability that the packets can be correctly received by the destination. However, the existing error recovery mechanisms in network layer use the simple CRC to check the data packets independently, and discard the error packets even if one correct packet can be obtained from more than one partly error packets. In this paper, first we propose a novel Network layer Error Recovery method (abbreviated as NER) based on Forward Error Correction (FEC). NER divides a data packet into Reed Solomon (RS) blocks and insert redundancy to each block. So the intermediate nodes and destinations can recover a correct data packet from multiple partially error copies of the same packet. Then we propose a novel routing protocol named NER-DRP based on the Epidemic routing and NER, which can improve the performance of ICMNs in terms of delivery ratio, end-to-end delay and count of hops.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Show more products
Literature
1.
go back to reference V. Cerf, S. Burleigh, and A. Hooke, “Delay-tolerant networking architecture,” IETF RFC4838, April, 2007. V. Cerf, S. Burleigh, and A. Hooke, “Delay-tolerant networking architecture,” IETF RFC4838, April, 2007.
2.
go back to reference K. Fall, “A delay-tolerant network architecture for challenged internet,” In Proceedings of SIGCOMM’03, Karlsruhe, Germany, Aug. 2003, pp. 27-34. K. Fall, “A delay-tolerant network architecture for challenged internet,” In Proceedings of SIGCOMM’03, Karlsruhe, Germany, Aug. 2003, pp. 27-34.
3.
go back to reference L. Pelusi, A. Passarella, and M. Conti, “Beyond MANETs: dissertation on opportunistic networking,” IIT-CNR. Tech. Rep., May 2006. L. Pelusi, A. Passarella, and M. Conti, “Beyond MANETs: dissertation on opportunistic networking,” IIT-CNR. Tech. Rep., May 2006.
4.
go back to reference J. Sushant, K. Fall, and R. Patra, “Routing in a delay tolerant network,” Proceedings of SIGCOMM’04, Oregon, USA, August, 2004, pp. 145-158. J. Sushant, K. Fall, and R. Patra, “Routing in a delay tolerant network,” Proceedings of SIGCOMM’04, Oregon, USA, August, 2004, pp. 145-158.
5.
go back to reference T. Hossmann, F. Legendre, and T. Spyropoulos, “From contacts to graphs: pitfalls in using complex network analysis for DTN routing,” Proceedings of INFOCOM Workshop on NetSciCom, Rio de Janeiro, Brazil, April 2009, pp. 1-6. T. Hossmann, F. Legendre, and T. Spyropoulos, “From contacts to graphs: pitfalls in using complex network analysis for DTN routing,” Proceedings of INFOCOM Workshop on NetSciCom, Rio de Janeiro, Brazil, April 2009, pp. 1-6.
6.
go back to reference A. Vahdat and D. Becker, “Epidemic routing for partially connected ad hoc networks,” Tech. Rep. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000. A. Vahdat and D. Becker, “Epidemic routing for partially connected ad hoc networks,” Tech. Rep. CS-2000-06, Department of Computer Science, Duke University, Durham, NC, 2000.
7.
go back to reference J. A. Davids, A. H. Fagg, and B. N. Levine, “Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks,” Proceedings of ISWC’01, New York, USA, Oct. 2001, pp. 141-148. J. A. Davids, A. H. Fagg, and B. N. Levine, “Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks,” Proceedings of ISWC’01, New York, USA, Oct. 2001, pp. 141-148.
8.
go back to reference B. Burns, O. Brock, and B. N. Levine, “MV Routing and capacity building in disruption tolerant networks,” Proceedings of IEEE INFOCOM, Miami, FL, USA, March 2005 pp. 398-408. B. Burns, O. Brock, and B. N. Levine, “MV Routing and capacity building in disruption tolerant networks,” Proceedings of IEEE INFOCOM, Miami, FL, USA, March 2005 pp. 398-408.
9.
go back to reference Balasubramanian A, Levine BN, Venkataramani A (2010) Replication routing in DTNs: a resource allocation approach. IEEE/ACM Trans on Networking 18(2):596–609CrossRef Balasubramanian A, Levine BN, Venkataramani A (2010) Replication routing in DTNs: a resource allocation approach. IEEE/ACM Trans on Networking 18(2):596–609CrossRef
10.
go back to reference T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networks, Philadelphia, PA, USA, August 2005, pp. 252-259. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networks, Philadelphia, PA, USA, August 2005, pp. 252-259.
11.
go back to reference Y. Wang, S. Jain, M. Martonosi, and K. Fall, “Erasure coding based routing for opportunistic networks,” Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networks, Philadelphia, PA, USA, August 2005, pp. 229-236. Y. Wang, S. Jain, M. Martonosi, and K. Fall, “Erasure coding based routing for opportunistic networks,” Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networks, Philadelphia, PA, USA, August 2005, pp. 229-236.
12.
go back to reference J. Widmer and J.Y. Le Boudec, “Network coding for efficient communication in extreme networks,” Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networks, Philadelphia, PA, USA, August 2005, pp. 284-291. J. Widmer and J.Y. Le Boudec, “Network coding for efficient communication in extreme networks,” Proceedings of ACM SIGCOMM Workshop on Delay Tolerant Networks, Philadelphia, PA, USA, August 2005, pp. 284-291.
13.
go back to reference X. Chen and A. L. Murphy, “Enabling disconnected transitive communication in mobile ad hoc networks,” Proceedings of the Workshop on Principles of Mobile Computing (collocated with PODC’01), Newport, RI, USA, August 2001, pp. 21-27. X. Chen and A. L. Murphy, “Enabling disconnected transitive communication in mobile ad hoc networks,” Proceedings of the Workshop on Principles of Mobile Computing (collocated with PODC’01), Newport, RI, USA, August 2001, pp. 21-27.
14.
go back to reference Lindgren A, Doria, Schelèn O (2003) Probabilistic routing in intermittently connected networks. Mobile Computing and Communications Review 7(3):19–20CrossRef Lindgren A, Doria, Schelèn O (2003) Probabilistic routing in intermittently connected networks. Mobile Computing and Communications Review 7(3):19–20CrossRef
15.
go back to reference M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive routing for intermittently connected mobile ad hoc networks”, Proceedings of WoWMoM, Taormina-Giardini Naxos, Italy, June 2005, pp. 183 -189. M. Musolesi, S. Hailes, and C. Mascolo, “Adaptive routing for intermittently connected mobile ad hoc networks”, Proceedings of WoWMoM, Taormina-Giardini Naxos, Italy, June 2005, pp. 183 -189.
16.
go back to reference F. Tchakountio and R. Ramanathan, “Tracking highly mobile endpoints”, Proceedings of WoWMoM’, Rome, Italy, July 2001, pp. 83 - 94. F. Tchakountio and R. Ramanathan, “Tracking highly mobile endpoints”, Proceedings of WoWMoM’, Rome, Italy, July 2001, pp. 83 - 94.
17.
go back to reference Guo H, Li J, Qian Y (2010) Hop-DTN: Modeling and Evaluation of Homing-Pigeon-Based Delay-Tolerant Networks. IEEE Transaction on vehicular technology 59(2):857–868CrossRef Guo H, Li J, Qian Y (2010) Hop-DTN: Modeling and Evaluation of Homing-Pigeon-Based Delay-Tolerant Networks. IEEE Transaction on vehicular technology 59(2):857–868CrossRef
18.
go back to reference T. Hossmann, T. Spyropoulos, and F. Legendre, “Know thy neighbor: towards optimal mapping of contacts to social graphs for dtn routing,” Proceedings of IEEE INFOCOM, San Diego, CA, USA, March 2010, pp. 1-9. T. Hossmann, T. Spyropoulos, and F. Legendre, “Know thy neighbor: towards optimal mapping of contacts to social graphs for dtn routing,” Proceedings of IEEE INFOCOM, San Diego, CA, USA, March 2010, pp. 1-9.
19.
go back to reference Rizzo L (1997) Effective erasure codes for reliable computer communication protocols. Computer Communication Review 27(2):24–36CrossRef Rizzo L (1997) Effective erasure codes for reliable computer communication protocols. Computer Communication Review 27(2):24–36CrossRef
20.
go back to reference Jeng JH, Truong TK (1999) On decoding of both errors and erasures of a reed-solomon code using an inverse-free berlekamp-massey algorithm. IEEE Trans On Commun 47(10):1488–1494MATHCrossRef Jeng JH, Truong TK (1999) On decoding of both errors and erasures of a reed-solomon code using an inverse-free berlekamp-massey algorithm. IEEE Trans On Commun 47(10):1488–1494MATHCrossRef
21.
go back to reference J. G. Proakis, “Digital communication,” the fourth edition, McGraw-Hill Press, Oct. 2001. J. G. Proakis, “Digital communication,” the fourth edition, McGraw-Hill Press, Oct. 2001.
Metadata
Title
NER-DRP: Dissemination-based Routing Protocol with Network-layer Error Control for Intermittently Connected Mobile Networks
Authors
Yun Li
Zhun Wang
Xiaohu You
Qi-lie Liu
Weiyi Zhang
Publication date
01-10-2012
Publisher
Springer US
Published in
Mobile Networks and Applications / Issue 5/2012
Print ISSN: 1383-469X
Electronic ISSN: 1572-8153
DOI
https://doi.org/10.1007/s11036-012-0354-6

Other articles of this Issue 5/2012

Mobile Networks and Applications 5/2012 Go to the issue