A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles

DOI10.1016/j.jpdc.2010.12.013zbMath1219.68056OpenAlexW2021633986MaRDI QIDQ635380

Yan Sun, Mukesh Singhal, Qiangfeng Jiang

Publication date: 19 August 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.12.013

zbMATH Keywords

planar graphgeographic routingmobile ad hoc and sensor networksunit-disk graph

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Unnamed Item
• The relative neighbourhood graph of a finite planar set
• Geometric ad-hoc routing
• Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles