A novel linear programming formulation of maximum lifetime routing problem in wireless sensor networks Online publication date: Sat, 13-Sep-2014
by Bilge Kartal Çetin; Neeli Rashmi Prasad; Ramjee Prasad
International Journal of Autonomous and Adaptive Communications Systems (IJAACS), Vol. 6, No. 2, 2013
Abstract: In wireless sensor networks, one of the key challenges is to achieve minimum energy consumption to maximise network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel Linear Programming (LP) approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the LP gives the upper analytical bound for the network lifetime. To illustrate the application of the optimisation model, we solved the problem for different parameter settings for an example network.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Autonomous and Adaptive Communications Systems (IJAACS):
Login with your Inderscience username and 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 subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook