Priority-Based Greedy Scheduling for Confident Information Coverage in Energy Harvesting Wireless Sensor Networks
An important issue in Wireless Sensor Networks (WSNs) is to maximize the network lifetime while guaranteeing the desired coverage requirement. Recent studies have demonstrated that using rechargeable sensor nodes with energy harvesting capability has a great potential to extend the network lifetime....
Uložené v:
| Vydané v: | Proceeding of 11th International Conference on Mobile Ad-hoc and Sensor Networks 16-18 December 2015, Shenzhen, China s. 18 - 22 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.12.2015
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | An important issue in Wireless Sensor Networks (WSNs) is to maximize the network lifetime while guaranteeing the desired coverage requirement. Recent studies have demonstrated that using rechargeable sensor nodes with energy harvesting capability has a great potential to extend the network lifetime. However, due to the high cost of rechargeable nodes, equipping every node with an energy harvesting unit is not practical in a large scale WSN. In this paper, we study the problem of maximizing the network lifetime of a hybrid WSN consisting of both common nodes and rechargeable nodes. Furthermore, we consider a new confident information coverage model which is more efficient for environment monitoring applications. We propose a novel priority-based greedy scheduling (PGS) algorithm to schedule the sensor nodes into a series of set covers that are activated sequentially, each satisfying the required coverage. Also, it can effectively exploit the advantages of using collaboration among sensors for the coverage requirement. Our simulations validate that the PGS algorithm can provide substantial performance improvement as compared to other peer algorithms. |
|---|---|
| AbstractList | An important issue in Wireless Sensor Networks (WSNs) is to maximize the network lifetime while guaranteeing the desired coverage requirement. Recent studies have demonstrated that using rechargeable sensor nodes with energy harvesting capability has a great potential to extend the network lifetime. However, due to the high cost of rechargeable nodes, equipping every node with an energy harvesting unit is not practical in a large scale WSN. In this paper, we study the problem of maximizing the network lifetime of a hybrid WSN consisting of both common nodes and rechargeable nodes. Furthermore, we consider a new confident information coverage model which is more efficient for environment monitoring applications. We propose a novel priority-based greedy scheduling (PGS) algorithm to schedule the sensor nodes into a series of set covers that are activated sequentially, each satisfying the required coverage. Also, it can effectively exploit the advantages of using collaboration among sensors for the coverage requirement. Our simulations validate that the PGS algorithm can provide substantial performance improvement as compared to other peer algorithms. |
| Author | Bang Wang Zehui Xiong Zhongsi Wang |
| Author_xml | – sequence: 1 surname: Zehui Xiong fullname: Zehui Xiong email: xiongzehui@hust.edu.cn organization: Sch. of Electron. Inf. & Commun., Huazhong Univ. of Sci. & Technol., Wuhan, China – sequence: 2 surname: Bang Wang fullname: Bang Wang email: wangbang@hust.edu.cn organization: Sch. of Electron. Inf. & Commun., Huazhong Univ. of Sci. & Technol., Wuhan, China – sequence: 3 surname: Zhongsi Wang fullname: Zhongsi Wang email: wangzhongsi@163.com organization: Bengbu Naval Petty Officer Acad., Bengbu, China |
| BookMark | eNotjMFKAzEURSMoqLUrl27yA6MvmWYyb6mltoVahSouS0xearTNaDJW5u8d0c293AP3nLLD2ERi7FzApRCAV3er5aUEofo4YEPUtVCAAKVEfcyGOb8BgMBK16o-YZ8PKTQptF1xYzI5Pk1EruMr-0ruaxvihvsm8XETfXAUWz6P_d6ZNjSxp3tKZkM8RD6JlDYdn5m0p9z-_p5Doi3lzFcUc-9YUvvdpPd8xo682WYa_veAPd1OHsezYnE_nY-vF0WQULcFEirS6IVArLEypRRGwYik8hrJqopKcC-lJm-cdxodmsoYW1ltayuFLQfs4s8biGj9kcLOpG6tRxJQQvkDjCdb9A |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/MSN.2015.20 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781509003297 1509003290 |
| EndPage | 22 |
| ExternalDocumentID | 7420920 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR AAWTH ADFMO ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK IEGSK IERZE OCL RIB RIC RIE RIL |
| ID | FETCH-LOGICAL-i208t-9e95e79f1199896a321a504e25f79ec56e30db37efadfd79d9a6aac6c7c8c21c3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000380566000003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 01:58:23 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i208t-9e95e79f1199896a321a504e25f79ec56e30db37efadfd79d9a6aac6c7c8c21c3 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_7420920 |
| PublicationCentury | 2000 |
| PublicationDate | 20151201 |
| PublicationDateYYYYMMDD | 2015-12-01 |
| PublicationDate_xml | – month: 12 year: 2015 text: 20151201 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Proceeding of 11th International Conference on Mobile Ad-hoc and Sensor Networks 16-18 December 2015, Shenzhen, China |
| PublicationTitleAbbrev | MSN |
| PublicationYear | 2015 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0001967858 |
| Score | 1.6187586 |
| Snippet | An important issue in Wireless Sensor Networks (WSNs) is to maximize the network lifetime while guaranteeing the desired coverage requirement. Recent studies... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 18 |
| SubjectTerms | Collaboration Confident information coverage Correlation Energy harvesting Monitoring Peer-to-peer computing rechargeable sensor networks Schedules scheduling problem Wireless sensor networks |
| Title | Priority-Based Greedy Scheduling for Confident Information Coverage in Energy Harvesting Wireless Sensor Networks |
| URI | https://ieeexplore.ieee.org/document/7420920 |
| WOSCitedRecordID | wos000380566000003&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA21eNCLH634TQ4eTbu72SSbq2Lx4lKoQm9lk0ykIFttt4L_3szu0vbgxdsS2AQyYSYzeW8eIXfaA0-ViBn33LI0xACWhVs1c8Zayx0oaUwtNqHyPJtO9bhD7jdcGACowWcwwM_6Ld8t7BpLZcOQxkU6CQn6nlKy4Wpt6yk6uF2RtRS8ONLDl0mO0C0xQC3vHemUOnKMjv635jHpbyl4dLwJLiekA-UpOdzpHtgjX-PlfIHac-whhCJHEULjfugkmMEhvvydhgspxflQOLSiLfMILRFGwxEOroTOS_pU0_8oqgRhy43wH0JiP4ILpJOQ5IY58gYrvuqTt9HT6-MzaxUU2DyJsopp0AKU9jEy6bQseBIXIkohEV5psEICj5zhCnzhvFPa6UIWhZVW2cwmseVnpFsuSjgntJAZz6TDAolPU62MUt4YYY3z3AttL0gPN2_22TTJmLX7dvn38BU5QNM0uJBr0q2Wa7gh-_a7mq-Wt7VlfwGVy6je |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEF5KFdSLj1Z8uwePbptks9nsVWmp2IZCK_RWsi8JSKptKvjv3UlC24MXb2EhE9hZZnYm3zcfQg_CGhpy5hNqqSKhywEkdrdqoqVSimrDIylLsQmeJPFsJsYN9LjhwhhjSvCZ6cBj-S9fL9QaWmVdV8Z5InAF-h5zVr2KrbXtqAgXeFlck_B8T3RHkwTAW6wDat474ill7ugf_--rJ6i9JeHh8Sa9nKKGyc_Q0c78wBb6Gi-zBajPkSeXjDQGEI3-wRPnCA0I83fsrqQY7IF0aIFr7hH4wq26Q-yCCc5y3CsJgBh0gmDohnsPQLEfLgjiiStznY2kQouv2uit35s-D0itoUCywIsLIoxghgvrA5dORCkN_JR5oQmY5cIoFhnqaUm5sam2mgst0ihNVaS4ilXgK3qOmvkiNxcIp1FM40hDi8SGoeCScyslU1JbaplQl6gFmzf_rMZkzOt9u_p7-R4dDKaj4Xz4krxeo0NwU4USuUHNYrk2t2hffRfZanlXevkXh6asJQ |
| 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%3Abook&rft.genre=proceeding&rft.title=Proceeding+of+11th+International+Conference+on+Mobile+Ad-hoc+and+Sensor+Networks+16-18+December+2015%2C+Shenzhen%2C+China&rft.atitle=Priority-Based+Greedy+Scheduling+for+Confident+Information+Coverage+in+Energy+Harvesting+Wireless+Sensor+Networks&rft.au=Zehui+Xiong&rft.au=Bang+Wang&rft.au=Zhongsi+Wang&rft.date=2015-12-01&rft.pub=IEEE&rft.spage=18&rft.epage=22&rft_id=info:doi/10.1109%2FMSN.2015.20&rft.externalDocID=7420920 |