scholarly journals An Energy-Efficient Mobile Sink based Clustering using Simulated Annealing for Traversing

Author(s):  
Shubhangi Jadon

Abstract: Over recent decades, both scientific and commercial societies have been seeing the progress of wireless sensor networks (WSNs). Clustering is the most common form of growing WSN lifetime. The optimal number of cluster heads (CHs) & structure of clusters are the main problems in clustering techniques. The paper focuses on an efficient CH preference mechanism that rotates CH between nodes amid a greater energy level than others. Original energy, residual energy as well as the optimum value of CHs is assumed to be used by the algo for the choice of the next category of IoT-capable network cluster heads including ecosystem control, smart cities, or devices. The updated version of K-medium algo k-means++. Meanwhile, Simulated Annealing is implemented as the shortest path tree for mobile nodes which is constructed to establish the connection between the nodes for finding the shortest and secure path for data transmission hence resulting in faster data sending and receiving process. Keywords: WSN, CH selection, Residual energy (RE), Network Lifetime, Energy-efficient (EE)

2012 ◽  
Vol 182-183 ◽  
pp. 823-828
Author(s):  
Xiang Ping Gu ◽  
Rong Lin Hu

ECRPW (energy-efficient clustering routing protocol based on weight) routing protocol is presented to avoid the characteristic of limited energy for wireless sensor networks. It takes nodes’ residual energy into consideration during the process of cluster heads being elected. The constraint of distance threshold is used to optimize cluster scheme. Furthermore, it also sets up the routing tree based on cluster heads’ weight. We simulate and analyze LEACH and ECRPW in NS2. The results show that the performance of ECRPW is better than LEACH.


2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.


2017 ◽  
Vol 16 (5) ◽  
pp. 6913-6919
Author(s):  
Ramandeep Kaur ◽  
Dinesh Kumar

The lower cost and easier installation of the WSNs than the wired counterpart pushes industry and academia to pay more attention to this promising technology. Large scale networks of small energy-constrained sensor nodes require techniques and protocols which are scalable, robust, and energy-efficient. The most efficient approach provided by clustering the nodes is hierarchy. The one node will send the data to another node and the another node will send to its neightbouring node. In smart cities, wireless sensor networks (WSNs) act as a type of core infrastructure that collects data from the city to implement smart services. Our thesis work included the region based clustering, cluster head selection and energy efficient communication using static base station and movable mobile nodes. Since it was earlier proposed that clustering improves the network lifetime. We modified the region based clustering by dividing the network area into n regions with cluster head chosen for each region and proposed a new method for cluster head selection having less computational complexity. It was also found that the modified approach has improved performance to that of the other clustering approaches. We have used the mobile nodes for each section with controlled trajectory path as a reference to compare the performance of each of the clustering methods.


Author(s):  
A. Sangeetha ◽  
T. Rajendran

As the advent of new technologies grows, the deployment of mobile ad hoc networks (MANET) becomes increasingly popular in many application areas. In addition, all the nodes in MANET are battery operated and the node mobility affects the path stability and creates excessive traffic leads to higher utilization of energy, data loss which degrades the performance of routing. So, in this paper we propose Levenberg–Marquardt logistic deep neural learning based energy efficient and load balanced routing (LLDNL-EELBR) which is a machine learning method to deeply analyze the mobile nodes to calculate residual load and energy and it also uses logistic activation function to select the mobile node having higher residual energy and residual load to route the data packet. Experimental evaluations of three methods (LLDNL-EELBR, multipath battery and mobility-aware routing scheme (MBMA-OLSR) and opportunistic routing with gradient forwarding for MANETs (ORGMA)) were done and the result reveals that LLDNL-EELBR method is able to increase the through put and minimizes the delay and energy consumption in MANET when compared to works under consideration.<br /><div> </div>


2018 ◽  
Vol 14 (9) ◽  
pp. 155014771880062 ◽  
Author(s):  
Yourui Huang ◽  
Zhenping Chen ◽  
Tao Han ◽  
Xiaotao Liu

Aimed at the limited energy supply and imperfect topological tolerance for underground wireless sensor networks, one energy-efficient random-walk scale-free topology model is proposed in this article, and a power network topology structure with adjustable rate index gets generated. At first, the network is divided into several clusters, and the cluster heads are selected with the use of random-walk strategy. During the growth of the network, with the introduction of preferred connection for scale-free network, together with considering both the node’s residual energy and the distance among nodes, nodes with larger residual energy present higher connectivity probability, so that the energy balance of the network gets realized. Simulation results show that the communication among the cluster heads selected by the proposed random-walk scale-free topology model presents not only the power-law characteristics of scale-free networks but also has better stability, higher fault tolerance, and it can still balance the energy consumption for nodes and the network and therefore can prolong the lifetime of the network.


2011 ◽  
Vol 216 ◽  
pp. 621-624
Author(s):  
Xin Lian Zhou ◽  
Jian Bo Xu

