An Efficient Hop Count Routing Protocol for Wireless Ad Hoc Networks

Xu, Zhijiang; Qian, Zhihong; Guo, Yuanqiang; Wang, Xue

doi:10.1007/s11633-014-0770-0

Cited by 17 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed routing algorithm makes use of the advantages of centralized control and topology management in software-defined networking (SDN), reduces the energy consumption of broadcast and reception, and has good performance in prolonging the network lifetime. Zhang et al 11 proposed an efficient hop count routing protocol (EHCR) for mobile ad hoc networks. This article assumes that all nodes have different transmit powers and sets power thresholds.…”

Section: Related Workmentioning

confidence: 99%

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Hao

Hou

Dang

et al. 2021

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

Aiming at the problems of low data transmission efficiency and uneven energy consumption caused by unreliable link communication in the routing process of wireless sensor networks, this article designs a routing game algorithm based on link quality. In this article, the index for evaluating link quality is defined first. Then, the link quality, node residual energy, and minimum jump transmission strategy are integrated into the utility function to establish a game model to determine the best next hop transmission node. Finally, the routing optimal transmission path is obtained according to the analysis of the existence of Nash equilibrium in the game. In the simulation experiment, the influence of the change of link quality parameters on the performance of the algorithm is analyzed, and the proposed algorithm is compared with non-linear weight particle swarm optimization (NWPSO) algorithm and Low Energy Adaptive Clustering Hierarchy-Improvement (LEACH-IMPT) algorithm in three aspects: the number of surviving nodes, network lifetime, and network energy consumption. The results show that the network lifetime of this method is 16.8% longer than that of LEACH-IMPT algorithm and 7.5% longer than that of NWPSO algorithm. This shows that the algorithm can effectively balance the network energy consumption and prolong the network life cycle. In addition, according to the routing path obtained in the simulation experiment, the optimality of its link quality is verified in the real experimental environment, and the experimental results prove the feasibility of the method in this article in practice.

show abstract

Section: Related Workmentioning

confidence: 99%

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Hao

Hou

Dang

et al. 2021

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…DSR-ant algorithm also reduces the search for shortest path identification. The transmitting power of the node and hop counts determines the selection of path in [15]. The transmitting power of each node is compared with the set of threshold power value set.…”

Section: Related Workmentioning

confidence: 99%

Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

Tamilselvi*¹,

Ravi²

2019

IJITEE

View full text Add to dashboard Cite

 Abstract: Mobile Ad-hoc Network (MANET) is a collection of self sustaining mobile nodes which are connected through many wi-fi links to form a temporary communication for sharing information between the users. Mobile nodes behave as a host as well as router. As nodes in MANET posse's mobility in traits frequently leads to irregular link between the nodes. Link failure directs a significant routing overhead during high mobility and also maintaining all the information associated with nodes and routing paths are considered as an extra overhead on the table. In order to overcome these issues, the routing algorithm to eliminate stare routed in routing cache. The neighbor degree centrality table is introduced to recognize the valuable nodes, using the valuable nodes the routes are discovered and link failure information are disseminated across the network wide. The results and findings show that the elimination of stale routes leads to significant reduction in routing overhead which in turn reduces the route error propagation delay.

show abstract

“…In level 3 super CH nodes, the data use network coding; they are forwarded to the sink. Owing to a multi-hop link [20] between level 3 CHs, data forwarded to the sink increase the network traffic. The network environment overcomes the disadvantages and provides reliable transmission to the sink.…”

Section: B Steady-state Phasementioning

confidence: 99%

An Efficient Mechanism Protocol for Wireless Sensor Networks by using Grids

Ibbini¹,

Lun²,

Othman³

et al. 2018

ijacsa

View full text Add to dashboard Cite

Multilevel short-distance clustering communication is an important scheme to reduce lost data packets over the path to the sink, particularly when nodes are deployed in a dense WSN (wireless sensor network). Our proposed protocol solves the problems of single hop paths in the TDTCGE (twodimensional technique based on center of gravity and energy) method, which addresses only single-hop problems and does not minimize distances between nodes by using multi-hop nodes with multilevel clustering grids to avoid dropped packets and to guarantee reliable paths without failures. In multilevel clustering grids, transmitted data are aggregated from lower-level grids to upper-level grids. In this paper, the proposed protocol obtains the optimal path for data transmission between cluster heads and the sink for heterogeneous WSNs. The cluster head nodes play an important role in forwarding data originating from other normal nodes that aggregate data to upper clusterheads. This routing approach is more efficient than other routing approaches, and it provides a reliable protocol for avoidance of data loss. In addition, the proposed protocol produces sleep and wakeup signals to the nodes and cluster heads via an MD (mediation device), thereby reducing energy consumption. Simulation results demonstrate the efficiency of the proposed method in terms of fewer dropped packets and high energy efficiency. The network environment overcomes the drawbacks of failure paths and provides reliable transmission to the sink.

show abstract

An Efficient Hop Count Routing Protocol for Wireless Ad Hoc Networks

Cited by 17 publications

References 18 publications

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality

Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

An Efficient Mechanism Protocol for Wireless Sensor Networks by using Grids

Contact Info

Product

Resources

About