Cost and Energy Efficient Distributed Computation: Wireless Sensor Networks on Uniform Grid

Ramamurthy, Garimella; Swamy, Tata Jagannadha; Jain, Arpit

doi:10.1109/sefet48154.2021.9375738

Cited by 2 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our proposed method works on a regular rectangular grid [38], where sensor nodes are positioned at grid intersection points. Our objective is to find the shortest quasistraight line path from the sender to the receiver.…”

Section: The Protocol Using Dqssmentioning

confidence: 99%

A Quasistraight Line Routing Protocol for Square Grid-Based Wireless Sensor Networks

Ajij

Pratihar

Luhach

et al. 2022

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Sensor nodes in a wireless sensor network (WSN) are both energy-constrained and vulnerable to faults and disasters. Communication between the sensor nodes is generally hop-by-hop, and the nodes are distributed throughout the area to be covered. Broadcast-based routing protocols are not preferable in sensor networks since broadcasting is considered costly in terms of battery power consumption. In this paper, a digital quasistraight line segment- (DQSS-) based approach is employed for the detection of quasistraight line segments, i.e., for quasistraight path finding between WSN sensors arranged in a square grid. Comparative results show that the method is comparable with the best-known straight line finding algorithm in terms of path lengths and computation time. Moreover, the proposed method is capable of avoiding dead nodes by updating DQSS parameters dynamically during path finding. Hence, the proposed method is promising to be used in WSN square grids as a quasistraight line routing protocol.

show abstract

Section: The Protocol Using Dqssmentioning

confidence: 99%