| Summary: | 博士 === 國立中央大學 === 資訊工程學系 === 101 === The articulation points in the induced graph of a network are known to be critical in terms of maintaining the connectivity of the network as most of the routing paths between nodes in the network have to pass through them. To detect articulation points, the previous works assume the setting of static networks. However, in case when a group of people move together, their mobile devices forms a highly dynamic mobile ad hoc network and the behavior of nodes in such a network can be a challenge when it comes to detecting articulation points. In this paper, we propose a distributed algorithm, namely Localized Depth-First-Search (LDFS), to identify articulation points efficiently in mobile ad hoc networks. The algorithm sets multiple initiators to send probing packets and a bound for the hop count of the probing packets in order to improve the accuracy rate and message overhead at the same time. The simulation results show that our LDFS algorithm outperforms the other well-known protocols, which suggest that LDFS is a better solution for articulation point detection to prevent possible losses in a group of moving nodes. In second part, we proposed a Power-Saving LDFS protocol to save power of node and still maintain the connectivity of network. The performance of energy consumption is better than original case.
|
|---|
