Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC...Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.展开更多
Heterogeneous wireless access technologies will coexist in next generation wireless networks.These technologies form integrated networks,and these networks support multiple services with high quality level.Various acc...Heterogeneous wireless access technologies will coexist in next generation wireless networks.These technologies form integrated networks,and these networks support multiple services with high quality level.Various access technologies allow users to select the best available access network to meet the requirements of each type of communication service.Being always best connected anytime and anywhere is a major concern in a heterogeneous wireless networks environment.Always best connected enables network selection mechanisms to keep mobile users always connected to the best network.We present an overview of the network selection and prediction problems and challenges.In addition,we discuss a comprehensive classification of related theoretic approaches,and also study the integration between these methods,finding the best solution of network selection and prediction problems.The optimal solution can fulfill the requirements of the next generation wireless networks.展开更多
Without considering security, existing message scheduling mechanisms may expose critical messages to malicious threats like confidentiality attacks. Incorporating confidentiality improvement into message scheduling, t...Without considering security, existing message scheduling mechanisms may expose critical messages to malicious threats like confidentiality attacks. Incorporating confidentiality improvement into message scheduling, this paper investigates the problem of scheduling aperiodc messages with time-critical and security-critical requirements. A risk-based security profit model is built to quantify the security quality of messages; and a dynamic programming based approximation algorithm is proposed to schedule aperiodic messages with guaranteed security performance. Experimental results illustrate the efficiency and effectiveness of the proposed algorithm.展开更多
The stability analysis and stabilization problems of the wireless networked control systems(WNCSs) with signal transmission deadbands were considered. The deadbands were respectively set up at the sensor to the contro...The stability analysis and stabilization problems of the wireless networked control systems(WNCSs) with signal transmission deadbands were considered. The deadbands were respectively set up at the sensor to the controller and the controller to the actor sides in the WNCS, which were used to reduce data transmission, furthermore, to decrease the network collision and node energy consumption. Under the consideration of time-varying delays and signal transmission deadbands, the model for the WNCS was presented. A novel Lyapunov functional which took full advantages of the network factors was exploited. Meanwhile, new stability analysis and stabilization conditions for the WNCS were proposed, which described the relationship of the delay bounds, the transmission deadband bounds and the system stability. Two examples were used to demonstrate the effectiveness of the proposed methods. The results show that the proposed approach can guarantee asymptotical stability of the system and reduce the data transmission effectively.展开更多
To address the issue of resource scarcity in wireless communication, a novel dynamic call admission control scheme for wireless mobile network was proposed. The scheme established a reward computing model of call admi...To address the issue of resource scarcity in wireless communication, a novel dynamic call admission control scheme for wireless mobile network was proposed. The scheme established a reward computing model of call admission of wireless cell based on Markov decision process, dynamically optimized call admission process according to the principle of maximizing the average system rewards. Extensive simulations were conducted to examine the performance of the model by comparing with other policies in terms of new call blocking probability, handoff call dropping probability and resource utilization rate. Experimental results show that the proposed scheme can achieve better adaptability to changes in traffic conditions than existing protocols. Under high call traffic load, handoff call dropping probability and new call blocking probability can be reduced by about 8%, and resource utilization rate can be improved by 2%-6%. The proposed scheme can achieve high source utilization rate of about 85%.展开更多
We analyze the development of quantum cryptography communication,including analyze the problems lie in the existent literatures and give the resolve methods according to these problems.Then discuss the quantum cryptog...We analyze the development of quantum cryptography communication,including analyze the problems lie in the existent literatures and give the resolve methods according to these problems.Then discuss the quantum cryptography communication for wireless networks and also point out the shortcoming of current research and the future of quantum wireless networks.展开更多
Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challe...Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challenges that MWN has to face. Software-defined network is expected as a promising way for future network and has captured growing attention. Network virtualization is an essential feature in software-defined wireless network（SDWN）, and it brings two new entities, physical networks and virtual networks. Accordingly, efficiently assigning spectrum resource to virtual networks is one of the fundamental problems in SDWN. Directly orienting towards the spectrum resource allocation problem, firstly, the fluctuation features of virtual network requirements in SDWN are researched, and the opportunistic spectrum sharing method is introduced to SDWN. Then, the problem is proved as NP-hardness. After that, a dynamic programming and graph theory based spectrum sharing algorithm is proposed.Simulations demonstrate that the opportunistic spectrum sharing method conspicuously improves the system performance up to around 20%–30% in SDWN, and the proposed algorithm achieves more efficient performance.展开更多
In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y ...In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment （UD）, non-uniform deployment （NUD） and op-timal distribution point spacing （ODS） is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.展开更多
To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomple...To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.展开更多
This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of g...This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.展开更多
Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless se...Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless sensor networks is restrictive energy, this paper proposes a distributed power control algorithm based on game theory for wireless sensor networks which objects of which are reducing power consumption and decreasing overhead and increasing network lifetime. The game theory and OPNET simulation shows that the power control algorithm converges to a Nash Equilibrium when decisions are updated according to a better response dynamic.展开更多
Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed ...Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.展开更多
Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a s...Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a special cluster member(CM) node selection method is put forward in the scheme.An energy efficiency model was proposed under consideration of both energy consumption and remaining energy balance in the network.A tracking accuracy model based on area-sum principle was also presented through analyzing the localization accuracy of triangulation.Then,the two models mentioned above were combined to establish dynamic cluster member selection model for MTT where a comprehensive performance index function was designed to guide the CM node selection.This selection was fulfilled using genetic algorithm.Simulation results show that this method keeps both energy efficiency and tracking quality in optimal state,and also indicate the validity of genetic algorithm in implementing CM node selection.展开更多
This paper introduces a parking management system based on a wireless sensor network developed by our group. The system consists of a large amount of parking space monitoring nodes, a few parking guiding nodes, a sink...This paper introduces a parking management system based on a wireless sensor network developed by our group. The system consists of a large amount of parking space monitoring nodes, a few parking guiding nodes, a sink node and a management station. All the nodes exchange information with each other through wireless communication. The prototype of the parking management system has been implemented and the preliminary test results show that the performance of the system can satisfy the requirements of the application.展开更多
In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification probl...In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification problem of moving vehicles in wireless sensor networks using acoustic signals emitted from vehicles. Three algorithms including wavelet decomposition, weighted k-nearest-neighbor and Dempster-Shafer theory are combined in this paper. Finally, we use real world experimental data to validate the classification methods. The result shows that wavelet based feature extraction method can extract stable features from acoustic signals. By fusion with Dempster's rule, the classification performance is improved.展开更多
Remote tracking for mobile targets is one of the most important applications in wireless sensor networks （WSNs）. A target tracking protoco–exponential distributed predictive tracking （EDPT） is proposed. To reduce...Remote tracking for mobile targets is one of the most important applications in wireless sensor networks （WSNs）. A target tracking protoco–exponential distributed predictive tracking （EDPT） is proposed. To reduce energy waste and response time, an improved predictive algorithm–exponential smoothing predictive algorithm （ESPA） is presented. With the aid of an additive proportion and differential （PD） controller, ESPA decreases the system predictive delay effectively. As a recovery mechanism, an optimal searching radius （OSR） algorithm is applied to calculate the optimal radius of the recovery zone. The simulation results validate that the proposed EDPT protocol performes better in terms of track failed ratio, energy waste ratio and enlarged sensing nodes ratio, respectively.展开更多
In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving ...In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving scheme for the sink based on local residual energy was proposed.In the scheme,the sink periodically moves to a new location with the highest stay-value defined by the average residual energy and the number of neighbors.The scheme can balance energy consumption and prevent nodes around sink from draining their energy very quickly in the networks.The simulation results show that the scheme can prolong the network lifetime by 26%-65%compared with the earlier schemes where the sink is static or moves randomly.展开更多
The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytica...The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.展开更多
基金supported by the National Natural Science Foundation of China(6104000561001126+5 种基金61271262)the China Postdoctoral Science Foundation Funded Project(201104916382012T50789)the Natural Science Foundation of Shannxi Province of China(2011JQ8036)the Special Fund for Basic Scientific Research of Central Colleges (CHD2012ZD005)the Research Fund of Zhejiang University of Technology(20100244)
文摘Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.
基金funded by the University of Malaya, under Grant No.RG208-11AFR
文摘Heterogeneous wireless access technologies will coexist in next generation wireless networks.These technologies form integrated networks,and these networks support multiple services with high quality level.Various access technologies allow users to select the best available access network to meet the requirements of each type of communication service.Being always best connected anytime and anywhere is a major concern in a heterogeneous wireless networks environment.Always best connected enables network selection mechanisms to keep mobile users always connected to the best network.We present an overview of the network selection and prediction problems and challenges.In addition,we discuss a comprehensive classification of related theoretic approaches,and also study the integration between these methods,finding the best solution of network selection and prediction problems.The optimal solution can fulfill the requirements of the next generation wireless networks.
基金supported by the National Natural Science Foundation of China (60673142)the National High Technology Research and Development Progrm of China (863 Program) (2006AA01Z1732007AA01Z131)
文摘Without considering security, existing message scheduling mechanisms may expose critical messages to malicious threats like confidentiality attacks. Incorporating confidentiality improvement into message scheduling, this paper investigates the problem of scheduling aperiodc messages with time-critical and security-critical requirements. A risk-based security profit model is built to quantify the security quality of messages; and a dynamic programming based approximation algorithm is proposed to schedule aperiodic messages with guaranteed security performance. Experimental results illustrate the efficiency and effectiveness of the proposed algorithm.
基金Project(61104106)supported by the National Natural Science Foundation of ChinaProject(201202156)supported by the Natural Science Foundation of Liaoning Province,ChinaProject(LJQ2012100)supported by the Program for Liaoning Excellent Talents in University(LNET),China
文摘The stability analysis and stabilization problems of the wireless networked control systems(WNCSs) with signal transmission deadbands were considered. The deadbands were respectively set up at the sensor to the controller and the controller to the actor sides in the WNCS, which were used to reduce data transmission, furthermore, to decrease the network collision and node energy consumption. Under the consideration of time-varying delays and signal transmission deadbands, the model for the WNCS was presented. A novel Lyapunov functional which took full advantages of the network factors was exploited. Meanwhile, new stability analysis and stabilization conditions for the WNCS were proposed, which described the relationship of the delay bounds, the transmission deadband bounds and the system stability. Two examples were used to demonstrate the effectiveness of the proposed methods. The results show that the proposed approach can guarantee asymptotical stability of the system and reduce the data transmission effectively.
基金Project(60873082) supported by the National Natural Science Foundation of ChinaProject(09C794) supported by the Natural Science Foundation of Education Department of Hunan Province, China+1 种基金Project (S2008FJ3078) supported by the Science and Technology Program Foundation of Hunan Province, ChinaProject(07JJ6109) supported by the Natural Science Foundation of Hunan Province, China
文摘To address the issue of resource scarcity in wireless communication, a novel dynamic call admission control scheme for wireless mobile network was proposed. The scheme established a reward computing model of call admission of wireless cell based on Markov decision process, dynamically optimized call admission process according to the principle of maximizing the average system rewards. Extensive simulations were conducted to examine the performance of the model by comparing with other policies in terms of new call blocking probability, handoff call dropping probability and resource utilization rate. Experimental results show that the proposed scheme can achieve better adaptability to changes in traffic conditions than existing protocols. Under high call traffic load, handoff call dropping probability and new call blocking probability can be reduced by about 8%, and resource utilization rate can be improved by 2%-6%. The proposed scheme can achieve high source utilization rate of about 85%.
基金Supported by National Natural Science Foundation of China 60404022, 60704009）, National Outstanding Youth Foundation 60525303）, and Natural Science Foundation of Hebei Province F2005000390, F2006000270）
基金supported by the National High Technology Research and Development Program of China(863 Program)(No. 2006AA01Z208)Nataral Sci-ence Foundation of Jiangsu Province(No. BK2007236)Six Projects Sponsoring Talent Summits of Jiangsu Province(No. SJ207001)
文摘We analyze the development of quantum cryptography communication,including analyze the problems lie in the existent literatures and give the resolve methods according to these problems.Then discuss the quantum cryptography communication for wireless networks and also point out the shortcoming of current research and the future of quantum wireless networks.
基金supported by the National Natural Science Foundation of China(6102100161133015+4 种基金61171065)the National Natural Science Foundation of China(973 Program)(2013CB329001)the National High Technology ResearchDevelopment Program(863 Program)(2013AA0106052013AA013500)
文摘Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challenges that MWN has to face. Software-defined network is expected as a promising way for future network and has captured growing attention. Network virtualization is an essential feature in software-defined wireless network（SDWN）, and it brings two new entities, physical networks and virtual networks. Accordingly, efficiently assigning spectrum resource to virtual networks is one of the fundamental problems in SDWN. Directly orienting towards the spectrum resource allocation problem, firstly, the fluctuation features of virtual network requirements in SDWN are researched, and the opportunistic spectrum sharing method is introduced to SDWN. Then, the problem is proved as NP-hardness. After that, a dynamic programming and graph theory based spectrum sharing algorithm is proposed.Simulations demonstrate that the opportunistic spectrum sharing method conspicuously improves the system performance up to around 20%–30% in SDWN, and the proposed algorithm achieves more efficient performance.
基金supported by the China Doctoral Discipline New Teacher Foundation(200802901507)the Sichuan Province Basic Research Plan Project(2013JY0165)the Cultivating Programme of Excellent Innovation Team of Chengdu University of Technology(KYTD201301)
文摘In order to reduce power consumption of sensor nodes and extend network survival time in the wireless sensor network （WSN）, sensor nodes are scheduled in an active or dormant mode. A chain-type WSN is fundamental y different from other types of WSNs, in which the sensor nodes are deployed along elongated geographic areas and form a chain-type network topo-logy structure. This paper investigates the node scheduling prob-lem in the chain-type WSN. Firstly, a node dormant scheduling mode is analyzed theoretical y from geographic coverage, and then three neighboring nodes scheduling criteria are proposed. Sec-ondly, a hybrid coverage scheduling algorithm and dead areas are presented. Final y, node scheduling in mine tunnel WSN with uniform deployment （UD）, non-uniform deployment （NUD） and op-timal distribution point spacing （ODS） is simulated. The results show that the node scheduling with UD and NUD, especial y NUD, can effectively extend the network survival time. Therefore, a strat-egy of adding a few mobile nodes which activate the network in dead areas is proposed, which can further extend the network survival time by balancing the energy consumption of nodes.
基金supported by the National Natural Science Fundation of China (60974082 60874085)+2 种基金the Fundamental Research Funds for the Central Universities (K50510700004)the Technology Plan Projects of Guangdong Province (20110401)the Team Project of Hanshan Normal University (LT201001)
文摘To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.
文摘This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.
文摘Energy saving is the most important issue in research and development for wireless sensor networks. A power control mechanism can reduce the power consumption of the whole network. Because the character of wireless sensor networks is restrictive energy, this paper proposes a distributed power control algorithm based on game theory for wireless sensor networks which objects of which are reducing power consumption and decreasing overhead and increasing network lifetime. The game theory and OPNET simulation shows that the power control algorithm converges to a Nash Equilibrium when decisions are updated according to a better response dynamic.
基金supported by the National Natural Science Foundation of China (60775047)Hunan Provincial Natural Science Foundation of China (07JJ6111)
文摘Due to the mutual interference and sharing of wireless links in TDMA wireless sensor networks, conflicts will occur when data messages are transmitting between nodes. The broadcast scheduling problem （BSP） is aimed to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots, as well as the maximum node transmission. A two-stage mixed algorithm based on a fuzzy Hopfield neural network is proposed to solve this BSP in wireless sensor network. In the first stage, a modified sequential vertex coloring algorithm is adopted to obtain a minimal TDMA frame length. In the second stage, the fuzzy Hopfleld network is utilized to maximize the channel utilization ratio. Experimental results, obtained from the running on three benchmark graphs, show that the algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exiting BSP solutions.
基金Projects(90820302,60805027)supported by the National Natural Science Foundation of ChinaProject(200805330005)supported by the Research Fund for the Doctoral Program of Higher Education,ChinaProject(2009FJ4030)supported by Academician Foundation of Hunan Province,China
文摘Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a special cluster member(CM) node selection method is put forward in the scheme.An energy efficiency model was proposed under consideration of both energy consumption and remaining energy balance in the network.A tracking accuracy model based on area-sum principle was also presented through analyzing the localization accuracy of triangulation.Then,the two models mentioned above were combined to establish dynamic cluster member selection model for MTT where a comprehensive performance index function was designed to guide the CM node selection.This selection was fulfilled using genetic algorithm.Simulation results show that this method keeps both energy efficiency and tracking quality in optimal state,and also indicate the validity of genetic algorithm in implementing CM node selection.
基金Supported by National Natural Science Foundation of P. R. China (60373049) National Basic Research Program of P.R.China (2006CB 3030000)
文摘This paper introduces a parking management system based on a wireless sensor network developed by our group. The system consists of a large amount of parking space monitoring nodes, a few parking guiding nodes, a sink node and a management station. All the nodes exchange information with each other through wireless communication. The prototype of the parking management system has been implemented and the preliminary test results show that the performance of the system can satisfy the requirements of the application.
基金Supported in part by Science & Technology Department of Shanghai (05dz15004)
文摘In wireless sensor networks, target classification differs from that in centralized sensing systems because of the distributed detection, wireless communication and limited resources. We study the classification problem of moving vehicles in wireless sensor networks using acoustic signals emitted from vehicles. Three algorithms including wavelet decomposition, weighted k-nearest-neighbor and Dempster-Shafer theory are combined in this paper. Finally, we use real world experimental data to validate the classification methods. The result shows that wavelet based feature extraction method can extract stable features from acoustic signals. By fusion with Dempster's rule, the classification performance is improved.
基金supported by the National Basic Research Program of China (973 Program) (2010CB731800)the National Natural Science Foundation of China (60934003+2 种基金 60974123 60804010)the Hebei Provincial Educational Foundation of China (2008147)
文摘Remote tracking for mobile targets is one of the most important applications in wireless sensor networks （WSNs）. A target tracking protoco–exponential distributed predictive tracking （EDPT） is proposed. To reduce energy waste and response time, an improved predictive algorithm–exponential smoothing predictive algorithm （ESPA） is presented. With the aid of an additive proportion and differential （PD） controller, ESPA decreases the system predictive delay effectively. As a recovery mechanism, an optimal searching radius （OSR） algorithm is applied to calculate the optimal radius of the recovery zone. The simulation results validate that the proposed EDPT protocol performes better in terms of track failed ratio, energy waste ratio and enlarged sensing nodes ratio, respectively.
基金Project(60673164)supported by the National Natural Science Foundation of ChinaProject(20060533057)supported by the Specialized Research Foundation for the Doctoral Program of Higher Education of China
文摘In the application of periodic data-gathering in sensor networks,sensor nodes located near the sink have to forward the data received from all other nodes to the sink,which depletes their energy very quickly.A moving scheme for the sink based on local residual energy was proposed.In the scheme,the sink periodically moves to a new location with the highest stay-value defined by the average residual energy and the number of neighbors.The scheme can balance energy consumption and prevent nodes around sink from draining their energy very quickly in the networks.The simulation results show that the scheme can prolong the network lifetime by 26%-65%compared with the earlier schemes where the sink is static or moves randomly.
基金Project(60873081)supported by the National Natural Science Foundation of ChinaProject(NCET-10-0787)supported by Program for New Century Excellent Talents in UniversityProject(11JJ1012)supported by the Natural Science Foundation of Hunan Province,China
文摘The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.
