Analysis of security protocols for Wireless Sensor Networks

Sensor networks are one of the fastest growing areas in broad wireless ad hoc networking field. A sensor node, typically, contains signal-processing circuits, micro-controllers and a wireless transmitter/receiver antenna. Energy saving is one of the critical issue for sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Routing schemes are used to transfer data collected by sensor nodes to base stations. In the literature many routing protocols for wireless sensor networks are suggested. In this work, four routing protocols for wireless sensor networks viz. flooding, Gossiping, GBR and LEACH have been simulated using TinyOS and their power consumption is studied using PowerTOSSIM. A realization of these protocols has been carried out using Mica2 Motes.

In monitoring wireless sensor networks (WSNs) with event-driven applications, the generated traffic usually has bursty characteristics when an event occurs. Transient congestion in the networks would increase delay and packet loss rate severely, reducing the network performance greatly. Through the analysis on delay and packet loss rate in congestion, this paper proposes a congestion-aware mac protocol (C-MAC) for wireless sensor networks. In C-MAC, backoff delay of the nodes around contention area is adopted as a congestion indication. In normal state, the CSMA/CA is working well at sensor nodes. And when the congestion occurs, localized TDMA replaces the CSMA/CA in the congestion nodes. With the above mechanism, the congestion nodes only deliver their data during its assigned slots to control the contention overhead. Finally, we implement the C-MAC in our sensor network testbed. The experiment results show that the proposed MAC protocol could effectively operate on the congestion caused by burst information, and reduce both the delay and packet loss rate significantly.

Wireless sensor networks are a promising application of the Internet of Things in the sustainable development of smart cities, and have been afforded significant attention since first being proposed. Authentication protocols aim to protect the security and confidentiality of legitimate users when accessing and transmitting data. However, existing protocols may suffer from one or more security flaws. Recently, Butt et al. proposed an energy-efficient three-factor authentication protocol for wireless sensor networks. However, their protocol is vulnerable to several attacks, and lacks certain security properties. In this paper, the causes of these design flaws are analyzed. Furthermore, we propose a novel three-factor authentication protocol (password, smart card, and biometric information) for wireless sensor networks in Internet of Things contexts. A dynamic anonymous strategy is designed to prevent privacy disclosure and to resist sensor node capture attacks, tracking attacks, and desynchronization attacks. The Find–Guess model and random oracle model are combined to prove the security of the proposed protocol. A comparative analysis with related schemes shows that the proposed protocol has higher security and is able to maintain a low computational overhead.

Wireless sensor networks congestion occurs easily due to its centralized traffic pattern. Normally, mono-sync wireless sensor network experiences multiple traffic flow congestion in the dense environment of the network, which leads to excess energy consumption and severe packet loss. To overcome these issues, a congestion detection and alleviation mechanism using cluster based heuristic optimized hierarchical routing protocol is proposed in this paper. Here, congestion detection and alleviation utilize the features of sensor nodes. The congestion is categorized into two types: (i) node level congestion and (ii) link level congestion. The node level congestion is detected by assessing the buffer utilization and the interval amid the consecutive data packets. The link level congestion is considered with computing link usage utilizing back-off step of round robin carrier sense multi-access with collision avoidance. Congestion detection and alleviation reactively affected node/link through cuckoo hosted rider search multi-hop routing algorithm. It has two phases: the cluster head selection and multi-path routing. Cluster head selection is performed through Taylor multiple random forest kernel fuzzy C-means clustering algorithm and multi-path routing is performed through cuckoo hosted rider search multi-hop routing algorithm. The simulation of the proposed method is done in network simulator tool. Here, the performance metrics, like packet delivery ratio, delay, energy consumption, packet drop, overhead, network lifetime and throughput are calculated. The experimental outcomes of the proposed technique shows 11.6%, 18.4% and 28.1% lower delay, 78.2%, 65.4% and 52.6% higher packet delivery ratio, and 29.2%, 37.4% and 40.8% lower packet drop compared with the existing methods, like congestion detection and alleviation using multi-attribute decision-making in optimization-based hybrid congestion alleviation routing protocol in wireless sensor networks, congestion detection and alleviation using hybrid K-means with greedy best first search algorithms in packet rate reduction utilizing adaptive weight firefly algorithm ant colony optimization based routing protocol in wireless sensor networks and congestion detection and alleviation using multi-input time on task optimization algorithm for altered gravitational search algorithm routing protocol in wireless sensor networks.

