Low energy fixed clustering algorithm (LEFCA) for wireless sensor networks

Wireless sensor networks (WSNs) have become an important part of our lives as they can be used in vast application areas from disaster relief to health care. As a consequence, the life span and the energy consumption of a WSN have become a challenging research area. According to the existing studies, instead of using direct transmission or multihop routing, clustering can significantly reduce the energy consumption of sensor nodes and can prolong the lifetime of a WSN. In this paper, we propose a low energy fixed clustering algorithm (LEFCA) for WSNs. With LEFCA, the clusters are constructed during the set-up phase. A sensor node which becomes a member of a cluster stays in the same cluster throughout the life span of the network. LEFCA not only improves the lifetime of the network but also decreases the energy dissipation significantly.

Automatic localization is one of the major issues in Wireless Sensor Networks (WSN). DV-hop algorithm is a well-known localization algorithm in WSN but with limited localization accuracy. In this paper, an improved DV-hop localization algorithm in hybrid optical wireless sensor networks is proposed based on the optimization of the parameters in WSN. Various factors that affect the localization accuracy of the DV-hop algorithm in WSN are investigated, including the communication radius of the node, the number of beacon nodes and the number of the total nodes. As the DV-hop algorithm is applied into hybrid optical sensor and WSNs (O-WSN) with rectangular topology, different parameters have to be optimized accordingly. Simulation results show that the square topology outperforms the rectangle topology more than 45 % under the same network parameters using the improved DV-hop algorithm. Therefore another improved DV-hop called Sub-Square Weighted DV-hop (SSW DV-hop) is proposed for the rectangle topology. Both simulation and experiment results demonstrate that applying the SSW DV-hop algorithmin O-WSNs could significantly improve the localization accuracy.

The mismatch of task scheduling results in rapid network energy consumption during data transmission in wireless sensor networks. To address this issue, the paper proposed an Energy-consumption Optimization-oriented Task Scheduling Algorithm (EOTS algorithm) which formally described the overall power dissipation in the network system. On this basis, a network model was built up such that both the idle energy consumption in sensor nodes and energy consumption during the execution of tasks were taken into account, with which the whole task was effectively decomposed into sub-task sequences. They underwent simulated annealing and iterative refinement, with the intention of improving sensor nodes’ utilization rate, reducing local idle energy cost, as well as cutting down the overall energy consumption accordingly. The experiment result shows that under the environment of multi-task operation, from the perspective of energy cost optimization, the proposed scheduling strategy recorded an increase of 21.24% compared with the FIFO algorithm, and an increase of 16.77% in comparison to the EMRSA algorithm; while in light of network lifetimes, the EOTS algorithm surpassed the ECTA algorithm by a gain of 19.21%. Therefore, the effectiveness of the proposed EOTS algorithm is verified.

Sensors are capable of performing different tasks such as receiving various environmental information and have generated the idea of creating and expanding the traditional networks to Wireless Sensor Networks (WSN). A WSN include various sensor nodes which are distributed in the environment to gather data. The sensor node’s location is not necessarily defined and not specified. Such a feature allows us to release them in hazardous or inaccessible places. On the other hand, this means that the WSN protocols and algorithms must have the ability to self-deny. Other unique features of WSNs are the ability of sensor nodes to collaborate and coordinate with each other. A processor is assigned to each sensor node which initially performs a series of acquired simple information processing to transmits the semi-processed data instead of sending all raw data to the center, Base Station (BS) or the sink node. Fault detections in WSN are of particular importance due to unique technical and conceptual challenges. In this paper, due to the specific limitations and operating conditions of wireless sensor networks, different fault detection algorithms were examined. The best way to improve the ability of fault detection is to reduce energy consumption in sensor nodes. In such techniques, using the residue number system in the wireless sensor network structure improves repair and fault detection. Moreover, modules are attached whenever we require distinguishing and correcting the information security in the number system. Although there are various algorithms yet the Residue Number System algorithm has higher performance.

Sensor nodes are small and low-cost portable devices that are connected wirelessly to form a wireless sensor network. Sensor nodes are typically powered by a chemical battery source that has a load-dependent finite lifetime. Most applications require wireless sensor networks to operate reliably for an extended period of time beginning with their deployment. To ensure both the longevity of a wireless sensor network via power management techniques and development of a self-powered sensor node, it is important to understand a sensor node’s operational energy consumption. It is well understood that wireless sensor network lifetime has a strong functional dependence on sensor node lifetime. This paper presents the development of a stochastic model to capture the expected energy consumption of a schedule-driven sensor node per cycle of operation by utilizing renewal theory, random stopping criteria, and Wald’s inequality. The model captures the expected energy consumed due to generic operation of a schedule-driven sensor node when an external event occurs (i.e., node level activities) and energy consumed due to carrier sense multiple access/collision avoidance medium access control protocol (i.e., retransmission attempts, channel listening, and other network level activities). The stochastic energy model is used to compute the expected lifetime and cycle lifetime of the sensor node. This paper also computes the deterministic energy bounds corresponding to the minimum and maximum energy consumption of a sensor node per cycle of operation. Analytical and numerical model validations are performed and presented.

