A Multi-Path Routing Protocol Based on Link Lifetime and Energy Consumption Prediction for Mobile Edge Computing

Zhang, Degan; Chen, Lu; Zhang, Jie; Chen, Jie; Zhang, Ting; Tang, Ya-meng; Qiu, Jianning

doi:10.1109/access.2020.2986078

Cited by 104 publications

(64 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, the neighbor node rotates and becomes a new CH for a random time slice, which can effectively reduce CH mortality rate, extend cluster lifetime, and improve data transmission efficiency.The proposed method is more effective in saving network energy, improving data transmission efficiency, and maximizing network lifetime of the RWSN for smart home or smart community. The topic in this paper is a multi-objective optimization problem, which means that a mathematical optimization model is needed to be used [46][47][48][49][50][51][52][53][54][55].…”

Section: Related Workmentioning

confidence: 99%

“…Smaller variances result in more data that is close to average. In this experimental tests of this paper, we adopt the classical method to deal with the standard deviation [52][53][54][55].…”

Section: Fig3 Ch Replacementmentioning

confidence: 99%

“…The CH distribution is dynamically changed according to the different application scenarios, so the CH distribution is complex when the application scenario is moving in the RWSN, simple analysis isn't enough to explain the CH distribution with comparison, the detailed discussion for this CH distribution can be found in our other papers [1] [55]. In Figure 8, parts (a), (b), and (c) show the relationship between the number of CHs and the sensor radius when the subarea size is respectively 30×30, 40×40, and 50×50.…”

Section: A) Test Environment and Parameter Settingsmentioning

confidence: 99%

“…As one of many scenarios for residential energy management of RWSN [38][39][40][41][42], the proposed method was tested in the residential environment of smart home or smart community [47][48][49][50][51][52][53][54][55]. According to related statistics, many gas explosions occur every year, which cause huge economic losses and casualties.…”

Section: C) Tests With Real Scenariosmentioning

confidence: 99%

See 3 more Smart Citations

New Approach of Energy-Efficient Hierarchical Clustering Based on Neighbor Rotation for RWSN

Chen

Zhang

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

Energy Efficient Hierarchical Clustering (EEHC) method is a distributed random clustering algorithm for residential wireless sensor networks (RWSNs) with the goal of maximizing network lifetime. However, during selection of the cluster head stage, a node declares itself as a cluster head to neighboring nodes with probability p, which does not consider well the topological characteristics of the network. The new energy-efficient hierarchical clustering approach based on neighbor rotation (EEHCN) for RWSN has been proposed in this paper, the new idea of which determines whether a node of RWSN can become a cluster head node by comparing the comprehensive weighting of the degree of the sensor node and the distance between the sensor node and the center of the subarea. When the cluster head is replaced, a member node in the set of neighbor nodes of the current cluster head becomes the new cluster head for a random time slice, and the merged information is transmitted to the nearest sink node in a multi-hop manner according to the routing information. The experimental results demonstrate that the proposed method is more effective in saving network energy, improving data transmission efficiency, and maximizing network lifetime of RWSN. The innovative research work is very useful for the relative application of the RWSN, such as smart home or smart community.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Fig3 Ch Replacementmentioning

confidence: 99%

Section: A) Test Environment and Parameter Settingsmentioning

confidence: 99%

Section: C) Tests With Real Scenariosmentioning

confidence: 99%

See 2 more Smart Citations

New Approach of Energy-Efficient Hierarchical Clustering Based on Neighbor Rotation for RWSN

Chen

Zhang

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, some works try to deploy the minimum number of relay nodes to minimize the network cost 23 . Other researchers have proposed the use of some mobile edge computing to decrease the transmission delay and the energy consumption 24‐26 . Furthermore, in the literature, mobile sinks were suggested for dealing with topology failure, the reduction of the sensing coverage, and delay 27,28 .…”

Section: Introductionmentioning

confidence: 99%

Node placement optimization using particle swarm optimization and iterated local search algorithm in wireless sensor networks

Chelbi

Dhahri

Bouaziz

2021

Int J Communication

View full text Add to dashboard Cite

