An optimal cluster formation based energy efficient dynamic scheduling hybrid MAC protocol for heavy traffic load in wireless sensor networks

Wireless sensor networks (WSNs) distribute hundreds to thousands of inexpensive micro-sensor nodes in their regions, and these nodes are important parts of Internet of Things (IoT). In WSN-assisted IoT, the nodes are resource constrained in many ways, such as storage resources, computing resources, energy resources, and so on. Robust routing protocols are required to maintain a long network lifetime and achieve higher energy utilization. In this paper, we propose a new energy-efficient centroid-based routing protocol (EECRP) for WSN-assisted IoT to improve the performance of the network. The proposed EECRP includes three key parts: a new distributed cluster formation technique that enables the self-organization of local nodes, a new series of algorithms for adapting clusters and rotating the cluster head based on the centroid position to evenly distribute the energy load among all sensor nodes, and a new mechanism to reduce the energy consumption for long-distance communications. In particular, the residual energy of nodes is considered in EECRP for calculating the centroid′s position. Our simulation results indicate that EECRP performs better than LEACH, LEACH-C, and GEEC. In addition, EECRP is suitable for networks that require a long lifetime and whose base station (BS) is located in the network.

An Efficient Centroid-Based Routing Protocol for Energy Management in WSN-Assisted IoT

Clustering Objectives in Wireless Sensor Networks: A Survey and Research Direction Analysis

A novel algorithm which combined the merits of the clustering strategy and the compressive sensing-based (CS-based) scheme was proposed in this paper. The lemmas for the relationship between any two adjacent layers, the optimal size of clusters, the optimal distribution of the cluster head (CH), and the corresponding proofs were presented first. In addition, to alleviate the “hot spot problem” and reduce the energy consumption resulted from the rotation of the role of CHs, a third role of backup CH (BCH) as well as the corresponding mechanism to rotate the roles between the CH and BCH were proposed. Subsequently, the energy-efficient compressive sensing-based clustering routing (EECSR) protocol was presented in detail. Finally, extensive simulation experiments were conducted to evaluate its energy performance. Comparisons with the existing clustering algorithms and the CS-based algorithm verified the effect of EECSR on improving energy efficiency and extending the lifespan of wireless sensor networks.

/pdf/an-energy-efficient-compressive-sensing-based-clustering-ozzw9gcupr.pdf

An Energy-Efficient Compressive Sensing-Based Clustering Routing Protocol for WSNs

Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision variables defined in the routing algorithm. The strengths and weaknesses of the choice of the decision variables used in the design of these energy-efficient and energy-balanced routing protocols are emphasised. Finally, we suggest possible research directions in order to optimize the energy consumption in sensor networks.

A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks.

The energy constraint is one of the inherent defects of the Wireless Sensor Networks (WSNs). How to prolong the lifespan of the network has attracted more and more attention. Numerous achievements have emerged successively recently. Among these mechanisms designing routing protocols is one of the most promising ones owing to the large amount of energy consumed for data transmission. The background and related works are described firstly in detail in this paper. Then a game model for selecting the Cluster Head is presented. Subsequently, a novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed. GEEC, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time. Finally, extensive simulation experiments are conducted. The experimental results indicate that a significant improvement in energy balance as well as in energy conservation compared with other two kinds of well-known clustering routing protocols is achieved.

A game theory based energy efficient clustering routing protocol for WSNs

The features that sensor nodes are powered by battery and have severe energy constraint make the design of energy-efficient protocol a key task for wireless sensor networks (WSNs). Clustering protocols significantly cut down the energy expenditure of each sensor node. However, hot spots problem occurs in locations close to the sink. Besides, it makes things worse if the nodes with less energy are selected as cluster heads (CHs), because they are often loaded heavier traffic than cluster members (CMs) due to their duty. The issues which exist in WSNs are proposed and the primary reason why cluster head election is hard to control is then presented. A mathematical model aiming to ease the hot spots problem via optimizing the cluster size is proposed and an optimal cluster size (OCS) algorithm is given firstly. Subsequently, an evolutionary game model for the sensor nodes to terminate the anarchism during the process of cluster head selection is presented, and a novel routing protocol named Energy Efficient Routing protocol based on Evolutionary Game (EEREG) theory is proposed. Finally, extensive simulation experiments and performance comparisons with the well-known hierarchical routing protocols are conducted. The experiment results show that a significant improvement in energy efficiency as well as lifetime extension is achieved.

