Network Coding-aware Lifetime Maximal routing in Multi-hop Static Wireless Ad-hoc Networks

Published online: Mar 21, 2014
Full Text: PDF (1.52 MiB)
DOI: 10.24138/jcomss.v10i1.135
Authors:
Rigil Salim, Rajarshi Roy

Abstract

In this paper, we address the issue of maximizing the lifetime of a static wireless ad-hoc network wherein the nodes are battery powered and have limited energy. In such scenarios, routing the traffic along shortest paths will lead to over-use of some nodes leading to premature network partition and an eventual end of communication. Network Coding is a promising technique that has been used, of late, by researchers for throughput improvement. We propose an algorithm that exploits network coding to route a set of unicast traffic demands, the objective being network lifetime maximization. The routing algorithm uses a link metric that takes care of the communication power consumption, the residual energy at the nodes and also the potential coding opportunities available at the node. Simulation results show that this algorithm enhances the network lifetime compared to the existing algorithms that do not employ network coding.

Keywords

network coding, Network lifetime, Network Coding Advantage, routing protocols, wireless multi-hop networks
Creative Commons License 4.0
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.