PSAP-WSN:A Provably Secure Authentication Protocol for 5G-Based Wireless Sensor Networks

Nowadays,the widespread application of 5G has promoted rapid development in different areas,particularly in the Internet of Things(IoT),where 5G provides the advantages of higher data transfer rate,lower latency,and widespread connections.Wireless sensor networks(WSNs),which comprise various sensors,are crucial components of IoT.The main functions of WSN include providing users with real-time monitoring information,deploying regional information collection,and synchronizing with the Internet.Security in WSNs is becoming increasingly essential because of the across-the-board nature of wireless technology in many fields.Recently,Yu et al.proposed a user authentication protocol forWSN.However,their design is vulnerable to sensor capture and temporary information disclosure attacks.Thus,in this study,an improved protocol called PSAP-WSNis proposed.The security of PSAP-WSN is demonstrated by employing the ROR model,BAN logic,and ProVerif tool for the analysis.The experimental evaluation shows that our design is more efficient and suitable forWSN environments.

Enhanced Metaheuristics with Trust Aware Route Selection for Wireless Sensor Networks

Recently,a trust system was introduced to enhance security and cooperation between nodes in wireless sensor networks(WSN).In routing,the trust system includes or avoids nodes related to the estimated trust values in the routing function.This article introduces Enhanced Metaheuristics with Trust Aware Secure Route Selection Protocol(EMTA-SRSP)for WSN.The presented EMTA-SRSP technique majorly involves the optimal selection of routes in WSN.To accomplish this,the EMTA-SRSP technique involves the design of an oppositional Aquila optimization algorithm to choose safe routes for data communication.For the clustering process,the nodes with maximum residual energy will be considered cluster heads(CHs).In addition,the OAOA technique gets executed to choose optimal routes based on objective functions with multiple parameters such as energy,distance,and trust degree.The experimental validation of the EMTA-SRSP technique is tested,and the results exhibited a better performance of the EMTA-SRSP technique over other approaches.

Energy-Efficient Routing Protocol with Multi-Hop Fuzzy Logic for Wireless Networks

A Wireless Sensor Network(WSN)becomes a newer type of real-time embedded device that can be utilized for a wide range of applications that make regular networking which appears impracticable.Concerning the energy produc-tion of the nodes,WSN has major issues that may influence the stability of the system.As a result,constructing WSN requires devising protocols and standards that make the most use of constrained capacity,especially the energy resources.WSN faces some issues with increased power utilization and an on going devel-opment due to the uneven energy usage between the nodes.Clustering has proven to be a more effective strategy in this series.In the proposed work,a hybrid meth-od is used for reducing the energy consumption among CHs.A Fuzzy Logic-based clustering protocol FLUC(unequally clustered)and Fuzzy Clustering with Energy-Efficient Routing Protocol(FCERP)are used.A Fuzzy Clustering with Energy Efficient Routing Protocol(FCERP)reduces the WSN power usage and increases the lifespan of the network.FCERP has created a novel cluster-based fuzzy routing mechanism that uses a limit value to combine the clustering and multi-hop routing capabilities.The technique creates uneven groups by using fuz-zy logic with a competitive range to choose the Cluster Head(CH).The input variables include the distance of the nodes from the ground station,concentra-tions,and remaining energy.The proposed FLUC-FCERP reduces the power usage and improves the lifetime of the network compared with the existing algorithms.

A Contention-Based MAC and Routing Protocol for Wireless Sensor Network

Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.

Prediction-based protocol for mobile target tracking in wireless sensor networks

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.

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.

AZR-LEACH: An Energy Efficient Routing Protocol for Wireless Sensor Networks

