scholarly journals Energy efficient clustering and routing optimization model for maximizing lifetime of wireless sensor network

Author(s):  
Savitha S. ◽  
S. C. Lingareddy ◽  
Sanjay Chitnis

Recently, the wide adoption of WSNs (Wireless-Sensor-Networks) is been seen for provision non-real time and real-time application services such as intelligent transportation and health care monitoring, intelligent transportation etc. Provisioning these services requires energy-efficient WSN. The clustering technique is an efficient mechanism that plays a main role in reducing the energy consumption of WSN. However, the existing model is designed considering reducing energy- consumption of the sensor-device for the homogenous network. However, it incurs energy-overhead (EO) between cluster-head (CH). Further, maximizing coverage time is not considered by the existing clustering approach considering heterogeneous networks affecting lifetime performance. In order to overcome these research challenges, this work presents an energy efficient clustering and routing optimization (EECRO) model adopting cross-layer design for heterogeneous networks. The EECRO uses channel gain information from the physical layer and TDMA based communication is adopted for communication among both intra-cluster and inter-cluster communication. Further, clustering and routing optimization are presented to bring a good trade-off among minimizing the energy of CH, enhancing coverage time and maximizing the lifetime of sensor-network (SN). The experiments are conducted to estimate the performance of EECRO over the existing model. The significant-performance is attained by EECRO over the existing model in terms of minimizing routing and communication overhead and maximizing the lifetime of WSNs.

WSN’s involve abundant sensor’s with inadequate power, which will dispatch the monitored information to the Base Station (BS) which needs extra energy. Clustering is a key strategy for enhancing the sensor network lifespan by diminishing the energy consumption. Energy competent clustering practice be supposed to be delineated for heterogeneous WSN. Effectiveness of heterogeneous protocols deteriorates while altering the heterogeneity. In this paper work, Distributed Energy Efficient Clustering (DEEC) was investigated first, at that point Threshold DEEC (TDEEC), Balanced Energy Efficient Network Integrated Super Heterogeneous (BEENISH) and Improved BEENISH (IBEENISH) under more than a few scenarios were examined and then outcomes were compared. In all four cases, Cluster Heads (CH’s) were preferred with respect to the remnant energy of sensor’s. Observations made thoroughly concerning the performance on the bases of network lifespan and packets received by the BS. IBEENISH performs superior than other existing protocols like DEEC, TDEEC and BEENISH.


Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.


2011 ◽  
Vol 216 ◽  
pp. 176-180
Author(s):  
Yong Ding ◽  
Yue Mei Su

Wireless Sensor Networks functionality is closely related to network lifetime which depends on the energy consumption, so require energy- efficient protocols to improve the network lifetime. According to the analysis and summary of the current energy efficient estimation algorithms in wireless sensor network An energy-efficient algorithm is proposed,. Then this optimization algorithm proposed in the paper is adopted to improve the traditional diffusion routing protocol. Simulation results show that this algorithm is to effectively balance the network energy consumption, improve the network life-cycle and ensure the communication quality.


Sign in / Sign up

Export Citation Format

Share Document