{"title":"无线传感器网络辅助,具有信息论效用的自主映射","authors":"Steffen Beyme, C. Leung","doi":"10.1109/WIVEC.2014.6953270","DOIUrl":null,"url":null,"abstract":"A mobile, autonomous platform is assisted by a wireless sensor network in its task of inferring a map of the spatial distribution of a physical quantity that is measured by the sensor nodes. Sensor nodes initiate a broadcast in the network, when the measured quantity assumes a value in the range of interest. Specifically, we consider randomly deployed networks of location-agnostic wireless sensor nodes, which broadcast messages by flooding. The node-to-node delays are assumed to be random. In networks of this type, the hop count of a broadcast message, given the distance from the source node, can be approximated by a simple parametric distribution. The mobile platform can interrogate a nearby sensor node to obtain, with a given success probability, the hop counts of the broadcast messages originating from different source nodes. By fusing successive hop count observations, the mobile platform infers the locations of the source nodes and thereby, the spatial distribution of the quantity of interest. The path taken by the mobile platform should minimize the resulting mapping error as quickly as possible. We propose an information-driven path planning approach, in which the mobile platform acts by maximizing a weighted sum of myopic, mutual information gains. We show by simulation, that suitable control of the weights is effective at reducing the error between the true and the inferred map, by preventing the information gain to be dominated by only a few source nodes.","PeriodicalId":410528,"journal":{"name":"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Wireless sensor network-assisted, autonomous mapping with information-theoretic utility\",\"authors\":\"Steffen Beyme, C. Leung\",\"doi\":\"10.1109/WIVEC.2014.6953270\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A mobile, autonomous platform is assisted by a wireless sensor network in its task of inferring a map of the spatial distribution of a physical quantity that is measured by the sensor nodes. Sensor nodes initiate a broadcast in the network, when the measured quantity assumes a value in the range of interest. Specifically, we consider randomly deployed networks of location-agnostic wireless sensor nodes, which broadcast messages by flooding. The node-to-node delays are assumed to be random. In networks of this type, the hop count of a broadcast message, given the distance from the source node, can be approximated by a simple parametric distribution. The mobile platform can interrogate a nearby sensor node to obtain, with a given success probability, the hop counts of the broadcast messages originating from different source nodes. By fusing successive hop count observations, the mobile platform infers the locations of the source nodes and thereby, the spatial distribution of the quantity of interest. The path taken by the mobile platform should minimize the resulting mapping error as quickly as possible. We propose an information-driven path planning approach, in which the mobile platform acts by maximizing a weighted sum of myopic, mutual information gains. We show by simulation, that suitable control of the weights is effective at reducing the error between the true and the inferred map, by preventing the information gain to be dominated by only a few source nodes.\",\"PeriodicalId\":410528,\"journal\":{\"name\":\"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIVEC.2014.6953270\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 6th International Symposium on Wireless Vehicular Communications (WiVeC 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIVEC.2014.6953270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Wireless sensor network-assisted, autonomous mapping with information-theoretic utility
A mobile, autonomous platform is assisted by a wireless sensor network in its task of inferring a map of the spatial distribution of a physical quantity that is measured by the sensor nodes. Sensor nodes initiate a broadcast in the network, when the measured quantity assumes a value in the range of interest. Specifically, we consider randomly deployed networks of location-agnostic wireless sensor nodes, which broadcast messages by flooding. The node-to-node delays are assumed to be random. In networks of this type, the hop count of a broadcast message, given the distance from the source node, can be approximated by a simple parametric distribution. The mobile platform can interrogate a nearby sensor node to obtain, with a given success probability, the hop counts of the broadcast messages originating from different source nodes. By fusing successive hop count observations, the mobile platform infers the locations of the source nodes and thereby, the spatial distribution of the quantity of interest. The path taken by the mobile platform should minimize the resulting mapping error as quickly as possible. We propose an information-driven path planning approach, in which the mobile platform acts by maximizing a weighted sum of myopic, mutual information gains. We show by simulation, that suitable control of the weights is effective at reducing the error between the true and the inferred map, by preventing the information gain to be dominated by only a few source nodes.