Summary Coverage and connectivity are the two most challenging issues in target‐based wireless sensor networks (WSNs). For that, node placement is one of the fundamental concerns that affect the performance of coverage and connectivity in WSN. This paper introduces a new approach by combining particle swarm optimization and iterated local search (PSO‐ILS) to have an optimum coverage and connectivity rate with the minimum number of nodes. In one side, to maintain the full coverage of targets, the PSO‐ILS is used to deploy the minimum number of sensor nodes. In other side, to achieve the full connectivity, the optimal position determination (OPD) algorithm was conceived to identify the optimal candidate positions which can be used by the PSO‐ILS to place the minimum number of relay nodes. The obtained results considered over a number of runs are compared with canonical PSO, differential evolution (DE), and genetic algorithms (GAs). The outcomes derived from this comprehensive analysis determine that PSO‐ILS provides an effectual improvement in contrary to the methods PSO, DE, and GA in terms of the selected potential positions to ensure full coverage of target points and the number of relay nodes required to achieve full connectivity.

show abstract

Certificate revocation schemes for providing secure QoS in MANETs

Sahana

Krishnan

2022

Concurrency and Computation

View full text Add to dashboard Cite

Due to crucial exchange issues, security in mobile ad hoc networks (MANETs) is more complicated. It is vital to secure MANET exchanges to ensure the network's services development. In this research, the proposed model focuses on providing trust and certificate-based Malicious Node detection for mobile adhoc networks and improving certificate revocation based on cluster head. The cluster head is crucial in eliminating falsely accused nodes. The malicious node may be easily discovered and isolated from the network using the trusted value. If the trust value falls below the trust threshold value in a trust management, the node is identified as malicious, the certificate is canceled, and the node is isolated from the network. The TSQRS protocol's integration with the CRS scheme was the main emphasis of the suggested model. The proposed model also creates more stable clusters with the help of Trust manager. When compared to other current protocols and methodologies, the findings produced by the suggested approach for the TSQRS-CRS scheme improve performance and stability in the QoS of MANETs. Finally, certain parameters were used to run the simulation, which resulted in an improved Packet Delivery Ratio, Routing Overhead, and reduced Delay. K E Y W O R D Scertificate revocation scheme, cluster head, mobile adhoc networks, trust-based secure QoS routing scheme INTRODUCTIONMANETs are wirelessly connected networks of mobile nodes. MANET has no stable topology because the nodes are always shifting from one site to another. Ad hoc networks' Nodes can send packets, forward packets, respond to routing messages, and send suggestions, among other things.The behavior of the nodes is defined by the collection of activities that are executed. As a result, the learning plan keeps track of the neighbors' actions to assess their behavior. 1,2 To route the packets, all of the nodes must work together. Cooperating nodes must have faith in one another.According to the relative distance between the nodes and the link's maintenance time, the link's quality and dependable communication are assessed. 3 The wireless sensor network (WSN) presently is one of the chosen study field in recent years as a critical aspect of industrial application. 4 Because of sensor nodes' restricted energy and communication capabilities, designing a routing protocol for WSNs is crucial to convey sensing data to the receiver 5 properly. The Internet of Vehicles may obtain traffic information through a vast amount of data acquired by sensors. 6 There is a particular need to be focused on energy consumption and the amount of delay on resource constraints of MANETs. [7][8][9] To identify the shortest path algorithm in the programme, a new approach of the best path selection with length priority based on past information needs to be taken into consideration. Different forms of intelligent driving vehicles can use this best path planning algorithm to efficiently choose the best way in a traffic network with limited height, width, and weight, accidents, and traffic co...

show abstract

A Multi-Path Routing Protocol Based on Link Lifetime and Energy Consumption Prediction for Mobile Edge Computing

Cited by 104 publications

References 57 publications

New Approach of Energy-Efficient Hierarchical Clustering Based on Neighbor Rotation for RWSN

New Approach of Energy-Efficient Hierarchical Clustering Based on Neighbor Rotation for RWSN

Node placement optimization using particle swarm optimization and iterated local search algorithm in wireless sensor networks

Certificate revocation schemes for providing secure QoS in MANETs

Contact Info

Product

Resources

About