Advertisement

Multi-commodity Trade Application to the Routing Algorithm for the Delay and Disruptive Tolerant Networks

  • Piotr Pałka
  • Radosław Schoeneich
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 185)

Abstract

The paper considers analysis of the specific routing problem, concerning the delay and disruptive tolerant networks (DTN). Those networks are characterized by their lack of connectivity – there may be no connection between any pair of nodes. Moreover, the nodes are mobile, and the network configuration changes over time. The simulation tool that is used to analyzing particular routing methods is presented. The simulation tool is based on the Multi-commodity Market Model (abbrev. M3 ), and implemented according to the multi-agent programing paradigm [19]. Thus, the paper also describes one of the M3 applications. Moreover, the preliminary results of applied RandomWalk, and Auction-based routing algorithms for the DTN are also presented.

Keywords

Mobile Node Data Packet Multiagent System Delivery Ratio Delay Tolerant Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allweyer, T.: BPMN 2.0: Introduction to the Standard for Bussiness Process Modeling. Herstellung und Verlag: Books on Demand GmbH (2009)Google Scholar
  2. 2.
    Balasubramanian, A., Levine, B.N., Venkataramani, A.: Replication routing in dtns: A resource allocation approach. IEEE/ACM Transactions on Networking 18(2), 596–609 (2010)CrossRefGoogle Scholar
  3. 3.
    Bellifemine, F.L., Caire, G., Greenwood, D.: Developing Multi-Agent Systems with JADE. John Wiley Sons Ltd. (2007)Google Scholar
  4. 4.
    Boldrini, C., Conti, M., Jacopini, J., Passarella, A.: Hibop: a history based routing protocol for opportunistic networks. In: World of Wireless, Mobile and Multimedia Networks, pp. 1–12 (2007)Google Scholar
  5. 5.
    Burns, B., Brock, O., Levine, B.N.: Mv routing and capacity building in disruption tolerant networks. In: Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005, vol. 1, pp. 398–408 (2005)Google Scholar
  6. 6.
    Costa, P., Mascolo, C., Musolesi, M., Picco, G.: Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE Journal on Selected Areas in Communications 26(5), 748–760 (2008)CrossRefGoogle Scholar
  7. 7.
    Cuevas, R., Jaho, E., Guerrero, C., Stavrakakis, I.: Onmove: a protocol for content distribution in wireless delay tolerant networks based on social information. In: Proceedings of the 2008 ACM CoNEXT Conference, CoNEXT 2008, pp. 40:1–40:2 (2008)Google Scholar
  8. 8.
    Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2007, pp. 32–40 (2007)Google Scholar
  9. 9.
    Dhillon, S.S., Mieghem, P.V.: Comparison of random walk strategies for ad hoc networks. In: Proceedings of Sixth Annual Mediterranean Ad Hoc Networking Workshop, pp. 196–203 (2007)Google Scholar
  10. 10.
    Fall, K.: Messaging in difficult enviroments. Tech. rep., IRB-TR-04-019 Intel Corp. (2004)Google Scholar
  11. 11.
    Foundation for Intelligent Physical Agents, http://fipa.org/
  12. 12.
    Kaleta, M., Pałka, P., Toczyłowski, E., Traczyk, T.: Electronic Trading on Electricity Markets within a Multi-agent Framework. In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) ICCCI 2009. LNCS, vol. 5796, pp. 788–799. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  13. 13.
    Kaleta, M., Traczyk, T. (eds.): Modeling Multi-commodity Trade: Information Exchange Methods. AISC, vol. 121. Springer, Heidelberg (2012)Google Scholar
  14. 14.
    Leguay, J., Friedman, T., Conan, V.: Evaluating mobility pattern space routing for dtns. In: Proceedings of IEEE INFOCOM 2006 (2006)Google Scholar
  15. 15.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communications Review 7(3), 19–20 (2003)CrossRefGoogle Scholar
  16. 16.
    McLaughlin, B.: Java and XML data binding. O’Reilly & Associates Inc. (2002)Google Scholar
  17. 17.
    Sarafijanovic-Djukic, N., Pidrkowski, M., Grossglauser, M.: Island hopping: Efficient mobility-assisted forwarding in partitioned networks. In: 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks, SECON 2006, pp. 226–235 (2006)Google Scholar
  18. 18.
    Schoeneich, R.O., Pałka, P.: Application of auction mechanisms in routing decisions for delay and disruptive tolerant networks. Przeglad Telekomunikacyjny- Wiadomosci Telekomunikacyjne LXXXIV(8-9), 1000–1003 (2011)Google Scholar
  19. 19.
    Shoham, Y.: Agent oriented programming. Artificial Inteligence 60(1), 51–92 (1993)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press (2009)Google Scholar
  21. 21.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Single-copy routing in intermittently connected mobile networks. In: IEEE Sensor and Ad Hoc Communications and Networks, pp. 235–244 (2004)Google Scholar
  22. 22.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In: Pervasive Computing and Communications Workshops, pp. 79–85 (2007)Google Scholar
  23. 23.
    Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, WDTN 2005, pp. 252–259 (2005)Google Scholar
  24. 24.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Tech. rep., CS-2000-06, CS Dept., Duke University (2000)Google Scholar
  25. 25.
    Yoneki, E., Hui, P., Chan, S., Crowcroft, J.: A socio-aware overlay for publish/subscribe communication in delay tolerant networks. In: Proceedings of the 10th ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, MSWiM 2007, pp. 225–234 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  1. 1.Institute of Control and Computation EngineeringWarsaw University of TechnologyWarsawPoland
  2. 2.Institute of TelecommunicationsWarsaw University of TechnologyWarsawPoland

Personalised recommendations