Advertisement

POMA: Prioritized Overlay Multicast in Ad Hoc Environments

  • Abhishek Patil
  • Yunhao Liu
  • Lionel M. Ni
  • Li Xiao
  • A. -H. Esfahanian
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2913)

Abstract

Overlay Multicast networks in mobile ad-hoc environments have received much attention due to their increasing number of practical applications. In many applications, some participating nodes might be members of more than one overlay trees or may wish to build a temporary tree in order to perform certain important tasks. The priority of these trees can be defined by the importance of the service. For the success of such an application, it is necessary that nodes belonging to more than one tree are smart enough to ignore incoming messages from members in low priority trees while they are listening to members from a higher priority tree. In this paper, we present a prioritized overlay multicast in ad-hoc environments (POMA). POMA builds priority trees with certain nodes carrying important tasks in overlay networks, and rearranges low priority trees whenever some nodes temporarily move to a high priority network. We study the feasibility of POMA by identifying a suitable unicast routing protocol, exploring to use location information to build efficient trees, and studying the impact of density of wireless nodes to the system performance.

Keywords

Steiner Tree Overlay Network Wireless Node Member Node Physical Topology 
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.
    Gui, C., Mohapatra, P.: Efficient Overlay Multicast for Mobile Ad Hoc Networks. In: Wireless Communications and Networking Conference, WCNC (2003)Google Scholar
  2. 2.
    Banerjee, S., Bhattacharjee, B.: Analysis of the NICE Application Layer Multicast Protocol. Technical report, UMIACSTR 2002-60 and CS-TR 4380, Department of Computer Science, University of Maryland, College Park (June 2002)Google Scholar
  3. 3.
    Park, V.D., Scott Corson, M.: Temporally-Ordered Routing Algorithm (TORA). Internet-Draft (November 1997), draft-ietf-manet-tora-spec-00.txt
  4. 4.
    Johnson, D., Maltz, D.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, T., Korth, H. (eds.) Mobile Computing, Kluwer Academic Publishers, Dordrecht (1996)Google Scholar
  5. 5.
    Perkins, C.E.: Ad-hoc on-demand distance vector routing. In: MILCOM 1997 panel on Ad Hoc Networks (November 1997)Google Scholar
  6. 6.
    Perkins, C.E., Bhagwat, P.: Highly dynamic Destination-Sequenced Distance- Vector routing (DSDV) for mobile computers. In: Proceedings of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, August 1994, pp. 234–244 (1994)Google Scholar
  7. 7.
    Chen, K., Nahrstedt, K.: Effective Location - Guided Tree Construction Algorithm for Small Group Multicast in MANET. In: Proceedings of IEEE/Infocom 2002 (May 2002)Google Scholar
  8. 8.
    Ni, L.M., Liu, Y., Lau, Y.C., Patil, A.P.: LANDMARC: Indoor Location Sensing Using Active RFID. In: IEEE PerCom 2003 (2003)Google Scholar
  9. 9.
    Patil, A., Liu, Y., Ni, L., Xiao, L., Esfahanian, A.-H.: SOMA: Security Using Overlay Multicast in Ad-Hoc Environments. Technical Report, MSU-CSE-03-21, Michigan State University (May 2003), http://www.cse.msu.edu/~patilabh/tr/soma.pdf

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Abhishek Patil
    • 1
  • Yunhao Liu
    • 1
  • Lionel M. Ni
    • 2
  • Li Xiao
    • 1
  • A. -H. Esfahanian
    • 1
  1. 1.Department of Computer Science and EngineeringMichigan State UniversityEast LansingUSA
  2. 2.Department of Computer ScienceHong Kong University of Science and TechnologyKowloonHong Kong

Personalised recommendations