Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Rate allocation and network lifetime problems for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
Performance of network coding in ad hoc networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Design challenges for energy-constrained ad hoc wireless networks
IEEE Wireless Communications
Distributed algorithms for maximum lifetime routing in wireless sensor networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Information flow decomposition for network coding
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.01 |
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and consequently improve the network lifetime. On the other hand, performing network coding requires the use of the limited resources of the sensor nodes such as memory and energy. We study the tradeoff between maximizing the network lifetime and minimizing the number of network coding operations. We introduce the coding flow variables which enable us to determine the rate at which different operations (e.g., forwarding, replication, and coding) are performed in each sensor node. Using the coding flow variables, we formulate the maximumlifetime minimum-resource (MLMR) coding subgraph problem as a linear programming problem. The objective in MLMR problem is to jointly maximize the network lifetime and minimize the rate of performing network coding. We propose an MLMR algorithm in order to obtain the optimal coding subgraph. We investigate the lifetime-resource tradeoff assuming that the cost of performing network coding varies for intermediate nodes. Simulation results show that the network lifetime can considerably be improved when the cost of performing network coding is relatively low compared to the case that this cost is high for intermediate nodes in the network. Moreover, results show that the network lifetime can substantially be increased using MLMR algorithm compared with the classical multicast with Steiner tree and another algorithm which uses network coding without considering the broadcast nature of wireless links.