The wireless sensor networks (WSNs) are usually deployed among widely area for environmental monitoring, data collection and other applications. In order to reduce the energy consumption and extend the lifetime of WSNs, as well as receive the data quickly, a source-based data aggregation algorithm (SBDA) for clustering wireless sensor networks is proposed. The method aggregated the data from sensor nodes and marked different transmission priority for the data. Simulation results show that, compared to existing protocols, the proposed method achieves a longer life time, and a lower packet drop ratio.

Wireless sensor networks (WSNs) have potential applications in environment monitoring, military surveillance, disaster systems, healthcare and many other areas. Clustering sensor nodes is an effective topology control method to reduce energy consumption of the sensor nodes for maximising network lifetime. However, cluster heads bear some extra load for data collection, data aggregation and communication of the aggregated data to the base station. Therefore, balancing the load of the cluster heads is a challenging issue for the long run operation of the WSNs. In this paper, we first present a centralised algorithm called centralised energy efficient load balancing algorithm (CELBA) that addresses the issues of energy consumption of the sensor nodes and the load balancing of the cluster heads. We next extend our work to propose a distributed version of the CELBA, called distributed energy efficient load balancing algorithm (DELBA) for the same purpose. Simulation results demonstrate that the proposed algorithms perform better than the existing approaches.

One major challenge in sensor networks is to maximize network life under the constraint of extremely limited power supply. Thus, two important design issues of routing and data-gathering protocols are 1) minimizing energy consumption in sensor nodes and 2) adapting to node failures. This paper studies two tree-based data gathering protocols, based on distributed versions of shortest path tree (SPT) and maximum leaf tree (MLT) algorithms. Furthermore, the two distributed algorithms are extended to be dynamic and robust. A localized tree-reconstruction scheme, localized flooding algorithm, is added to handle joining and leaving (death) of sensor nodes. Accurate energy consumption has been modeled for both leaf-nodes and intermediate nodes, when sending and receiving control and data packets. The resulting dynamic algorithms are fast to adapt network changes. Performance is evaluated through detailed simulation. Comparing with MLT, due to its simplicity and smaller number of control message exchanges, SPT achieves better energy efficiency and less delay in tree constructions, data transmissions, and dynamic tree reconstructions

Wireless sensor networks area collection of a large number of unattended sensor nodes. The sensor nodes are dynamically deployed in the region. In wireless sensor networks, the unlicensed sensor nodes use their temporarily available vacant licensed channels or spectrum band in a telecommunication network. The many open challenges with issues such as adaptive in self-organisation, fault-tolerance and network scalability with cooperative spectrum sensing and sharing are identifying new challenges in wireless sensor networks. In this paper, we proposed the bio-inspired adaptive routing algorithm for cognitive radio wireless sensor networks. The utilisation of the foraging approach of ANTs and BEEs for making the decision of using the available spectrum sensing and sharing of channels over multi-hops communication, provides the method to utilise idle channel and decrease the delay for communication in wireless sensor network. In this paper, we design the algorithm to solve the issue of wireless sensor network and performance of classical routing protocol LEACH and cognitive radio sensor networks (CRSN) evaluates the parameters which proof the self-organisation routing algorithm.

Radio transmission and reception consumes a lot of energy in a wireless sensor network (WSN), which are made of low-cost, low-power, small in size, and multifunctional sensor nodes. Thus, one of the important issues in wireless sensor network is the inherent limited battery power within the sensor nodes. Therefore, battery power is crucial parameter in the algorithm design in maximizing the lifespan of sensor nodes. It is also preferable to distribute the energy dissipated throughout the wireless sensor network in order to maximize overall network performance. Much research has been done in recent years in the area of low power routing protocol, but, there are still many design options open for improvement, and for further research targeted to the specific applications, need to be done. In this paper, we propose a new approach of an energy-efficient homogeneous clustering algorithm for wireless sensor networks in which the lifespan of the network is increased by ensuring a homogeneous distribution of nodes in the clusters. In this clustering algorithm, energy efficiency is distributed and network performance is improved by selecting cluster heads on the basis of (i) the residual energy of existing cluster heads, (ii) holdback value, and (iii) nearest hop distance of the node. In the proposed clustering algorithm, the cluster members are uniformly distributed and the life of the network is further extended.

