File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Maximizing network lifetime online by localized probabilistic load balancing

TitleMaximizing network lifetime online by localized probabilistic load balancing
Authors
KeywordsCritical problems
Data collection
Distributed algorithm
Dynamic network
Extensive simulations
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 10th international conference on Ad-hoc, mobile, and wireless networks (ADHOC-NOW'11), Paderborn, Germany, 18-20 July 2011. In Lecture Notes in Computer Science, 2011, v. 6811, p. 332-345 How to Cite?
AbstractNetwork lifetime maximization is a critical problem for long-term data collection in wireless sensor networks. For large-scale networks, distributed and self-adaptive solutions are highly desired. In this paper, we investigate how to optimize the network lifetime by a localized method. Specifically, the network lifetime maximization problem is converted to a localized cost-balancing problem with an appropriately designed local cost function. A distributed algorithm, LocalWiser, which adopts the idea of adaptive probabilistic routing, is proposed to construct a localized and self-adaptive optimal solution to maximize the network lifetime. We analyze LocalWiser in both static and dynamic networks. In static networks, it is formally proved that 1) LocalWiser can reach a stable status; 2) the stable status is optimal for maximizing the network lifetime. In dynamic networks, our extensive simulations illustrate that LocalWiser can converge to the optimal status rapidly for the network topology and flow dynamics. © 2011 Springer-Verlag.
DescriptionLNCS v. 6811 has title: AD-HOC, mobile, and wireless networks: 10th International Conference, ADHOC-NOW 2011 proceedings
Persistent Identifierhttp://hdl.handle.net/10722/152002
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorWang, Yen_US
dc.contributor.authorWang, Yen_US
dc.contributor.authorTan, Hen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:32:19Z-
dc.date.available2012-06-26T06:32:19Z-
dc.date.issued2011en_US
dc.identifier.citationThe 10th international conference on Ad-hoc, mobile, and wireless networks (ADHOC-NOW'11), Paderborn, Germany, 18-20 July 2011. In Lecture Notes in Computer Science, 2011, v. 6811, p. 332-345en_US
dc.identifier.isbn978-3-642-22449-2-
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/152002-
dc.descriptionLNCS v. 6811 has title: AD-HOC, mobile, and wireless networks: 10th International Conference, ADHOC-NOW 2011 proceedings-
dc.description.abstractNetwork lifetime maximization is a critical problem for long-term data collection in wireless sensor networks. For large-scale networks, distributed and self-adaptive solutions are highly desired. In this paper, we investigate how to optimize the network lifetime by a localized method. Specifically, the network lifetime maximization problem is converted to a localized cost-balancing problem with an appropriately designed local cost function. A distributed algorithm, LocalWiser, which adopts the idea of adaptive probabilistic routing, is proposed to construct a localized and self-adaptive optimal solution to maximize the network lifetime. We analyze LocalWiser in both static and dynamic networks. In static networks, it is formally proved that 1) LocalWiser can reach a stable status; 2) the stable status is optimal for maximizing the network lifetime. In dynamic networks, our extensive simulations illustrate that LocalWiser can converge to the optimal status rapidly for the network topology and flow dynamics. © 2011 Springer-Verlag.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes in Computer Scienceen_US
dc.rightsThe original publication is available at www.springerlink.com-
dc.subjectCritical problems-
dc.subjectData collection-
dc.subjectDistributed algorithm-
dc.subjectDynamic network-
dc.subjectExtensive simulations-
dc.titleMaximizing network lifetime online by localized probabilistic load balancingen_US
dc.typeConference_Paperen_US
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hken_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_OA_fulltext-
dc.identifier.doi10.1007/978-3-642-22450-8_26en_US
dc.identifier.scopuseid_2-s2.0-79960378022en_US
dc.identifier.hkuros211549-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79960378022&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume6811en_US
dc.identifier.spage332en_US
dc.identifier.epage345en_US
dc.publisher.placeGermanyen_US
dc.description.otherThe 10th international conference on Ad-hoc, mobile, and wireless networks (ADHOC-NOW'11), Paderborn, Germany, 18-20 July 2011. In Lecture Notes in Computer Science, 2011, v. 6811, p. 332-345-
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.scopusauthoridTan, H=22936378500en_US
dc.identifier.scopusauthoridWang, Y=43061815300en_US
dc.identifier.scopusauthoridWang, Y=14016845800en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats