Data dissemination in wireless sensor networks with instantly decodable network coding
Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to...
Gespeichert in:
Veröffentlicht in: | Journal of communications and networks 2016, 18(5), , pp.846-856 |
---|---|
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 | 856 |
---|---|
container_issue | 5 |
container_start_page | 846 |
container_title | Journal of communications and networks |
container_volume | 18 |
creator | Gou, Liang Zhang, Gengxin Bian, Dongming Zhang, Wei Xie, Zhidong |
description | Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to sensors. Several approaches have been proposed recently for data dissemination in WSNs. However, none of these approaches achieves both high efficiency and low complexity simultaneously. To address this problem, cluster-tree based network architecture, which divides a WSN into hierarchies and clusters is proposed. Upon this architecture, data is delivered from base station to all sensors in clusters hierarchy by hierarchy. In each cluster, father broadcasts data to all his children with instantly decodable network coding (IDNC), and a novel scheme targeting to maximize total transmission gain (MTTG) is proposed. This scheme employs a new packet scheduling algorithm to select IDNC packets, which uses weight status feedback matrix (WSFM) directly. Analysis and simulation results indicate that the transmission efficiency approximate to the best existing approach maximum weight clique, but with much lower computational overhead. Hence, the energy efficiency achieves both in data transmission and processing. |
doi_str_mv | 10.1109/JCN.2016.000113 |
format | Article |
fullrecord | <record><control><sourceid>nrf_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_JCN_2016_000113</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7742731</ieee_id><sourcerecordid>oai_kci_go_kr_ARTI_1276696</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-5a0e9f8a4b7b3566a1fdcdcc0e76400569a27e63126415a4834e4d927c3b44883</originalsourceid><addsrcrecordid>eNo9kD1PwzAQhi0EEuVjZmDJypDWZzt2PVblq6gCCRVWy3EuxTR1kB2p6r8nJcD03ume94aHkCugYwCqJ0_z5zGjIMeUUgB-REaglcyLQsBxPzOmc8YVPSVnKX1SKoALGJH3W9vZrPIp4dYH2_k2ZD5kOx-xwZSyhCG1MQvY7dq4Sf2h--iB1NnQNfusQtdWtmzwj8j63Yf1BTmpbZPw8jfPydv93Wr-mC9fHhbz2TJ3TBddXliKup5aUaqSF1JaqCtXOUdRSUFpIbVlCiUHJgUUVky5QFFpphwvhZhO-Tm5Gf6GWJuN86a1_ifXrdlEM3tdLQwwJaWWPTsZWBfblCLW5iv6rY17A9QcFJpeoTkoNIPCvnE9NDwi_tNKCaY48G_8E20v</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Data dissemination in wireless sensor networks with instantly decodable network coding</title><source>IEEE Electronic Library (IEL)</source><creator>Gou, Liang ; Zhang, Gengxin ; Bian, Dongming ; Zhang, Wei ; Xie, Zhidong</creator><creatorcontrib>Gou, Liang ; Zhang, Gengxin ; Bian, Dongming ; Zhang, Wei ; Xie, Zhidong</creatorcontrib><description>Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to sensors. Several approaches have been proposed recently for data dissemination in WSNs. However, none of these approaches achieves both high efficiency and low complexity simultaneously. To address this problem, cluster-tree based network architecture, which divides a WSN into hierarchies and clusters is proposed. Upon this architecture, data is delivered from base station to all sensors in clusters hierarchy by hierarchy. In each cluster, father broadcasts data to all his children with instantly decodable network coding (IDNC), and a novel scheme targeting to maximize total transmission gain (MTTG) is proposed. This scheme employs a new packet scheduling algorithm to select IDNC packets, which uses weight status feedback matrix (WSFM) directly. Analysis and simulation results indicate that the transmission efficiency approximate to the best existing approach maximum weight clique, but with much lower computational overhead. Hence, the energy efficiency achieves both in data transmission and processing.</description><identifier>ISSN: 1229-2370</identifier><identifier>EISSN: 1976-5541</identifier><identifier>DOI: 10.1109/JCN.2016.000113</identifier><language>eng</language><publisher>Editorial Department of Journal of Communications and Networks</publisher><subject>Cluster-tree based architecture ; Complexity theory ; computational complexity ; instantly decodable network coding ; Network coding ; number of transmissions ; packet scheduling algorithm ; Receivers ; Sensors ; Wireless communication ; Wireless sensor networks ; wireless sensor networks(WSNs) ; 전자/정보통신공학</subject><ispartof>Journal of Communications and Networks, 2016, 18(5), , pp.846-856</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-5a0e9f8a4b7b3566a1fdcdcc0e76400569a27e63126415a4834e4d927c3b44883</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7742731$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54737</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7742731$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART002162885$$DAccess content in National Research Foundation of Korea (NRF)$$Hfree_for_read</backlink></links><search><creatorcontrib>Gou, Liang</creatorcontrib><creatorcontrib>Zhang, Gengxin</creatorcontrib><creatorcontrib>Bian, Dongming</creatorcontrib><creatorcontrib>Zhang, Wei</creatorcontrib><creatorcontrib>Xie, Zhidong</creatorcontrib><title>Data dissemination in wireless sensor networks with instantly decodable network coding</title><title>Journal of communications and networks</title><addtitle>JCN</addtitle><description>Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to sensors. Several approaches have been proposed recently for data dissemination in WSNs. However, none of these approaches achieves both high efficiency and low complexity simultaneously. To address this problem, cluster-tree based network architecture, which divides a WSN into hierarchies and clusters is proposed. Upon this architecture, data is delivered from base station to all sensors in clusters hierarchy by hierarchy. In each cluster, father broadcasts data to all his children with instantly decodable network coding (IDNC), and a novel scheme targeting to maximize total transmission gain (MTTG) is proposed. This scheme employs a new packet scheduling algorithm to select IDNC packets, which uses weight status feedback matrix (WSFM) directly. Analysis and simulation results indicate that the transmission efficiency approximate to the best existing approach maximum weight clique, but with much lower computational overhead. Hence, the energy efficiency achieves both in data transmission and processing.</description><subject>Cluster-tree based architecture</subject><subject>Complexity theory</subject><subject>computational complexity</subject><subject>instantly decodable network coding</subject><subject>Network coding</subject><subject>number of transmissions</subject><subject>packet scheduling algorithm</subject><subject>Receivers</subject><subject>Sensors</subject><subject>Wireless communication</subject><subject>Wireless sensor networks</subject><subject>wireless sensor networks(WSNs)</subject><subject>전자/정보통신공학</subject><issn>1229-2370</issn><issn>1976-5541</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kD1PwzAQhi0EEuVjZmDJypDWZzt2PVblq6gCCRVWy3EuxTR1kB2p6r8nJcD03ume94aHkCugYwCqJ0_z5zGjIMeUUgB-REaglcyLQsBxPzOmc8YVPSVnKX1SKoALGJH3W9vZrPIp4dYH2_k2ZD5kOx-xwZSyhCG1MQvY7dq4Sf2h--iB1NnQNfusQtdWtmzwj8j63Yf1BTmpbZPw8jfPydv93Wr-mC9fHhbz2TJ3TBddXliKup5aUaqSF1JaqCtXOUdRSUFpIbVlCiUHJgUUVky5QFFpphwvhZhO-Tm5Gf6GWJuN86a1_ifXrdlEM3tdLQwwJaWWPTsZWBfblCLW5iv6rY17A9QcFJpeoTkoNIPCvnE9NDwi_tNKCaY48G_8E20v</recordid><startdate>201610</startdate><enddate>201610</enddate><creator>Gou, Liang</creator><creator>Zhang, Gengxin</creator><creator>Bian, Dongming</creator><creator>Zhang, Wei</creator><creator>Xie, Zhidong</creator><general>Editorial Department of Journal of Communications and Networks</general><general>한국통신학회</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>ACYCR</scope></search><sort><creationdate>201610</creationdate><title>Data dissemination in wireless sensor networks with instantly decodable network coding</title><author>Gou, Liang ; Zhang, Gengxin ; Bian, Dongming ; Zhang, Wei ; Xie, Zhidong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-5a0e9f8a4b7b3566a1fdcdcc0e76400569a27e63126415a4834e4d927c3b44883</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Cluster-tree based architecture</topic><topic>Complexity theory</topic><topic>computational complexity</topic><topic>instantly decodable network coding</topic><topic>Network coding</topic><topic>number of transmissions</topic><topic>packet scheduling algorithm</topic><topic>Receivers</topic><topic>Sensors</topic><topic>Wireless communication</topic><topic>Wireless sensor networks</topic><topic>wireless sensor networks(WSNs)</topic><topic>전자/정보통신공학</topic><toplevel>online_resources</toplevel><creatorcontrib>Gou, Liang</creatorcontrib><creatorcontrib>Zhang, Gengxin</creatorcontrib><creatorcontrib>Bian, Dongming</creatorcontrib><creatorcontrib>Zhang, Wei</creatorcontrib><creatorcontrib>Xie, Zhidong</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>CrossRef</collection><collection>Korean Citation Index</collection><jtitle>Journal of communications and networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gou, Liang</au><au>Zhang, Gengxin</au><au>Bian, Dongming</au><au>Zhang, Wei</au><au>Xie, Zhidong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Data dissemination in wireless sensor networks with instantly decodable network coding</atitle><jtitle>Journal of communications and networks</jtitle><stitle>JCN</stitle><date>2016-10</date><risdate>2016</risdate><volume>18</volume><issue>5</issue><spage>846</spage><epage>856</epage><pages>846-856</pages><issn>1229-2370</issn><eissn>1976-5541</eissn><abstract>Wireless sensor networks (WSNs) are widely applied in monitoring and control of environment parameters. It is sometimes necessary to disseminate data through wireless links after they are deployed in order to adjust configuration parameters of sensors or distribute management commands and queries to sensors. Several approaches have been proposed recently for data dissemination in WSNs. However, none of these approaches achieves both high efficiency and low complexity simultaneously. To address this problem, cluster-tree based network architecture, which divides a WSN into hierarchies and clusters is proposed. Upon this architecture, data is delivered from base station to all sensors in clusters hierarchy by hierarchy. In each cluster, father broadcasts data to all his children with instantly decodable network coding (IDNC), and a novel scheme targeting to maximize total transmission gain (MTTG) is proposed. This scheme employs a new packet scheduling algorithm to select IDNC packets, which uses weight status feedback matrix (WSFM) directly. Analysis and simulation results indicate that the transmission efficiency approximate to the best existing approach maximum weight clique, but with much lower computational overhead. Hence, the energy efficiency achieves both in data transmission and processing.</abstract><pub>Editorial Department of Journal of Communications and Networks</pub><doi>10.1109/JCN.2016.000113</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1229-2370 |
ispartof | Journal of Communications and Networks, 2016, 18(5), , pp.846-856 |
issn | 1229-2370 1976-5541 |
language | eng |
recordid | cdi_crossref_primary_10_1109_JCN_2016_000113 |
source | IEEE Electronic Library (IEL) |
subjects | Cluster-tree based architecture Complexity theory computational complexity instantly decodable network coding Network coding number of transmissions packet scheduling algorithm Receivers Sensors Wireless communication Wireless sensor networks wireless sensor networks(WSNs) 전자/정보통신공학 |
title | Data dissemination in wireless sensor networks with instantly decodable network coding |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T05%3A54%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-nrf_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Data%20dissemination%20in%20wireless%20sensor%20networks%20with%20instantly%20decodable%20network%20coding&rft.jtitle=Journal%20of%20communications%20and%20networks&rft.au=Gou,%20Liang&rft.date=2016-10&rft.volume=18&rft.issue=5&rft.spage=846&rft.epage=856&rft.pages=846-856&rft.issn=1229-2370&rft.eissn=1976-5541&rft_id=info:doi/10.1109/JCN.2016.000113&rft_dat=%3Cnrf_RIE%3Eoai_kci_go_kr_ARTI_1276696%3C/nrf_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=7742731&rfr_iscdi=true |