Reducing the energy consumption of available resources is still a problem to be solved in Wireless Sensor Networks (WSNs). Many types of existing routing protocols are developed to save power consumption. In these protocols, cluster-based routing protocols are found to be more energy efficient. A cluster head is selected to aggregate the data received from root nodes and forwards these data to the base station in cluster-based routing. The selection of cluster heads should be efficient to save energy. In our proposed protocol, we use static clustering for the efficient selection of cluster heads. The proposed routing protocol works efficiently in large as well as small areas. For an optimal number of cluster head selection we divide a large sensor field into rectangular clusters. Then these rectangular clusters are further grouped into zones for efficient communication between cluster heads and a base station. We perform MATLAB simulations to observe the network stability, throughput, energy consumption, network lifetime and the number of cluster heads. Our proposed routing protocol outperforms in large areas in comparison with the LEACH, MH-LEACH, and SEP routing protocols.

Analysis and Improvement on Routing Protocols for Wireless Sensor Networks

Routing protocols are perceived to be growing hotspots and required to devote more time and work to studying it. Research on routing protocols of wireless sensor networks is significantly important to accurately guide the application. Theoretical analysis and comparison are one of the key steps in the protocol research. Restricted by irreversible factors of power and others, lifetime of wireless sensor networks is very short. In this paper, we analyze and compare the characteristics and application fields of existing protocols. On the basis of that, this paper mainly proposes an improved directed diffusion exploring the phase of reinforcing path, which chooses the way to strengthen the path after evaluating the critical factors. It was determined by simulation that improved directed diffusion has a higher transmission rate, and it satisfies the requirements, which balancing the energy consumption and prolonging the lifetime.

Trust management-based and energy efficient hierarchical routing protocol in wireless sensor networks

The single planar routing protocol has a slow convergence rate in the large-scale Wireless Sensor Network(WSN).Although the hierarchical routing protocol can effectively cope with large-scale application scenarios,how to elect a secure cluster head and balance the network load becomes an enormous challenge.In this paper,a Trust Management-based and Low Energy Adaptive Clustering Hierarchy protocol(LEACH-TM)is proposed.In LEACH-TM,by using the number of dynamic decision cluster head nodes,residual energy and density of neighbor nodes,the size of the cluster can be better constrained to improve energy efficiency,and avoid excessive energy consumption of a node.Simultaneously,the trust management scheme is introduced into LEACH-TM to defend against internal attacks.The simulation results show that,compared with LEACH-SWDN protocol and LEACH protocol,LEACH-TM outperforms in prolonging the network lifetime and balancing the energy consumption,and can effectively mitigate the influence of malicious nodes on cluster head selection,which can greatiy guarantee the security of the overall network.

Multi-Gradient Routing Protocol for Wireless Sensor Networks

Sensor networks tend to support different traffic patterns since more and more emerging applications have diverse needs. We present MGRP, a Multi-Gradient Routing Protocol for wireless sensor networks, which is fully distributed and efficiently supports endto-end, one-to-many and many-to-one traffic patterns by effectively construct and maintain a gradient vector for each node. We further combine neighbor link estimation with routing information to reduce packet exchange on network dynamics and node failures. We have implemented MGRP on Tiny OS and evaluated its performance on real-world testbeds. The result shows MGRP achieves lower end-to-end packet delay in different traffic patterns compared to the state of the art routing protocols while still remains high packet delivery ratio.

Problem of Standardization of Configuration Data in Wireless Sensor Networks: The Case of Routing Protocols

The exploitation of Wireless Sensor Networks (WSN) is constrained by limited power, low computing power and storage and short-range radio transmission. Many routing protocols respecting these constraints were developed but, it still lacks formal and standardized solutions being able to help in their configuration. The configuration management that responds to this concern is very important in this type of network. It consists of the definition of data models to configure and is very necessary for the good network performance. Tangible results were obtained in traditional networks with the emergence of NETCONF and YANG standards, but on the best of our humble knowledge there are none yet in WSNs. We propose in this paper wsn-routing-protocol, a YANG data model for routing protocols configuration in WSNs. Following our model, we propose two YANG configuration data models based on the latter: they are respectively aodv for AODV and rpl for RPL.

