Abstract
We consider the problem of maximizing the multicast lifetime in multihop wireless networks in which each node is static and has limited energy, bandwidth, memory, and computation capabilities. Unlike most multicast algorithms that use centralized greedy algorithms, our algorithm can construct a global optimal maximum lifetime multicast tree in a distributed manner. It has a low complexity of O(λu) for both memory and computation requirements at each node u, where λu is the degree of node u. The simulation results have shown that it has an expected linear communication complexity under different network sizes and multicast group sizes. This means that our distributed algorithm is also scalable in terms of communication overhead and it is very useful for large-scale energy and bandwidth constrained multihop wireless networks like sensor networks.
Original language | English |
---|---|
Title of host publication | 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006 |
Pages | 673-677 |
Number of pages | 5 |
Volume | 2 |
DOIs | |
Publication status | Published - 1 Dec 2007 |
Externally published | Yes |
Event | 2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006 - Reston, VA, United States Duration: 25 Sept 2006 → 28 Sept 2006 |
Conference
Conference | 2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006 |
---|---|
Country/Territory | United States |
City | Reston, VA |
Period | 25/09/06 → 28/09/06 |
Keywords
- Distributed algorithm
- Maximum-lifetime multicast
- Wireless ad hoc networks
ASJC Scopus subject areas
- Computer Networks and Communications