Performance of distributed algorithms for maximizing multicast lifetime in mobile ad hoc networks

Song Guo*, Oliver Yang

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

Abstract

We consider the problem of maximizing the lifetime of a given multicast connection in mobile ad hoc networks that use omni-directional antennas and have limited energy resources. We present two distributed multicast algorithms BEEM and DMLM for this problem. In our distributed algorithms, each node requires only the knowledge of its distance to all neighboring nodes and distances between its neighboring nodes. The extensive simulation results have shown that our DMLM algorithm is very efficient in terms of multicast lifetime.

Original languageEnglish
Title of host publicationPE-WASUN'05 - Proceedings of the Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks
PublisherAssociation for Computing Machinery (ACM)
Pages152-159
Number of pages8
ISBN (Print)1595931821, 9781595931825
DOIs
Publication statusPublished - 2005
Externally publishedYes
EventPE-WASUN'05 - Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks - Montreal, QB, Canada
Duration: 10 Oct 200513 Oct 2005

Publication series

NamePE-WASUN'05 - Proceedings of the Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks

Conference

ConferencePE-WASUN'05 - Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks
Country/TerritoryCanada
CityMontreal, QB
Period10/10/0513/10/05

Keywords

  • Distributed Algorithms
  • Maximum Lifetime Multicast
  • Mobile Ad Hoc Network

Fingerprint

Dive into the research topics of 'Performance of distributed algorithms for maximizing multicast lifetime in mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this