Energy-Efficient and Reliable Transport Protocols for Wireless Sensor Networks: State-of-Art

New wireless sensor network applications (e.g., military surveillance) require higher reliability than a simple best effort service could provide. Classical reliable transport protocols like Transmission Control Protocol (TCP) are not well suited for wireless sensor networks due to both the characteristics of the network nodes (low computing power, strong energy constraints) and those of the main applications running on those nodes (low data rates). Recent researches present new transport protocols for wireless sensor networks providing various type of reliability and using new mechanisms for loss detection and recovery, and congestion control. This paper presents a survey on reliable transport protocol for WSNs.

BEAR: A Balanced Energy-Aware Routing Protocol for Wireless Sensor Networks

Energy aware routing protocols can be classified into energy saver and energy manager. Energy saver protocols decrease energy consumption totally. Most of them try to find the shortest path between source and destination to reduce energy consumption. But energy manager protocols balance energy consumption in network to avoid network partitioning. Finding best route only based on energy balancing consideration may lead to long path with high delay and decreases network lifetime. On the other hand, finding best route only with the shortest distance consideration may lead to network partitioning. This paper improves SEER [1] routing protocol. Traditional SEER is only energy saver and has poor idea about energy balancing. Our proposed protocol, named BEAR, considers energy balancing and optimal distance both. It finds a fair tradeoff between energy balancing and optimal distance by learning automata concept. We simulate and evaluate routing protocols by Glomosim [2] simulator.

Tree Based Energy and Congestion Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) have inherent and unique characteristics rather than traditional networks. They have many different constraints, such as computational power, storage capacity, energy supply and etc;of course the most important issue is their energy constraint. Energy aware routing protocol is very important in WSN, but routing protocol which only considers energy has not efficient performance. Therefore considering other parameters beside energy efficiency is crucial for protocols efficiency. Depending on sensor network application, different parameters can be considered for its protocols. Congestion management can affect routing protocol performance. Congestion occurrence in network nodes leads to increasing packet loss and energy consumption. Another parameter which affects routing protocol efficiency is providing fairness in nodes energy consumption. When fairness is not considered in routing process, network will be partitioned very soon and then the network performance will be decreased. In this paper a Tree based Energy and Congestion Aware Routing Protocol (TECARP) is proposed. The proposed protocol is an energy efficient routing protocol which tries to manage congestion and to provide fairness in network. Simulation results shown in this paper imply that the TECARP has achieved its goals.

Energy efficient mechanism using flexible medium access control protocol for hybrid wireless sensor networks

Energy efficiency is a primary consideration in a wireless sensor network (WSN). This is also a major parameter when designing a medium access control (MAC) protocol for WSNs. Hierarchical clustering structure is regarded suitable for WSNs due to its good performance in energy conservation. In this work, an adequately flexible mechanism for clustering WSNs is designed, in which some creative or promotional metrics are utilized, such as cluster head selection algorithm, cluster optional reconstruction, interested data transmission, multiple path routing protocol. All these strategies were cooperated to maximize energy saving of whole system. An appropriate MAC protocol for this mechanism is proposed, by flexibly switching the status of diverse sensor nodes in different strategies. The simulation results show that the proposed MAC protocol is suitable for clustering WSNs and performs well in aspects of energy efficiency, flexibility and scalability.

An Energy-Aware Routing Protocol Based on Effective Transmission in Sensor Networks

In order to minimize the energy consumption in the discovery of the routing path, this paper introduces a novel concept of effective transmission （ET） that ensures each forwarding node is not only farther from the source node, but also nearer to the destination node with respect to its sender, An energ-aware routing protocol based on ET is proposed. It enables the energy consumption for each hop to be the least for the transmission. The simulation results show the routing protocol is effective in the performance of energy consumption comparing with some other routing protocols.

