Event region detection is the important application for wireless sensor networks（WSNs）, where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment n...Event region detection is the important application for wireless sensor networks（WSNs）, where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance（DFWD） is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.展开更多
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.展开更多
Wireless sensor networks （WSN） provide an approachto collecting distributed monitoring data and transmiting them tothe sink node. This paper proposes a WSN-based multi-hop networkinfrastructure, to increase network ...Wireless sensor networks （WSN） provide an approachto collecting distributed monitoring data and transmiting them tothe sink node. This paper proposes a WSN-based multi-hop networkinfrastructure, to increase network lifetime by optimizing therouting strategy. First, a network model is established, an operatingcontrol strategy is devised, and energy consumption characteristicsare analyzed. Second, a fast route-planning algorithm isproposed to obtain the original path that takes into account the remainingenergy of communicating nodes and the amount of energyconsumed in data transmission. Next, considering the amount ofenergy consumed by an individual node and the entire network,a criterion function is established to describe node performanceand to evaluate data transmission ability. Finally, a route optimizingalgorithm is proposed to increase network lifetime by adjusting thetransmission route in protection of the weak node （the node withlow transmission ability）. Simulation and comparison experimentalresults demonstrate the good performance of the proposed algorithmsto increase network lifetime.展开更多
Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inn...Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key pre-distribution, polynomial-based, Blom's matrix-based, and deterministic key pre-distribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.展开更多
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.展开更多
Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmissio...Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmission delay and packet loss.It compensates for transmission delay and packet loss firstly,and then,estimates clock skew and clock offset in two steps.Simulation and experiment results show that the proposed protocol can keep synchronization error below 2μs in the grid network of 10 nodes or the random network of 90 nodes.Moreover,the synchronization accuracy in the proposed protocol can keep constant when the WSN works up to a month.展开更多
基金supported by the National Science Foundation for Outstanding Young Scientists (60425310)the Science Foundation for Post-doctoral Scientists of Central South University (2008)
文摘Event region detection is the important application for wireless sensor networks（WSNs）, where the existing faulty sensors would lead to drastic deterioration of network quality of service.Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance（DFWD） is proposed, which exploits the spatial correlation among sensor nodes and their redundant information.In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node.Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node.Simultaneously, readings of faulty sensors would be corrected during this process.Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.
基金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.
基金supported by the National Natural Science Foundation of China(61571068)the Innovative Research Projects of Colleges and Universities in Chongqing(12A19369)
文摘Wireless sensor networks （WSN） provide an approachto collecting distributed monitoring data and transmiting them tothe sink node. This paper proposes a WSN-based multi-hop networkinfrastructure, to increase network lifetime by optimizing therouting strategy. First, a network model is established, an operatingcontrol strategy is devised, and energy consumption characteristicsare analyzed. Second, a fast route-planning algorithm isproposed to obtain the original path that takes into account the remainingenergy of communicating nodes and the amount of energyconsumed in data transmission. Next, considering the amount ofenergy consumed by an individual node and the entire network,a criterion function is established to describe node performanceand to evaluate data transmission ability. Finally, a route optimizingalgorithm is proposed to increase network lifetime by adjusting thetransmission route in protection of the weak node （the node withlow transmission ability）. Simulation and comparison experimentalresults demonstrate the good performance of the proposed algorithmsto increase network lifetime.
基金Supported by National Natural Science Foundation of China （60602061） and National High Technology Research and Development Program of China （863 Program） （2006AA01Z413）
文摘Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key pre-distribution, polynomial-based, Blom's matrix-based, and deterministic key pre-distribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.
基金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.
文摘Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmission delay and packet loss.It compensates for transmission delay and packet loss firstly,and then,estimates clock skew and clock offset in two steps.Simulation and experiment results show that the proposed protocol can keep synchronization error below 2μs in the grid network of 10 nodes or the random network of 90 nodes.Moreover,the synchronization accuracy in the proposed protocol can keep constant when the WSN works up to a month.
