Rose algorithm for fast and even routing in sensor networks
In this paper, the novel ROSE Algorithm is proposed for fast and even routing in sensor networks. The algorithm uses the concepts of the differences of sets and the node relative degree to find the paths from the sink to all nodes in the network. It is developed in the manner of a rose blossoming. T...
Uložené v:
| Vydané v: | Journal of the Chinese Institute of Engineers Ročník 32; číslo 7; s. 993 - 1007 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Taylor & Francis Group
01.11.2009
|
| Predmet: | |
| ISSN: | 0253-3839, 2158-7299 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, the novel ROSE Algorithm is proposed for fast and even routing in sensor networks. The algorithm uses the concepts of the differences of sets and the node relative degree to find the paths from the sink to all nodes in the network. It is developed in the manner of a rose blossoming. The protocol forms a tree-architecture to organize the sensors as hierarchical sets governed by their set-heads. The branches of the tree are not long extended. Therefore, the sink can conveniently and quickly follows the tree structure to find its destinations. The set-heads perform data fusion / aggregation to reduce bandwidth consumption, media access delay, and power consumption in communication. Rose Algorithm is proved to be packet delivery guaranteed. It is adaptive to variant modes of set-head selection. If the mode is of the least set-heads with the corresponding largest relative degrees, then the required number of the transmissions and the entire energy consumption are greatly reduced. On the other hand, if the mode is of more set-heads with medium relative degrees, then the loads of the routing paths in the tree are more balanced. Besides, if the mode is of the selected set-heads with the greatest residual energy, then the lifetime of the network can be prolonged. In addition, the tree-based upstream recovery method is provided to reconstruct the routing tree quickly when a set-head fails. The features of the protocol include: (1) the quick finding of the guaranteed packet delivery routing paths from sink to all sensors without the need of the locations of the sensors, and the found paths are very close to their corresponding shortest paths, (2) the reduction of amount of re-transmissions, and (3) the reduction of the amount of the reply packets from the set-heads to the sink due to the data fusion / aggregation performed by the set-heads. The simulation results of the algorithm with respect to the transmission time delay and the reply time delay outperform Pure Flooding to a large extent. |
|---|---|
| AbstractList | In this paper, the novel ROSE Algorithm is proposed for fast and even routing in sensor networks. The algorithm uses the concepts of the differences of sets and the node relative degree to find the paths from the sink to all nodes in the network. It is developed in the manner of a rose blossoming. The protocol forms a tree-architecture to organize the sensors as hierarchical sets governed by their set-heads. The branches of the tree are not long extended. Therefore, the sink can conveniently and quickly follows the tree structure to find its destinations. The set-heads perform data fusion / aggregation to reduce bandwidth consumption, media access delay, and power consumption in communication. Rose Algorithm is proved to be packet delivery guaranteed. It is adaptive to variant modes of set-head selection. If the mode is of the least set-heads with the corresponding largest relative degrees, then the required number of the transmissions and the entire energy consumption are greatly reduced. On the other hand, if the mode is of more set-heads with medium relative degrees, then the loads of the routing paths in the tree are more balanced. Besides, if the mode is of the selected set-heads with the greatest residual energy, then the lifetime of the network can be prolonged. In addition, the tree-based upstream recovery method is provided to reconstruct the routing tree quickly when a set-head fails. The features of the protocol include: (1) the quick finding of the guaranteed packet delivery routing paths from sink to all sensors without the need of the locations of the sensors, and the found paths are very close to their corresponding shortest paths, (2) the reduction of amount of re-transmissions, and (3) the reduction of the amount of the reply packets from the set-heads to the sink due to the data fusion / aggregation performed by the set-heads. The simulation results of the algorithm with respect to the transmission time delay and the reply time delay outperform Pure Flooding to a large extent. |
| Author | Hou, Ting-Wei Su, Bey-Ling Huang, Yueh-Min |
| Author_xml | – sequence: 1 givenname: Ting-Wei surname: Hou fullname: Hou, Ting-Wei organization: Department of Engineering Science , National Cheng Kung University – sequence: 2 givenname: Bey-Ling surname: Su fullname: Su, Bey-Ling organization: Department of Engineering Science , National Cheng Kung University – sequence: 3 givenname: Yueh-Min surname: Huang fullname: Huang, Yueh-Min organization: Department of Engineering Science , National Cheng Kung University |
| BookMark | eNp9kN1KAzEQhYNUsK0-gpAX2DU_zW6CN0rxDwqC6HUYs0ld3U0kiUrf3iytt14dmDnnMPMt0MwHbxE6p6SmRJILwgTnkquaEaJq1bRUyPYIzVnRqmVKzdB88lST6QQtUnonhDWC0Tm6fArJYhi2Ifb5bcQuROwgZQy-w_bbehzDV-79FvceJ-tT2Xubf0L8SKfo2MGQ7NlBl-jl9uZ5fV9tHu8e1tebyjAhc-U66UCpIlwwy7jhskwEBelUB04o7iwYwYEwyV-JBNOuDIBruF0pKgxfIrHvNTGkFK3Tn7EfIe40JXoioP8I6ImAPhAouat9rvflrRHK0UOnM-yGEF0Eb_qk-f8VvycbZVQ |
| Cites_doi | 10.1109/WCNC.2002.993520 10.1016/S1389-1286(01)00302-4 10.1145/509506.509514 10.1023/A:1016542229220 10.1109/ICC.1998.683110 10.1007/s11390-006-0997-5 10.1109/2.841788 10.1023/A:1013715909417 10.1109/TBC.2005.847624 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 2009 |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 2009 |
| DBID | AAYXX CITATION |
| DOI | 10.1080/02533839.2009.9671587 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2158-7299 |
| EndPage | 1007 |
| ExternalDocumentID | 10_1080_02533839_2009_9671587 9671587 |
| GroupedDBID | -~X .7F .QJ 0BK 0R~ 30N 4.4 5GY 8RM AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABFIM ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGFS ACTIO ADCVX ADGTB ADUMR AEISY AENEX AEOZL AFRVT AGBKS AGDLA AGMYJ AHDZW AIJEM AIYEW AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AQTUD AVBZW BLEHA CCCUG DGEBU DKSSO EBS EJD E~A E~B FRP GTTXZ H13 HZ~ H~P J.P KYCEM M4Z NA5 NX~ O9- RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEN TFL TFT TFW TTHFI TUROJ UT5 UU3 ZGOLN ~S~ 07I AAYXX ACTTO ADMLS ADXEU AEHZU AEZBV AFBWG AFION AGVKY AGWUF AGYFW AKHJE AKMBP ALRRR ALXIB BGSSV BWMZZ C0- CITATION CYRSC DAOYK DEXXA FETWF HF~ IFELN LJTGL OPCYK RIG TAJZE UB6 |
| ID | FETCH-LOGICAL-c258t-fd8fa99fd8352e23c38d8f51a8f9daf593feac53a0283b08ac74caaf63e4915c3 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000272526500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0253-3839 |
| IngestDate | Sat Nov 29 08:12:27 EST 2025 Mon Oct 20 23:47:47 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c258t-fd8fa99fd8352e23c38d8f51a8f9daf593feac53a0283b08ac74caaf63e4915c3 |
| PageCount | 15 |
| ParticipantIDs | informaworld_taylorfrancis_310_1080_02533839_2009_9671587 crossref_primary_10_1080_02533839_2009_9671587 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-11-01 |
| PublicationDateYYYYMMDD | 2009-11-01 |
| PublicationDate_xml | – month: 11 year: 2009 text: 2009-11-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Journal of the Chinese Institute of Engineers |
| PublicationYear | 2009 |
| Publisher | Taylor & Francis Group |
| Publisher_xml | – name: Taylor & Francis Group |
| References | Qayyum I. A. (CIT0011) 2000 Murthy C. S. R. (CIT0010) 2004 CIT0012 Agre J. (CIT0001) 2000 Wu J. (CIT0015) 2006 CIT0003 CIT0014 CIT0002 CIT0013 CIT0005 CIT0007 CIT0006 CIT0009 Cramer J. M. (CIT0004) 1999 CIT0008 |
| References_xml | – ident: CIT0012 doi: 10.1109/WCNC.2002.993520 – ident: CIT0014 – ident: CIT0002 doi: 10.1016/S1389-1286(01)00302-4 – ident: CIT0007 doi: 10.1145/509506.509514 – ident: CIT0003 doi: 10.1023/A:1016542229220 – start-page: 1191 volume-title: IEEE MILCOM'99 year: 1999 ident: CIT0004 – ident: CIT0005 doi: 10.1109/ICC.1998.683110 – volume-title: Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer‐to‐Peer Networks year: 2006 ident: CIT0015 – ident: CIT0006 – ident: CIT0008 doi: 10.1007/s11390-006-0997-5 – start-page: 106 year: 2000 ident: CIT0001 publication-title: IEEE Computer Magazine doi: 10.1109/2.841788 – ident: CIT0009 doi: 10.1023/A:1013715909417 – volume-title: INRIA–Rapport de recherché year: 2000 ident: CIT0011 – volume-title: Prentice Hall Communications Engineering and Emerging Technologies Series year: 2004 ident: CIT0010 – ident: CIT0013 doi: 10.1109/TBC.2005.847624 |
| SSID | ssj0026521 ssj0001654702 |
| Score | 1.7586913 |
| Snippet | In this paper, the novel ROSE Algorithm is proposed for fast and even routing in sensor networks. The algorithm uses the concepts of the differences of sets... |
| SourceID | crossref informaworld |
| SourceType | Index Database Publisher |
| StartPage | 993 |
| SubjectTerms | reply time delay Rose Algorithm transmission time delay wireless sensor network |
| Title | Rose algorithm for fast and even routing in sensor networks |
| URI | https://www.tandfonline.com/doi/abs/10.1080/02533839.2009.9671587 |
| Volume | 32 |
| WOSCitedRecordID | wos000272526500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Online Journals customDbUrl: eissn: 2158-7299 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0026521 issn: 0253-3839 databaseCode: TFW dateStart: 19780101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0R5yQOrIYljxxYTQlQMqGIo0C26uD6oBClKUn4_dh7QDrDAFCmRL9b5cZ-t774j5CyyCjFGzRw0MCy2AEzpBBlEQZwZDoGpxaof75LhUI3H-r5lE5YtrdKfobERiqj3ar-4ISs7RtyFC9P-YKUbtUktk1Aon0_uQr9fmqPB0_cti6-tG3wJSkVS1JlY3gLzJrqcnp-sLkWrJS3ThSg02PyH_m-RjRaC0qtmzmyTFZvvkPUFYcJdcukLLlJ4fZ4V0-rljboOUYSyou6f1Gs-0WI294RpOs1p6U7C7nveEMrLPfIwuBld37K2zAIzkVAVw4lC0No9HBizETdcuTciBIV6Aig0R7c7CzduDopkgQKTxAYAJbexDoXh-6SXz3J7QKiWgAgGEx5jbKQAcHAv5JlUKpsoafvkvHNn-t6oaaRhJ1LaesUXxtRp65U-0YtOT6v6GgObmiMp_7Xt4R_aHpE1h4yihqJzTHpVMbcnZNV8VNOyOK3n2CcLIs0U |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED5BQQIG3ojy9MBqaOI4scWEEFURpVOBbpHj5qASpChJ-f3YeUA6wAJTJEe-xJez75G77wDO3FggeiipMQ009WKlqJABUuV2vEgz1dEFWPVjPxgMxGgkm7UwNq3S-tBYAkUUZ7Xd3DYYXafEXRg9bT0rWcJNSj9wuAgWYYlLxq2UD7tP33EW21238wUp5fq8qMWyJKilUVf1_ER2Tl_NoZk29FB34z9WsAnrlRVKrkqx2YKFONmGtQY24Q5c2p6LRL0-T9NJ_vJGzBsRVFlOzEOJhX0i6XRmc6bJJCGZcYbN_aTMKc924aF7M7zu0arTAtUuFznFsUAlpbkYeyx2mWbCjHBHCZRjhYavaA5obj6dsUaijlA68LRS6LPYkw7XbA9ayTSJ94FIXyEqjQHz0NM-V8pYfA6LfCGisfDjNpzX_AzfS0CN0KlxSiuu2N6YMqy40gbZ5HqYF5EMLNuOhOzXuQd_mHsKK73hfT_s3w7uDmG1-ItU1CAeQStPZ_ExLOuPfJKlJ4XAfQIhfNFC |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIAQDb0R5emA1JLGd2GJCQAWiqjoU6BY5Tg4qQVolKb8fOw9oB1hgipTIl_ji2N85332H0JmXCAAGkhhooAlLlCJCBkCU57BIU-XoUqz6qRv0emI4lP2aTZjXtEobQ0MlFFHO1fbjnsTQMOIuzDJtAytZqU1KP3C5CBbRkoHOzLK6Bp3n720WW1zX-VKU8nxepmJZE8TaaJJ6fjI7t1zNiZnOLEOdjX_owCZarzEovqoGzRZaSNJttDajTLiDLm3FRazeXsbZqHh9x-aBMKi8wOae2Io-4Ww8tYxpPEpxbkJhcz2tGOX5Lnrs3A6u70hdZ4Foj4uCQCxASWkOBo0lHtVUmDPcVQJkrIBLCmZ65ubFGSwSOULpgGmlwKcJky7XdA-10nGa7CMsfQWgNASUAdM-V8rgPZdGvhBRLPykjc4bd4aTSk4jdBuV0tortjKmDGuvtJGcdXpYlPsYUBUdCemvbQ_-0PYUrfRvOmH3vvdwiFbLX0hlAuIRahXZNDlGy_qjGOXZSTncPgHMjc_0 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Rose+algorithm+for+fast+and+even+routing+in+sensor+networks&rft.jtitle=Journal+of+the+Chinese+Institute+of+Engineers&rft.au=Hou%2C+Ting%E2%80%90Wei&rft.au=Su%2C+Bey%E2%80%90Ling&rft.au=Huang%2C+Yueh%E2%80%90Min&rft.date=2009-11-01&rft.issn=0253-3839&rft.eissn=2158-7299&rft.volume=32&rft.issue=7&rft.spage=993&rft.epage=1007&rft_id=info:doi/10.1080%2F02533839.2009.9671587&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_02533839_2009_9671587 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0253-3839&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0253-3839&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0253-3839&client=summon |