Topology control in network-coding-based-multicast wireless sensor networks
by Mohammad Khalily Dermany; Masoud Sabaei; Mostafa Shamsi
International Journal of Sensor Networks (IJSNET), Vol. 17, No. 2, 2015

Abstract: Network coding is a promising technique to improve throughput and reliability. However, the benefit of network coding is restricted and affected by network topology, especially in wireless sensor networks (WSNs). Topology control algorithms adjust the transmission parameters of sensors, chiefly transmission power to achieve a desired topology. So both network coding and topology control algorithms reduce and improve WSN's lifetime. We provide a detailed analytical evaluation of an optimal topology control in network-coding-based-multicast WSNs as a mixed integer non-linear problem. Although this problem is NP-hard, but the mathematical formulation can help us assess the essence and understand the hardness of this problem. We then propose a heuristic algorithm for topology control in network-coding-based-multicast WSNs that run much faster. The efficiency of our algorithm is demonstrated by simulation results under different traffic patterns. We conclude that our algorithm can be used to control the topology of multicast-capable WSNs with significantly better lifetime when compared with conventional algorithms.

Online publication date: Sat, 07-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email