Provably Secure Dynamic Anonymous Authentication Protocol for Wireless Sensor Networks in Internet of Things

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.

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 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.

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.

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

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(WSN) are a kind of communication networks with in-dependent sensor nodes which could construct multi-hop ad hoc network to trans-fer data. The transport protocols for Wireless Sensor Network play an important role to promote the performance of the whole systems. This paper proposes a modified transport layer protocol for heterogeneous Wireless Sensor Networks(HWSN). As TCP is not suitable to use in HWSN directly, we design a modified transport protocol(named mTCP) based on TCP by a six-state finite state machine. Experimental results illustrate that our design can improve the communication capability of the transmission layer in heterogeneous wireless sensor networks significantly.

The existing routing protocols for wireless sensor networks were not reasonable in design, which limited their application. Most of the existing studies did not take into account the energy consumption of the network and the balanced use of the energy of sensor nodes, which led to the unsatisfactory application effect of wireless sensor networks in some fields. Therefore, from the perspective of energy balance in wireless sensor networks, this paper proposed a construction method of an energy balance routing protocol in wireless sensor networks based on a fuzzy control strategy. Firstly, based on the analysis of the basic composition of wireless sensor networks and the structure of sensor nodes, this paper expounded the basic process of wireless data transmission and summarized the classification and characteristics of routing protocols in wireless sensor networks from different angles. Secondly, according to the node data transmission characteristics of wireless sensor networks, the energy balance use model of sensor nodes was established, and the design method of the energy balance routing protocol based on fuzzy control strategy was proposed, and the data transmission link was optimized. Finally, through experimental comparative analysis, the results showed that the energy balanced routing protocol proposed in this paper can effectively realize the energy balanced use of the network data transmission process. Compared with other common routing protocols, the wireless sensor network routing protocol proposed in this paper can not only improve the data transmission efficiency and reduce the data redundancy but also save energy consumption and prolong the network running time. The design method of routing protocol proposed in this paper will be conducive to the optimization and application of routing protocol in wireless sensor networks and provide a theoretical basis for the related research of wireless sensor networks.

The Internet of things is playing more and more important role in smart healthcare, smart grids, and smart transportation, and using wireless sensor network (WSN), we can easily obtain and transmit information. However, the data security and users’ privacy are the biggest challenges for WSN because sensor nodes have low computing power and low storage capacity and are easy to be captured, and wireless networks are vulnerable. In 2021, Shuai et al. proposed a lightweight three-factor anonymous authentication scheme for WSN. However, we found that their protocol is vulnerable to stolen-verifier attack, modification of messages’ attack, and no perfect forward secrecy. Then, a new three-factor anonymous authentication scheme using elliptic curve cryptography (ECC) is proposed. Through informal and formal security analyses, our scheme can resist various known attacks and maintains low computational complexity.

Classical clustering protocols in wireless sensor networks (WSNs) assume that all nodes are equipped with the same amount of energy. As a result, they cannot take full advantage of the presence of node heterogeneity. In this study, a stable and energy‐efficient clustering (SEEC) protocol for heterogeneous WSNs is proposed. In addition, the extension to multi‐level of SEEC is presented. It depends on the network structure that is divided into clusters. Each cluster has a powerful advanced node and some normal nodes deployed randomly in this cluster. In the multi‐level architectures, more powerful supper nodes are assigned to cover distant sensing areas. Each type of nodes has its role in the sensing, aggregation or transmission to the base station. At each level of heterogeneity, the optimum number of powerful nodes that achieves the minimum energy consumption of the network is obtained. The proposed protocol is a heterogeneous awareness to prolong the stability period, which is crucial for many applications. The performance of the proposed protocol is compared by existing homogeneous and heterogeneous protocols. Simulation results show that the proposed protocol provides a longer stability period, more energy efficiency and higher average throughput than the existing protocols.

Improved sensor localization with intelligent trust model in heterogeneous wireless sensor network in Internet of Things (IoT) environment

A prediction based energy-efficient target tracking protocol in wireless sensor networks (PET) was proposed for tracking a mobile target in terms of sensing and communication energy consumption. In order to maximize the lifetime of a wireless sensor network (WSN), the volume of messages and the time for neighbor discovery operations were minimized. The target was followed in a special region known as a face obtained by planarization technique in face-aware routing. An election process was conducted to choose a minimal number of appropriate sensors that are the nearest to the target and a wakeup strategy was proposed to wakeup the appropriate sensors in advance to track the target. In addition, a tracking algorithm to track a target step by step was introduced. Performance analysis and simulation results show that the proposed protocol efficiently tracks a target in WSNs and outperforms some existing protocols of target tracking with energy saving under certain ideal situations.

Wireless sensor networks are a new emerging area where swarm intelligence can be applied with interesting implications. In fact, a strong analogy between unicellular organism colonies and wireless sensor networks can be emphasized: a sensor network can be viewed as a “colony” of simple, scarce resource nodes that, autonomously, are able only to perform simple tasks, but all together can accomplish very complex problems. In this paper we propose a routing protocol for multisink Wireless Sensor Networks with interesting properties: self organization, fault tolerance and environmental adaptation. The proposed protocol was inspired by the well known behavior (in artificial life studies) of “Slime Mold”. Such colony of unicellular organisms organizes itself in clusters by pheromone generation and evaporation mechanisms. In a similar manner our protocol manages the data traffic towards multiple sink nodes using the gradient concept and reaching high levels of autonomy and fault tolerance. We analyze the proposed protocol to examine the performances, the signalling overhead and the adaptation properties to environmental changes or nodes faults using simulation techniques.

In wireless sensor networks, prolonging the life time is an important research topic. Based on the study of LEACH protocol and EEUC protocol, a novel zone-divided and energy-balanced clustering routing protocol for wireless sensor networks (ZECR) is brought up. The protocol divides the area into several zones according to the distance, and uses the unequal clustering method among these zones to solve the hot spots problem caused by multi-hop mechanism. In the cluster head election phase, only the nodes that meet the energy standard can participate in the competition; in the inter-cluster multi-hop routing phase, the cluster heads with high residual energy in high energy region will be selected as the relay node based on the advantages of zone-divided. Simulation results show that the protocol can effectively balance the energy consumption of each part of the network, solve the hot spots problem, apply to the energy heterogeneous network and prolong the network life time obviously.