File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2008.443
- Scopus: eid_2-s2.0-51249115143
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A greedy distributed time synchronization algorithm for wireless sensor networks
Title | A greedy distributed time synchronization algorithm for wireless sensor networks |
---|---|
Authors | |
Issue Date | 2008 |
Citation | Ieee International Conference On Communications, 2008, p. 2327-2331 How to Cite? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/98813 |
ISSN | 2023 SCImago Journal Rankings: 0.861 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cheng, KY | en_HK |
dc.contributor.author | Lui, KS | en_HK |
dc.contributor.author | Wu, YC | en_HK |
dc.contributor.author | Tam, V | en_HK |
dc.date.accessioned | 2010-09-25T18:03:22Z | - |
dc.date.available | 2010-09-25T18:03:22Z | - |
dc.date.issued | 2008 | en_HK |
dc.identifier.citation | Ieee International Conference On Communications, 2008, p. 2327-2331 | en_HK |
dc.identifier.issn | 0536-1486 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/98813 | - |
dc.description.abstract | In 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.language | eng | en_HK |
dc.relation.ispartof | IEEE International Conference on Communications | en_HK |
dc.title | A greedy distributed time synchronization algorithm for wireless sensor networks | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Lui, KS:kslui@eee.hku.hk | en_HK |
dc.identifier.email | Wu, YC:ycwu@eee.hku.hk | en_HK |
dc.identifier.email | Tam, V:vtam@eee.hku.hk | en_HK |
dc.identifier.authority | Lui, KS=rp00188 | en_HK |
dc.identifier.authority | Wu, YC=rp00195 | en_HK |
dc.identifier.authority | Tam, V=rp00173 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICC.2008.443 | en_HK |
dc.identifier.scopus | eid_2-s2.0-51249115143 | en_HK |
dc.identifier.hkuros | 142165 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-51249115143&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 2327 | en_HK |
dc.identifier.epage | 2331 | en_HK |
dc.identifier.scopusauthorid | Cheng, KY=14631590500 | en_HK |
dc.identifier.scopusauthorid | Lui, KS=7103390016 | en_HK |
dc.identifier.scopusauthorid | Wu, YC=7406894786 | en_HK |
dc.identifier.scopusauthorid | Tam, V=7005091988 | en_HK |
dc.identifier.issnl | 0536-1486 | - |