Institut for Forretningsudvikling og Teknologi

Ramjee Prasad

Maximum lifetime routing problem in duty-cycling sensor networks

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

Standard

Maximum lifetime routing problem in duty-cycling sensor networks. / Çetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee.

I: Wireless Personal Communications, Bind 72, Nr. 1, 18.01.2013, s. 101-119.

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

Harvard

Çetin, BK, Prasad, NR & Prasad, R 2013, 'Maximum lifetime routing problem in duty-cycling sensor networks', Wireless Personal Communications, bind 72, nr. 1, s. 101-119. https://doi.org/10.1007/s11277-013-1003-5

APA

Çetin, B. K., Prasad, N. R., & Prasad, R. (2013). Maximum lifetime routing problem in duty-cycling sensor networks. Wireless Personal Communications, 72(1), 101-119. https://doi.org/10.1007/s11277-013-1003-5

CBE

Çetin BK, Prasad NR, Prasad R. 2013. Maximum lifetime routing problem in duty-cycling sensor networks. Wireless Personal Communications. 72(1):101-119. https://doi.org/10.1007/s11277-013-1003-5

MLA

Çetin, Bilge Kartal, Neeli R. Prasad, og Ramjee Prasad. "Maximum lifetime routing problem in duty-cycling sensor networks". Wireless Personal Communications. 2013, 72(1). 101-119. https://doi.org/10.1007/s11277-013-1003-5

Vancouver

Çetin BK, Prasad NR, Prasad R. Maximum lifetime routing problem in duty-cycling sensor networks. Wireless Personal Communications. 2013 jan 18;72(1):101-119. https://doi.org/10.1007/s11277-013-1003-5

Author

Çetin, Bilge Kartal ; Prasad, Neeli R. ; Prasad, Ramjee. / Maximum lifetime routing problem in duty-cycling sensor networks. I: Wireless Personal Communications. 2013 ; Bind 72, Nr. 1. s. 101-119.

Bibtex

@article{3d2812f5d9a34735b3af670934a42cbf,
title = "Maximum lifetime routing problem in duty-cycling sensor networks",
abstract = "In order to extend the lifetime of a wireless sensor network, the energy consumption of individual sensor nodes need to be minimized. This can be achieved byminimizing the idle listening time with duty cycling mechanism and/or minimizing the number of communications per node. The nodes will have different relay loads for different routing strategies: therefore, the routing problem is important factor in minimization of the number of communications per node. In this paper, we investigate achievable network lifetime with a routing mechanism on top of an existing duty-cycling scheme. To this end, we formulated the routing problem for duty-cycling sensor network as a linear programming problem with the objective of maximizing the network lifetime. Using the developed linear programming formulation, we investigate the relationship between network lifetime and duty-cycling parameter for different data generation rates and determine the minimum duty-cycling parameter that meets the application requirements. To the best of our knowledge, this is the first mathematical programming formulation which addresses the maximum lifetime routing problem in dutycycling sensor network. In order to illustrate the application of the analytical model, we solved the problem for different parameter settings.",
author = "{\cC}etin, {Bilge Kartal} and Prasad, {Neeli R.} and Ramjee Prasad",
year = "2013",
month = "1",
day = "18",
doi = "10.1007/s11277-013-1003-5",
language = "English",
volume = "72",
pages = "101--119",
journal = "Wireless Personal Communications",
issn = "0929-6212",
publisher = "Springer New York LLC",
number = "1",

}

RIS

TY - JOUR

T1 - Maximum lifetime routing problem in duty-cycling sensor networks

AU - Çetin, Bilge Kartal

AU - Prasad, Neeli R.

AU - Prasad, Ramjee

PY - 2013/1/18

Y1 - 2013/1/18

N2 - In order to extend the lifetime of a wireless sensor network, the energy consumption of individual sensor nodes need to be minimized. This can be achieved byminimizing the idle listening time with duty cycling mechanism and/or minimizing the number of communications per node. The nodes will have different relay loads for different routing strategies: therefore, the routing problem is important factor in minimization of the number of communications per node. In this paper, we investigate achievable network lifetime with a routing mechanism on top of an existing duty-cycling scheme. To this end, we formulated the routing problem for duty-cycling sensor network as a linear programming problem with the objective of maximizing the network lifetime. Using the developed linear programming formulation, we investigate the relationship between network lifetime and duty-cycling parameter for different data generation rates and determine the minimum duty-cycling parameter that meets the application requirements. To the best of our knowledge, this is the first mathematical programming formulation which addresses the maximum lifetime routing problem in dutycycling sensor network. In order to illustrate the application of the analytical model, we solved the problem for different parameter settings.

AB - In order to extend the lifetime of a wireless sensor network, the energy consumption of individual sensor nodes need to be minimized. This can be achieved byminimizing the idle listening time with duty cycling mechanism and/or minimizing the number of communications per node. The nodes will have different relay loads for different routing strategies: therefore, the routing problem is important factor in minimization of the number of communications per node. In this paper, we investigate achievable network lifetime with a routing mechanism on top of an existing duty-cycling scheme. To this end, we formulated the routing problem for duty-cycling sensor network as a linear programming problem with the objective of maximizing the network lifetime. Using the developed linear programming formulation, we investigate the relationship between network lifetime and duty-cycling parameter for different data generation rates and determine the minimum duty-cycling parameter that meets the application requirements. To the best of our knowledge, this is the first mathematical programming formulation which addresses the maximum lifetime routing problem in dutycycling sensor network. In order to illustrate the application of the analytical model, we solved the problem for different parameter settings.

U2 - 10.1007/s11277-013-1003-5

DO - 10.1007/s11277-013-1003-5

M3 - Journal article

AN - SCOPUS:84893650286

VL - 72

SP - 101

EP - 119

JO - Wireless Personal Communications

JF - Wireless Personal Communications

SN - 0929-6212

IS - 1

ER -