https://journals.sagepub.com/doi/pdf/10.1155/2015/409503

An energy-efficient clustering routing protocol based on evolutionary game theory in wireless sensor networks

In VANETs, frequent beacon broadcasting can lead to high bandwidth consumption and channel congestion. In this paper, a position prediction based beacon approach is proposed to reduce beacon frequency and decrease bandwidth consumption. Vehicles track their neighbors using the predicted position instead of using periodic beacon broadcasting. Only when the prediction error is higher than a predefined tolerance will a beacon broadcasting be triggered. For improving the prediction accuracy, we classify the motion of vehicles into two typical patterns: a constant speed pattern and a maneuvering pattern. A maneuver detection module is responsible for recognizing current motion patterns, and a variable dimension filter that can switch dynamically between the two patterns is employed to generate high accurate position prediction. The simulation results show the proposed scheme can reduce significantly the number of beacons than three existing beacon approaches.

/pdf/position-prediction-based-frequency-control-of-beacons-in-4peqhfy84a.pdf

Position prediction based frequency control of beacons in vehicular ad hoc networks

Though the mostly used topologies in network-on-chip (NoC) based systems, mesh and torus can lead to a waste of resource and bandwidth when the processing elements(PEs) demand less communication, and fail to meet the requirements of PEs demanding mass communication since they connect all the PEs by the paths of the same type. In this paper, a configurable network and an efficient routing algorithm is designed so that the topology is regular and easy to expend while the adjustable density of transmission roads could satisfy the varied requirements of different PEs. Experimental results have shown that our design is more desirable in terms of network delay, power consumption and area cost among other important performance parameters of a network.

http://www.sersc.org/journals/IJFGCN/vol8_no1/3.pdf

Heterogeneous Honeycomb-like NoC Topology and Routing based on Communication Division

The issue “Sink’s Neighbor Problem” hinders the applications of Wireless Sensor Networks (WSNs). Owing to the heavier traffic burden they bear, the nodes close to the sink tend to dissipate their energy faster than others. They die earlier when their energy is used up. The energy efficiency is vital for WSNs because it is unpractical for the sensor nodes to be recharged. An Energy Efficient sink Deployment Scheme (EEDS) aiming at extending the lifespan for wireless sensor networks is proposed. It alleviates the energy consumption imbalance by adopting a mobile sink and regulating its route. Specifically speaking, a mobile sink moves in the monitor area with a certain rate and lingers at the fixed stops. During its move, the sensor nodes collect the data and store them in their memorizers. It is proved that the network lifetime is extended to be approximately six times compared with the static sink used only schemes via mathematical analysis. Besides, the scheme is extensible when the monitor area is enlarged. Finally, the energy efficiency of EEDS is evaluated through comparisons with the strategies only using static or mobile sinks. Experiment results show that EEDS has a good energy efficiency and can extend the network lifespan to be approximately 6 times compared with that of static-sink-used-only schemes. Besides, it is prolonged to be 148 percent of that of strategy using the mobile sink such as GMRE.

http://www.sersc.org/journals/IJFGCN/vol9_no8/8.pdf

Quan Wang

Papers

A game theory based energy efficient clustering routing protocol for WSNs

An energy-efficient clustering routing protocol based on evolutionary game theory in wireless sensor networks

Position prediction based frequency control of beacons in vehicular ad hoc networks

Heterogeneous Honeycomb-like NoC Topology and Routing based on Communication Division

An Energy Efficient Sink Deployment Scheme aiming at extending the Lifespan for Wireless Sensor Networks