A large number of small sensors in wireless sensor network are battery-powered; one of the most important design criteria for this type of network is energy efficiency. Clustering provides an effective way for extending the lifetime of a sensor network. In this paper, we propose a maximum-votes and load-balance clustering algorithm (VLCA) for wireless sensor network Each sensor collects votes from their neighbors and calculates the total vote received. The more votes a sensor accumulates, the more important it is in the whole network During the clustering phase, sensors compete with each other based on the total votes each has received. The algorithm is completely distributed, locating-unaware and independent of network size and topology. Simulation results show that our VLCA can reduce the number of clusters by 20-50% and prolong the lifetime of a sensor network.

Limited battery power directly affects the performance and survival time of sensor networks. In this study, solar energy was used to provide additional energy for sensor nodes, and a clustering algorithm for heterogeneous wireless sensor networks (WSNs) based on a solar energy supply is proposed. A cluster head is selected on the basis of the self-replenishment state and the remaining energy of the nodes. A cluster-head selection mechanism and network layer multi-hop routing are adopted to balance the energy consumption of the network. A set of experiments showed that the proposed algorithm can effectively prolong the network lifetime, improve the stability and efficiency of the network, and balance the energy consumption compared with other algorithms under the same environmental energy supply.

One of the main emphases of the prevalent clustering and routing algorithms in wireless sensor networks is efficient energy utilization aimed towards enhanced network lifetime. In this paper we are proposing a clustering approach where the sensor nodes are clustered together based on a defined spatial correlation and the geographical location of each sensor nodes. The Cluster Head or Cluster Leader along with routing path is decided by our proposed algorithm based on the estimated chance-value during each rounds of data transfer. Thus in our scheme a multi-hop routing is effected wherein either two-level or three-level hops are dynamically chosen based on the spatial correlation existing between the nodes for the data transfer from the sensing node to the sink. It has been observed that our proposed algorithm outperforms the standard algorithms namely Low Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP) and Distributed Energy Efficient Clustering (DEEC) Protocol with regards to system throughput and Network Lifespan of WSN.

Wireless Sensor Networks (WSNs) applications have attracted attention in Internet of Things (IoT) as a novel networking paradigm consisting of billions of small sensor nodes. These sensors collect environmental information and communicate with each other to provide solutions for real time IoT applications' requirements. Since the majority of applications require location-based services, it is necessary to improve the accuracy of localization algorithms. DV-Hop is one of the most attractive range-free localization algorithms in wireless sensor networks and several works have been undertaken to improve its accuracy, however, since sensor nodes have limited power resources, the energy consumption of nodes should be also considered. In this paper, we propose a method based on DV-Hop to improve both accuracy and power consumption. Each unknown node calculates the Hopsize of each anchor node according to the limited information it has from the network topology; therefore there is no need to broadcast the Hopsize from anchor nodes, and in this way energy can be saved. In the next step, we use Shuffled Frog Leaping Algorithm (SFLA) as an evolutionary algorithm to improve the accuracy of estimated Hopsizes and a hybrid Genetic-PSO algorithm is applied to the third step of DV-Hop to achieve more accurate values for unknown nodes' positions. Simulation results show that our proposed method decreases the localization error significantly by jointly considering the energy consumption of sensors and is overall 44% more accurate than DV-Hop.

Energy-efficient optimization algorithm in wireless sensor network (WSN) is often based on solely cluster routing or multi-hop routing. The cluster optimization algorithm will form a cluster network by dividing the sensor nodes into few clusters where each cluster has a cluster head (CH) for data collection. On the other hand, multi-hop optimization algorithm will form a multi-hop network by transmitting data to base station (BS) through data multi-hopping between sensor nodes. However, cluster optimization algorithm suffers from the overburdens of CH nodes, while multi-hop optimization algorithm suffers from the overburdens of nodes which are near to the BS. Therefore, Genetic Algorithm-Cuckoo Search (GACS) is proposed and developed based on the multi-hop clustering model in this paper. GACS optimizes both intra-cluster and inter-cluster communications to enhance energy efficiency in WSN, extending the network lifetime. Based on the performance evaluation, GACS outperforms both Genetic Algorithm (GA)-based cluster optimization algorithm and Cuckoo Search (CS)-based multi-hop optimization algorithm.