File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Latency-minimizing data aggregation in wireless sensor networks under physical interference model

TitleLatency-minimizing data aggregation in wireless sensor networks under physical interference model
Authors
KeywordsData Aggregation
Minimum-Latency
Physical Interference Model
Wireless Sensor Networks
Issue Date2014
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/adhoc
Citation
Ad Hoc Networks, 2014, v. 12 n. 1, p. 52-68 How to Cite?
AbstractMinimizing latency is of primary importance for data aggregation which is an essential application in wireless sensor networks. Many fast data aggregation algorithms under the protocol interference model have been proposed, but the model falls short of being an accurate abstraction of wireless interferences in reality. In contrast, the physical interference model has been shown to be more realistic and has the potential to increase the network capacity when adopted in a design. It is a challenge to derive a distributed solution to latency-minimizing data aggregation under the physical interference model because of the simple fact that global-scale information to compute the cumulative interference is needed at any node. In this paper, we propose a distributed algorithm that aims to minimize aggregation latency under the physical interference model in wireless sensor networks of arbitrary topologies. The algorithm uses O(K) time slots to complete the aggregation task, where K is the logarithm of the ratio between the lengths of the longest and shortest links in the network. The key idea of our distributed algorithm is to partition the network into cells according to the value K, thus obviating the need for global information. We also give a centralized algorithm which can serve as a benchmark for comparison purposes. It constructs the aggregation tree following the nearest-neighbor criterion. The centralized algorithm takes O( log n) and O(log 3 n) time slots when coupled with two existing link scheduling strategies, respectively (where n is the total number of nodes), which represents the current best algorithm for the problem in the literature. We prove the correctness and efficiency of our algorithms, and conduct empirical studies under realistic settings to validate our analytical results. © 2011 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/152487
ISSN
2015 Impact Factor: 1.66
2015 SCImago Journal Rankings: 0.967
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorLi, Hen_US
dc.contributor.authorWu, Cen_US
dc.contributor.authorHua, QSen_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:39:36Z-
dc.date.available2012-06-26T06:39:36Z-
dc.date.issued2014en_US
dc.identifier.citationAd Hoc Networks, 2014, v. 12 n. 1, p. 52-68en_US
dc.identifier.issn1570-8705en_US
dc.identifier.urihttp://hdl.handle.net/10722/152487-
dc.description.abstractMinimizing latency is of primary importance for data aggregation which is an essential application in wireless sensor networks. Many fast data aggregation algorithms under the protocol interference model have been proposed, but the model falls short of being an accurate abstraction of wireless interferences in reality. In contrast, the physical interference model has been shown to be more realistic and has the potential to increase the network capacity when adopted in a design. It is a challenge to derive a distributed solution to latency-minimizing data aggregation under the physical interference model because of the simple fact that global-scale information to compute the cumulative interference is needed at any node. In this paper, we propose a distributed algorithm that aims to minimize aggregation latency under the physical interference model in wireless sensor networks of arbitrary topologies. The algorithm uses O(K) time slots to complete the aggregation task, where K is the logarithm of the ratio between the lengths of the longest and shortest links in the network. The key idea of our distributed algorithm is to partition the network into cells according to the value K, thus obviating the need for global information. We also give a centralized algorithm which can serve as a benchmark for comparison purposes. It constructs the aggregation tree following the nearest-neighbor criterion. The centralized algorithm takes O( log n) and O(log 3 n) time slots when coupled with two existing link scheduling strategies, respectively (where n is the total number of nodes), which represents the current best algorithm for the problem in the literature. We prove the correctness and efficiency of our algorithms, and conduct empirical studies under realistic settings to validate our analytical results. © 2011 Elsevier B.V. All rights reserved.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/adhocen_US
dc.relation.ispartofAd Hoc Networksen_US
dc.subjectData Aggregationen_US
dc.subjectMinimum-Latencyen_US
dc.subjectPhysical Interference Modelen_US
dc.subjectWireless Sensor Networksen_US
dc.titleLatency-minimizing data aggregation in wireless sensor networks under physical interference modelen_US
dc.typeArticleen_US
dc.identifier.emailWu, C:cwu@cs.hku.hken_US
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_US
dc.identifier.authorityWu, C=rp01397en_US
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.adhoc.2011.12.004en_US
dc.identifier.scopuseid_2-s2.0-84888641303en_US
dc.identifier.hkuros217634-
dc.identifier.volume12-
dc.identifier.issue1-
dc.identifier.spage52-
dc.identifier.epage68-
dc.identifier.isiWOS:000329957300006-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridLi, H=35292662600en_US
dc.identifier.scopusauthoridWu, C=15836048100en_US
dc.identifier.scopusauthoridHua, QS=15060090400en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.identifier.citeulike10168910-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats