scholarly journals Trust Based Authentication Mechanism in Wireless Sensor Networks

2016 ◽  
Vol 12 (1) ◽  
pp. 58
Author(s):  
Li Ru Ping
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Exchange ◽  
Wireless Sensor ◽  
Network Nodes ◽  
Authentication Mechanism ◽  
Efficiency And Effectiveness ◽  
Evaluation Algorithm ◽  
History Of ◽  
Interaction History

Authentication mechanism is the basis of access control and data exchange. In wireless sensor networks, the vulnerability of network nodes and complexity of communication protocols pose a huge challenge for designing authentication mechanism in such environment. In this paper, we study the authentication mechanism in wireless sensor networks based on trust between nodes. We use the interaction history of nodes for recommendation trust computation, and the interaction history comes from the interactions between nodes. We design a penalty mechanism for hostile nodes based on the TCP congestion control protocol, and present a loyalty based trust recommendation evaluation algorithm. Massive experiments validate the efficiency and effectiveness of the proposed approach.

Applying Game Theory in Securing Wireless Sensor Networks by Minimizing Battery Usage

Game Theory ◽  
2017 ◽  
pp. 337-352
Author(s):  
Mehran Asadi ◽  
Afrand Agah ◽  
Christopher Zimmerman
Keyword(s):  
Game Theory ◽  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Network Nodes ◽  
Voltage Loss ◽  
History Of

In this chapter, the authors examine the impacts of applying game theory on the network throughput, network voltage loss, and accuracy of malicious node detection in wireless sensor networks. Nodes in a wireless sensor network use our proposed protocol when deciding whether or not to forward packets they receive from other sensors in order to conserve power. Wireless sensor network nodes achieve this by optimizing their decision-making based on a framework using game theory. Defining a suitable cost and profit for routing and forwarding incoming packets and keeping a history of past behaviors of non-cooperating nodes gradually forces malicious nodes out of the wireless sensor network.In this chapter, the authors examine the impacts of applying game theory on the network throughput, network voltage loss, and accuracy of malicious node detection in wireless sensor networks. Nodes in a wireless sensor network use our proposed protocol when deciding whether or not to forward packets they receive from other sensors in order to conserve power. Wireless sensor network nodes achieve this by optimizing their decision-making based on a framework using game theory. Defining a suitable cost and profit for routing and forwarding incoming packets and keeping a history of past behaviors of non-cooperating nodes gradually forces malicious nodes out of the wireless sensor network.

Applying Game Theory in Securing Wireless Sensor Networks by Minimizing Battery Usage

2014 ◽  
pp. 58-73
Author(s):  
Mehran Asadi ◽  
Afrand Agah ◽  
Christopher Zimmerman
Keyword(s):  
Game Theory ◽  
Wireless Sensor Networks ◽  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Network Nodes ◽  
Voltage Loss ◽  
History Of

In this chapter, the authors examine the impacts of applying game theory on the network throughput, network voltage loss, and accuracy of malicious node detection in wireless sensor networks. Nodes in a wireless sensor network use our proposed protocol when deciding whether or not to forward packets they receive from other sensors in order to conserve power. Wireless sensor network nodes achieve this by optimizing their decision-making based on a framework using game theory. Defining a suitable cost and profit for routing and forwarding incoming packets and keeping a history of past behaviors of non-cooperating nodes gradually forces malicious nodes out of the wireless sensor network.In this chapter, the authors examine the impacts of applying game theory on the network throughput, network voltage loss, and accuracy of malicious node detection in wireless sensor networks. Nodes in a wireless sensor network use our proposed protocol when deciding whether or not to forward packets they receive from other sensors in order to conserve power. Wireless sensor network nodes achieve this by optimizing their decision-making based on a framework using game theory. Defining a suitable cost and profit for routing and forwarding incoming packets and keeping a history of past behaviors of non-cooperating nodes gradually forces malicious nodes out of the wireless sensor network.

An Improved Cluster Key Management Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 998-999 ◽  
pp. 1092-1095
Author(s):  
Qi Sheng Zhao ◽  
Xiao Ming Liu ◽  
Hui Sheng Zhu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Authentication Mechanism ◽  
Management Algorithm ◽  
Management Scheme ◽  
Dynamic Key Management ◽  
Dynamic Key

The information security of wireless sensor networks is one of hot issues on the current research; this paper combines threshold key scheme with the management of security key sharing and group agreement and proposes dynamic key management scheme through clustering level key matrix of authentication mechanism from the cluster to node. The network is divided into different clusters, and the cluster head conducts the key authentication exchange and updates the key management with threshold key schemes, with no need of third authentication center, reduces the computing and communication costs, and promotes communication.

scholarly journals Cryptanalysis and Security Enhancement of Three Authentication Schemes in Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Wenting Li ◽  
Bin Li ◽  
Yiming Zhao ◽  
Ping Wang ◽  
Fushan Wei
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Access ◽  
Academic Community ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Time Data ◽  
Forward Secrecy ◽  
User Friendliness ◽  
Authentication Mechanism

