Cluster Computing

, Volume 10, Issue 1, pp 33–45 | Cite as

Dispersed information diffusion with level and schema-based coordination in mobile peer to peer networks

  • Constandinos X. Mavromoustakis
  • Helen D. Karatza


Several open ended issues for high resource availability in mobile peer to peer networks have been examined in the recent past. Different approaches were conducted for supporting information distribution and availability, through guided or unguided packet diffusion. The majority of the recently proposed approaches try to benefit from the spatial characteristics of the dynamically varying topologies. In this work a directed information diffusion scheme is examined using a level and schema-based coordination, applied in mobile peer to peer networks. The prioritization degree of any requested advert is modeled and enables directed prioritized diffusions to end mobile users that are traversing a certain geographic region (location based advertisements). The proposed method is robust in disseminating redundant messages to users while maintaining connectivity through Gradual Energy Tree-based (GET) configuration. Simulation is performed for the examination and performance evaluation of the proposed scheme, taking into account the modeled prioritization as well as the diffusion accuracy by using the Hierarchical and Non-hierarchical GET configuration.


Information diffusion Level-based coordination Schema-based coordination Mobile peer to peer networks Dispersed dissemination 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Mavromoustakis, C., Karatza, H.: Segmented file sharing with recursive epidemic placement policy for reliability in mobile peer-to-peer devices. In: Proceedings of the 13th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), Georgia Tech, Atlanta, Georgia, September 26–29, 2005, pp. 371–380 Google Scholar
  2. 2.
    Aydin, I., Shen, C.C.: Facilitating match-making service in ad hoc sensor networks using pseudo quorum. In: Proceedings of 11th International Conference on Computer Communications and Networks (ICCCN), Miami, FL, 2002, pp. 250–257 Google Scholar
  3. 3.
    Jetcheva, J.G., Chun Hu, Y., Maltz, D., Johnson, D.: A simple protocol for multicast and broadcast in mobile ad hoc networks. Internet-Draft of Internet Engineering Task Force, draft-ietf-manet-simple-mbcast-01.txt, July 2001 Google Scholar
  4. 4.
    Liu, M., Talpade, R., McAuley, A.: AMRoute: ad-hoc multicast routing protocol. Internet draft name: draft-manet-amroute-00.txt, August 1999 Google Scholar
  5. 5.
    Perkins, C., Royer, E., Das, S.: Ad hoc on demand distance vector (AODV) routing. Internet Engineering Task Force IETF Draft,, January 2002 (last visited/downloaded May 2006)
  6. 6.
    Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. Wireless networks. In: Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM 1999), 1999, vol. 8, pp. 153–167 Google Scholar
  7. 7.
    Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), 2002, pp. 194–205 Google Scholar
  8. 8.
    Wu, C.W., Tay, Y.C., Toh, C.-K.: Ad hoc multicast routing protocol utilizing increasing id-numbers (amris) functional specification. Internet-Draft of Internet Engineering Task Force, draft-ietf-manet-amris-spec-00.txt, November 1998 Google Scholar
  9. 9.
    Wu, J., Lou, W.: Forward-node-set-based broadcast in clustered mobile ad hoc networks. In: Proceedings of the Wireless Communications and Mobile Computing, 2003, vol. 3/2, pp. 155–173 Google Scholar
  10. 10.
    Alzoubi, K., Wan, P., Frieder, O.: Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’02), Lausanne, Switzerland, 2002, pp. 157–164 Google Scholar
  11. 11.
    Braginsky, D., Estrin, D.: Rumor routing algorithm for sensor networks. In: Proceedings of the 1st International Workshop on Wireless Sensor Networks and Applications (WSNA02), Atlanta, GA, October 2002, pp. 22–31 Google Scholar
  12. 12.
    Madden, S., Franklin, M. Hellerstein, J., Hong, W.: TAG: Tiny AGgregate queries in ad-hoc sensor networks. In: Proceedings of the USENIX Symposium on Operating Systems Design and Implementation, Boston, Massachusetts, USA, December 2002, USENIX, pp. 298–313 Google Scholar
  13. 13.
    Estrin, D., Govindan, R., Heidemann, J.: Next century challenges: scalable coordination in sensor networks. In: Proceedings of the 5th International Conference on Mobile Computing and Networking MOBICOM, 1999, pp. 263–270 Google Scholar
  14. 14.
    Mavromoustakis, C., Karatza, H.: On the performance analysis of recursive data replication scheme for file sharing in mobile peer-to-peer devices using the HyMIS scheme. In: Proceedings of the Fifth International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS 2006) in conjunction with IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2006 Google Scholar
  15. 15.
    Bollobas, B.: In: Random Graphs. Academic Press, London, pp. 336–346, ISBN 0–12-111755-3 (1985) Google Scholar
  16. 16.
    Haas, Z., Pearlman, M.: The Zone Routing Protocol (ZRP) for ad hoc networks, Internet Draft, draft-ietf-manet-zone-zrp-02.txt, June 1999 Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Constandinos X. Mavromoustakis
    • 1
  • Helen D. Karatza
    • 2
  1. 1.Department of Computer ScienceINTERCOLLEGENicosia,Cyprus
  2. 2.Department of InformaticsAristotle University of ThessalonikiThessalonikiGreece

Personalised recommendations