论文标题
CWBOUND：复杂非凸移动临时网络的边界节点检测算法
CWBound: boundary node detection algorithm for complex non-convex mobile ad hoc networks
论文作者
论文摘要
在灾难方案中移动临时网络中的有效消息转发是具有挑战性的，因为在边界和内部节点上的位置信息通常不可用。与边界节点有关的信息可用于设计有效的路由协议，并沿临时网络边界延长设备的电池电量。在本文中，我们开发了一种算法CWBOUND，该算法在复杂的非Convex移动临时（CNCAH）网络中发现边界节点。实验表明，CWBOUND算法的速度至少比其他最先进的算法快三倍，并且比经典力指向的算法快400倍。该实验还证实，在评估的算法中，CWBOUND算法达到了最高准确性（在4种类型的CNCAH网络中的3个高于97％）和灵敏度（90％）。
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.
