CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks

TL;DR

This paper introduces CWBound, an efficient algorithm for detecting boundary nodes in complex non-convex mobile ad hoc networks, improving speed and accuracy over existing methods, which is crucial for routing and energy conservation in disaster scenarios.

Contribution

The paper presents CWBound, a novel boundary node detection algorithm that significantly outperforms existing algorithms in speed and accuracy for complex non-convex mobile ad hoc networks.

Findings

CWBound is at least three times faster than other algorithms.

Achieves over 97% accuracy in most network types.

Attains 90% sensitivity in boundary detection.

Abstract

Efficient message forwarding in mobile ad hoc network in disaster scenarios is challenging because location information on the boundary and interior nodes is often unavailable. Information related to boundary nodes can be used to design efficient routing protocols as well as to prolong the battery power of devices along the boundary of an ad hoc network. In this article, we developed an algorithm, CWBound, which discovers boundary nodes in a complex non-convex mobile ad hoc (CNCAH) networks. Experiments show that the CWBound algorithm is at least three times faster than other state-of-the-art algorithms, and up to 400 times faster than classical force-directed algorithms. The experiments also confirmed that the CWBound algorithm achieved the highest accuracy (above 97% for 3 out of the 4 types of CNCAH networks) and sensitivity (90%) among the algorithms evaluated.