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 | IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference |
Pages | 419-424 |
Number of pages | 6 |
Volume | 2006 |
DOIs | |
Publication status | Published - 1 Dec 2006 |
Externally published | Yes |
Event | IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference - Vancouver, BC, Canada Duration: 3 Jul 2006 → 6 Jul 2006 |
Conference
Conference | IWCMC 2006 - 2006 International Wireless Communications and Mobile Computing Conference |
---|---|
Country/Territory | Canada |
City | Vancouver, BC |
Period | 3/07/06 → 6/07/06 |
Keywords
- Distributed algorithm
- Maximum lifetime multicast
- Multihop wireless network
ASJC Scopus subject areas
- Engineering(all)
- Computer Networks and Communications
- Computer Science Applications
- Software