QoSNET: An integrated QoS network for routing protocols in large scale wireless sensor networks

Underwater Sensor Networks (UWSNs) are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node mobility, high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. The communication range of underwater wireless sensor networks (UWSNs) is limited, and the nodes are equipped with limited power battery whose replacement is expensive due to underwater harsh environment. Moreover, the networks including small number of nodes have communication problems for long ranges. In this paper, we evaluate the performance of three classical location-based routing protocols (namely, VBF, HH-VBF, and VBVA) for underwater wireless sensor networks in terms of three critical performance metrics for dynamic network topology. Our comparison includes energy consumption, end-to-end delay, and packet delivery ratio.

Wireless sensor networks with node calculation ability is weak, node power (battery provides) Limited, routing algorithm of wireless sensor networks should be the energy saving and simple algorithm. Ant colony algorithm shows good search results in the discrete solution space. This paper improves the ant colony optimization algorithm. The paper presents analysis of routing protocols for wireless sensor networks based on improved ant colony optimization algorithm, and the simulation results verify the effectiveness of the improved algorithm.

Wireless Sensor Networks (WSNs) play a necessary position in todays actual world applications. WSNs are a team of autonomous sensor nodes that are geographically distributed to accumulate information and monitor events. WSNs are similarly sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor information can be transported via wireless. Sometimes called dust network, minute sensors as small as dust referring to smart dust. WSNs are spatially distributed two to screen or bodily temperature, sound, pressure, etc. and to cooperatively ignore their data via the network to different locations. Each such sensor network node has typically various parts. Routing in WSNs in one of the important technique, because all node executes its battery power, if may be one node failure it collapse entire networks. Routing in WSNs is in reality difficult due to the intrinsic characteristics that differentiate these networks from different networks. The plan of routing protocols in WSN is affected via number of exigent factors. In this paper, a review on routing protocols for Wireless Sensor Networks (WSNs) and performance of its execution.

An energy-balancing, cross-layer data gathering protocol (EB-CLDG) for wireless sensor networks (WSNs) is presented in this paper. EB-CLDG is proposed for monitoring and periodic reporting applications and the network is organized into concentric tiers around the sink. An energy-balancing clustering algorithm is employed to mitigate the “hot spot” problem. Thus the number of clusters closer to the sink node is bigger than those farther away from sink node, the inner cluster heads(CHs) can reduce the energy consumption within a cluster and preserve more energy for inter-cluster data relaying. In addition to, the MAC and routing of networks are integrated to minimize the protocol overhead. The scheme of synchronization within a cluster can not only synchronize sleep schedule to ensure data deliveries among neighbor nodes but also avoid energy waste for following and maintaining unnecessary schedules. And the scheme of invitation is employed to make collision-free within a cluster, which can reduce the density of contending nodes and the collisions of traffic being probably temporal correlation. Simulation results show that EB-CLDG leads to more uniform energy dissipation and prolongs the lifetime of network than S-MAC.

The optimized link state routing (OLSR) protocol is widely used in wireless ad hoc networks. With OLSR, only one routing path from source to destination is established at a time. However, links of wireless networks are very unreliable, and network topologies might vary rapidly. These features may cause frequent data retransmissions or the route rebuilding. Hence, improving the network throughput becomes a big challenge. This paper designs a new high-throughput routing protocol (HTRP) for wireless sensor networks, which combines the OLSR protocol with opportunistic routing and network coding. Opportunistic routing is able to leverage the wireless channel's characteristic of broadcasting and opportunistically deliver data through multiple routing paths. And OLSR can provide the information about network topologies and other parameters that opportunistic routing needs but cannot gain by itself. We evaluate the performance through both simulation and empirical experiments. The throughput of the HTRP is more than 10× and 2× of the OLSR protocol respectively in simulation and experiments.

In this study, the authors propose a mobility-based clustering (MBC) protocol for wireless sensor networks with mobile nodes. In the proposed clustering protocol, a sensor node elects itself as a cluster-head based on its residual energy and mobility. A non-cluster-head node aims at its link stability with a cluster head during clustering according to the estimated connection time. Each non-cluster-head node is allocated a timeslot for data transmission in ascending order in a time division multiple address (TDMA) schedule based on the estimated connection time. In the steady-state phase, a sensor node transmits its sensed data in its timeslot and broadcasts a joint request message to join in a new cluster and avoid more packet loss when it has lost or is going to lose its connection with its cluster head. Simulation results show that the MBC protocol can reduce the packet loss by 25% compared with the cluster-based routing (CBR) protocol and 50% compared with the low-energy adaptive clustering hierarchy-mobile (LEACH-mobile) protocol. Moreover, it outperforms both the CBR protocol and the LEACH-mobile protocol in terms of average energy consumption and average control overhead, and can better adapt to a highly mobile environment.

