Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks

Moonseong Kim; Hyunseung Choo; Won Kim

doi:10.1007/978-3-540-72588-6_77

Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks

Moonseong Kim, Hyunseung Choo, Won Kim

Department of Computer Science and Engineering

Sungkyunkwan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In wireless sensor networks, maximizing battery life (network lifetime), and thus the number of messages the networks can support (network capacity), is a key issue. In this paper, we propose an algorithm, called Most Power Reliable Paths (MoPoRePa), for online message routing in energy constrained wireless sensor networks. The time complexity of MoPoRePa is significantly lower than the well-known max min zP_min algorithm. Moreover, simulation studies show that MoPoRePa about 14.75 % and 8.05 % improvement over the max min zP _min algorithm in terms of network capacity and the network lifetime, respectively.

Original language	English
Title of host publication	Computational Science - ICCS 2007 - 7th International Conference, Proceedings
Publisher	Springer Verlag
Pages	465-468
Number of pages	4
Edition	PART 3
ISBN (Print)	9783540725879
DOIs	https://doi.org/10.1007/978-3-540-72588-6_77
State	Published - 2007
Event	7th International Conference on Computational Science, ICCS 2007 - Beijing, China Duration: 27 May 2007 → 30 May 2007

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 3
Volume	4489 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Conference on Computational Science, ICCS 2007
Country/Territory	China
City	Beijing
Period	27/05/07 → 30/05/07

Keywords

Network capacity
Network lifetime
Wireless sensor networks

Access to Document

10.1007/978-3-540-72588-6_77

Cite this

Kim, M., Choo, H., & Kim, W. (2007). Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks. In Computational Science - ICCS 2007 - 7th International Conference, Proceedings (PART 3 ed., pp. 465-468). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4489 LNCS, No. PART 3). Springer Verlag. https://doi.org/10.1007/978-3-540-72588-6_77

Kim, Moonseong ; Choo, Hyunseung ; Kim, Won. / Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks. Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3. ed. Springer Verlag, 2007. pp. 465-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).

@inproceedings{4b793195b143455b8e2020835ba302a8,

title = "Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks",

abstract = "In wireless sensor networks, maximizing battery life (network lifetime), and thus the number of messages the networks can support (network capacity), is a key issue. In this paper, we propose an algorithm, called Most Power Reliable Paths (MoPoRePa), for online message routing in energy constrained wireless sensor networks. The time complexity of MoPoRePa is significantly lower than the well-known max min zPmin algorithm. Moreover, simulation studies show that MoPoRePa about 14.75 \% and 8.05 \% improvement over the max min zP min algorithm in terms of network capacity and the network lifetime, respectively.",

keywords = "Network capacity, Network lifetime, Wireless sensor networks",

author = "Moonseong Kim and Hyunseung Choo and Won Kim",

year = "2007",

doi = "10.1007/978-3-540-72588-6\_77",

language = "English",

isbn = "9783540725879",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 3",

pages = "465--468",

booktitle = "Computational Science - ICCS 2007 - 7th International Conference, Proceedings",

edition = "PART 3",

note = "7th International Conference on Computational Science, ICCS 2007 ; Conference date: 27-05-2007 Through 30-05-2007",

}

Kim, M, Choo, H & Kim, W 2007, Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks. in Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 4489 LNCS, Springer Verlag, pp. 465-468, 7th International Conference on Computational Science, ICCS 2007, Beijing, China, 27/05/07. https://doi.org/10.1007/978-3-540-72588-6_77

Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks. / Kim, Moonseong; Choo, Hyunseung; Kim, Won.
Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3. ed. Springer Verlag, 2007. p. 465-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4489 LNCS, No. PART 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks

AU - Kim, Moonseong

AU - Choo, Hyunseung

AU - Kim, Won

PY - 2007

Y1 - 2007

N2 - In wireless sensor networks, maximizing battery life (network lifetime), and thus the number of messages the networks can support (network capacity), is a key issue. In this paper, we propose an algorithm, called Most Power Reliable Paths (MoPoRePa), for online message routing in energy constrained wireless sensor networks. The time complexity of MoPoRePa is significantly lower than the well-known max min zPmin algorithm. Moreover, simulation studies show that MoPoRePa about 14.75 % and 8.05 % improvement over the max min zP min algorithm in terms of network capacity and the network lifetime, respectively.

AB - In wireless sensor networks, maximizing battery life (network lifetime), and thus the number of messages the networks can support (network capacity), is a key issue. In this paper, we propose an algorithm, called Most Power Reliable Paths (MoPoRePa), for online message routing in energy constrained wireless sensor networks. The time complexity of MoPoRePa is significantly lower than the well-known max min zPmin algorithm. Moreover, simulation studies show that MoPoRePa about 14.75 % and 8.05 % improvement over the max min zP min algorithm in terms of network capacity and the network lifetime, respectively.

KW - Network capacity

KW - Network lifetime

KW - Wireless sensor networks

UR - https://www.scopus.com/pages/publications/38149026421

U2 - 10.1007/978-3-540-72588-6_77

DO - 10.1007/978-3-540-72588-6_77

M3 - Conference contribution

AN - SCOPUS:38149026421

SN - 9783540725879

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 465

EP - 468

BT - Computational Science - ICCS 2007 - 7th International Conference, Proceedings

PB - Springer Verlag

T2 - 7th International Conference on Computational Science, ICCS 2007

Y2 - 27 May 2007 through 30 May 2007

ER -

Kim M, Choo H, Kim W. Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks. In Computational Science - ICCS 2007 - 7th International Conference, Proceedings. PART 3 ed. Springer Verlag. 2007. p. 465-468. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3). doi: 10.1007/978-3-540-72588-6_77

Most power reliable paths algorithm for maximizing the lifetime of energy constrained sensor networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this