Aarhus University Seal / Aarhus Universitets segl

Ramjee Prasad

A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

Standard

A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks. / Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee.

The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011). IEEE Press, 2011. s. 1865-1870.

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

Harvard

Cetin, BK, Prasad, NR & Prasad, R 2011, A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks. i The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011). IEEE Press, s. 1865-1870, 7th International Wireless Communications and Mobile Computing Conference, Istanbul, Tyrkiet, 04/07/2011. https://doi.org/10.1109/IWCMC.2011.5982819

APA

Cetin, B. K., Prasad, N. R., & Prasad, R. (2011). A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks. I The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011) (s. 1865-1870). IEEE Press. https://doi.org/10.1109/IWCMC.2011.5982819

CBE

Cetin BK, Prasad NR, Prasad R. 2011. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks. I The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011). IEEE Press. s. 1865-1870. https://doi.org/10.1109/IWCMC.2011.5982819

MLA

Cetin, Bilge Kartal, Neeli R. Prasad, og Ramjee Prasad "A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks". The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011). IEEE Press. 2011, 1865-1870. https://doi.org/10.1109/IWCMC.2011.5982819

Vancouver

Cetin BK, Prasad NR, Prasad R. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks. I The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011). IEEE Press. 2011. s. 1865-1870 https://doi.org/10.1109/IWCMC.2011.5982819

Author

Cetin, Bilge Kartal ; Prasad, Neeli R. ; Prasad, Ramjee. / A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks. The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011). IEEE Press, 2011. s. 1865-1870

Bibtex

@inproceedings{abcf069dc3364ebc81c1c88f66291024,
title = "A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks",
abstract = "In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize 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 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 linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings for an example network.",
author = "Cetin, {Bilge Kartal} and Prasad, {Neeli R.} and Ramjee Prasad",
year = "2011",
doi = "10.1109/IWCMC.2011.5982819",
language = "English",
isbn = "978-1-4244-9539-9",
pages = "1865--1870",
booktitle = "The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011)",
publisher = "IEEE Press",

}

RIS

TY - GEN

T1 - A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

AU - Cetin, Bilge Kartal

AU - Prasad, Neeli R.

AU - Prasad, Ramjee

PY - 2011

Y1 - 2011

N2 - In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize 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 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 linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings for an example network.

AB - In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize 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 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 linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings for an example network.

U2 - 10.1109/IWCMC.2011.5982819

DO - 10.1109/IWCMC.2011.5982819

M3 - Article in proceedings

SN - 978-1-4244-9539-9

SP - 1865

EP - 1870

BT - The 7th International Wireless Communications and Mobile Computing Conference—(IWCMC 2011)

PB - IEEE Press

ER -