An entropy coding based hybrid routing algorithm for data aggregation in wireless sensor networks

Author(s):  
Zhenzhong Huang ◽  
Jun Zheng
2020 ◽  
pp. 221-237
Author(s):  
Nandkumar Prabhakar Kulkarni ◽  
Neeli Rashmi Prasad ◽  
Ramjee Prasad

Researchers have faced numerous challenges while designing WSNs and protocols in numerous applications. Amongst all sustaining connectivity and capitalizing on the network lifetime is a serious deliberation. To tackle these two problems, the authors have considered Mobile Wireless Sensor Networks (MWSNs). In this paper, the authors put forward an Evolutionary Mobility aware multi-objective hybrid Routing Protocol for heterogeneous wireless sensor networks (EMRP). EMRP selects the optimal path from source node to sink by means of various metrics such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The Performance of EMRP when equated with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing Algorithm (DyMORA) using parameters such as Average Residual Energy (ARE), Delay and Normalized Routing Load. EMRP improves AES by a factor of 4.93% as related to SHRP and 5.15% as related to DyMORA. EMRP has a 6% lesser delay as compared with DyMORA.


Author(s):  
Gopikrishnan S. ◽  
Priakanth P.

Energy efficient data aggregation is a key solution to enhance the lifetime of wireless sensor networks since sensor nodes are battery-powered and deployed in remote environments. This article explore a two-hop data aggregation tree construction algorithm using binary search tree to reduce the total energy consumption of sensor nodes in wireless sensor networks. An adaptive and hybrid routing algorithm for simultaneous data aggregation and exploit the data correlation between nodes using the two-hop data aggregation tree framework is proposed. Routes are chosen based on the shortest response time for the broadcasting request to minimize the total energy expended by the network. This paper also proposes a high secure asymmetric key cryptography algorithm to provide the secure data communication among the network. The data aggregation function that is used in the proposed routing algorithm enhances the lifetime of sensor network by resolving the delay, collision and security issues. Simulations results show that the binary tree based data aggregation can appreciably reduces the total energy consumption and resolves the maximum data aggregation issues in wireless sensor network.  


2012 ◽  
Vol 35 (9) ◽  
pp. 1056-1063 ◽  
Author(s):  
Ahmed E.A.A. Abdulla ◽  
Hiroki Nishiyama ◽  
Nei Kato

2017 ◽  
Vol 4 (3) ◽  
pp. 17-32 ◽  
Author(s):  
Nandkumar Prabhakar Kulkarni ◽  
Neeli Rashmi Prasad ◽  
Ramjee Prasad

Researchers have faced numerous challenges while designing WSNs and protocols in numerous applications. Amongst all sustaining connectivity and capitalizing on the network lifetime is a serious deliberation. To tackle these two problems, the authors have considered Mobile Wireless Sensor Networks (MWSNs). In this paper, the authors put forward an Evolutionary Mobility aware multi-objective hybrid Routing Protocol for heterogeneous wireless sensor networks (EMRP). EMRP selects the optimal path from source node to sink by means of various metrics such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The Performance of EMRP when equated with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing Algorithm (DyMORA) using parameters such as Average Residual Energy (ARE), Delay and Normalized Routing Load. EMRP improves AES by a factor of 4.93% as related to SHRP and 5.15% as related to DyMORA. EMRP has a 6% lesser delay as compared with DyMORA.


Sign in / Sign up

Export Citation Format

Share Document