Efficient Route Redundancy in DAG-Based Wireless Sensor Networks
Wireless Sensor Networks (WSN) need to be organized in order to be more resource-efficient and scalable. Directed Acyclic Graphs (DAG) are of interest for WSN organization because of their route redundancy to the root. A recent routing protocol for WSNs coming from the IETF ROLL Working Group specif...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 6 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Lampin, Quentin Barthel, Dominique Valois, Fabrice |
| description | Wireless Sensor Networks (WSN) need to be organized in order to be more resource-efficient and scalable. Directed Acyclic Graphs (DAG) are of interest for WSN organization because of their route redundancy to the root. A recent routing protocol for WSNs coming from the IETF ROLL Working Group specifies the use of DAGs and proposes to improve the route redundancy even further by routing through sibling nodes as well. In this paper, we investigate the effectiveness of routing through sibling nodes and we propose a new use of siblings which preserves most of the performance but reduces algorithmic complexity and memory requirements. |
| doi_str_mv | 10.1109/WCNC.2010.5506360 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5506360</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5506360</ieee_id><sourcerecordid>5506360</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a20a97aa218f2531703839e9c4a441c1060584a498dbf444b44d206ce9d81f2b3</originalsourceid><addsrcrecordid>eNpVUMtKAzEUjS-w1PkAcZMfSM3Na5KddVqrUCpUpcuSmbmBaJ2RyRTp3ztiN57NecFZHEKugU8AuLvdFKtiIvhgteZGGn5CMpdbUEIpI53Vp2QEWlsmDIizf52B899OaCY1wCXJUnrnA9QQcTkid_MQYhWx6em63fdI11jvm9o31YHGhs6mC3bvE9Z0EzvcYUr0BZvUdnSF_XfbfaQrchH8LmF25DF5e5i_Fo9s-bx4KqZLFiHXPfOCe5d7L8AGoSXkXFrp0FXKKwUVcMO1HbSzdRmUUqVSteCmQldbCKKUY3LztxsRcfvVxU_fHbbHP-QP8kdNGg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Efficient Route Redundancy in DAG-Based Wireless Sensor Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Lampin, Quentin ; Barthel, Dominique ; Valois, Fabrice</creator><creatorcontrib>Lampin, Quentin ; Barthel, Dominique ; Valois, Fabrice</creatorcontrib><description>Wireless Sensor Networks (WSN) need to be organized in order to be more resource-efficient and scalable. Directed Acyclic Graphs (DAG) are of interest for WSN organization because of their route redundancy to the root. A recent routing protocol for WSNs coming from the IETF ROLL Working Group specifies the use of DAGs and proposes to improve the route redundancy even further by routing through sibling nodes as well. In this paper, we investigate the effectiveness of routing through sibling nodes and we propose a new use of siblings which preserves most of the performance but reduces algorithmic complexity and memory requirements.</description><identifier>ISSN: 1525-3511</identifier><identifier>ISBN: 9781424463961</identifier><identifier>ISBN: 1424463963</identifier><identifier>EISSN: 1558-2612</identifier><identifier>EISBN: 9781424463985</identifier><identifier>EISBN: 142446398X</identifier><identifier>EISBN: 1424463971</identifier><identifier>EISBN: 9781424463978</identifier><identifier>DOI: 10.1109/WCNC.2010.5506360</identifier><language>eng</language><publisher>IEEE</publisher><subject>Communications Society ; Maintenance ; Network topology ; Peer to peer computing ; Proposals ; Radio access networks ; Research and development ; Routing protocols ; Telecommunication traffic ; Wireless sensor networks</subject><ispartof>2010 IEEE Wireless Communication and Networking Conference, 2010, p.1-6</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5506360$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5506360$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lampin, Quentin</creatorcontrib><creatorcontrib>Barthel, Dominique</creatorcontrib><creatorcontrib>Valois, Fabrice</creatorcontrib><title>Efficient Route Redundancy in DAG-Based Wireless Sensor Networks</title><title>2010 IEEE Wireless Communication and Networking Conference</title><addtitle>WCNC</addtitle><description>Wireless Sensor Networks (WSN) need to be organized in order to be more resource-efficient and scalable. Directed Acyclic Graphs (DAG) are of interest for WSN organization because of their route redundancy to the root. A recent routing protocol for WSNs coming from the IETF ROLL Working Group specifies the use of DAGs and proposes to improve the route redundancy even further by routing through sibling nodes as well. In this paper, we investigate the effectiveness of routing through sibling nodes and we propose a new use of siblings which preserves most of the performance but reduces algorithmic complexity and memory requirements.</description><subject>Communications Society</subject><subject>Maintenance</subject><subject>Network topology</subject><subject>Peer to peer computing</subject><subject>Proposals</subject><subject>Radio access networks</subject><subject>Research and development</subject><subject>Routing protocols</subject><subject>Telecommunication traffic</subject><subject>Wireless sensor networks</subject><issn>1525-3511</issn><issn>1558-2612</issn><isbn>9781424463961</isbn><isbn>1424463963</isbn><isbn>9781424463985</isbn><isbn>142446398X</isbn><isbn>1424463971</isbn><isbn>9781424463978</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVUMtKAzEUjS-w1PkAcZMfSM3Na5KddVqrUCpUpcuSmbmBaJ2RyRTp3ztiN57NecFZHEKugU8AuLvdFKtiIvhgteZGGn5CMpdbUEIpI53Vp2QEWlsmDIizf52B899OaCY1wCXJUnrnA9QQcTkid_MQYhWx6em63fdI11jvm9o31YHGhs6mC3bvE9Z0EzvcYUr0BZvUdnSF_XfbfaQrchH8LmF25DF5e5i_Fo9s-bx4KqZLFiHXPfOCe5d7L8AGoSXkXFrp0FXKKwUVcMO1HbSzdRmUUqVSteCmQldbCKKUY3LztxsRcfvVxU_fHbbHP-QP8kdNGg</recordid><startdate>201004</startdate><enddate>201004</enddate><creator>Lampin, Quentin</creator><creator>Barthel, Dominique</creator><creator>Valois, Fabrice</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201004</creationdate><title>Efficient Route Redundancy in DAG-Based Wireless Sensor Networks</title><author>Lampin, Quentin ; Barthel, Dominique ; Valois, Fabrice</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a20a97aa218f2531703839e9c4a441c1060584a498dbf444b44d206ce9d81f2b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Communications Society</topic><topic>Maintenance</topic><topic>Network topology</topic><topic>Peer to peer computing</topic><topic>Proposals</topic><topic>Radio access networks</topic><topic>Research and development</topic><topic>Routing protocols</topic><topic>Telecommunication traffic</topic><topic>Wireless sensor networks</topic><toplevel>online_resources</toplevel><creatorcontrib>Lampin, Quentin</creatorcontrib><creatorcontrib>Barthel, Dominique</creatorcontrib><creatorcontrib>Valois, Fabrice</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lampin, Quentin</au><au>Barthel, Dominique</au><au>Valois, Fabrice</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Efficient Route Redundancy in DAG-Based Wireless Sensor Networks</atitle><btitle>2010 IEEE Wireless Communication and Networking Conference</btitle><stitle>WCNC</stitle><date>2010-04</date><risdate>2010</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><issn>1525-3511</issn><eissn>1558-2612</eissn><isbn>9781424463961</isbn><isbn>1424463963</isbn><eisbn>9781424463985</eisbn><eisbn>142446398X</eisbn><eisbn>1424463971</eisbn><eisbn>9781424463978</eisbn><abstract>Wireless Sensor Networks (WSN) need to be organized in order to be more resource-efficient and scalable. Directed Acyclic Graphs (DAG) are of interest for WSN organization because of their route redundancy to the root. A recent routing protocol for WSNs coming from the IETF ROLL Working Group specifies the use of DAGs and proposes to improve the route redundancy even further by routing through sibling nodes as well. In this paper, we investigate the effectiveness of routing through sibling nodes and we propose a new use of siblings which preserves most of the performance but reduces algorithmic complexity and memory requirements.</abstract><pub>IEEE</pub><doi>10.1109/WCNC.2010.5506360</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1525-3511 |
| ispartof | 2010 IEEE Wireless Communication and Networking Conference, 2010, p.1-6 |
| issn | 1525-3511 1558-2612 |
| language | eng |
| recordid | cdi_ieee_primary_5506360 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Communications Society Maintenance Network topology Peer to peer computing Proposals Radio access networks Research and development Routing protocols Telecommunication traffic Wireless sensor networks |
| title | Efficient Route Redundancy in DAG-Based Wireless Sensor Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T22%3A31%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Efficient%20Route%20Redundancy%20in%20DAG-Based%20Wireless%20Sensor%20Networks&rft.btitle=2010%20IEEE%20Wireless%20Communication%20and%20Networking%20Conference&rft.au=Lampin,%20Quentin&rft.date=2010-04&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.issn=1525-3511&rft.eissn=1558-2612&rft.isbn=9781424463961&rft.isbn_list=1424463963&rft_id=info:doi/10.1109/WCNC.2010.5506360&rft_dat=%3Cieee_6IE%3E5506360%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424463985&rft.eisbn_list=142446398X&rft.eisbn_list=1424463971&rft.eisbn_list=9781424463978&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5506360&rfr_iscdi=true |