Skip to main content

Density-Aware Route Design for Ferry-Based DTNs Using Partitive Clustering Algorithms

  • Conference paper
Communication and Networking (FGCN 2009)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 56))

Abstract

The Delay Tolerant Networks (DTNs) generally contain relatively sparse nodes that are frequently disconnected. Message Ferrying (MF) is a mobility-assisted approach which utilizes a set of mobile elements to provide communication services in ferry-based DTNs. In this paper, we propose a Density-Aware Route Design (DARD) algorithm using partitive clustering algorithms along a validity index for identifying the suitable node clusters and assigning ferries to these clusters. In the proposed algorithm, unlike using multiple ferries in a single route (SIRA algorithm) or dividing the deployment area into grid as static (NRA and FRA algorithms), the manner of node’s distribution and their density are regarded as clustering metric. Evaluation results for comparing our scheme demonstrate that DARD either minimizes message delivery delay or by preserving message delay, it reduces resource requirements in both ferries and nodes resulting in increasing ferries efficiency.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fall, K.: A delay-tolerant network architecture for challenged internets. In: ACM SIGCOMM 2003, Karlsruhe, Germany, pp. 27–34 (2003)

    Google Scholar 

  2. Bai, F., Helmy, N.: Impact of Mobility on Mobility-Assisted Information Diffusion (MAID) Protocols in Ad hoc Networks. In: IEEE INFOCOM (2005)

    Google Scholar 

  3. Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University (2000)

    Google Scholar 

  4. Zhao, W., Ammar, M.: Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks. In: Proc. IEEE Workshop on Future Trends in Distributed Computing Systems, Puerto Rico (2003)

    Google Scholar 

  5. Haqson, A.A., Fletcher, R., Pzntland, A.: DakNet: A road to universal broadband connectivity. In: wireless Inremet UN ICT Conference Case Study (2003)

    Google Scholar 

  6. Li, Q., Rus, D.: Sending messages to mobile users in disconnected ad-hoc wireless networks. In: MOBICOM (2000)

    Google Scholar 

  7. Tariq, M.M.B., Ammar, M., Zegura, E.: Message ferry route design for sparse ad hoc networks with mobile nodes. In: ACM MobiHoc (2006)

    Google Scholar 

  8. Viswanathan, R., Li, J., Chuah, M.: Message ferrying for constrained scenarios. In: Proceedings of the IEEE WoWMoM 2005 (2005)

    Google Scholar 

  9. Zhao, W., Ammar, M., Zegura, E.: Controlling the Mobility of Multiple Data Transport Ferries in a Delay-Tolerant Network. In: Proceedings of IEEE INFOCOMM (2005)

    Google Scholar 

  10. Zhang, Z., Fei, Z.: Route Design for Multiple Ferries in Delay Tolerant Networks. In: Proceedings of IEEE INFOCOMM (2005)

    Google Scholar 

  11. Polat, B.K., Khan, M., Tuli, N., Kailay, P.: ZBMF: Zone Based Message Ferrying for Disruption Tolerant Networks. In: Proceedings of ChinacomBiz, pp. 48–59 (2009)

    Google Scholar 

  12. Nemhauser, G., Rinnooy, k., Todd, M.J.: Optimization (1989)

    Google Scholar 

  13. Huang, Z.: Extensions to the k-Means Algorithms for Clustering Large Data Sets with Categorical Values. Data Mining and Knowledge Discovery 2, 283–304 (1998)

    Article  Google Scholar 

  14. Kohonen, T.: Self-Organizing Maps. Springer, Berlin (1997)

    MATH  Google Scholar 

  15. Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Patt. Anal. Machine Intell. PAMI-1, 224–227 (1979)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jedari, B., Goudarzi, R. (2009). Density-Aware Route Design for Ferry-Based DTNs Using Partitive Clustering Algorithms. In: Ślęzak, D., Kim, Th., Chang, A.CC., Vasilakos, T., Li, M., Sakurai, K. (eds) Communication and Networking. FGCN 2009. Communications in Computer and Information Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10844-0_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10844-0_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10843-3

  • Online ISBN: 978-3-642-10844-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics