DHGRP: Dynamic Hexagonal Grid Routing Protocol with Mobile Sink for Congestion Control in Wireless Sensor Networks

Christopher, V. Bibin; Jasper, J.

doi:10.1007/s11277-020-07146-z

Cited by 7 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, most of these protocols are applied to static sensor networks. The hotspot problem is the chief problem of stationary sensor networks [11]. In contrast, in scenarios where the sensor node or sink can move, the transmission distance can be significantly reduced, resulting in balanced node energy consumption and a more extended network life span.…”

Section: Related Workmentioning

confidence: 99%

“…Many schemes have been proposed for extending the duration of MWSNs. Cluster-based hierarchical routing protocols [6][7][8][9][10][11][12] surpass other routing techniques in terms of scalability, prolonged network life, and reduced energy expenditure. This protocol works by organizing the network into fixed-sized clusters so that the nodes within the cluster pass the captured environmental information to its cluster's cluster head (CH), which successively passes to the next hop or sink.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

MMSCM: A multiple mobile sinks coverage maximization based hierarchical routing protocol for mobile wireless sensor networks

Guo

2023

IET Communications

View full text Add to dashboard Cite

Mobile wireless sensor network (MWSN) adapts to the requirements of mobility of civil and military network devices and has received a lot of attention. Designing an efficient, low‐energy, and fault‐tolerant routing protocol for the frequently changing topology of highly mobile MWSNs is challenging. Most routing protocols today only support the movement of sensor nodes or only sink. This paper proposes a Multiple Mobile Sinks Coverage Maximization based hierarchical routing protocol for mobile wireless sensor networks (MMSCM), which allows sensor nodes and sinks to move simultaneously. The MMSCM divides the monitoring area into virtual grids and deploys a movable sink in each grid cell. Sink selects the appropriate next hop for each cluster head in the area to build an optimal routing forest and collects data from all routing tree root nodes at a uniform speed along the specified path with maximum coverage. Simulation results show that, compared with current advanced routing algorithms, the MMSCM protocol can better solve the network delay problem and improve data throughput while extending the network life cycle, which is more suitable for time‐sensitive application scenarios.

show abstract

Section: Related Workmentioning

confidence: 99%