{"title":"基于动态集群的目标跟踪传感器网络的移动传感器部署","authors":"Xiaoning Shan, Jindong Tan","doi":"10.1109/IROS.2005.1545069","DOIUrl":null,"url":null,"abstract":"This paper presents a mobile sensor deployment algorithm within a hybrid sensor network, which consists of some mobile sensors and a relatively large number of static sensors. For a target tracking task, a cluster is constructed and updated dynamically for tracking upon detection of an event. A cluster construction algorithm in a sparsely deployed sensor network is addressed. Mobile sensors are used to fill the coverage holes inside the cluster. A scalable mobile sensor deployment algorithm based on static sensor cluster is presented and analyzed. Minimum spanning circle (MSC) of a polygon acts as the metric for dynamic clustering. Simulations have been used to verify the proposed algorithms.","PeriodicalId":189219,"journal":{"name":"2005 IEEE/RSJ International Conference on Intelligent Robots and Systems","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Mobile sensor deployment for a dynamic cluster-based target tracking sensor network\",\"authors\":\"Xiaoning Shan, Jindong Tan\",\"doi\":\"10.1109/IROS.2005.1545069\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a mobile sensor deployment algorithm within a hybrid sensor network, which consists of some mobile sensors and a relatively large number of static sensors. For a target tracking task, a cluster is constructed and updated dynamically for tracking upon detection of an event. A cluster construction algorithm in a sparsely deployed sensor network is addressed. Mobile sensors are used to fill the coverage holes inside the cluster. A scalable mobile sensor deployment algorithm based on static sensor cluster is presented and analyzed. Minimum spanning circle (MSC) of a polygon acts as the metric for dynamic clustering. Simulations have been used to verify the proposed algorithms.\",\"PeriodicalId\":189219,\"journal\":{\"name\":\"2005 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"volume\":\"133 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.2005.1545069\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE/RSJ International Conference on Intelligent Robots and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.2005.1545069","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Mobile sensor deployment for a dynamic cluster-based target tracking sensor network
This paper presents a mobile sensor deployment algorithm within a hybrid sensor network, which consists of some mobile sensors and a relatively large number of static sensors. For a target tracking task, a cluster is constructed and updated dynamically for tracking upon detection of an event. A cluster construction algorithm in a sparsely deployed sensor network is addressed. Mobile sensors are used to fill the coverage holes inside the cluster. A scalable mobile sensor deployment algorithm based on static sensor cluster is presented and analyzed. Minimum spanning circle (MSC) of a polygon acts as the metric for dynamic clustering. Simulations have been used to verify the proposed algorithms.