FEAR: Fuzzy-Based Energy Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are used in different civilian, military, and industrial applications. Recently, many routing protocols have been proposed attempting to find suitable routes to transmit data. In this paper we propose a Fuzzy Energy Aware tree-based Routing (FEAR) protocol that aims to enhance existing tree-based routing protocols and prolong the network’s life time by considering sensors’ limited energy. The design and implementation of the new protocol is based on cross-layer structure where information from different layers are utilized to achieve the best power saving. Each node maintains a list of its neighbors in order to use neighbors’links in addition to the parent-child links. The protocol is tested and compared with other tree-based protocols and the simulation results show that FEAR protocol is more energy-efficient than comparable protocols. According to the results FEAR protocol saves up to 70.5% in the number of generated control messages and up to 55.08% in the consumed power.

A synchronous duty-cycled reservation based MAC protocol for underwater wireless sensor networks

To design an energy-efficient Medium Access Control(MAC)protocol for the Underwater Wireless Sensor Networks(UWSNs)is an urgent research issue since depleted batteries cannot be recharged or replaced in the underwater environment.Moreover,the underwater acoustic channels are affected by hindrances such as long propagation delay and limited bandwidth,which appear in the design of the MAC protocol for the UWSNs.The available MAC protocols for the terrestrial wireless sensor networks exhibit low performance in energy efficiency,throughput and reliability in the UWSNs,and cannot be used in the UWSNs directly because of their unique characteristics.This paper proposes a synchronous duty-cycled reservation-based MAC protocol named Ordered Contention MAC(OCMAC)protocol.The basic mechanism of this protocol is to schedule data transmission by transmitters through the scheduling of Ready To Send(RTS)frames.The protocol eliminates the possible collision during data transmission and improves communication efficiency.The paper analyzes the performance in energy efficiency,throughput and reliability of the protocol by modeling the queuing behavior of OCMAC with a Markov Chain process.Furthermore,the analytical model is validated through a simulation study.The analysis results demonstrated that while providing good throughput and reliability,OCMAC can achieve energy saving.

Data Concurrent Transmission MAC Protocol for Application Oriented Underwater Acoustic Sensor Networks

With the increasing demand for marine exploration, underwater acoustic sensor networks (UASNs) are prone to have the characteristics of large-scale, long term monitoring, and high data traffic load. Underwater media access control (MAC) protocols, which allow multiple users to share the common medium fairly and efficiently, are essential for the performance of UASNs. However, the design of MAC protocols is confronted with the challenges of spatial unfairness, data eruption, and low energy efficiency. In this paper, we propose a novel data concurrent transmission (DCT) MAC protocol, which is able to exploit long propagation delay and conduct concurrent transmission. Specifically, we present the theoretical performance analysis of the proposed MAC protocol in detail and give an analytical solution of the success concurrent transmission probability between nodes. In addition, simulation results are provided to demonstrate that our proposed protocol is appropriate for UASNs and can significantly improve the performance in terms of network throughput and energy consumption. Finally, we give some typical future applications of UASNs and discuss the demands on MAC protocol design.

Multihop Deterministic Energy Efficient Routing Protocol for Wireless Sensor Networks MDR

The inception of Wireless Sensor Networks (WSN) has brought convenience into many lives with uninterrupted wireless network. The nodes that transmit data consist of heterogeneous and battery equipped sensor nodes (SNs) that are deployed randomly for network surveillance. To manage the random deployment of nodes, clustering algorithms are used with efficient routing protocols. This results in aggregation and dropping of redundant data packets that enables flawless data transmission from cluster nodes to Base Station (BS) via Cluster Heads (CHs). In this paper, a dynamic and multi-hop clustering and routing protocol for thorough behavior analysis is proposed, taking distance and energy into consideration. This forms a smooth routing path from the cluster nodes, CHs, Sub-CHs to the BS. On comparing proposed process with the existing system, experimental analysis shows a significant enhancement in the performance of network lifetime, with improved data aggregation, throughput, as the protocol showing deterministic behavior while traversing the network for data transmission, we name this protocol as Multi-hop Deterministic energy efficient Routing protocol (MDR).