Loading…

Unknown hostile environment-oriented autonomous WSN deployment using a mobile robot

In this study, we consider the Internet of Things (IoT) with an autonomous deployment framework and seek optimal localizable k-coverage (OLKC) strategies to preserve the connectivity and robustness in IoT networks to assist robots during disaster recovery activities. Therefore, we define localizable...

Full description

Saved in:
Bibliographic Details
Published in:Journal of network and computer applications 2021-05, Vol.182, p.103053, Article 103053
Main Authors: Feng, Sheng, Shi, Haiyan, Huang, Longjun, Shen, Shigen, Yu, Shui, Peng, Hua, Wu, Chengdong
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c300t-32fbfb05e4b5cee09dbb544558dd1c9b595033db62f4db636f202224adf44cca3
cites cdi_FETCH-LOGICAL-c300t-32fbfb05e4b5cee09dbb544558dd1c9b595033db62f4db636f202224adf44cca3
container_end_page
container_issue
container_start_page 103053
container_title Journal of network and computer applications
container_volume 182
creator Feng, Sheng
Shi, Haiyan
Huang, Longjun
Shen, Shigen
Yu, Shui
Peng, Hua
Wu, Chengdong
description In this study, we consider the Internet of Things (IoT) with an autonomous deployment framework and seek optimal localizable k-coverage (OLKC) strategies to preserve the connectivity and robustness in IoT networks to assist robots during disaster recovery activities. Therefore, we define localizable k-coverage as the covered region within which a mobile robot can localize itself aided by k neighboring beacon nodes (BNs) in a wireless sensor network (WSN). To this end, we first propose the optimal localizable k-coverage WSN deployment problem (OLKWDP) and present a novel framework that preserves WSN connectivity and robustness for mobile robots. To localize a mobile robot with at least k BNs and overcome the network hole problem that can occur in unknown hostile environments, we propose a hole recovery method for the OLKC achieved by a mobile robot that knows the concurrent mapping, deployment and localization of the WSN. We then present a mapping-to-image transformation method to reveal the interactions between the WSN deployment and the network holes for the OLKC while constructing the online mapping. To solve the OLKWDP, we also develop two optimality conditions to achieve maximum coverage by the proposed OLKC in the unknown hostile environment using the minimum number of sensors. Moreover, we analyze the factors that influence the probability of success of the OLKC and the factors that influence the performance of a mobile robot when determining the WSN deployment. The simulation results illustrate that our framework outperforms the trilateration and spanning tree (TST) method in unknown hostile environment exploration and can achieve the OLKC in a WSN. In 27 simulated situations, our framework achieved average rates of nearly 100% 1-coverage, 91.34% 2-coverage and 89.00% 3-coverage.
doi_str_mv 10.1016/j.jnca.2021.103053
format article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_jnca_2021_103053</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1084804521000783</els_id><sourcerecordid>S1084804521000783</sourcerecordid><originalsourceid>FETCH-LOGICAL-c300t-32fbfb05e4b5cee09dbb544558dd1c9b595033db62f4db636f202224adf44cca3</originalsourceid><addsrcrecordid>eNp9kNtKAzEQhoMoWA8v4FVeYOvktOyCN1I8QdGLWrwMm5Nm7SYl2Vb69map197MPwzzD_N_CN0QmBMg9W0_74Pu5hQoKQMGgp2gGYFWVI1o6enUN7xqgItzdJFzDwA1b9kMrdbhO8SfgL9iHv3GYhv2PsUw2DBWMfki1uBuN8YQh7jL-GP1io3dbuJhWsG77MMn7vAQ1eROUcXxCp25bpPt9Z9eovXjw_viuVq-Pb0s7peVZgBjxahTToGwXAltLbRGKcG5EI0xRLdKtAIYM6qmjpfKalfiUco74zjXumOXiB7v6hRzTtbJbfJDlw6SgJywyF5OWOSERR6xFNPd0WTLZ3tvk8y6pNTW-GT1KE30_9l_AdoWbY8</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Unknown hostile environment-oriented autonomous WSN deployment using a mobile robot</title><source>Elsevier</source><creator>Feng, Sheng ; Shi, Haiyan ; Huang, Longjun ; Shen, Shigen ; Yu, Shui ; Peng, Hua ; Wu, Chengdong</creator><creatorcontrib>Feng, Sheng ; Shi, Haiyan ; Huang, Longjun ; Shen, Shigen ; Yu, Shui ; Peng, Hua ; Wu, Chengdong</creatorcontrib><description>In this study, we consider the Internet of Things (IoT) with an autonomous deployment framework and seek optimal localizable k-coverage (OLKC) strategies to preserve the connectivity and robustness in IoT networks to assist robots during disaster recovery activities. Therefore, we define localizable k-coverage as the covered region within which a mobile robot can localize itself aided by k neighboring beacon nodes (BNs) in a wireless sensor network (WSN). To this end, we first propose the optimal localizable k-coverage WSN deployment problem (OLKWDP) and present a novel framework that preserves WSN connectivity and robustness for mobile robots. To localize a mobile robot with at least k BNs and overcome the network hole problem that can occur in unknown hostile environments, we propose a hole recovery method for the OLKC achieved by a mobile robot that knows the concurrent mapping, deployment and localization of the WSN. We then present a mapping-to-image transformation method to reveal the interactions between the WSN deployment and the network holes for the OLKC while constructing the online mapping. To solve the OLKWDP, we also develop two optimality conditions to achieve maximum coverage by the proposed OLKC in the unknown hostile environment using the minimum number of sensors. Moreover, we analyze the factors that influence the probability of success of the OLKC and the factors that influence the performance of a mobile robot when determining the WSN deployment. The simulation results illustrate that our framework outperforms the trilateration and spanning tree (TST) method in unknown hostile environment exploration and can achieve the OLKC in a WSN. In 27 simulated situations, our framework achieved average rates of nearly 100% 1-coverage, 91.34% 2-coverage and 89.00% 3-coverage.</description><identifier>ISSN: 1084-8045</identifier><identifier>EISSN: 1095-8592</identifier><identifier>DOI: 10.1016/j.jnca.2021.103053</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Autonomous deployment ; Optimal localizable k-coverage network ; Path planning ; Unknown hostile environment ; Wireless sensor networks</subject><ispartof>Journal of network and computer applications, 2021-05, Vol.182, p.103053, Article 103053</ispartof><rights>2021 Elsevier Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c300t-32fbfb05e4b5cee09dbb544558dd1c9b595033db62f4db636f202224adf44cca3</citedby><cites>FETCH-LOGICAL-c300t-32fbfb05e4b5cee09dbb544558dd1c9b595033db62f4db636f202224adf44cca3</cites><orcidid>0000-0001-5761-3535</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Feng, Sheng</creatorcontrib><creatorcontrib>Shi, Haiyan</creatorcontrib><creatorcontrib>Huang, Longjun</creatorcontrib><creatorcontrib>Shen, Shigen</creatorcontrib><creatorcontrib>Yu, Shui</creatorcontrib><creatorcontrib>Peng, Hua</creatorcontrib><creatorcontrib>Wu, Chengdong</creatorcontrib><title>Unknown hostile environment-oriented autonomous WSN deployment using a mobile robot</title><title>Journal of network and computer applications</title><description>In this study, we consider the Internet of Things (IoT) with an autonomous deployment framework and seek optimal localizable k-coverage (OLKC) strategies to preserve the connectivity and robustness in IoT networks to assist robots during disaster recovery activities. Therefore, we define localizable k-coverage as the covered region within which a mobile robot can localize itself aided by k neighboring beacon nodes (BNs) in a wireless sensor network (WSN). To this end, we first propose the optimal localizable k-coverage WSN deployment problem (OLKWDP) and present a novel framework that preserves WSN connectivity and robustness for mobile robots. To localize a mobile robot with at least k BNs and overcome the network hole problem that can occur in unknown hostile environments, we propose a hole recovery method for the OLKC achieved by a mobile robot that knows the concurrent mapping, deployment and localization of the WSN. We then present a mapping-to-image transformation method to reveal the interactions between the WSN deployment and the network holes for the OLKC while constructing the online mapping. To solve the OLKWDP, we also develop two optimality conditions to achieve maximum coverage by the proposed OLKC in the unknown hostile environment using the minimum number of sensors. Moreover, we analyze the factors that influence the probability of success of the OLKC and the factors that influence the performance of a mobile robot when determining the WSN deployment. The simulation results illustrate that our framework outperforms the trilateration and spanning tree (TST) method in unknown hostile environment exploration and can achieve the OLKC in a WSN. In 27 simulated situations, our framework achieved average rates of nearly 100% 1-coverage, 91.34% 2-coverage and 89.00% 3-coverage.</description><subject>Autonomous deployment</subject><subject>Optimal localizable k-coverage network</subject><subject>Path planning</subject><subject>Unknown hostile environment</subject><subject>Wireless sensor networks</subject><issn>1084-8045</issn><issn>1095-8592</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kNtKAzEQhoMoWA8v4FVeYOvktOyCN1I8QdGLWrwMm5Nm7SYl2Vb69map197MPwzzD_N_CN0QmBMg9W0_74Pu5hQoKQMGgp2gGYFWVI1o6enUN7xqgItzdJFzDwA1b9kMrdbhO8SfgL9iHv3GYhv2PsUw2DBWMfki1uBuN8YQh7jL-GP1io3dbuJhWsG77MMn7vAQ1eROUcXxCp25bpPt9Z9eovXjw_viuVq-Pb0s7peVZgBjxahTToGwXAltLbRGKcG5EI0xRLdKtAIYM6qmjpfKalfiUco74zjXumOXiB7v6hRzTtbJbfJDlw6SgJywyF5OWOSERR6xFNPd0WTLZ3tvk8y6pNTW-GT1KE30_9l_AdoWbY8</recordid><startdate>20210515</startdate><enddate>20210515</enddate><creator>Feng, Sheng</creator><creator>Shi, Haiyan</creator><creator>Huang, Longjun</creator><creator>Shen, Shigen</creator><creator>Yu, Shui</creator><creator>Peng, Hua</creator><creator>Wu, Chengdong</creator><general>Elsevier Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-5761-3535</orcidid></search><sort><creationdate>20210515</creationdate><title>Unknown hostile environment-oriented autonomous WSN deployment using a mobile robot</title><author>Feng, Sheng ; Shi, Haiyan ; Huang, Longjun ; Shen, Shigen ; Yu, Shui ; Peng, Hua ; Wu, Chengdong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c300t-32fbfb05e4b5cee09dbb544558dd1c9b595033db62f4db636f202224adf44cca3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Autonomous deployment</topic><topic>Optimal localizable k-coverage network</topic><topic>Path planning</topic><topic>Unknown hostile environment</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Feng, Sheng</creatorcontrib><creatorcontrib>Shi, Haiyan</creatorcontrib><creatorcontrib>Huang, Longjun</creatorcontrib><creatorcontrib>Shen, Shigen</creatorcontrib><creatorcontrib>Yu, Shui</creatorcontrib><creatorcontrib>Peng, Hua</creatorcontrib><creatorcontrib>Wu, Chengdong</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of network and computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Feng, Sheng</au><au>Shi, Haiyan</au><au>Huang, Longjun</au><au>Shen, Shigen</au><au>Yu, Shui</au><au>Peng, Hua</au><au>Wu, Chengdong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Unknown hostile environment-oriented autonomous WSN deployment using a mobile robot</atitle><jtitle>Journal of network and computer applications</jtitle><date>2021-05-15</date><risdate>2021</risdate><volume>182</volume><spage>103053</spage><pages>103053-</pages><artnum>103053</artnum><issn>1084-8045</issn><eissn>1095-8592</eissn><abstract>In this study, we consider the Internet of Things (IoT) with an autonomous deployment framework and seek optimal localizable k-coverage (OLKC) strategies to preserve the connectivity and robustness in IoT networks to assist robots during disaster recovery activities. Therefore, we define localizable k-coverage as the covered region within which a mobile robot can localize itself aided by k neighboring beacon nodes (BNs) in a wireless sensor network (WSN). To this end, we first propose the optimal localizable k-coverage WSN deployment problem (OLKWDP) and present a novel framework that preserves WSN connectivity and robustness for mobile robots. To localize a mobile robot with at least k BNs and overcome the network hole problem that can occur in unknown hostile environments, we propose a hole recovery method for the OLKC achieved by a mobile robot that knows the concurrent mapping, deployment and localization of the WSN. We then present a mapping-to-image transformation method to reveal the interactions between the WSN deployment and the network holes for the OLKC while constructing the online mapping. To solve the OLKWDP, we also develop two optimality conditions to achieve maximum coverage by the proposed OLKC in the unknown hostile environment using the minimum number of sensors. Moreover, we analyze the factors that influence the probability of success of the OLKC and the factors that influence the performance of a mobile robot when determining the WSN deployment. The simulation results illustrate that our framework outperforms the trilateration and spanning tree (TST) method in unknown hostile environment exploration and can achieve the OLKC in a WSN. In 27 simulated situations, our framework achieved average rates of nearly 100% 1-coverage, 91.34% 2-coverage and 89.00% 3-coverage.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.jnca.2021.103053</doi><orcidid>https://orcid.org/0000-0001-5761-3535</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 1084-8045
ispartof Journal of network and computer applications, 2021-05, Vol.182, p.103053, Article 103053
issn 1084-8045
1095-8592
language eng
recordid cdi_crossref_primary_10_1016_j_jnca_2021_103053
source Elsevier
subjects Autonomous deployment
Optimal localizable k-coverage network
Path planning
Unknown hostile environment
Wireless sensor networks
title Unknown hostile environment-oriented autonomous WSN deployment using a mobile robot
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T00%3A50%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Unknown%20hostile%20environment-oriented%20autonomous%20WSN%20deployment%20using%20a%20mobile%20robot&rft.jtitle=Journal%20of%20network%20and%20computer%20applications&rft.au=Feng,%20Sheng&rft.date=2021-05-15&rft.volume=182&rft.spage=103053&rft.pages=103053-&rft.artnum=103053&rft.issn=1084-8045&rft.eissn=1095-8592&rft_id=info:doi/10.1016/j.jnca.2021.103053&rft_dat=%3Celsevier_cross%3ES1084804521000783%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c300t-32fbfb05e4b5cee09dbb544558dd1c9b595033db62f4db636f202224adf44cca3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true