To Integrate the capacity of sensing, communication, computing, and actuating, one of the compelling technological advances of these years has been the appearance of distributed wireless sensor network (DSN) for infor...To Integrate the capacity of sensing, communication, computing, and actuating, one of the compelling technological advances of these years has been the appearance of distributed wireless sensor network (DSN) for information gathering tasks. In order to save the energy, multi-hop routing between the sensor nodes and the sink node is necessary because of limited resource. In addition, the unpredictable conditional factors make the sensor nodes unreliable. In this paper, the reliability of routing designed for sensor network and some dependability issues of DSN, such as MTTF (mean time to failure) and the probability of connectivity between the sensor nodes and the sink node are analyzed. Unfortunately, we could not obtain the accurate result for the arbitrary network topology, which is #P-hard problem. And the reliability analysis of restricted topologies clustering-based is given. The method proposed in this paper will show us a constructive idea about how to place energy-constrained sensor nodes in the network efficiently from the prospective of reliability.展开更多
Wireless technology is applied increasingly in networked control systems. A new form of wireless network called wireless sensor network can bring control systems some advantages, such as flexibility and feasibility of...Wireless technology is applied increasingly in networked control systems. A new form of wireless network called wireless sensor network can bring control systems some advantages, such as flexibility and feasibility of network deployment at low costs, while it also raises some new challenges. First, the communication resources shared by all the control loops are limited. Second, the wireless and multi-hop character of sensor network makes the resources scheduling more difficult. Thus, how to effectively allocate the limited communication resources for those control loops is an important problem. In this paper, this problem is formulated as an optimal sampling frequency assignment problem, where the objective function is to maximize the utility of control systems, subject to channel capacity constraints. Then an iterative distributed algorithm based on local buffer information is proposed. Finally, the simulation results show that the proposed algorithm can effectively allocate the limited communication resource in a distributed way. It can achieve the optimal quality of the control system and adapt to the network load changes.展开更多
The transmission modes of multi-hop and broadcasting for Wireless Sensor Networks(WSN)often make random and unknown transmission delays appear,so multisensor data fusion based ondelayed systems attracts intense attent...The transmission modes of multi-hop and broadcasting for Wireless Sensor Networks(WSN)often make random and unknown transmission delays appear,so multisensor data fusion based ondelayed systems attracts intense attention from lots of researchers.The existing achievements for thedelayed fusion all focus on Out-Of-Sequence Measurements(OOSM)problem which has many dis-advantages such as high communication cost,low computational efficiency,huge computational com-plexity and storage requirement,bad real-time performance and so on.In order to overcome theseproblems occurred in the OOSM fusion,the Out-Of-Sequence Estimates(OOSE)are considered tosolve the delayed fusion for the first time.Different from OOSM which belongs to the centralized fusion,the OOSE scheme transmits local estimates from local sensors to the central processor and is thus thedistributed fusion;thereby,the OOSE fusion can not only avoid the problems suffered in the OOSMfusion but also make the design of fusion algorithm highly simple and easy.Accordingly,a novel optimallinear recursive prediction weighted fusion method is proposed for one-step OOSE problem in this letter.As a tradeoff,its fusion accuracy is slightly lower than that of the OOSM method because the currentOOSM fusion is a smooth estimate and OOSE gets a prediction estimate.But,the smooth result of theOOSE problem also has good fusion accuracy.Performance analysis and computer simulation show thatthe total performance of the proposed one-step OOSE fusion algorithm is better than the current one-step OOSM fusion in the practical tracking systems.展开更多
A hierarchical wireless sensor networks(WSN) was proposed to estimate the plume source location.Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding t...A hierarchical wireless sensor networks(WSN) was proposed to estimate the plume source location.Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident.The entire surveillant field is divided into several small sub-regions.In each sub-region,the localization algorithm based on the improved particle filter(IPF) was performed to estimate the location.Some improved methods such as weighted centroid,residual resampling were introduced to the IPF algorithm to increase the localization performance.This distributed estimation method eliminates many drawbacks inherent with the traditional centralized optimization method.Simulation results show that localization algorithm is efficient for estimating the plume source location.展开更多
Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Str...Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.展开更多
In this paper, a sensing model for the coverage analysis of wireless sensor networks is provided. Using this model and Monte Carlo method, the ratio of private range to sensing range required to obtain the desired cov...In this paper, a sensing model for the coverage analysis of wireless sensor networks is provided. Using this model and Monte Carlo method, the ratio of private range to sensing range required to obtain the desired coverage can be derived considering the scale of deployment area and the number of sensor nodes. Base on the coverage analysis, an energy-efficient distributed node scheduling scheme is proposed to prolong the network lifetime while maintaining the desired sensing coverage, which does not need the geographic or neighbor information of nodes. The proposed scheme can also handle uneven distribution, and it is robust against node failures. Theoretical and simulation results demonstrate its efficiency and usefulness.展开更多
Wireless sensor network nodes (WSN nodes) have limited computing power, storage ca-pacity, conmmunication capabilities and energy and WSN nodes are easy to be paralyzed by Sybil at- tack. In order to prevent Sybil a...Wireless sensor network nodes (WSN nodes) have limited computing power, storage ca-pacity, conmmunication capabilities and energy and WSN nodes are easy to be paralyzed by Sybil at- tack. In order to prevent Sybil attacks, a new key distribution scheme for wireless sensor networks is presented. In this scheme, the key inforrmtion and node ID are associated, and then the attacker is dif-ficult to forge identity ID and the key inforrmtion corresponding to ID can not be forged. This scheme can use low-power to resist the Syhil attack and give full play to the resource advantages of the cluster head. The computing, storage and corrn^ni- cation is rminly undertaken by the cluster head o- verhead to achieve the lowest energy consumption and resist against nodes capture attack. Theoretical analysis and experimental results show that com- pared with the traditional scheme presented in Ref. [14], the capture rate of general nodes of cluster re-duces 40%, and the capture rate of cluster heads reduces 50%. So the scheme presented in this pa-per can improve resilience against nodes capture at- tack and reduce node power consumption.展开更多
This paper presents two aggregation strategies in convex intersection region for the distributed mobile sensor network(MSN) with heterogeneous dynamics. First, the authors analyze individual local perception model and...This paper presents two aggregation strategies in convex intersection region for the distributed mobile sensor network(MSN) with heterogeneous dynamics. First, the authors analyze individual local perception model and dynamics model, set the intersection of all the local perceptions as the region of interest(ROI). The MSN consists of sensors with first-order dynamics and second-order dynamics. Then, the authors design a control strategy to ensure that individuals aggregate at a point in the ROI relying on their local perceptions and the locations of neighbors within their communication scope. The authors describe this situation of aggregation as rendezvous. In addition, the authors introduce artificial potential field to make sensors deploy dispersedly in a bounded range near the ROI,which the authors call dispersed deployment. Finally, the authors prove the stability of the proposed strategies and validate the theoretical results by simulations. This research is applied for the cooperative deployment and data collection of mobile platforms with different dynamics under the condition of inaccurate perception.展开更多
A wearable body area sensor network(WBASN) was designed and implemented to monitor movement information of stroke patients in real time. The sensor system was combined with a previously developed distributed functiona...A wearable body area sensor network(WBASN) was designed and implemented to monitor movement information of stroke patients in real time. The sensor system was combined with a previously developed distributed functional electrical stimulation(d FES) system, which is a promising technology for motor rehabilitation of stroke patients. Movement information could be useful in outcome assessment of rehabilitation, or for closed-loop adaptive stimulation during rehabilitation. In addition,a short-latency, low-power communication protocol was developed to meet the clinical requirements of energy efficiency and high rate of data feed-through. The prototype of the WBASN was tested in preliminary human experiments. Experimental results demonstrate the feasibility of the proposed wearable body area sensor network in monitoring arm movements on healthy subjects.展开更多
基金This work was supported by National Defence Advanced Research Fund .Serial No.5141604010HT0117
文摘To Integrate the capacity of sensing, communication, computing, and actuating, one of the compelling technological advances of these years has been the appearance of distributed wireless sensor network (DSN) for information gathering tasks. In order to save the energy, multi-hop routing between the sensor nodes and the sink node is necessary because of limited resource. In addition, the unpredictable conditional factors make the sensor nodes unreliable. In this paper, the reliability of routing designed for sensor network and some dependability issues of DSN, such as MTTF (mean time to failure) and the probability of connectivity between the sensor nodes and the sink node are analyzed. Unfortunately, we could not obtain the accurate result for the arbitrary network topology, which is #P-hard problem. And the reliability analysis of restricted topologies clustering-based is given. The method proposed in this paper will show us a constructive idea about how to place energy-constrained sensor nodes in the network efficiently from the prospective of reliability.
基金Project (Nos. 60074011 and 60574049) supported by the National Natural Science Foundation of China
文摘Wireless technology is applied increasingly in networked control systems. A new form of wireless network called wireless sensor network can bring control systems some advantages, such as flexibility and feasibility of network deployment at low costs, while it also raises some new challenges. First, the communication resources shared by all the control loops are limited. Second, the wireless and multi-hop character of sensor network makes the resources scheduling more difficult. Thus, how to effectively allocate the limited communication resources for those control loops is an important problem. In this paper, this problem is formulated as an optimal sampling frequency assignment problem, where the objective function is to maximize the utility of control systems, subject to channel capacity constraints. Then an iterative distributed algorithm based on local buffer information is proposed. Finally, the simulation results show that the proposed algorithm can effectively allocate the limited communication resource in a distributed way. It can achieve the optimal quality of the control system and adapt to the network load changes.
基金the National Natural Science Foundation of China(No.60434020,No.60572051)International Coop-erative Project Foundation(No.0446650006)Ministryof Education Science Foundation of China(No.2050 92).
文摘The transmission modes of multi-hop and broadcasting for Wireless Sensor Networks(WSN)often make random and unknown transmission delays appear,so multisensor data fusion based ondelayed systems attracts intense attention from lots of researchers.The existing achievements for thedelayed fusion all focus on Out-Of-Sequence Measurements(OOSM)problem which has many dis-advantages such as high communication cost,low computational efficiency,huge computational com-plexity and storage requirement,bad real-time performance and so on.In order to overcome theseproblems occurred in the OOSM fusion,the Out-Of-Sequence Estimates(OOSE)are considered tosolve the delayed fusion for the first time.Different from OOSM which belongs to the centralized fusion,the OOSE scheme transmits local estimates from local sensors to the central processor and is thus thedistributed fusion;thereby,the OOSE fusion can not only avoid the problems suffered in the OOSMfusion but also make the design of fusion algorithm highly simple and easy.Accordingly,a novel optimallinear recursive prediction weighted fusion method is proposed for one-step OOSE problem in this letter.As a tradeoff,its fusion accuracy is slightly lower than that of the OOSM method because the currentOOSM fusion is a smooth estimate and OOSE gets a prediction estimate.But,the smooth result of theOOSE problem also has good fusion accuracy.Performance analysis and computer simulation show thatthe total performance of the proposed one-step OOSE fusion algorithm is better than the current one-step OOSM fusion in the practical tracking systems.
基金National High Technology Research and Development Program of China(863Program,No.2004AA412050)
文摘A hierarchical wireless sensor networks(WSN) was proposed to estimate the plume source location.Such WSN can be of tremendous help to emergency personnel trying to protect people from terrorist attacks or responding to an accident.The entire surveillant field is divided into several small sub-regions.In each sub-region,the localization algorithm based on the improved particle filter(IPF) was performed to estimate the location.Some improved methods such as weighted centroid,residual resampling were introduced to the IPF algorithm to increase the localization performance.This distributed estimation method eliminates many drawbacks inherent with the traditional centralized optimization method.Simulation results show that localization algorithm is efficient for estimating the plume source location.
文摘Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.
基金Supported by China Scholarship Council(No.201306255014)
文摘In this paper, a sensing model for the coverage analysis of wireless sensor networks is provided. Using this model and Monte Carlo method, the ratio of private range to sensing range required to obtain the desired coverage can be derived considering the scale of deployment area and the number of sensor nodes. Base on the coverage analysis, an energy-efficient distributed node scheduling scheme is proposed to prolong the network lifetime while maintaining the desired sensing coverage, which does not need the geographic or neighbor information of nodes. The proposed scheme can also handle uneven distribution, and it is robust against node failures. Theoretical and simulation results demonstrate its efficiency and usefulness.
基金This paper was supported by the National Science Foundation for Young Scholars of China under Crant No.61001091 .
文摘Wireless sensor network nodes (WSN nodes) have limited computing power, storage ca-pacity, conmmunication capabilities and energy and WSN nodes are easy to be paralyzed by Sybil at- tack. In order to prevent Sybil attacks, a new key distribution scheme for wireless sensor networks is presented. In this scheme, the key inforrmtion and node ID are associated, and then the attacker is dif-ficult to forge identity ID and the key inforrmtion corresponding to ID can not be forged. This scheme can use low-power to resist the Syhil attack and give full play to the resource advantages of the cluster head. The computing, storage and corrn^ni- cation is rminly undertaken by the cluster head o- verhead to achieve the lowest energy consumption and resist against nodes capture attack. Theoretical analysis and experimental results show that com- pared with the traditional scheme presented in Ref. [14], the capture rate of general nodes of cluster re-duces 40%, and the capture rate of cluster heads reduces 50%. So the scheme presented in this pa-per can improve resilience against nodes capture at- tack and reduce node power consumption.
基金supported by the National Natural Science Foundation of China under Grant No.61203078the Foundation for Innovative Research Groups of the National Natural Science Foundation of China under Grant No.61321002+3 种基金the Projects of Major International(Regional)Joint Research Program NSFC under Grant No.61120106010the Beijing Education Committee Cooperation Building Foundation Projectthe Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT1208the Chang Jiang Scholars Program,and the Beijing Outstanding Ph.D.Program Mentor under Grant No.20131000704
文摘This paper presents two aggregation strategies in convex intersection region for the distributed mobile sensor network(MSN) with heterogeneous dynamics. First, the authors analyze individual local perception model and dynamics model, set the intersection of all the local perceptions as the region of interest(ROI). The MSN consists of sensors with first-order dynamics and second-order dynamics. Then, the authors design a control strategy to ensure that individuals aggregate at a point in the ROI relying on their local perceptions and the locations of neighbors within their communication scope. The authors describe this situation of aggregation as rendezvous. In addition, the authors introduce artificial potential field to make sensors deploy dispersedly in a bounded range near the ROI,which the authors call dispersed deployment. Finally, the authors prove the stability of the proposed strategies and validate the theoretical results by simulations. This research is applied for the cooperative deployment and data collection of mobile platforms with different dynamics under the condition of inaccurate perception.
基金National Natural Science Foundation of Chinagrant number:31070749,81271684+2 种基金National Basic Research Program of Chinagrant number:2011CB013304Translational Medicine Research Grant of Project 985III from School of Medicine of SJTU
文摘A wearable body area sensor network(WBASN) was designed and implemented to monitor movement information of stroke patients in real time. The sensor system was combined with a previously developed distributed functional electrical stimulation(d FES) system, which is a promising technology for motor rehabilitation of stroke patients. Movement information could be useful in outcome assessment of rehabilitation, or for closed-loop adaptive stimulation during rehabilitation. In addition,a short-latency, low-power communication protocol was developed to meet the clinical requirements of energy efficiency and high rate of data feed-through. The prototype of the WBASN was tested in preliminary human experiments. Experimental results demonstrate the feasibility of the proposed wearable body area sensor network in monitoring arm movements on healthy subjects.