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

TitleMaximum-Lifetime Coding Subgraph for Multicast Traffic in Wireless Sensor Networks
Publication TypeConference Paper
Year of Publication2008
AuthorsShah-Mansouri, V., and V. Wong
Conference NameGlobal Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE
Pagination1 -6
Date Publishednov.
Keywordsencoding, graph theory, maximum-lifetime coding subgraph, network coding, network lifetime, wireless sensor network multicast traffic, 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.


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2018 The University of British Columbia