This paper first proposed an energy-efficient distributed clustering technology for mobile sensor nodes and sink node mobility, select the higher residual energy and the nearest node from fixed nodes as cluster heads responsible for collecting sensed data, and all the fixed nodes form routing backbone to forward data, both can save energy and avoid cluster head away. Then, proposed a cross-layer scheduling mechanism to avoid the impact of mobile node and meet expectations cluster coverage. With energy-efficient clustering technology, efficient network topology control technology and mobile sink node, the data collection algorithm MSDBG, not only has considered mobility of nodes and energy saving, but also has achieved prolonging network lifetime.


Author(s):  
Peng Xiong ◽  
Qinggang Su

Due to the resource constraint, in wireless sensor network, the node processing ability, wireless bandwidth and battery capacity and other resources are scarcer. For improving the energy efficient and extend the lifetime of the network, this paper proposes a novel algorithm with the distributed and energy-efficient for collecting and aggregating data of wireless sensor network. In the proposed protocol, nodes can autonomously compete for the cluster head based on its own residual energy and the signal strength of its neighbouring nodes. To reduce the energy overhead of cluster head nodes, with a multi-hop way among cluster heads, the collected data from cluster heads is sent to a designated cluster head so as to further send these data to a base station. For improving the performance of the proposed protocol, a new cluster coverage method is proposed to fit the proposed protocol so that when the node density increases, network lifetime can be increased linearly as the number of nodes is increased. Simulations experiments show that network lifetime adopting the proposed protocol is sharply increased. And, the proposed protocol makes all the nodes die (network lifetime is defined as the death of last one node) in the last 40 rounds so that networks adopting the proposed protocol have higher reliability than networks adopting compared protocols.


2019 ◽  
Vol 8 (3) ◽  
pp. 5152-5158

Due to the profits raised due to the exploitation of the sink mobility for enlarging the life span of the network made the WSNs highly recognizable. Various complications and restrictions can be seen in the sensing field during the practical conditions. Hence, all the developers faced a challenge for acquiring the efficient outcome for mobile sink to determine the shortest path which can overcome all the complications and restrictions. The main aim of this paper is to give a clear explanation about the energy-efficient routing strategy on the basis of the cluster-based technique, for sinking the mobiles in the WSNs with complications. In this cluster-based technique, the nodes which are chosen as a cluster heads gather the information from the cluster members then send the information which is being gathered towards the mobile sink. Here, initially the data collection is initiated by the mobile sink through the periodical route from the initial site and at that time collects the information directly from all the cluster heads in a range known as single hop range, and in the end go back towards the initial point. Intended for the mobile sink, this design utilizes a procedure for determining shortest route through which one can avoid the obstacles. The algorithm is existing system algorithm whose name is heuristic tour planning algorithm. Anyhow, because of the complications of the programing issue in WSNs by means of obstacles and vast tour time, the conventional algorithms are bit challenging for solving. For overcoming this issue, the developers projected a strategy known as a visiting center based energy efficient data collection strategy. On the basis of the information and data which is being collected by them, they presented an algorithm. The name of the algorithm is visiting center algorithm. This algorithm is used in mobile sink. This helps in determining the route and path for cluster heads and collecting the information from the cluster heads and stores them safely. The data gathering route is initiated in a periodical way from the beginning stage which is the primary work of the mobile sink node, and at that time the information is collected by it from the VC’s in the single hop range and lastly gets back to the initial stage. The efficiency of this technique can be clearly observed in the simulation results. The software utilized here for making the process of simulation is NS2 software. This software efficiently verifies the efficiency and effectiveness of the technique.


Author(s):  
Yinghui Yang ◽  
Qunting Yang ◽  
Tiegang Gao

<span lang="EN-US">To prolong the life cycle of the network and increase the effective data transmission quantity of the network</span><span lang="EN-US">, several classic network layer routing algorithms are analyzed and they are implemented with programming language, which verifies their real advantages and disadvantages.</span><span lang="EN-US"> I</span><span lang="EN-US">n the model of ring networking, the optimal number of cluster heads in the annular region is deduced with the goal of minimizing the average energy consumption of cluster heads in each ring,</span><span lang="EN-US">and the formation mechanism of cluster heads is proposed for the purpose of preferentially using nodes with more residual energy as cluster heads.</span><span lang="EN-US">To further optimize energy consumption performance, a dynamic self-organizing multi-hop routing selection mode is proposed.</span><span lang="EN-US">Finally, the network simulation software is applied to construct the model based on ring network, and the optimization algorithm is adopted to obtain the flow chart of actual programming and some programming methods.</span><span lang="EN-US">The results show that the proposed algorithm achieves the ultimate optimization goal, which increases the number of effective monitoring data packets.</span>


WSN has brought revolution in monitoring or examining the particular area of the network. It has acquired many sectors like agricultural sectors, smart cities (Smart grids, Sewage treatment plants) and automation industries etc. the most prominent concern of battery of the sensor nodes are reported to deal with the energy efficient solution but still there is a lot of scope in enhancing the network performance of the WSN. The sink mobility in a controlled scenario with optimized Cluster head selection after every round using PSO has improved the network performance. The proposed scheme beats the ICM in terms of stability period, lifetime and half node dead. Stability Period, Half Node Dead and Network lifetime has increased by 19.8%, 42.1% and 37% respectively. Standard average coverage time decreases with increase in network area size.


Sign in / Sign up

Export Citation Format

Share Document