scholarly journals On Connectivity and Energy Efficiency for Sleeping-Schedule-Based Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (9) ◽  
pp. 2126 ◽  
Author(s):  
Lijun Wang ◽  
Jia Yan ◽  
Tao Han ◽  
Dexiang Deng

Based on the connectivity and energy consumption problems in wireless sensor networks, this paper proposes a kind of new network algorithm called the connectivity and energy efficiency (CEE) algorithm to guarantee the connectivity and connectivity probability, and also to reduce the network energy consumption as much as possible. Under the premise that all sensors can communicate with each other in a specific communication radius, we obtained the relationship among the connectivity, the number of sensor nodes, and the communication radius because of the theory of probability and statistics. The innovation of the paper is to maximize the network connectivity and connectivity probability, by choosing which types of sleeping nodes to wake up. According to the node’s residual energy and the relative value of distance, the algorithm reduces the energy consumption of the whole network as much as possible, and wakes up the number of neighbor nodes as little as possible, to improve the service life of the whole network. Simulation results show that this algorithm combines the connectivity and the energy efficiency, provides a useful reference value for the normal operation of the sensors networks.

2014 ◽  
Vol 666 ◽  
pp. 322-326
Author(s):  
Yu Yang Peng ◽  
Jae Ho Choi

Energy efficiency is one of the important hot issues in wireless sensor networks. In this paper, a multi-hop scheme based on a cooperative multi-input multi-outputspatial modulation technique is proposed in order to improve energy efficiency in WSN. In this scheme, the sensor nodes are grouped into clusters in order to achieve a multi-input multi-output system; and a simple forwarding transmission scenario is considered so that the intermediate clusters only forward packets originated from the source cluster down to the sink cluster. In order to verify the performance of the proposed system, the bit energy consumption formula is derived and the optimal number of hopsis determined. By qualitative experiments, the obtained results show that the proposed scheme can deliver the data over multiple hops consuming optimal energy consumption per bit.


2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.


Author(s):  
Ananda Kumar K S ◽  
Balakrishna R

At present day’s wireless sensor networks, obtain a lot consideration to researchers. Maximum number of sensor nodes are scattered that can communicate with all others. Reliable data communication and energy consumption are the mainly significant parameters that are required in wireless sensor networks. Many of MAC protocols have been planned to improve the efficiency more by enhancing the throughput and energy consumption. The majority of the presented medium access control protocols to only make available, reliable data delivery or energy efficiency does not offer together at the same time. In this research work the author proposes a novel approach based on Receiver Centric-MAC is implemented using NS2 simulator. Here, the author focuses on the following parametric measures like - energy consumption, reliability and bandwidth. RC-MAC provides high bandwidth without decreasing energy efficiency. The results show that 0.12% of less energy consumption, reliability improved by 20.86% and bandwidth increased by 27.32% of RC-MAC compared with MAC IEEE 802.11.


Sensors ◽  
2019 ◽  
Vol 19 (3) ◽  
pp. 561 ◽  
Author(s):  
Abdulmughni Hamzah ◽  
Mohammad Shurman ◽  
Omar Al-Jarrah ◽  
Eyad Taqieddin

In wireless sensor networks, the energy source is limited to the capacity of the sensor node’s battery. Clustering in WSN can help with reducing energy consumption because transmission energy is related to the distance between sender and receiver. In this paper, we propose a fuzzy logic model for cluster head election. The proposed model uses five descriptors to determine the opportunity for each node to become a CH. These descriptors are: residual energy, location suitability, density, compacting, and distance from the base station. We use this fuzzy logic model in proposing the Fuzzy Logic-based Energy-Efficient Clustering for WSN based on minimum separation Distance enforcement between CHs (FL-EEC/D). Furthermore, we adopt the Gini index to measure the clustering algorithms’ energy efficiency in terms of their ability to balance the distribution of energy through WSN sensor nodes. We compare the proposed technique FL-EEC/D with a fuzzy logic-based CH election approach, a k-means based clustering technique, and LEACH. Simulation results show enhancements in energy efficiency in terms of network lifetime and energy consumption balancing between sensor nodes for different network sizes and topologies. Results show an average improvement in terms of first node dead and half nodes dead.


2016 ◽  
Vol 850 ◽  
pp. 23-29
Author(s):  
Wen Zhi Zhu ◽  
Feng Xu

In wireless sensor networks, clustering class routing protocol is an important protocol type. Different clustering methods, and cluster head selection method directly affects the energy consumption of the entire network communication. This paper studies the effect of different partition methods of the network energy consumption, and to study the partitioning methods under the conditions of uneven distribution of nodes. We believe that energy efficiency clustering method should adapt the distributed of sensor nodes in order to improve energy efficiency. And according to the partition method we propose a low-power adaptive clustering routing protocol based on node distribution to partition. The protocol can effectively extend the lifetime of a wireless sensor network. Simulation results show that the proposed protocol can effectively prolong the network lifetime.


2020 ◽  
Vol 30.8 (147) ◽  
pp. 14-21
Author(s):  
Thanh Huong Nguyen ◽  
◽  
Dang Toan Dao ◽  

Energy efficiency is one of the important factors when exploiting Wireless Sensor Networks, especially for increasing lifespan and performance. In the network nowadays, the number of sensor nodes can reach hundreds or thousands and can be arranged in complex hierarchical architecture. Besides, the current sensor nodes have a small size, limited battery source but are operated in vast areas. The clustered-based method has been an effective and potentially extensible means of boosting the management and operation of such large-scale networks and minimizing the overall energy consumption. In this paper, the issue of arranging and routing the nodes in the sensor network in a hierarchical manner is investigated, in which each lowest level sensor nodes are grouped in a cluster with a common cluster head, then the cluster-head plays an intermediate role transmit the information back and forth between the sensor nodes and the base station. In this way, the route to exchange information can not only be optimized with respect to the distance but also for energy spent on the communication. In order to do so, this paper proposed a novel method based on a Genetic Algorithm to establish a routing protocol to achieve energy optimization. The results demonstrate that this approach can decrease the energy consumption according to the optimized routing through clustering and increase the performance superior to the other clustering schemes.


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.


Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.


2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.


Sign in / Sign up

Export Citation Format

Share Document