Paper Info
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 on-line 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.
Year
DOI
Venue
2007
10.1007/978-3-540-72588-6_77
International Conference on Computational Science (3)
Keywords
Field
DocType
simulation study,network capacity,battery life,power reliable paths algorithm,wireless sensor network,energy constrained sensor networks,power reliable paths,network lifetime,key issue,time complexity,on-line message routing,max min zp min,sensor network,wireless sensor networks
Key distribution in wireless sensor networks,Message routing,Computer science,Algorithm,Computer network,Brooks–Iyengar algorithm,Mobile wireless sensor network,Time complexity,Battery (electricity),Wireless sensor network
Conference
Volume
ISSN
Citations 
4489
0302-9743
0
PageRank 
References 
Authors
0.34
6
3
Name
Order
Citations
PageRank
Moonseong Kim114339.75
Hyunseung Choo21364195.25
Won Kim3143.26