A Survey of Energy Efficient Network Protocols for Wireless Networks
Wireless Networks
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
Minimum-cost multicast over coded packet networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Network coding theory: single sources
Communications and Information Theory
Foundations and Trends® in Networking
Foundations and Trends® in Networking
On the Network Coding Advantage for Wireless Multicast in Euclidean Space
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Efficient broadcasting using network coding
IEEE/ACM Transactions on Networking (TON)
Design challenges for energy-constrained ad hoc wireless networks
IEEE Wireless Communications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Scheduling with pairwise XORing of packets under statistical overhearing information and feedback
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We consider the energy savings that can be obtained by employing network coding instead of plain routing in wireless multiple unicast problems. We establish lower bounds on the benefit of network coding, defined as the maximum of the ratio of the minimum energy required by routing and network coding solutions, where the maximum is over all configurations. It is shown that if coding and routing solutions are using the same transmission range, the benefit in d-dimensional networks is at least 2d/⌊√d⌋. Moreover, it is shown that if the transmission range can be optimized for routing and coding individually, the benefit in 2-dimensional networks is at least 3. Our results imply that codes following a decode-and-recombine strategy are not always optimal regarding energy efficiency.