scholarly journals A Game-Theoretic Response Strategy for Coordinator Attack in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Jianhua Liu ◽  
Guangxue Yue ◽  
Shigen Shen ◽  
Huiliang Shang ◽  
Hongjie Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Cooperative Communications ◽  
Network Performance ◽  
Stochastic Game ◽  
Evolutionary Game ◽  
Response Strategy ◽  
Wireless Sensor ◽  
Game Model

The coordinator is a specific node that controls the whole network and has a significant impact on the performance in cooperative multihop ZigBee wireless sensor networks (ZWSNs). However, the malicious node attacks coordinator nodes in an effort to waste the resources and disrupt the operation of the network. Attacking leads to a failure of one round of communication between the source nodes and destination nodes. Coordinator selection is a technique that can considerably defend against attack and reduce the data delivery delay, and increase network performance of cooperative communications. In this paper, we propose an adaptive coordinator selection algorithm using game and fuzzy logic aiming at both minimizing the average number of hops and maximizing network lifetime. The proposed game model consists of two interrelated formulations: a stochastic game for dynamic defense and a best response policy using evolutionary game formulation for coordinator selection. The stable equilibrium best policy to response defense is obtained from this game model. It is shown that the proposed scheme can improve reliability and save energy during the network lifetime with respect to security.

scholarly journals TWO-WAY AUTHENTICATION FOR ENHANCING SECURITY IN HETEROGENEOUS WIRELESS SENSOR NETWORKS

2021 ◽  
Vol 130 (2B) ◽  
Author(s):  
Văn Trường Nguyễn ◽  
Tuấn Anh Dương ◽  
Quý Sỹ Nguyễn
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Security ◽  
Network Lifetime ◽  
High Performance ◽  
Network Performance ◽  
Homomorphic Encryption ◽  
Security Analysis ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Networks

In wireless sensor networks, each sensor node nowadays is responsible for the exchange of sensory data with high performance in terms of QoS such as network throughput and delay under energy restrictions. Besides network performance, network security plays an important role in designing a wireless sensor network. One of current challenges is to design efficiently lightweight security methods to achieve highly secured transmissions and prolonged network lifetime. In this paper, we introduce an end-to-end two-way authentication scheme for WSNs under the heterogeneous assumption. By drawing on the benefit of lightweight homomorphic encryption and watermark data, numerical evaluations and security analysis show that our proposed method can prolong the network lifetime with the enhancement in network security.

scholarly journals Cluster Head Relocation Based on Selfish Herd Hypothesis for Prolonging the Life Span of Wireless Sensor Networks

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 403 ◽  
Author(s):  
Goran Popovic ◽  
Goran Djukanovic ◽  
Dimitris Kanellopoulos
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Network Performance ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Total Energy Consumption ◽  
Selfish Herd

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed of several sensor nodes, one of them selected as the cluster head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. In such a hierarchical WSN, some nodes are possibly moveable or nomadic (relocated periodically), while others are static. The mobility of sensor nodes can improve network performance and prolong network lifetime. This paper presents the idea of mobile, solar-powered CHs that relocate themselves inside clusters in such a way that the total energy consumption in the network is reduced and the network lifetime is extended. The positioning of CHs is made in each round based on a selfish herd hypothesis, where the leader retreats to the center of gravity. Based on this idea, the CH-active algorithm is proposed in this study. Simulation results show that this algorithm has benefits in terms of network lifetime and in the prolongation of the duration of network stability period.

An Energy-Efficient Cluster Head and Router Selecting Protocol for Wireless Sensor Networks

2012 ◽  
Vol 226-228 ◽  
pp. 1807-1810 ◽  
Author(s):  
Shou Zhi Huang ◽  
Xue Zeng Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Network Performance ◽  
Low Cost ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distance Communication

Wireless sensor networks (WSNs) based on ZigBee technology are currently popular low-energy, low-cost, short-distance communication technologies that can be applied in many areas, such as industry, environment, agriculture, etc. Energy efficiency is one of the most important research points for WSNs. In this paper, we analyze the existing WSNs protocols, especially LEACH, and propose an energy-efficient cluster head and router selecting protocol (EECRS). EECRS combines both cluster-based and energy-threshold routing protocols to balance the energy consumption of the sensor nodes in the whole network in order to extend the network lifetime. And through the simulation via NS2 software, it is shown that EECRS improves the network performance, network lifetime and data received per energy mount consumption, compared with LEACH protocol.

scholarly journals An energy-optimized game algorithm for wireless sensor networks

2020 ◽  
Vol 53 (7-8) ◽  
pp. 1548-1557
Author(s):  
Mei-Qi Wang ◽  
En-Li Chen ◽  
Shuang Hou ◽  
Peng-Fei Liu ◽  
Wan-Jie Hang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Performance ◽  
Channel Allocation ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Game Model ◽  
Rest Energy ◽  
Average Residual ◽  
Long Lifetime

The ongoing development of wireless sensor networks has been greatly restricted because of scarce spectrum resources, limited battery power, and ineffective topologic structures. Thus, how to construct a suitable topological structure and allocate the appropriate node channels has become an urgent problem. In this study, we built a game model that took into account the influence of channel allocation and topology structure on network performance. The game model considered the nodes in wireless sensor networks to be players and took transmitting power, node channels, and node rest energy into account to establish the income function. Then, the model certified that it has Nash equilibrium. Next, we propose an energy-optimized game algorithm joint topology and channel for wireless sensor network (CETGA) in accordance with the game model. The CETGA algorithm improved each node’s income by changing the transmitting power and node channel gradually, assuming that the network retained connectivity. Then, we demonstrated that the algorithm could converge to a Pareto optimal. Finally, we used MATLAB software to verify the simulation. The results show that the topology created by CETGA is with low interference and long lifetime. In addition, the nodes’ average residual energy is more balanced and the network robustness and real time are improved.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

scholarly journals Distributed and morphological operation-based data collection algorithm

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771759 ◽  
Author(s):  
Yalin Nie ◽  
Haijun Wang ◽  
Yujie Qin ◽  
Zeyu Sun
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Network Lifetime ◽  
Algorithm Analysis ◽  
Wireless Sensor ◽  
Morphological Operation ◽  
Event Monitoring ◽  
Binary Images ◽  
Structuring Element

When monitoring the environment with wireless sensor networks, the data sensed by the nodes within event backbone regions can adequately represent the events. As a result, identifying event backbone regions is a key issue for wireless sensor networks. With this aim, we propose a distributed and morphological operation-based data collection algorithm. Inspired by the use of morphological erosion and dilation on binary images, the proposed distributed and morphological operation-based data collection algorithm calculates the structuring neighbors of each node based on the structuring element, and it produces an event-monitoring map of structuring neighbors with less cost and then determines whether to erode or not. The remaining nodes that are not eroded become the event backbone nodes and send their sensing data. Moreover, according to the event backbone regions, the sink can approximately recover the complete event regions by the dilation operation. The algorithm analysis and experimental results show that the proposed algorithm can lead to lower overhead, decrease the amount of transmitted data, prolong the network lifetime, and rapidly recover event regions.

Sign in / Sign up

Export Citation Format

Share Document