We propose a pseudo-random asynchronous duty cycle MAC protocol in wireless sensor networks. The proposed protocol adopts a hash function to determine the next wake-up times. As the next wake-up times are known in advance, the sensor nodes do not need to remain active until their intended receivers wake up. Given an end-to-end delay requirement, the proposed protocol significantly decreases energy consumption by reducing the idle listening time.

Wireless sensor networks, a distributed network of sensor nodes perform critical tasks in many application areas such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. The routing protocols developed for these distributed sensor networks need to be energy efficient and scalable. To create a better understanding of the performance of various routing protocols proposed it is very important to perform a detailed analysis of them. Network simulators enable us to study the performance and behavior of these protocols on various network topologies. Many Sensor Network frameworks were developed to explore both the networking issues and the distributed computing aspects of wireless sensor networks. The current work of simulation study of routing protocols is done on SensorSimulator, a discrete event simulation framework developed at Sensor Networks Research Laboratory, LSU and on a popular event driven network simulator ns2 developed at UC Berkeley. SensorSimulator is a discrete event simulation framework for sensor networks built over OMNeT++ (Objective Modular Network Test-bed in C++). This framework allows the user to debug and test software for distributed sensor networks. SensorSimulator allows developers and researchers in the area of Sensor Networks to investigate topological, phenomenological, networking, robustness and scaling issues, to explore arbitrary algorithms for distributed sensors, and to defeat those algorithms through simulated failure. The framework has modules for all the layers of a Sensor Network Protocol stack. This thesis is focused on the simulation and performance evaluation of various routing protocols on SensorSimulator and ns2. The performance of the simulator is validated with a comparative study of Directed Diffusion Routing Protocol on both ns2 and SensorSimulator. Then the simulations are done to evaluate the performance of Optimized Broadcast Protocols for Sensor Networks, Efficient Coordination Protocol for Wireless Sensor Networks on SensorSimulator. Also a performance study of Random Asynchronous Wakeup protocol for Sensor Networks is done on ns2.

In wireless sensor networks, MAC protocol is used to achieve efficient, fair and balanced allocation of wireless channel resources and access control of nodes in the network, and to control the communication process of nodes in the network. The energy consumption of wireless sensor nodes is mainly concentrated in the communication unit, including: data transceiver, idle listening, protocol control overhead, etc. A good MAC protocol is beneficial to reduce unnecessary energy consumption and enhance node life time. At the same time, MAC protocol, as the bottom protocol of wireless sensor network, provides a stable and reliable communication foundation for the realization of the upper protocol. Therefore, a large number of scholars at home and abroad have carried out extensive and in-depth research on MAC layer protocol of network. In this paper, the research process and progress of MAC layer protocol in wireless sensor networks are analyzed, and the research progress of MAC layer protocol in multi-radio frequency and multi-channel wireless sensor networks is analyzed.

Wireless Sensor Networks is a promising prototype of networking and computing, where a node may be self powered and individual node have the capability to sense and compute and communicate. Wireless Sensor Networks have been proposed for variety of applications such as Industrial control and monitoring and Home automation and Consumer electronics and Security and Military sensing, Asset tracking and supply chain management, Intelligent Agriculture, Missile directing, Fire alarming, Landslide Warning, Environmental monitoring and health monitoring and commercial applications. In Wireless Sensor Network large number of nodes are deployed randomly. Depends on the network architecture the application may be personalized such as Energy Efficiency, Routing and Power Management and data dissemination. Energy efficiency is one critical issue for sensor networks because many sensors are equipped with batteries that have limited life time. In this paper, Energy efficient routing protocol for wireless sensor networks using spatial correlation based medium access control protocol compared with IEEE 802.11 is proposed. A model for WSN is proposed using spatial correlation based collaborative medium access control (CC-MAC) with AODV and DSR. Simulation results have been obtained by using Ns2. From the results, the performance of AODV is better compared to the other protocol as DSR also AODV and DSR performance are compared using CCMAC and IEEE 802.11.