Distributed routing algorithm with dynamic connection partition for mobile
            <i>ad hoc</i>
            networks

Wang, Nan; Zhang, Hai; Long, Hai

doi:10.1049/iet-net.2018.5150

Cited by 6 publications

(3 citation statements)

References 16 publications

(23 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tang et al proposed a joint stable routing and adaptive power adjustment algorithm for multi‐stream and multi‐hop MAC networks with the goal of maximizing network throughput 29 . Wang et al proposed a distributed dynamic routing algorithm based on the mobility of nodes to establish an effective routing mechanism for WANETs 30 …”

Section: Related Workmentioning

confidence: 99%

“…29 Wang et al proposed a distributed dynamic routing algorithm based on the mobility of nodes to establish an effective routing mechanism for WANETs. 30 In addition, swarm intelligence algorithms are also applied to routing optimization in WANETs. Giagkos et al proposed a bee-inspired routing protocol for providing multipath routing in wireless self-organizing networks of mobile nodes.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Energy efficiency optimization routing decision scheme in three‐dimensional wireless ad hoc network

Liu

Chen

Wang

2023

Concurrency and Computation

View full text Add to dashboard Cite

In recent years, many realistic wireless ad hoc networks (WANETs) have taken on three-dimensional characteristics due to the implementation of various structures such as viaducts, tunnels, and overpasses. An increasing amount of work has also been devoted to studying the challenges posed by 3D vanet scenarios. And research on routing methods for 3D vanet scenarios is a hot topic. However, the three-dimensional scene routing decision schemes have some problems, such as low data transmission efficiency, high energy consumption, and low end-to-end delays. Therefore, an energy efficiency optimization routing decision system is proposed based on the establishment of a three-dimensional Voronoi polygon topology model. First, we define a node state-related attribute parameter that determines whether the source node and the forward node are linked. The data forwarding node is determined by comparing attribute differences. Then, a power control mechanism based on received signal strength is proposed to solve the energy consumption, which includes deterministic and random parts. Finally, the specific state of the network node is monitored by comparing the attribute decision matrix to ensure basic maintenance of network operation and improve network transmission reliability. The simulation results show that the proposed scheme not only ensures the communication performance index in WANETs but also improves the reliability of the network.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Energy efficiency optimization routing decision scheme in three‐dimensional wireless ad hoc network

Liu

Chen

Wang

2023

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…A distributed dynamic routing algorithm was designed in [16] to create an efficient routing mechanism based on mobility of nodes. However, the designed routing algorithm has some defects in terms of delay and packet loss rate.…”

Section: Introductionmentioning

confidence: 99%

Hybridization of Brownboost and Random Forest Tree with Gradient Free Optimization for Route Selection

Tamilselvi¹,

Ravi²

2021

IJC

View full text Add to dashboard Cite

MANETs are self-organizing network architectures of mobile nodes. Due to node mobility, wireless network topologies dynamically various over time. A novel link stability estimation technique called Hybridization of Brownboost Cluster and Random Forest Decision Tree with Optimized Route Selection (HBCRFDT-GORS) technique is introduced for increasing the reliable data delivery by eliminating the stale routes in MANET. Brown Boost technique is applied to find the route paths having the smaller number of hop counts to perform the data transmission. After that, the status of the mobile nodes in the selected route paths is determined based on the residual energy and signal strength. Then, a random forest decision tree is applied to correctly identify the stale routes by finding the link failure due to the selfish node and the corruptive node along the route path. Then the broken link is removed from the route path. After eliminating the stale route from the path, the HBCRFDT-GORS technique finds the alternative optimal route through the gradient free optimization. The proposed HBCRFDT-GORS technique performs stale route elimination and improves reliable data delivery from source to destination. Simulation is conducted on different performance metrics such as routing overhead, packet delivery ratio, packet drop rate, and delay with respect to the number of data packets. The Network simulation results indicate that the HBCRFDT-GORS technique is improving the data delivery and and minimizing the delay as well as reducing the packet losses when compared to the baseline approaches.

show abstract

Energy-Efficient MPLS-MANET Using Ant Colony Optimization and Harmony Search Algorithm

Ambika

Banga

2021

Cognitive Informatics and Soft Computing

View full text Add to dashboard Cite

Distributed routing algorithm with dynamic connection partition for mobile ad hoc networks

Cited by 6 publications

References 16 publications

Energy efficiency optimization routing decision scheme in three‐dimensional wireless ad hoc network

Energy efficiency optimization routing decision scheme in three‐dimensional wireless ad hoc network

Hybridization of Brownboost and Random Forest Tree with Gradient Free Optimization for Route Selection

Energy-Efficient MPLS-MANET Using Ant Colony Optimization and Harmony Search Algorithm

Contact Info

Product

Resources

About