scholarly journals Efficient & Reliable Algorithm for Route Selection in A Wireless Sensor Networks

Author(s):  
Shivani Namala

Abstract: The routing schemes in Wireless Sensor Network (WSN) systems are performed among the groups of different clusters. The node works for data aggregation from the source nodes and they also perform data dissemination and network management and events sensing and information collecting in the neighbourhood. Many clustering topologies have been proposed in recent years to localize the route within the cluster itself. In this work, it has been reviewed and compared these topologies to find out the network mechanism which is easier to manage and scalable for getting high quality response with respect to dynamics of the environment.

2021 ◽  
pp. 1-11
Author(s):  
Shu Zhang ◽  
Jianhua Chen

 This paper analyzes the security algorithm and energy cost of wireless sensor networks in depth, and designs and implements a series of energy-optimized security solutions to ensure the secure establishment and operation of wireless sensor networks. This paper proposes an improved Ad hoc network routing protocol based on energy control. It introduces a low-energy balanced routing algorithm to reduce routing transmission energy consumption, balance network traffic, and improve the energy control performance of network routing protocols. The protocol uses a cross-layer design in this way, the route selection combines the information of the link the remaining energy. A joint function is formed by the transmit power level remaining energy. The joint function of all nodes on the path is used as the basis for route selection and applied to the route discovery stage. At the same time, the protocol introduces edge degree parameters in the establishment process, the idea of minimum energy consumption path and the introduction of energy consumption ratio parameters in the cluster skull backbone network generation process are adopted to realize the energy optimization of the path establishment process. At the same time, the protocol uses the message interaction mechanism in the path establishment process to implement a node security authentication scheme based on secret shared information without adding any routing communication messages, which effectively prevents the passive and active attacks of the attacker on the network. The results of simulation experiments prove that the secure routing protocol achieves the network’s balanced energy consumption while ensuring the secure communication of the network, and solves the energy problem.


2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.


2021 ◽  
Vol 40 (5) ◽  
pp. 8727-8740
Author(s):  
Rajvir Singh ◽  
C. Rama Krishna ◽  
Rajnish Sharma ◽  
Renu Vig

Dynamic and frequent re-clustering of nodes along with data aggregation is used to achieve energy-efficient operation in wireless sensor networks. But dynamic cluster formation supports data aggregation only when clusters can be formed using any set of nodes that lie in close proximity to each other. Frequent re-clustering makes network management difficult and adversely affects the use of energy efficient TDMA-based scheduling for data collection within the clusters. To circumvent these issues, a centralized Fixed-Cluster Architecture (FCA) has been proposed in this paper. The proposed scheme leads to a simplified network implementation for smart spaces where it makes more sense to aggregate data that belongs to a cluster of sensors located within the confines of a designated area. A comparative study is done with dynamic clusters formed with a distributive Low Energy Adaptive Clustering Hierarchy (LEACH) and a centralized Harmonic Search Algorithm (HSA). Using uniform cluster size for FCA, the results show that it utilizes the available energy efficiently by providing stability period values that are 56% and 41% more as compared to LEACH and HSA respectively.


Sign in / Sign up

Export Citation Format

Share Document