Sciweavers

Share
GLOBECOM
2008
IEEE

Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks

8 years 2 months ago
Maximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks
It has been shown that network coding can lead to significant improvement in network capacity and reduction in power consumption for multicast traffic in wireless networks. In this paper, we study the problem of supporting multicast in wireless sensor networks. The objective is to jointly maximize the network lifetime and minimize the number of packets undergoing network coding. We formulate the problem of establishing coding subgraph in the network as a linear programming problem, which is suitable for distributed implementation. We propose a new set of information flow variables, which enables us to determine the rate of performing network coding. Simulation results show that the network lifetime achieved by our proposed scheme is 20% higher than the maximum lifetime Steiner tree algorithm.
Vahid Shah-Mansouri, Vincent W. S. Wong
Added 08 Dec 2010
Updated 08 Dec 2010
Type Conference
Year 2008
Where GLOBECOM
Authors Vahid Shah-Mansouri, Vincent W. S. Wong
Comments (0)
books