File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A greedy distributed time synchronization algorithm for wireless sensor networks

TitleA greedy distributed time synchronization algorithm for wireless sensor networks
Authors
Issue Date2008
Citation
Ieee International Conference On Communications, 2008, p. 2327-2331 How to Cite?
AbstractIn this paper, a distributed network-wise synchronization protocol is presented. The protocol employs Pairwise Broadcast Synchronization (PBS) in which sensors can be synchronized by merely overhearing the exchange of synchronization packets. We investigate how to minimize the number of PBS required to synchronize all nodes in a network. We show that the problem of finding the minimum number of PBS required is NP-complete. A distributed greedy algorithm is proposed. The protocol is tested by extensive simulations. Although the algorithm behind is heuristic-based, the performance is closed to the centralized algorithm. The message overhead is compared with that of Timing-Sync Protocol for Sensor Networks (TPSN). ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/98813
ISSN
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-09-25T18:03:22Z-
dc.date.available2010-09-25T18:03:22Z-
dc.date.issued2008en_HK
dc.identifier.citationIeee International Conference On Communications, 2008, p. 2327-2331en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/98813-
dc.description.abstractIn this paper, a distributed network-wise synchronization protocol is presented. The protocol employs Pairwise Broadcast Synchronization (PBS) in which sensors can be synchronized by merely overhearing the exchange of synchronization packets. We investigate how to minimize the number of PBS required to synchronize all nodes in a network. We show that the problem of finding the minimum number of PBS required is NP-complete. A distributed greedy algorithm is proposed. The protocol is tested by extensive simulations. Although the algorithm behind is heuristic-based, the performance is closed to the centralized algorithm. The message overhead is compared with that of Timing-Sync Protocol for Sensor Networks (TPSN). ©2008 IEEE.en_HK
dc.languageengen_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.titleA greedy distributed time synchronization algorithm for wireless sensor networksen_HK
dc.typeConference_Paperen_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/ICC.2008.443en_HK
dc.identifier.scopuseid_2-s2.0-51249115143en_HK
dc.identifier.hkuros142165en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51249115143&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage2327en_HK
dc.identifier.epage2331en_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