File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization

TitleA distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization
Authors
KeywordsSensor networks
Time synchronization
Issue Date2009
PublisherIEEE
Citation
Ieee Transactions On Wireless Communications, 2009, v. 8 n. 4, p. 1764-1772 How to Cite?
AbstractRecently, a time synchronization algorithm called Pairwise Broadcast Synchronization (PBS) is proposed. With PBS, a sensor can be synchronized by overhearing synchronization packet exchange among its neighbouring sensors without sending out any packet itself. In an one-hop sensor network where every node is a neighbour of each other, a single PBS message exchange between two nodes would facilitate all nodes to synchronize. However, in a multi-hop sensor network, PBS message exchanges in several node pairs are needed in order to achieve network-wide synchronization. To reduce the number of message exchanges, these node pairs should be carefully chosen. In this paper, we investigate how to choose these appropriate sensors aiming at reducing the number of PBS message exchanges while allowing every node to synchronize. This selection problem is shown to be NP-complete, for which the greedy heuristic is a good polynomial-time approximation algorithm. Nevertheless, a centralized algorithm is not suitable for wireless sensor networks. Therefore, we develop a distributed heuristic algorithm allowing a sensor to determine how to synchronize itself based on its neighbourhood information only. The protocol is tested through extensive simulations. The simulation results reveal that the proposed protocol gives consistent performance under different conditions with its performance comparable to that of the centralized algorithm. © 2006 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/58813
ISSN
2015 Impact Factor: 2.925
2015 SCImago Journal Rankings: 2.340
ISI Accession Number ID
Funding AgencyGrant Number
General Research FundHKU 7181/07E
HKU Small Project Fund200507176083
Funding Information:

This work was supported in part by the General Research Fund, Project No. HKU 7181/07E and the HKU Small Project Fund, Project No. 200507176083.

References

 

DC FieldValueLanguage
dc.contributor.authorCheng, KYen_HK
dc.contributor.authorLui, KSen_HK
dc.contributor.authorWu, YCen_HK
dc.contributor.authorTam, Ven_HK
dc.date.accessioned2010-05-31T03:37:21Z-
dc.date.available2010-05-31T03:37:21Z-
dc.date.issued2009en_HK
dc.identifier.citationIeee Transactions On Wireless Communications, 2009, v. 8 n. 4, p. 1764-1772en_HK
dc.identifier.issn1536-1276en_HK
dc.identifier.urihttp://hdl.handle.net/10722/58813-
dc.description.abstractRecently, a time synchronization algorithm called Pairwise Broadcast Synchronization (PBS) is proposed. With PBS, a sensor can be synchronized by overhearing synchronization packet exchange among its neighbouring sensors without sending out any packet itself. In an one-hop sensor network where every node is a neighbour of each other, a single PBS message exchange between two nodes would facilitate all nodes to synchronize. However, in a multi-hop sensor network, PBS message exchanges in several node pairs are needed in order to achieve network-wide synchronization. To reduce the number of message exchanges, these node pairs should be carefully chosen. In this paper, we investigate how to choose these appropriate sensors aiming at reducing the number of PBS message exchanges while allowing every node to synchronize. This selection problem is shown to be NP-complete, for which the greedy heuristic is a good polynomial-time approximation algorithm. Nevertheless, a centralized algorithm is not suitable for wireless sensor networks. Therefore, we develop a distributed heuristic algorithm allowing a sensor to determine how to synchronize itself based on its neighbourhood information only. The protocol is tested through extensive simulations. The simulation results reveal that the proposed protocol gives consistent performance under different conditions with its performance comparable to that of the centralized algorithm. © 2006 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEEen_HK
dc.relation.ispartofIEEE Transactions on Wireless Communicationsen_HK
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectSensor networksen_HK
dc.subjectTime synchronizationen_HK
dc.titleA distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronizationen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1536-1276&volume=8&spage=1764&epage=1772&date=2009&atitle=A+Distributed+Multihop+Time+Synchronization+Protocol+for+Wireless+Sensor+Networks+using+Pairwise+Broadcast+Synchronization+en_HK
dc.identifier.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.emailWu, YC:ycwu@eee.hku.hken_HK
dc.identifier.emailTam, V:vtam@eee.hku.hken_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.identifier.authorityWu, YC=rp00195en_HK
dc.identifier.authorityTam, V=rp00173en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TWC.2009.080112en_HK
dc.identifier.scopuseid_2-s2.0-65949093728en_HK
dc.identifier.hkuros158700en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-65949093728&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume8en_HK
dc.identifier.issue4en_HK
dc.identifier.spage1764en_HK
dc.identifier.epage1772en_HK
dc.identifier.isiWOS:000265373100027-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridCheng, KY=14631590500en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.scopusauthoridWu, YC=7406894786en_HK
dc.identifier.scopusauthoridTam, V=7005091988en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats