ACM Home Page
Please provide us with feedback. Feedback
Performance of distributed algorithms for maximizing multicast lifetime in mobile ad hoc networks
Full text PdfPdf (279 KB)
Source International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems archive
Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks table of contents
Montreal, Quebec, Canada
SESSION: Technical papers table of contents
Pages: 152 - 159  
Year of Publication: 2005
ISBN:1-59593-182-1
Authors
Song Guo  University of Ottawa, Ottawa, ON, Canada
Oliver Yang  University of Ottawa, Ottawa, ON, Canada
Sponsors
ACM: Association for Computing Machinery
SIGSIM: ACM Special Interest Group on Simulation and Modeling
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1089803.1089980
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. E. Wieselthier, G. D. Nguyen, et al, "On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks", IEEE INFOCOM, March 2000, pp.585--594.
 
2
Song Guo and Oliver Yang, "A Dynamic Multicast Tree Reconstruction Algorithm for Minimum-Energy Multicasting in Wireless Ad Hoc Networks", IEEE IPCCC, Phoenix, USA April 2004, pp. 637--642.
 
3
 
4
J. Cartigny, D. Simplot, and I. Stojmenovic, "Localized minimum-energy broadcasting in ad-hoc networks", IEEE INFOCOM, April 2003, pp. 2210--2217.
 
5
P. J. Wan, G. Calinescu, and et al, "Minimum-energy broadcast routing in static ad hoc wireless networks", IEEE INFOCOM, Anchorage, Alaska, April 2001, pp. 1162--1171.
 
6
P.-J. Wan, G. Calinsecu, X.-Y. Li, and O. Frieder, "Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks", IEEE INFOCOM, April 2001, pp. 1162--1171.
 
7
 
8
9
 
10
Intae Kang and Radha Poovendran, "Maximizing Static Network Lifetime of Wireless Broadcast Adhoc Networks", IEEE ICC, Alaska, May 2003, pp. 2256--2261.
 
11
M. X. Cheng, J. Sun, and et al, "Energy-efficient Broadcast and Multicast Routing in Ad Hoc Wireless Networks", IEEE IPCCC, Phoenix, Arizona, April 2003, pp.87--94.
 
12
Bin Wang and Sandeep K. S. Gupta, "On Maximizing Lifetime of Multicast Trees in Wireless Ad hoc Networks", International Conference on Parallel Processing, Kaohsiung, Taiwan, October 2003, pp. 333--340.
13
 
14
A.K. Das, R.J. Marks II, M.A. El-Sharkawi, P. Arabshahi and A. Gray, "MDLT: a polynomial time optimal algorithm for maximization of time-to-first-failure in energy-constrained broadcast wireless networks", IEEE Globecom, San Francisco, CA, December 2003.
 
15
Song Guo and Oliver Yang, "Multicast Lifetime Maximization for Energy-Constrained Wireless Ad-hoc Networks with Directional Antennas", IEEE Globecom, Dallas, USA, December 2004, pp. 4120--4124.
 
16
D.B. Johnson and D.A. Maltz, "Dynamic Source Routing in Ad Hoc Wireless Networks," Mobile Computing, T. Imielinski and H. Korth, eds. Kluwer Academic, 1996, pp. 153--181.
 
17
Jungkeun Yoon, Mingyan Liu, and Brian Noble, "Random Waypoint Considered Harmful", IEEE INFOCOM 2003, pp. 1312--1321.