Nowadays wireless sensor networks (WSNs) have drawn great attention from both industrial world and academic community. To facilitate real-time data access for external users from the sensor nodes directly, password-based authentication has become the prevalent authentication mechanism in the past decades. In this work, we investigate three foremost protocols in the area of password-based user authentication scheme for WSNs. Firstly, we analyze an efficient and anonymous protocol and demonstrate that though this protocol is equipped with a formal proof, it actually has several security loopholes been overlooked, such that it cannot resist against smart card loss attack and violate forward secrecy. Secondly, we scrutinize a lightweight protocol and point out that it cannot achieve the claimed security goal of forward secrecy, as well as suffering from user anonymity violation attack and offline password guessing attack. Thirdly, we find that an anonymous scheme fails to preserve two critical properties of forward secrecy and user friendliness. In addition, by adopting the “perfect forward secrecy (PFS)” principle, we provide several effective countermeasures to remedy the identified weaknesses. To test the necessity and effectiveness of our suggestions, we conduct a comparison of 10 representative schemes in terms of the underlying cryptographic primitives used for realizing forward secrecy.

scholarly journals Using Mobile Elements as Dynamic Bridges in Sparse Wireless Sensor Networks

2014 ◽  
pp. 107
Author(s):  
Hoang Dang Hai ◽  
Thorsten Strufe ◽  
Pham Thieu Nga ◽  
Hoang Hong Ngoc ◽  
Nguyen Anh Son ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Exchange ◽  
Data Transfer ◽  
Mobile Elements ◽  
Sensor Nodes ◽  
Pollution Monitoring ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Road Distance

Sparse  Wireless  Sensor  Networks  using several  mobile  nodes  and  a  small  number  of  static sensor  nodes  have  been  widely  used  for  many applications,  especially  for  traffic-generated  pollution monitoring.  This  paper  proposes  a  method  for  data collection and forwarding using Mobile Elements (MEs), which are moving on predefined trajectories in contrast to previous works that use a mixture of MEsand static nodes. In our method, MEscan be used as data collector as well as dynamic bridges for data transfer. We design the  trajectories  in  such  a  way,  that  they  completely cover  the  deployed  area  and  data  will  be  gradually forwarded  from  outermost  trajectories  to  the  center whenever  a  pair  of MEs contacts  each  other  on  an overlapping road distance of respective trajectories. The method  is based  on  direction-oriented  level  and  weight assignment.  We  analyze  the  contact  opportunity  for data  exchange  while MEs move.  The  method  has  been successfully tested for traffic pollution monitoring in an urban area.

Data Processing and Exchange Challenges in Video-Based Wireless Sensor Networks

2014 ◽  
pp. 196-215
Author(s):  
Dan Pescaru ◽  
Daniel-Ioan Curiac
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Processing ◽  
Data Exchange ◽  
Video Data ◽  
Wireless Sensor ◽  
Localization Algorithms ◽  
Innovative Solutions ◽  
Communication Efficiency ◽  
Specific Localization

This chapter presents the main challenges in developing complex systems built around the core concept of Video-Based Wireless Sensor Networks. It summarizes some innovative solutions proposed in scientific literature on this field. Besides discussion on various issues related to such systems, the authors focus on two crucial aspects: video data processing and data exchange. A special attention is paid to localization algorithms in case of random deployment of nodes having no specific localization hardware installed. Solutions for data exchange are presented by highlighting the data compression and communication efficiency in terms of energy saving. In the end, some open research topics related with Video-Based Wireless Sensor Networks are identified and explained.

scholarly journals A novel energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks

2017 ◽  
Vol 13 (7) ◽  
pp. 155014771771738 ◽  
Author(s):  
Min Wook Kang ◽  
Yun Won Chung
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Probabilistic Routing ◽  
History Of ◽  
Delay Tolerant ◽  
Overhead Ratio ◽  
Intermittently Connected

In delay-tolerant wireless sensor networks, messages for sensor data are delivered using opportunistic contacts between intermittently connected nodes. Since there is no stable end-to-end routing path like the Internet and mobile nodes operate on battery, an energy-efficient routing protocol is needed. In this article, we consider the probabilistic routing protocol using history of encounters and transitivity protocol as the base protocol. Then, we propose an energy-aware routing protocol in intermittently connected delay-tolerant wireless sensor networks, where messages are forwarded based on the node’s remaining battery, delivery predictability, and type of nodes. The performance of the proposed protocol is compared with that of probabilistic routing protocol using history of encounters and transitivity and probabilistic routing protocol using history of encounters and transitivity with periodic sleep in detail, from the aspects of delivery ratio, overhead ratio, delivery latency, and ratio of alive nodes. Simulation results show that the proposed protocol has better delivery probability, overhead ratio, and ratio of alive nodes, in most of the considered parameter settings, in spite of a small increase in delivery latency.

scholarly journals Balanced Transmissions Based Trajectories of Mobile Sink in Homogeneous Wireless Sensor Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Mariam Akbar ◽  
Nadeem Javaid ◽  
Wadood Abdul ◽  
Sanaa Ghouzali ◽  
Abid Khan ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Performance Metrics ◽  
Geometric Model ◽  
Data Gathering ◽  
Path Loss ◽  
Mobile Sink ◽  
Wireless Sensor ◽  
Network Nodes ◽  
Better Than

Mobile Sink (MS) based routing strategies have been widely investigated to prolong the lifetime of Wireless Sensor Networks (WSNs). In this paper, we propose two schemes for data gathering in WSNs: (i) MS moves on random paths in the network (RMS) and (ii) the trajectory of MS is defined (DMS). In both the schemes, the network field is logically divided into small squares. The center point of each partitioned area is the sojourn location of the MS. We present three linear programming based models: (i) to maximize network lifetime, (ii) to minimize path loss, and (iii) to minimize end to end delay. Moreover, a geometric model is proposed to avoid redundancy while collecting information from the network nodes. Simulation results show that our proposed schemes perform better than the selected existing schemes in terms of the selected performance metrics.

Sign in / Sign up

Export Citation Format

Share Document