Oppo-Flood: An Energy-Efficient Data Dissemination Protocol for Asynchronous Duty-Cycled Wireless Sensor Networks

Data dissemination from multiple sources to mobile sinks is fundamental and challenging in WSN applications due to limited energy supply of sensor nodes and sink mobility. Previous data dissemination protocols either rely on an energy-consuming coordinate system or build an inefficient backbone. In this paper, we propose a hierarchical role-based data dissemination (HRDD) protocol in wireless sensor networks. In HRDD, a small number of sensor nodes are assigned to serve as cluster heads and agents to form the data dissemination backbone and mitigate unnecessary query forwarding. In addition, HRDD designs an efficient data delivery mechanism that provides shorter paths to accelerate data delivery as well as reduce the number of data transmissions. An adaptive backbone maintenance mechanism is also introduced for low-energy cluster heads and agents to reduce their load, thereby prolonging the network lifetime. The experimental results show that HRDD achieves the longer network lifetime, the shorter delay, and the high success ratio compared to the prior work.

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.

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.

One of the major challenges in facing the design of disseminating protocol for Wireless Sensor Networks (WSNs) is to find an energy efficiency way. Recently, several researches have been studied for this issue, and SPMS, that outperforms the well-known protocol SPIN, specially is a representative protocol. Also one of many characters of SPMS is the using of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a novel data dissemination protocol, called Energy and Distance Aware protocol based on SPIN (EDAS), that guarantees energy-efficient data transmission and maximizes network lifetime. EDAS solves the network lifetime problem by using the residual energy and the efficient distance between nodes to determine a path for data dissemination. The simulation results show that EDAS guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 69% than that of SPMS.KeywordsWireless Sensor NetworksData Dissemination ProtocolEnergy EfficiencyLifetimeSPMS

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

Energy saving to prolong the network life is an important design issue while developing a new routing protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a homogeneous network architecture, in which all sensors have the same capabilities in terms of battery power, communication, sensing, storage, and processing. Recently, there has been an interest in heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal nodes are elected with the help of a probability scheme based on residual and average energy of the normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a round. Advanced nodes use a separate probability based scheme for cluster head election and they will further act as a gateway for normal cluster heads and transmit their data load to base station when they are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during cluster formation phase to save network energy. The performance of EACP is compared with SEP and simulation result shows the better result for stability period, network life and energy saving than SEP.

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.

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.

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

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

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.

A Bloom filters based dissemination protocol in wireless sensor networks

Many receiver-based Preamble Sampling Medium Access Control (PS-MAC) protocols have been proposed to provide better performance for variable traffic in a wireless sensor network (WSN). However, most of these protocols cannot prevent the occurrence of incorrect traffic convergence that causes the receiver node to wake-up more frequently than the transmitter node. In this research, a new protocol is proposed to prevent the problem mentioned above. The proposed mechanism has four components, and they are Initial control frame message, traffic estimation function, control frame message, and adaptive function. The initial control frame message is used to initiate the message transmission by the receiver node. The traffic estimation function is proposed to reduce the wake-up frequency of the receiver node by using the proposed traffic status register (TSR), idle listening times (ILTn, ILTk), and “number of wake-up without receiving beacon message” (NWwbm). The control frame message aims to supply the essential information to the receiver node to get the next wake-up-interval (WUI) time for the transmitter node using the proposed adaptive function. The proposed adaptive function is used by the receiver node to calculate the next WUI time of each of the transmitter nodes. Several simulations are conducted based on the benchmark protocols. The outcome of the simulation indicates that the proposed mechanism can prevent the incorrect traffic convergence problem that causes frequent wake-up of the receiver node compared to the transmitter node. Moreover, the simulation results also indicate that the proposed mechanism could reduce energy consumption, produce minor latency, improve the throughput, and produce higher packet delivery ratio compared to other related works.