Skip to main content

Advertisement

Springer Nature Link
Log in

SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The use of mobile nodes to improve network system performance has drawn considerable attention recently. The movement-assisted model considers mobility as a desirable feature, where routing is based on the store-carry-forward paradigm with random or controlled movement of resource rich mobile nodes. The application of such a model has been used in several emerging networks, including mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), and delay tolerant networks (DTNs). It is well known that mobility increases the capacity of MANETs by reducing the number of relays for routing, prolonging the lifespan of WSNs by using mobile nodes in place of bottleneck static sensors, and ensuring network connectivity in DTNs using mobile nodes to connect different parts of a disconnected network. Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay, average number of relays, and moving distance. In this paper, we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals, including delay, the number of relays, and moving distance. The model is based on the small-world model where each static node has “short” link connections to its nearest neighbors and “long” link connections to other nodes following a certain probability distribution. Short links are regular wireless connections whereas long links are implemented using mobile nodes. Various issues are considered, including trade-offs between delay and average number of relays, selection of the number of mobile nodes, and selection of the number of long links. The effectiveness of the proposed model is evaluated analytically as well as through simulation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Fall K. A delay-tolerant network architecture for challenged Internets. In Proc. ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003, pp.27–34.

  2. Wu J. Mobility in ad hoc wireless networks: A villain or a friend? In Proc. Third International Workshop on Mobile Distributed Computing, in Conjunction with IEEE ICDCS, Columbus Ohio, June 2005, p.547.

  3. Wu J, Dai F. Mobility-sensitive topology control in mobile ad hoc networks. In Proc. IEEE IPDPS, Santa Fe New Mexico, April 2004, pp.522–535.

  4. Grossglauser M, Tse D. Mobility increases the capacity of ad-hoc wireless networks. In Proc. IEEE INFOCOM, Anchorage Alaska, April 2001, pp.1360–1369.

  5. Wang W, Srinivasan V, Chua K C. Using mobile relays to prolong the lifetime of wireless sensor networks. In Proc. ACM MobiCom, Cologne, Germany, Aug. 2005, pp.270–283.

  6. Hull B, Bychkovskiy V, Chen K, Goraczko M, Shih E, Zhang Y, Balakrishnan H, Madden S. CarTel: A distributed mobile sensor computing system. In Proc. the SenSys, Boulder Colorado, Oct.-Nov. 2006, pp.125–138.

  7. Zhao W, Ammar M, Zegura E. Controlling the mobility of multiple data transport ferries in a delaytolerant network. In Proc. IEEE INFOCOM, Miami Florida, Mar. 2005, pp.1407–1418.

  8. Vahdat A, Becker D. Epidemic routing for partially-connected ad hoc networks. Technical Report, Duke University, 2002.

  9. Wu J, Yang S, Dai F. Logarithmic store-carry-forward routing in mobile ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(6): 735–748.

    Article  Google Scholar 

  10. Watts D, Strogatz S. Collective dynamics of small-world networks. Nature, 1998, 393: 440–442.

    Article  Google Scholar 

  11. Gupta P, Kumar P R. The capacity of wireless networks. IEEE Transactions on Information Theory, 2000, 46(2): 388–404.

    Article  MATH  MathSciNet  Google Scholar 

  12. Das S, Nandan A, Pau G, Sanadidi M Y, Gerla M. Evaluating mobility pattern space routing for DTNs. In Proc. the 1st ACM VANET, in Conjunction with ACM MobiCom, Philadelphia Pennsylvania, Oct. 2004.

  13. Wong V W S, Leung V C M. Location management for next generation personal communicaition networks. IEEE Networks, 2000, 14(5): 18–24.

    Article  Google Scholar 

  14. Wu J, Dai F. Mobility management and its applications in efficient broadcasting in mobile ad hoc networks. In Proc. IEEE INFOCOM, Hong Kong, China, Mar. 2004, p.350.

  15. Garetto M, Giaccone P, Leonardi E. On the capacity of ad hoc wireless networks under general node mobility. In Proc. IEEE INFOCOM, Anchorage Alaska, May 2007, pp.357–365.

  16. Pellegrini F, Miorandi D, Carreras I, Chlamtac I. A graph-based model for disconnected ad hoc networks. In Proc. IEEE INFOCOM, Anchorage Alaska, May 2007, pp.373–381.

  17. Wang Z M, Basagni S, Melachrinoudis E, Petrioli C. Exploiting sink mobility for maximizing sensor networks lifetime. In Proc. the 38th Hawaii International Conference on System Sciences (HICSS), Big Island Hawaii, Jan. 2005, p.287.1.

  18. Luo J, Hubaux J P. Joint mobility and routing for lifetime elongation in wireless sensor networks. In Proc. IEEE IN-FOCOM, Miami Florida, Mar. 2005, 3(3): 1735–1746.

  19. Shah D, Shakkottai S. Oblivious routing with mobile fusion centers over a sensor network. In Proc. IEEE INFOCOM, Anchorage Alaska, May 2007, pp.1541–1549.

  20. BAA04-13: Disruption tolerant networking (DTN). Technical POC: Preston Marshall, DARPA/ATO, 2004.

  21. Burleigh S, Hooke A, Torgerson L, Fall K, Cerf V, Durst B, Scott K, Weiss H. Delay-tolerant networking — An approach to interplanetary Internet. IEEE Communications Magazine, 2003, 41(6): 128–136.

    Article  Google Scholar 

  22. Wang R Y, Sobti S, Garg N, Ziskind E, Lai J, Krishnamurthy A. Turning the postal system into a generic digital communication mechanism. In Proc. ACM SIGCOMM, Portland, Oregan, Aug.-Sept. 2004, pp.159–166.

  23. Motani M, Srinivasan V, Nuggehalli P S. Peoplenet: Engineering a wireless virtual social network. In Proc. ACM MobiCom, 2005, pp.243–257.

  24. Jain S, Fall K, Patra R. Routing in a delay tolerant network. In Proc. ACM SIGCOMM, Cologne, Germany, Aug. 2004, pp.145–158.

  25. Zhao W, Ammar M, Zegura E. Multicasting in delay tolerant networks: Semantic models and routing algorithms. In Proc. ACM SIGCOMM Workshop on Delay Tolerant Networks, Cologne, Germany, Aug. 2005, pp.268–275.

  26. Davis J, Fagg A, Levine B. Wearable computers as packet transport mechanisms in highly-partitioned ad-hoc networks. In Proc. the International Symposium on Wearable Computing, ETH Zurich, Oct. 2001.

  27. Chen Z, Kung H, Vlah D. Ad hoc relay wireless networks over moving vehicles on highways. In Proc. ACM MobiHoc, Long Beach California, Oct. 2001, pp.247–250.

  28. Juang P, Oki H, Wang Y, Martonosi M, Peh L, Rubenstein D. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet. In Proc. AS-PLOS, San Jose, California. Oct. 2002, pp.96–107.

  29. Small T, Haas Z. The shared wireless infostation model — A new ad hoc networking paradigm (or where there is a whale, there is a way). In Proc. ACM MobiHoc, Annapolis, US, 2003, pp.233–244.

  30. Liu C, Wu J. Scalable routing in delay tolerant networks. In Proc. ACM MobiHoc, Montreal, Canada, Sept. 2007.

  31. Daly E, Haahr M. Social network analysis for routing in disconnected delay-tolerant MANETs. In Proc. ACM MobiHoc, Montreal, Canada, Sept. 2007, pp.32–40.

  32. Milgram S. The small world problem. Psychology Today, 1967, 1(1): 61–67.

    MathSciNet  Google Scholar 

  33. Kleinberg J. The Small-world phenomenon: An algorithmic perspective. In Proc. the 32nd ACM Symposium on Theory of Computing, Portland Oregon, May 2000, pp.163–170.

  34. Kleinberg J. Small-world phenomena and the dynamics of information. In Proc. Advances in Neural Information Processing Systems (NIPS), Vancouver, Canada, Dec. 2001.

  35. Blazevic L, Buttyan L, Capkun S, Giordano S, Hubaux J, Le Boudec J. Self-organization in mobile ad-hoc networks: The approach of terminodes. IEEE Communications Magazine, 2001, 39(6): 166–174.

    Article  Google Scholar 

  36. Chitradurga R, Helmy A. Analysis of wired short cuts in wireless sensor networks. In Proc. IEEE International Conference on Pervasive Services, Beirut, Lebanon, July 2004, pp.167–176.

  37. Dimtar T et al. Small world application layer for ad hoc networks. In Proc. Telekomunikacioni Forum Telfor, Belgrade, 2003.

  38. Xu Y, Heidemann J, Estrin D. Geography informed energy conservation for ad hoc routing. In Proc. ACM MobiCom, Long Beach California, Oct. 2001, pp.70–84.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL, 33431, USA

    Jie Wu

  2. Department of Computer Science, Rensselear Polytechnic Institute, Troy, NY, 12180, USA

    Shu-Hui Yang

Authors
  1. Jie Wu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shu-Hui Yang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jie Wu.

Additional information

The work was supported in part by NSF of USA under Grant Nos. CCR 0329741, CNS 0422762, CNS 0434533, CNS 0531410, and CNS 0626240.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(PDF 85.8 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, J., Yang, SH. SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes. J. Comput. Sci. Technol. 23, 327–342 (2008). https://doi.org/10.1007/s11390-008-9136-9

Download citation

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9136-9

Keywords