Event monitoring is an important application of sensor networks. Multiple parties, with different surveillance targets, can share the same network, with limited sensing resources, to monitor their events of interest simultaneously. Such a system achieves profit by allocating sensing resources to missions to collect event related information (e.g., Videos, photos, electromagnetic signals). We address the problem of dynamically assigning resources to missions so as to achieve maximum profit with uncertainty in event occurrence. We consider time-varying resource demands and profits, and multiple concurrent surveillance missions. We model each mission as a sequence of monitoring attempts, each being allocated with a certain amount of resources, on a specific set of events that occurs as a Markov process. We propose a Self-Adaptive Resource Allocation algorithm (SARA) to adaptively and efficiently allocate resources according to the results of previous observations. By means of simulations we compare SARA to previous solutions and show SARA's potential in finding higher profit in both static and dynamic scenarios.
{"title":"Self-Adaptive Resource Allocation for Event Monitoring with Uncertainty in Sensor Networks","authors":"Nan Hu, T. L. Porta, N. Bartolini","doi":"10.1109/MASS.2015.72","DOIUrl":"https://doi.org/10.1109/MASS.2015.72","url":null,"abstract":"Event monitoring is an important application of sensor networks. Multiple parties, with different surveillance targets, can share the same network, with limited sensing resources, to monitor their events of interest simultaneously. Such a system achieves profit by allocating sensing resources to missions to collect event related information (e.g., Videos, photos, electromagnetic signals). We address the problem of dynamically assigning resources to missions so as to achieve maximum profit with uncertainty in event occurrence. We consider time-varying resource demands and profits, and multiple concurrent surveillance missions. We model each mission as a sequence of monitoring attempts, each being allocated with a certain amount of resources, on a specific set of events that occurs as a Markov process. We propose a Self-Adaptive Resource Allocation algorithm (SARA) to adaptively and efficiently allocate resources according to the results of previous observations. By means of simulations we compare SARA to previous solutions and show SARA's potential in finding higher profit in both static and dynamic scenarios.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124081378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a Delay Tolerant Network (DTN), where nodes are constantly moving and the connection of nodes are intermittent, messages are delivered by replicating to neighbor nodes in hopes of delivering to the destination in a timely manner. This causes a DTN network to have many duplicates even long after the message has reached its destination. In this paper, we develop a new routing protocol that helps alleviate the amount of unnecessary message duplicates by introducing ferry nodes that have the capability of deleting messages that have already been delivered to the destination nodes in the network. With appropriately designed routes, ferries also help with message delivery. We then analyze the protocol through simulations and verify the performance in terms of message delivery delay, average number of copies created within a network, and message delivery ratio. The experiments show that the proposed protocol has improved performance.
{"title":"Ferry Enhanced Improved PRoPHET Routing Protocol","authors":"Ying Vang, Arturo Saavedra, Shuhui Yang","doi":"10.1109/MASS.2015.60","DOIUrl":"https://doi.org/10.1109/MASS.2015.60","url":null,"abstract":"In a Delay Tolerant Network (DTN), where nodes are constantly moving and the connection of nodes are intermittent, messages are delivered by replicating to neighbor nodes in hopes of delivering to the destination in a timely manner. This causes a DTN network to have many duplicates even long after the message has reached its destination. In this paper, we develop a new routing protocol that helps alleviate the amount of unnecessary message duplicates by introducing ferry nodes that have the capability of deleting messages that have already been delivered to the destination nodes in the network. With appropriately designed routes, ferries also help with message delivery. We then analyze the protocol through simulations and verify the performance in terms of message delivery delay, average number of copies created within a network, and message delivery ratio. The experiments show that the proposed protocol has improved performance.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115550830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ningning Cheng, Shaxun Chen, P. Pathak, P. Mohapatra
Smartphones are closely coupled with their users and smartphone sensors can perceive users' private information. The existing studies in this area focus on user activity recognition and short-term context detection. In this paper, we show that smartphone sensors are able to profile users' long-term privacy and more sensitive information. We present the techniques of discovering users' spending level by merely using smartphone sensors. We do not access users' contacts, calendar, or call log, so that the profiling is performed in a non-intrusive manner. This paper is an alert towards the public that the privacy leakage could be far worse than imagination by just carrying smartphones.
{"title":"Long-Term Privacy Profiling through Smartphone Sensors","authors":"Ningning Cheng, Shaxun Chen, P. Pathak, P. Mohapatra","doi":"10.1109/MASS.2015.36","DOIUrl":"https://doi.org/10.1109/MASS.2015.36","url":null,"abstract":"Smartphones are closely coupled with their users and smartphone sensors can perceive users' private information. The existing studies in this area focus on user activity recognition and short-term context detection. In this paper, we show that smartphone sensors are able to profile users' long-term privacy and more sensitive information. We present the techniques of discovering users' spending level by merely using smartphone sensors. We do not access users' contacts, calendar, or call log, so that the profiling is performed in a non-intrusive manner. This paper is an alert towards the public that the privacy leakage could be far worse than imagination by just carrying smartphones.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132059938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Min Chen, Xianbin Wang, Junfeng Wang, Di Wu, Yong Li
Performance of multihop cooperative sensor networks depends on relaying candidate selection, optimal relay assignment, and cooperative communication. In this paper, we first propose a novel relaying candidate selection scheme (KCN-selection) to choose k-cooperative nodes (KCN) at each hop based on geographic information, while the certain number of k is initially determined based on an on-demand end-to-end (ETE) reliability in the presence of unreliable communication links. However, the pre-assigned KCN cannot ensure an optimal performance due to wireless channel dynamics. To prolong the lifetime of wireless sensor network (WSN), we schedule some part of KCN to sleep while the on-demand ETE reliability still can be guaranteed with wireless channel variations. A probabilistic ETE reliability model is built to compute optimal duty cycle for KCN in an online manner. Furthermore, a KCN based optimal relay assignment and cooperative data delivery (KCN-delivery) scheme is presented, which can provide fully stateless, energy-efficient sensor-to-sink data delivery at a low communication overhead without the help of prior neighborhood knowledge. Simulation results show that our scheme significantly outperforms existing protocols in wireless sensor networks with highly dynamic wireless channel.
{"title":"KCN: Guaranteed Delivery via K-Cooperative-Nodes in Duty-Cycled Sensor Networks","authors":"Min Chen, Xianbin Wang, Junfeng Wang, Di Wu, Yong Li","doi":"10.1109/MASS.2015.29","DOIUrl":"https://doi.org/10.1109/MASS.2015.29","url":null,"abstract":"Performance of multihop cooperative sensor networks depends on relaying candidate selection, optimal relay assignment, and cooperative communication. In this paper, we first propose a novel relaying candidate selection scheme (KCN-selection) to choose k-cooperative nodes (KCN) at each hop based on geographic information, while the certain number of k is initially determined based on an on-demand end-to-end (ETE) reliability in the presence of unreliable communication links. However, the pre-assigned KCN cannot ensure an optimal performance due to wireless channel dynamics. To prolong the lifetime of wireless sensor network (WSN), we schedule some part of KCN to sleep while the on-demand ETE reliability still can be guaranteed with wireless channel variations. A probabilistic ETE reliability model is built to compute optimal duty cycle for KCN in an online manner. Furthermore, a KCN based optimal relay assignment and cooperative data delivery (KCN-delivery) scheme is presented, which can provide fully stateless, energy-efficient sensor-to-sink data delivery at a low communication overhead without the help of prior neighborhood knowledge. Simulation results show that our scheme significantly outperforms existing protocols in wireless sensor networks with highly dynamic wireless channel.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"203 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133457053","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Gianpiero Costantino, R. Maiti, F. Martinelli, P. Santi
We tackle the problem of locality-aware message spreading in a network composed of smart mobile devices, without resorting to any backbone communication infrastructure. The motivations for our work are two-fold. First, recent smart mobile devices are capable of capturing and storing location information (at a significant granularity) by using, e.g., GPS service and storage capacity available in the devices. Second, recent studies have shown that mobility is positively correlated with the building of new social relationships, which are relatively more likely to occur for people who have visited common places in the past [2], [4], [3]. These two factors together show the importance of building proximity based communication networks, and the need of messages spreading among a targeted set of users in a network. We assume that the participating users move in a large geographic area, and a location inside the area can be uniquely identified by any user, for example, using GPS coordinates. Each user independently builds her mobility profile, called Moby Zone, considering her own past mobility traces. The Moby Zone of a user is the set of her most visited places.
{"title":"Location-Based Routing for Opportunistic Networks","authors":"Gianpiero Costantino, R. Maiti, F. Martinelli, P. Santi","doi":"10.1109/MASS.2015.37","DOIUrl":"https://doi.org/10.1109/MASS.2015.37","url":null,"abstract":"We tackle the problem of locality-aware message spreading in a network composed of smart mobile devices, without resorting to any backbone communication infrastructure. The motivations for our work are two-fold. First, recent smart mobile devices are capable of capturing and storing location information (at a significant granularity) by using, e.g., GPS service and storage capacity available in the devices. Second, recent studies have shown that mobility is positively correlated with the building of new social relationships, which are relatively more likely to occur for people who have visited common places in the past [2], [4], [3]. These two factors together show the importance of building proximity based communication networks, and the need of messages spreading among a targeted set of users in a network. We assume that the participating users move in a large geographic area, and a location inside the area can be uniquely identified by any user, for example, using GPS coordinates. Each user independently builds her mobility profile, called Moby Zone, considering her own past mobility traces. The Moby Zone of a user is the set of her most visited places.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134580058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mobile sinks have been used recently, mainly to minimize energy consumption and to resolve some other issues including data collection from disconnected networks, energy depletion from sensor nodes which are close to the sink, etc. In this paper, we address the problem of finding an optimal path for the mobile sink to traverse through the sensing field, to collect a single packet from each sensor and return back to its initial point (starting point) such that the total energy use is minimized and subject to the length constraint L. We refer to this as the minimum energy cost mobile sink restricted tour problem (MMRTP), and show that this problem is NP-hard. Second, we propose two algorithms. The first algorithm is a heuristic one based on the maximum ratio criteria, while the second algorithm is based on the dynamic programming technique. We consider two scenarios for each algorithm. In the first scenario, there is no restriction on the transmission range of the nodes, whereas in the second scenario, the maximum transmission range is Rmax. Finally, we evaluate the performance of our proposed algorithms based on the MATLAB simulations for two different network sizes and show their effectiveness in terms of energy consumption. Moreover, the simulation results show that our second proposed algorithm has significant impact on energy consumption in comparison with the algorithm of [20] for the same parameters (i.e. Lengths and transmission ranges).
{"title":"An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks","authors":"Aram Rasul, T. Erlebach","doi":"10.1109/MASS.2015.41","DOIUrl":"https://doi.org/10.1109/MASS.2015.41","url":null,"abstract":"Mobile sinks have been used recently, mainly to minimize energy consumption and to resolve some other issues including data collection from disconnected networks, energy depletion from sensor nodes which are close to the sink, etc. In this paper, we address the problem of finding an optimal path for the mobile sink to traverse through the sensing field, to collect a single packet from each sensor and return back to its initial point (starting point) such that the total energy use is minimized and subject to the length constraint L. We refer to this as the minimum energy cost mobile sink restricted tour problem (MMRTP), and show that this problem is NP-hard. Second, we propose two algorithms. The first algorithm is a heuristic one based on the maximum ratio criteria, while the second algorithm is based on the dynamic programming technique. We consider two scenarios for each algorithm. In the first scenario, there is no restriction on the transmission range of the nodes, whereas in the second scenario, the maximum transmission range is Rmax. Finally, we evaluate the performance of our proposed algorithms based on the MATLAB simulations for two different network sizes and show their effectiveness in terms of energy consumption. Moreover, the simulation results show that our second proposed algorithm has significant impact on energy consumption in comparison with the algorithm of [20] for the same parameters (i.e. Lengths and transmission ranges).","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114339162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Scott M. Pudlewski, B. Shrader, L. Herrera, N. M. Jones, A. Worthen
This paper presents a transport layer protocol for multi-path networks with blockage. Using urban SATCOM as an example, we see from data taken from a 2006 measurement campaign that these blockages are generally on the order of 1 -- 5seconds in length and the links are blocked approximately 33%of the time. To compensate for this type of impairment, we have developed a multipath IP overlay routing algorithm, a random linear coding reliability scheme, and a maximum-queue-based (MQCC) congestion control algorithm. MQCC uses average buffer occupancy as a measure of the congestion in a network (as opposed to packet loss or round trip time (RTT)) and updates the transmission rate of each source to avoid network congestion. This allows us to design a congestion control algorithm that is independent of the channel conditions and can be made resilient to channel losses. The reliability scheme uses selective negative acknowledgments (Snacks) to guarantee packet delivery to the destination. We show through simulation that we can approach the optimal benchmark in realistic loss blockage channels.
{"title":"MQCC: Maximum Queue Congestion Control for Multipath Networks with Blockage","authors":"Scott M. Pudlewski, B. Shrader, L. Herrera, N. M. Jones, A. Worthen","doi":"10.1109/MASS.2015.13","DOIUrl":"https://doi.org/10.1109/MASS.2015.13","url":null,"abstract":"This paper presents a transport layer protocol for multi-path networks with blockage. Using urban SATCOM as an example, we see from data taken from a 2006 measurement campaign that these blockages are generally on the order of 1 -- 5seconds in length and the links are blocked approximately 33%of the time. To compensate for this type of impairment, we have developed a multipath IP overlay routing algorithm, a random linear coding reliability scheme, and a maximum-queue-based (MQCC) congestion control algorithm. MQCC uses average buffer occupancy as a measure of the congestion in a network (as opposed to packet loss or round trip time (RTT)) and updates the transmission rate of each source to avoid network congestion. This allows us to design a congestion control algorithm that is independent of the channel conditions and can be made resilient to channel losses. The reliability scheme uses selective negative acknowledgments (Snacks) to guarantee packet delivery to the destination. We show through simulation that we can approach the optimal benchmark in realistic loss blockage channels.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114342986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Satyajit Bhowmick, Suryadip Chakraborty, D. Agrawal
In previous decades, there has been a significant paradigm shift in the domain of computer architecture and processing mechanisms of large-scale data due to the increase of computational power caused by an overwhelming flow of massive amount of data. Hadoop and MapReduce are very powerful concepts which enable the efficient development of scalable and parallel applications required for processing vast amounts of data. In this paper, we investigate the concept of Hadoop and MapReduce and eventually use the programming tool of MapReduce and Apache Pig to solve existing computation problems of very complex and complicated Google Ngrams datasets.
{"title":"Study of Hadoop-MapReduce on Google N-Gram Datasets","authors":"Satyajit Bhowmick, Suryadip Chakraborty, D. Agrawal","doi":"10.1109/MASS.2015.105","DOIUrl":"https://doi.org/10.1109/MASS.2015.105","url":null,"abstract":"In previous decades, there has been a significant paradigm shift in the domain of computer architecture and processing mechanisms of large-scale data due to the increase of computational power caused by an overwhelming flow of massive amount of data. Hadoop and MapReduce are very powerful concepts which enable the efficient development of scalable and parallel applications required for processing vast amounts of data. In this paper, we investigate the concept of Hadoop and MapReduce and eventually use the programming tool of MapReduce and Apache Pig to solve existing computation problems of very complex and complicated Google Ngrams datasets.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114548632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Database-driven cognitive radio has been well recognized as an efficient way to reduce interference between Primary Users (PUs) and Secondary Users (SUs). In database-driven cognitive radio, PUs and SUs must provide their locations to enable dynamic channel allocation, which raises location privacy breach concern. Previous studies only focus on unilateral privacy preservation, i.e., Only PUs' or SUs' privacy is preserved. In this paper, we propose to protect bilateral location privacy of a PU and an SU. The main challenge lies in how to coordinate the PU and SU to maximize their utility provided that their location privacy is protected. We first introduce a quantitative method to calculate both PU's and SU's location privacy, and then design a novel privacy preserving Utility Maximization protocol (UMax). UMax allows for both PU and SU to adjust their privacy preserving levels and optimize transmit power iteratively to achieve the maximum utility. Through extensive evaluations, we demonstrate that our proposed mechanism can efficiently increase the utility of both PU and SU while preserving their location privacy.
{"title":"Achieving Bilateral Utility Maximization and Location Privacy Preservation in Database-Driven Cognitive Radio Networks","authors":"Zhikun Zhang, Heng Zhang, Shibo He, Peng Cheng","doi":"10.1109/MASS.2015.93","DOIUrl":"https://doi.org/10.1109/MASS.2015.93","url":null,"abstract":"Database-driven cognitive radio has been well recognized as an efficient way to reduce interference between Primary Users (PUs) and Secondary Users (SUs). In database-driven cognitive radio, PUs and SUs must provide their locations to enable dynamic channel allocation, which raises location privacy breach concern. Previous studies only focus on unilateral privacy preservation, i.e., Only PUs' or SUs' privacy is preserved. In this paper, we propose to protect bilateral location privacy of a PU and an SU. The main challenge lies in how to coordinate the PU and SU to maximize their utility provided that their location privacy is protected. We first introduce a quantitative method to calculate both PU's and SU's location privacy, and then design a novel privacy preserving Utility Maximization protocol (UMax). UMax allows for both PU and SU to adjust their privacy preserving levels and optimize transmit power iteratively to achieve the maximum utility. Through extensive evaluations, we demonstrate that our proposed mechanism can efficiently increase the utility of both PU and SU while preserving their location privacy.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125976984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
De-gan Zhang, Wen-bin Li, Zhen Ma, Si Liu, J. Song
Wireless location is one of the core technologies of Wireless Sensor Network. In many applications, the accuracy of the location is the precondition of the useful of data information the node collected. Under the premise of cost limits, improving the accuracy of wireless sensor node position has crucial significance. After analyzing reasons of the location weakness of Dv-Distance algorithm due to errors caused by different paths, we propose an estimation algorithm that is based on the distance of different paths between node and the anchor node, thereby balancing the error of different paths to locate the node. This is an improved algorithm which is based on circle focal point positioning.
{"title":"New Dv-Distance Algorithm Based on Path for Wireless Sensor Network","authors":"De-gan Zhang, Wen-bin Li, Zhen Ma, Si Liu, J. Song","doi":"10.1109/MASS.2015.97","DOIUrl":"https://doi.org/10.1109/MASS.2015.97","url":null,"abstract":"Wireless location is one of the core technologies of Wireless Sensor Network. In many applications, the accuracy of the location is the precondition of the useful of data information the node collected. Under the premise of cost limits, improving the accuracy of wireless sensor node position has crucial significance. After analyzing reasons of the location weakness of Dv-Distance algorithm due to errors caused by different paths, we propose an estimation algorithm that is based on the distance of different paths between node and the anchor node, thereby balancing the error of different paths to locate the node. This is an improved algorithm which is based on circle focal point positioning.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121711404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：