A distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization
Recently, 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...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on wireless communications 2009-04, Vol.8 (4), p.1764-1772 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1772 |
---|---|
container_issue | 4 |
container_start_page | 1764 |
container_title | IEEE transactions on wireless communications |
container_volume | 8 |
creator | King-Yip Cheng King-Shan Lui Yik-Chung Wu Tam, V. |
description | Recently, 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 ldquoappropriaterdquo 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. |
doi_str_mv | 10.1109/TWC.2009.080112 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_861062952</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4907449</ieee_id><sourcerecordid>34489727</sourcerecordid><originalsourceid>FETCH-LOGICAL-c488t-b1491e29125447b9574de988af36f435d2fc02734239acec0f2b08b50fe7ef7d3</originalsourceid><addsrcrecordid>eNp9kcFrFDEUxgdRsK6ePXgJgvY02ySTTJJjXawKBQUrHkMm82JTZ5M1L8PS_vXOuqWgB09JeL_v-174muYlo2vGqDm7-r5Zc0rNmmrKGH_UnDApdcu50I8P965vGVf90-YZ4g2lTPVSnjR352SMWEsc5goj2c5Tjdd5R2rcAsHb5K9LTvHO1ZgT2ZVcs88TCbmQfSwwASJBSLi8E9R9Lj-RzBjTD_LFxbKPCORdyW70Div5-rfd8-ZJcBPCi_tz1Xy7eH-1-dhefv7waXN-2XqhdW0HJgwDbhiXQqjBSCVGMFq70PVBdHLkwVOuOsE74zx4GvhA9SBpAAVBjd2qOT36Luv_mgGr3Ub0ME0uQZ7RaiUpM0vAQr79L9kJoY1aslbN63_AmzyXtPzC6p7RnhvJF-jsCPmSEQsEuytx68qtZdQeKrNLZfZQmT1Wtije3Ns69G4KxSUf8UHGmRKM_4l_deQiADyMhaFKCNP9BpfJoag</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>861062952</pqid></control><display><type>article</type><title>A distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization</title><source>IEEE Electronic Library (IEL)</source><creator>King-Yip Cheng ; King-Shan Lui ; Yik-Chung Wu ; Tam, V.</creator><creatorcontrib>King-Yip Cheng ; King-Shan Lui ; Yik-Chung Wu ; Tam, V.</creatorcontrib><description>Recently, 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 ldquoappropriaterdquo 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.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2009.080112</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; Broadcasting ; Detection, estimation, filtering, equalization, prediction ; Event detection ; Exact sciences and technology ; Exchange ; Heuristic ; Information, signal and communications theory ; Messages ; Networks ; Polynomials ; sensor networks ; Sensors ; Services and terminals of telecommunications ; Signal and communications theory ; Signal processing algorithms ; Signal, noise ; Spread spectrum communication ; Streaming media ; Studies ; Switching and signalling ; Synchronism ; Synchronization ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Telemetry. Remote supervision. Telewarning. Remote control ; Time synchronization ; Timing ; Wireless application protocol ; Wireless networks ; Wireless sensor networks</subject><ispartof>IEEE transactions on wireless communications, 2009-04, Vol.8 (4), p.1764-1772</ispartof><rights>2009 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c488t-b1491e29125447b9574de988af36f435d2fc02734239acec0f2b08b50fe7ef7d3</citedby><cites>FETCH-LOGICAL-c488t-b1491e29125447b9574de988af36f435d2fc02734239acec0f2b08b50fe7ef7d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4907449$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4907449$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21741227$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>King-Yip Cheng</creatorcontrib><creatorcontrib>King-Shan Lui</creatorcontrib><creatorcontrib>Yik-Chung Wu</creatorcontrib><creatorcontrib>Tam, V.</creatorcontrib><title>A distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>Recently, 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 ldquoappropriaterdquo 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.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Broadcasting</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Event detection</subject><subject>Exact sciences and technology</subject><subject>Exchange</subject><subject>Heuristic</subject><subject>Information, signal and communications theory</subject><subject>Messages</subject><subject>Networks</subject><subject>Polynomials</subject><subject>sensor networks</subject><subject>Sensors</subject><subject>Services and terminals of telecommunications</subject><subject>Signal and communications theory</subject><subject>Signal processing algorithms</subject><subject>Signal, noise</subject><subject>Spread spectrum communication</subject><subject>Streaming media</subject><subject>Studies</subject><subject>Switching and signalling</subject><subject>Synchronism</subject><subject>Synchronization</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Telemetry. Remote supervision. Telewarning. Remote control</subject><subject>Time synchronization</subject><subject>Timing</subject><subject>Wireless application protocol</subject><subject>Wireless networks</subject><subject>Wireless sensor networks</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNp9kcFrFDEUxgdRsK6ePXgJgvY02ySTTJJjXawKBQUrHkMm82JTZ5M1L8PS_vXOuqWgB09JeL_v-174muYlo2vGqDm7-r5Zc0rNmmrKGH_UnDApdcu50I8P965vGVf90-YZ4g2lTPVSnjR352SMWEsc5goj2c5Tjdd5R2rcAsHb5K9LTvHO1ZgT2ZVcs88TCbmQfSwwASJBSLi8E9R9Lj-RzBjTD_LFxbKPCORdyW70Div5-rfd8-ZJcBPCi_tz1Xy7eH-1-dhefv7waXN-2XqhdW0HJgwDbhiXQqjBSCVGMFq70PVBdHLkwVOuOsE74zx4GvhA9SBpAAVBjd2qOT36Luv_mgGr3Ub0ME0uQZ7RaiUpM0vAQr79L9kJoY1aslbN63_AmzyXtPzC6p7RnhvJF-jsCPmSEQsEuytx68qtZdQeKrNLZfZQmT1Wtije3Ns69G4KxSUf8UHGmRKM_4l_deQiADyMhaFKCNP9BpfJoag</recordid><startdate>20090401</startdate><enddate>20090401</enddate><creator>King-Yip Cheng</creator><creator>King-Shan Lui</creator><creator>Yik-Chung Wu</creator><creator>Tam, V.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20090401</creationdate><title>A distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization</title><author>King-Yip Cheng ; King-Shan Lui ; Yik-Chung Wu ; Tam, V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c488t-b1491e29125447b9574de988af36f435d2fc02734239acec0f2b08b50fe7ef7d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Broadcasting</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Event detection</topic><topic>Exact sciences and technology</topic><topic>Exchange</topic><topic>Heuristic</topic><topic>Information, signal and communications theory</topic><topic>Messages</topic><topic>Networks</topic><topic>Polynomials</topic><topic>sensor networks</topic><topic>Sensors</topic><topic>Services and terminals of telecommunications</topic><topic>Signal and communications theory</topic><topic>Signal processing algorithms</topic><topic>Signal, noise</topic><topic>Spread spectrum communication</topic><topic>Streaming media</topic><topic>Studies</topic><topic>Switching and signalling</topic><topic>Synchronism</topic><topic>Synchronization</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Telemetry. Remote supervision. Telewarning. Remote control</topic><topic>Time synchronization</topic><topic>Timing</topic><topic>Wireless application protocol</topic><topic>Wireless networks</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>King-Yip Cheng</creatorcontrib><creatorcontrib>King-Shan Lui</creatorcontrib><creatorcontrib>Yik-Chung Wu</creatorcontrib><creatorcontrib>Tam, V.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>King-Yip Cheng</au><au>King-Shan Lui</au><au>Yik-Chung Wu</au><au>Tam, V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2009-04-01</date><risdate>2009</risdate><volume>8</volume><issue>4</issue><spage>1764</spage><epage>1772</epage><pages>1764-1772</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>Recently, 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 ldquoappropriaterdquo 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.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TWC.2009.080112</doi><tpages>9</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1536-1276 |
ispartof | IEEE transactions on wireless communications, 2009-04, Vol.8 (4), p.1764-1772 |
issn | 1536-1276 1558-2248 |
language | eng |
recordid | cdi_proquest_journals_861062952 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithms Applied sciences Broadcasting Detection, estimation, filtering, equalization, prediction Event detection Exact sciences and technology Exchange Heuristic Information, signal and communications theory Messages Networks Polynomials sensor networks Sensors Services and terminals of telecommunications Signal and communications theory Signal processing algorithms Signal, noise Spread spectrum communication Streaming media Studies Switching and signalling Synchronism Synchronization Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Telemetry. Remote supervision. Telewarning. Remote control Time synchronization Timing Wireless application protocol Wireless networks Wireless sensor networks |
title | A distributed multihop time synchronization protocol for wireless sensor networks using Pairwise Broadcast Synchronization |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T23%3A04%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20distributed%20multihop%20time%20synchronization%20protocol%20for%20wireless%20sensor%20networks%20using%20Pairwise%20Broadcast%20Synchronization&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=King-Yip%20Cheng&rft.date=2009-04-01&rft.volume=8&rft.issue=4&rft.spage=1764&rft.epage=1772&rft.pages=1764-1772&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2009.080112&rft_dat=%3Cproquest_RIE%3E34489727%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=861062952&rft_id=info:pmid/&rft_ieee_id=4907449&rfr_iscdi=true |