An Experimental Analysis of Modified EEECARP

Author(s):  
Venkata Ramana Sarella ◽  
Deshai Nakka ◽  
Sekhar B. V. D. S. ◽  
Krishna Rao Sala ◽  
Sameer Chakravarthy V. V. S. S.

Designing various energy-saving routing protocols for real-time internet of things (IoT) applications in modern secure wireless sensor networks (MS-WSN) is a tough task. Many hierarchical protocols for WSNs were not well scalable to large-scale IoT applications. Low energy adaptive two-level-CH clustering hierarchy (LEATCH) is an optimized technique reduces the energy-utilization of few cluster heads, but the LEATCH is not suitable for scalable and dynamic routing. For dynamic routing in MS-WSN, energy efficiency and event clustering adaptive routing protocol (EEECARP) with event-based dynamic clustering and relay communication by selecting intermediates nodes as relay-nodes is necessary. However, EEECARP cannot consider the hop-count, different magnitude ecological conditions, and energy wastage in cluster formation while collisions occur. So, the authors propose the modified EEECARP to address these issues for better dynamic event clustering adaptive routing to improve the lifetime of MS-WSNs. The experimental outcomes show that proposed protocol achieves better results than EEECARP and LEATCH.

2020 ◽  
pp. 479-493
Author(s):  
Venkata Ramana Sarella ◽  
P.V.G.D. Prasad Reddy ◽  
S. Krishna Rao ◽  
Preethi Padala

WSN is a promising approach for variety of different real time applications. Different Routing protocols for WSNs are very effective challenge in present days because of scalability, efficient energy utilization and robustness in large number of wireless sensor networks with consists of more number of sensor nodes. LEATCH is a traditional routing protocol for energy optimization in WSNs. However, LEATCH cannot scale performance for large scale wireless sensor networks and difficulty to apply effective utilization of real time wireless sensor networks. So, in this paper the authors propose to develop a novel Energy Efficiency and Event Clustering Adaptive Routing Protocol (EEECARP) for WSN. The main designing feature of their proposed approach is as follows: Energy Efficiency, Dynamic Event Clustering and multi hop relay configuration with residual energy available on relay nodes in wireless sensor networks. The simulation results show that authors' routing protocol achieves convenient and effective better performance in formation of clusters with relay sensor nodes in wireless sensor networks.


2020 ◽  
Author(s):  
Mohammad Alharbi ◽  
Mario Kolberg ◽  
Muhammad Zeeshan

Abstract Wireless sensor network (WSN)-based Internet of Things (IoT) applications suffer from issues including limited battery capacity, frequent disconnections due to multihop communication and a shorter transmission range. Researchers propose different but isolated clustering and routing solutions that are inefficient in terms of energy efficiency and network connectivity in IoT-based WSNs. In this work, we emphasize the importance of considering the context of IoT applications that have further requirements for dedicated data collection per node. We address two interlinked issues, clustering and routing, in a large-scale IoT-based WSN. We propose an improved clustering and routing (ICR) protocol to jointly solve both of these issues. Improved clustering and routing provide area-based clustering derived from the transmission range of network nodes. This clustering also develops a strong network backbone that provides fail-over-proof routing. An efficient routing path is achieved by finding the minimal hop count with the availability of alternate routing paths. The results are compared with state-of-the-art benchmark protocols, Joint Clustering and Routing (JCR), Low Energy Adaptive Hierarchical Clustering (LEACH) and other recent protocols. Theoretical and simulation results demonstrate reliable network topology, improved network lifetime, efficient node density management and improved overall network capacity.


2017 ◽  
Vol 25 (4) ◽  
pp. 125-138 ◽  
Author(s):  
Venkata Ramana Sarella ◽  
P.V.G.D. Prasad Reddy ◽  
S. Krishna Rao ◽  
Preethi Padala

WSN is a promising approach for variety of different real time applications. Different Routing protocols for WSNs are very effective challenge in present days because of scalability, efficient energy utilization and robustness in large number of wireless sensor networks with consists of more number of sensor nodes. LEATCH is a traditional routing protocol for energy optimization in WSNs. However, LEATCH cannot scale performance for large scale wireless sensor networks and difficulty to apply effective utilization of real time wireless sensor networks. So, in this paper the authors propose to develop a novel Energy Efficiency and Event Clustering Adaptive Routing Protocol (EEECARP) for WSN. The main designing feature of their proposed approach is as follows: Energy Efficiency, Dynamic Event Clustering and multi hop relay configuration with residual energy available on relay nodes in wireless sensor networks. The simulation results show that authors' routing protocol achieves convenient and effective better performance in formation of clusters with relay sensor nodes in wireless sensor networks.


2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Wei Zhou ◽  
Zilong Tan ◽  
Shaowen Yao ◽  
Shipu Wang

Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing table) based on the splay tree. This approach extends the Chord finger table with additional routing entries. Adaptive routing algorithm is proposed for implementation, and it can be shown that hop count is significantly minimized without introducing any other protocol overheads. We analyze the hop count of the adaptive routing algorithm, as compared to Chord variants, and demonstrate sharp upper and lower bounds for both worst-case and average case settings. In addition, we theoretically analyze the hop reducing in SChord and derive the fact that SChord can significantly reduce the routing hops as compared to Chord. Several simulations are presented to evaluate the performance of the algorithm and support our analytical findings. The simulation results show the efficiency of SChord.


2018 ◽  
Vol 6 (11) ◽  
pp. 163-171
Author(s):  
Tandra Mondal ◽  
Pranab Kumar Nag

In India, small and marginal farmers have emerged as a distinct and dominant category. While farm mechanization represents a rapid transformation from traditional to modern methods of farming, it is not uniform across the crops and regions. The level of mechanization, however, remains scattered due to the compulsiveness to the situation dominated by the economic layout of farm holdings, land size, and large-scale deprivation of access to the technology suitable to small holdings. This present contribution elucidates the extent of use tools and machinery among the rice farmers of the state of Wes Bengal, India. Analysis revealed that the total number of man-days involved in paddy cultivation was 120-140 per ha, i.e., 900-1000 man-hours depending upon the availability of labour, tools, and machinery used for the individual operation. Analysis of farm work in small and marginal holdings evolved that over 90% of the total number of farmers use either tractor or power tiller for land preparation. Use of the animal-drawn country plough is gradually phased out in the study regions. For sowing and transplanting operations are primarily manual methods using hand tools. The study provided an insight of the issues of work methods and practices of the farmworkers in small and marginal farm holdings.


Sign in / Sign up

Export Citation Format

Share Document