Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70076-1
Dingcheng Yang, Zhenghai Wang, Hao He, Jisheng Xu
This paper describes an optimal power allocation scheme for orthogonal frequency division multiple access two-way relay networks with physical network coding. The aim is to enhance the achievable sum rate of the terminals for a constrained total transmit power. Convex optimization is used to derive a closed-form solution for the power allocation between the relay node and the two terminals. This reduces the variable dimensionality of the objective function for the power assignment problem among multiple carriers when the total transmit power is constrained. This solution is then used to derive the optimal power control scheme. This method reduces the implementation complexity compared with the traditional resource allocation scheme. Numerical and simulation results show that the approach achieves almost the optimal sum rate and outperforms the fixed power assignment method with less computational load in various scenarios.
{"title":"Optimal Power Control for OFDM Signals over Two-Way Relay with Physical Network Coding","authors":"Dingcheng Yang, Zhenghai Wang, Hao He, Jisheng Xu","doi":"10.1016/S1007-0214(11)70076-1","DOIUrl":"10.1016/S1007-0214(11)70076-1","url":null,"abstract":"<div><p><span><span>This paper describes an optimal power allocation scheme for </span>orthogonal frequency division multiple access two-way relay networks with physical network coding. The aim is to enhance the achievable sum rate of the terminals for a constrained total transmit power. Convex optimization is used to derive a closed-form solution for the power allocation between the </span>relay node and the two terminals. This reduces the variable dimensionality of the objective function for the power assignment problem among multiple carriers when the total transmit power is constrained. This solution is then used to derive the optimal power control scheme. This method reduces the implementation complexity compared with the traditional resource allocation scheme. Numerical and simulation results show that the approach achieves almost the optimal sum rate and outperforms the fixed power assignment method with less computational load in various scenarios.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70076-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68028631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70081-5
Nan Jing , Weihong Bi , Qing Yue
In recent years, underwater acoustic wireless sensor networks have been used in many areas. There have been many field trials of acoustic propagation models and statistics for shallow water conditions. However, field trials are limited environmentally and, hence, not widely accepted. Simulations of the impulse response of a shallow underwater acoustic channel allows less expensive system tests that are reproducable. This paper presents a shallow water acoustic channel model based on the actual acoustic propagation characteristics with path attenuation, ambient noise, multiple paths, and Doppler effects. The second-order statistical characteristics of the simulation model are verified with the autocorrelations and crosscorrelations of the quadrature components and the complex envelopes of channel impulse responses. The channel model is implemented in Matlab with the results showing that the absorption coefficient and path losses are both dependent on the frequencies and propagation distances and that the path gain can be improved with Light of Sight (LOS) and short range acoustic propagation. Analysis of the channel impulse response and the frequency response that the zero-order Bessel function of first kind can be used to describe the correlation functions for the impulse response. The shallow underwater acoustic channel is time-varying and can not be modeled as a wide-sense stationary-uncorrelated scattering channel.
{"title":"Attack Simulation Model and Channel Statistics in Underwater Acoustic Sensor Networks","authors":"Nan Jing , Weihong Bi , Qing Yue","doi":"10.1016/S1007-0214(11)70081-5","DOIUrl":"10.1016/S1007-0214(11)70081-5","url":null,"abstract":"<div><p><span>In recent years, underwater acoustic wireless sensor networks<span><span><span> have been used in many areas. There have been many field trials of acoustic propagation models and statistics for shallow water conditions. However, field trials are limited environmentally and, hence, not widely accepted. Simulations of the impulse response of a shallow underwater acoustic channel allows less expensive system tests that are reproducable. This paper presents a shallow water acoustic channel model based on the actual acoustic propagation characteristics with path attenuation, ambient noise, multiple paths, and </span>Doppler effects. The second-order statistical characteristics of the simulation model are verified with the autocorrelations and </span>crosscorrelations of the </span></span>quadrature components<span><span> and the complex envelopes of channel impulse responses<span>. The channel model is implemented in Matlab with the results showing that the absorption coefficient and path losses are both dependent on the frequencies and propagation distances and that the path gain can be improved with Light of Sight (LOS) and short range acoustic propagation. Analysis of the channel impulse response and the frequency response that the zero-order </span></span>Bessel function of first kind can be used to describe the correlation functions for the impulse response. The shallow underwater acoustic channel is time-varying and can not be modeled as a wide-sense stationary-uncorrelated scattering channel.</span></p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70081-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68031110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70085-2
Xiaoping Wu , Shili Tan , Tao Chen , Xiaomei Yi , Dan Dai
Navigation with sensor networks has shown many advantages and great potential in many scenarios. Previous works have mainly focused on selecting the shortest path to navigate an internal user out of an emergency field. However, they did not consider variations of the dangerous areas which usually occur in practical applications. This paper presents an efficient dynamic routing algorithm to successfully guide users to the destination exit. The navigation goal is looking for a safe and short path to enable the user to escape from a dangerous area as fast as possible. Without knowing the locations of the nodes, the user is guided by a sequence of sensor nodes to pass through the dangerous areas. The algorithm ensures the navigation path security by predicting the dynamic changes affecting the navigation path. The performance of this approach is evaluated using extensive simulations to validate its effectiveness. Simulations show that the approach is scalable and performs well in various settings.
{"title":"Distributed Dynamic Navigation for Sensor Networks","authors":"Xiaoping Wu , Shili Tan , Tao Chen , Xiaomei Yi , Dan Dai","doi":"10.1016/S1007-0214(11)70085-2","DOIUrl":"10.1016/S1007-0214(11)70085-2","url":null,"abstract":"<div><p><span>Navigation with sensor networks has shown many advantages and great potential in many scenarios. Previous works have mainly focused on selecting the shortest path to navigate an internal user out of an emergency field. However, they did not consider variations of the dangerous areas which usually occur in practical applications. This paper presents an efficient dynamic routing algorithm to successfully guide users to the destination exit. The navigation goal is looking for a safe and short path to enable the user to escape from a dangerous area as fast as possible. Without knowing the locations of the nodes, the user is guided by a sequence of </span>sensor nodes to pass through the dangerous areas. The algorithm ensures the navigation path security by predicting the dynamic changes affecting the navigation path. The performance of this approach is evaluated using extensive simulations to validate its effectiveness. Simulations show that the approach is scalable and performs well in various settings.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70085-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68148118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70078-5
Lina Lan, Xuerong Gou, Jingli Mao, Wenyuan Ke
Most current Global System for Mobile Communications (GSM) frequency planning methods evaluate the interference and assign frequencies based on measurement reports. Assigning the same or adjacent frequencies to cells close to each other will introduce co-channel and adjacent channel interference which will reduce network performance. Traditionally, man power is used to check and allocate new frequencies which is time consuming and the accuracy is not satisfactory. This paper presents an intelligent analysis method for optimization of co-channel and adjacent channel interference by exploiting cell configuration information. The method defines an interference evaluation model by analyzing various factors such as the base station layer, the azimuth ward relationship, and the cell neighborhood relationships. The interference for each frequency is evaluated and the problem frequencies are optimized. This method is verified by a large number of actual datasets from an in-service GSM network. The results show this method has better intelligence, accuracy, timeliness, and visualization than traditional methods.
{"title":"GSM Co-Channel and Adjacent Channel Interference Analysis and Optimization","authors":"Lina Lan, Xuerong Gou, Jingli Mao, Wenyuan Ke","doi":"10.1016/S1007-0214(11)70078-5","DOIUrl":"10.1016/S1007-0214(11)70078-5","url":null,"abstract":"<div><p>Most current Global System for Mobile Communications (GSM) frequency planning methods evaluate the interference and assign frequencies based on measurement reports. Assigning the same or adjacent frequencies to cells close to each other will introduce co-channel and adjacent channel interference<span> which will reduce network performance. Traditionally, man power is used to check and allocate new frequencies which is time consuming and the accuracy is not satisfactory. This paper presents an intelligent analysis method for optimization of co-channel and adjacent channel interference by exploiting cell configuration information. The method defines an interference evaluation model by analyzing various factors such as the base station layer, the azimuth ward relationship, and the cell neighborhood relationships. The interference for each frequency is evaluated and the problem frequencies are optimized. This method is verified by a large number of actual datasets from an in-service GSM network. The results show this method has better intelligence, accuracy, timeliness, and visualization than traditional methods.</span></p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70078-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68028629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70080-3
Hui Zhou
The powerful processors and the variety of sensors in new and upcoming mobile Internet devices, such as iPhones and Android-based smart phones, can be leveraged to build cyber-physical applications that collect sensor data from the real world and communicate it back to the Internet for comprehensive processing. Available bandwidth measurement has been discussed previously in the computer networking community. Currently, it is important for cyber-physical applications to behave smartly since these applications prefer small data packets, short round-trip times, and sudden bursts of traffic. A new available bandwidth measurement technique for cyber-physical applications, SOProbe, was introduced and its accuracy was verified through ns-2 simulation. The experimental data indicate that this methodology can enable the gateway node to measure the available bandwidth of a path at low cost.
{"title":"Measuring Available Bandwidth for Smart Cyber-Physical Applications","authors":"Hui Zhou","doi":"10.1016/S1007-0214(11)70080-3","DOIUrl":"10.1016/S1007-0214(11)70080-3","url":null,"abstract":"<div><p>The powerful processors and the variety of sensors in new and upcoming mobile Internet devices, such as iPhones and Android-based smart phones, can be leveraged to build cyber-physical applications that collect sensor data<span> from the real world and communicate it back to the Internet for comprehensive processing. Available bandwidth measurement has been discussed previously in the computer networking community. Currently, it is important for cyber-physical applications to behave smartly since these applications prefer small data packets, short round-trip times, and sudden bursts of traffic. A new available bandwidth measurement technique for cyber-physical applications, SOProbe, was introduced and its accuracy was verified through ns-2 simulation. The experimental data indicate that this methodology can enable the gateway node to measure the available bandwidth of a path at low cost.</span></p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70080-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68031111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70079-7
Ruisheng Shi , Fuqiang Liu , Yang Zhang , Bo Cheng , Junliang Chen
A large proportion of Internet of Things (IoT) applications are internally publish/subscribe in nature, and traditional architecture cannot support them efficiently and flexibly. In essence, supporting efficient publish/subscribe systems requires data-oriented naming and efficient multicast. Since deployment of native IP-based multicast has failed, overlay-based multicast has become the practical choice. Since load balancing between heterogeneous nodes is an important issue, designing an optimal load balancing overlay network for publish/subscribe systems is a necessary endeavor. This study focuses on the optimal load balancing overlay design problem for topic-based publish/subscribe systems in a heterogeneous environment (in terms of node processing power, bandwidth, and reachability). The Minimum Idle Degree (MID) model is introduced to capture the heterogeneity of overlay nodes. Based on the MID model, new node load measures are defined that can accommodate heterogeneous server capacities and capture the node load in publish/subscribe systems more accurately than traditional measures. A new optimization problem, Maximum Minimum Idle Degree Topic-Connected Overlay (MMID-TCO), is established. This problem is NP-complete and a constant approximation algorithm does not exist for this problem (unless P = NP). Based on MID metrics, the Maximum Minimum Idle Degree Overlay Design Algorithm (MMID-ODA), which has polynomial time, is introduced. To improve performance, an approach that breaks down the problem into several small-scale problems by exploiting the potential inherent disjoint characteristic in the subscription table is presented. Simulation results show that the proposed algorithm is able to achieve better load balance than MinMax-ODA in a heterogeneous environment.
{"title":"An MID-Based Load Balancing Approach for Topic-Based Pub-Sub Overlay Construction","authors":"Ruisheng Shi , Fuqiang Liu , Yang Zhang , Bo Cheng , Junliang Chen","doi":"10.1016/S1007-0214(11)70079-7","DOIUrl":"10.1016/S1007-0214(11)70079-7","url":null,"abstract":"<div><p><span><span>A large proportion of Internet of Things (IoT) applications are internally publish/subscribe in nature, and traditional architecture cannot support them efficiently and flexibly. In essence, supporting efficient publish/subscribe systems requires data-oriented naming and efficient multicast. Since deployment of native IP-based multicast has failed, overlay-based multicast has become the practical choice. Since load balancing between heterogeneous nodes is an important issue, designing an optimal load balancing </span>overlay network<span> for publish/subscribe systems is a necessary endeavor. This study focuses on the optimal load balancing overlay design problem for topic-based publish/subscribe systems in a heterogeneous environment (in terms of node processing power, bandwidth, and reachability). The Minimum Idle Degree (MID) model is introduced to capture the heterogeneity of overlay nodes<span>. Based on the MID model, new node load measures are defined that can accommodate heterogeneous server capacities and capture the node load in publish/subscribe systems more accurately than traditional measures. A new optimization problem, Maximum Minimum Idle Degree Topic-Connected Overlay (MMID-TCO), is established. This problem is NP-complete and a constant approximation algorithm does not exist for this problem (unless P = NP). Based on MID metrics, the Maximum Minimum Idle Degree Overlay Design Algorithm (MMID-ODA), which has </span></span></span>polynomial time, is introduced. To improve performance, an approach that breaks down the problem into several small-scale problems by exploiting the potential inherent disjoint characteristic in the subscription table is presented. Simulation results show that the proposed algorithm is able to achieve better load balance than MinMax-ODA in a heterogeneous environment.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70079-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68028630","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70075-X
Md Nafees Rahman, MA Matin
One of the fundamental design challenges in designing a Wireless Sensor Network (WSN) is to maximize the network lifetime, as each sensor node of the network is equipped with a limited power battery. To overcome this challenge, different methods were developed in the last few years using such techniques as network protocols, data fusion algorithms using low power, energy efficient routing, and locating optimal sink position. This paper focuses on finding the optimal sink position. Relay nodes are introduced in conjunction with the sensor nodes to mitigate network geometric deficiencies since in most other approaches the sensor nodes close to the sink become heavily involved in data forwarding and, thus, their batteries are quickly depleted. A Particle Swarm Optimization (PSO) based algorithm is used to locate the optimal sink position with respect to those relay nodes to make the network more energy efficient. The relay nodes communicate with the sink instead of the sensor nodes. Tests show that this approach can save at least 40% of the energy and prolong the network lifetime.
{"title":"Efficient Algorithm for Prolonging Network Lifetime of Wireless Sensor Networks","authors":"Md Nafees Rahman, MA Matin","doi":"10.1016/S1007-0214(11)70075-X","DOIUrl":"10.1016/S1007-0214(11)70075-X","url":null,"abstract":"<div><p><span><span>One of the fundamental design challenges in designing a Wireless Sensor Network (WSN) is to maximize the network lifetime, as each </span>sensor node of the network is equipped with a limited power battery. To overcome this challenge, different methods were developed in the last few years using such techniques as network protocols, data fusion algorithms using low power, energy efficient routing, and locating optimal sink position. This paper focuses on finding the optimal sink position. </span>Relay nodes<span> are introduced in conjunction with the sensor nodes to mitigate network geometric deficiencies since in most other approaches the sensor nodes close to the sink become heavily involved in data forwarding and, thus, their batteries<span> are quickly depleted. A Particle Swarm Optimization (PSO) based algorithm is used to locate the optimal sink position with respect to those relay nodes to make the network more energy efficient. The relay nodes communicate with the sink instead of the sensor nodes. Tests show that this approach can save at least 40% of the energy and prolong the network lifetime.</span></span></p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70075-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68028632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70083-9
Xingfa Shen, Xin Qian, Bei Zhao, Qiming Fang, Guojun Dai
The Clapping and Broadcasting Synchronization (CBS) algorithm, which is specifically designed for large-scale sensor networks with low communication overhead and high synchronization accuracy, is introduced. The CBS protocol uses broadcasting rather than pairwise communication to accomplish synchronization. In the CBS scheme, the initial offset of local clocks can be successfully eliminated by the operation of clapping nodes, which leads to significant improvement in synchronization accuracy. The CBS protocol was implemented on the TelosB platform and its performance was evaluated in a variety of experiments. The results demonstrate that the CBS protocol outperforms the current state-of-the-art approach, the Flooding Time Synchronization Protocol (FTSP), in both single-hop and multi-hop scenarios in terms of synchronous precision and energy consumption. In multi-hop scenarios, the CBS algorithm keeps about 50% of its synchronization errors within 1 ms. In comparison, the FTSP keeps less than 7% of its synchronization errors within this range. In both single-hop and multi-hop scenarios, the CBS protocol is over 3.2 times more energy-efficient than the FTSP.
{"title":"Clapping and Broadcasting Synchronization in Wireless Sensor Networks","authors":"Xingfa Shen, Xin Qian, Bei Zhao, Qiming Fang, Guojun Dai","doi":"10.1016/S1007-0214(11)70083-9","DOIUrl":"10.1016/S1007-0214(11)70083-9","url":null,"abstract":"<div><p>The Clapping and Broadcasting Synchronization (CBS) algorithm, which is specifically designed for large-scale sensor networks with low communication overhead and high synchronization accuracy, is introduced. The CBS protocol uses broadcasting rather than pairwise communication to accomplish synchronization. In the CBS scheme, the initial offset of local clocks can be successfully eliminated by the operation of clapping nodes, which leads to significant improvement in synchronization accuracy. The CBS protocol was implemented on the TelosB platform and its performance was evaluated in a variety of experiments. The results demonstrate that the CBS protocol outperforms the current state-of-the-art approach, the Flooding Time Synchronization Protocol (FTSP), in both single-hop and multi-hop scenarios in terms of synchronous precision and energy consumption. In multi-hop scenarios, the CBS algorithm keeps about 50% of its synchronization errors within 1 ms. In comparison, the FTSP keeps less than 7% of its synchronization errors within this range. In both single-hop and multi-hop scenarios, the CBS protocol is over 3.2 times more energy-efficient than the FTSP.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70083-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68031109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2011-12-01DOI: 10.1016/S1007-0214(11)70086-4
Lin Wang, Wenyuan Liu
Emergency navigation with a large number of sensors can serve as a safety service in emergencies. Recent studies have focused on navigation protocols to safely guide people to exits while helping them avoid hazardous areas. However, those approaches are not applicable in all circumstances. Both the dynamics of the environment and the mobility of users are key challenges for the efficiency and effectiveness of navigation protocols. The concepts of navigability and reachability are used to evaluate three typical navigation approaches. A large number of simulation results show that these two indicators effectively identify the performance levels of navigation protocols in changing environments.
{"title":"Navigability and Reachability Index for Emergency Navigation Systems Using Wireless Sensor Networks","authors":"Lin Wang, Wenyuan Liu","doi":"10.1016/S1007-0214(11)70086-4","DOIUrl":"10.1016/S1007-0214(11)70086-4","url":null,"abstract":"<div><p>Emergency navigation with a large number of sensors can serve as a safety service in emergencies. Recent studies have focused on navigation protocols to safely guide people to exits while helping them avoid hazardous areas. However, those approaches are not applicable in all circumstances. Both the dynamics of the environment and the mobility of users are key challenges for the efficiency and effectiveness of navigation protocols. The concepts of navigability and reachability are used to evaluate three typical navigation approaches. A large number of simulation results show that these two indicators effectively identify the performance levels of navigation protocols in changing environments.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(11)70086-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68028634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}