期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：11
出版社：S.S. Mishra
摘要：A wireless ad hoc network consists of a collection of transceivers, in which a packet may have to traverse multiple consecutive wireless links to reach its final destina tion. Wireless networks face a variety of constraints that do not appear in wired networks. There are also fault tolerance requirements, due to their evolving critical application domains and to the large number of failures that may result from mobility, fading, or obstructions. A biconnected communication graph is necessary to ensure fault tolerance in wireless network, since wireless ad hoc networks are used in critical application domains where failures are likely to occur. This means that each pair of nodes in the network has at least two node disjoint paths between them, and thus, failure at any single node does not partition the network. In this paper, we first introduce a new concept of removable node, such that the removal of it does not partition the network anymore. Algorithms are provided to identify removable nodes, in which all nodes can be simultaneously removed from the network without generating any new cut-node in the network, and to derive the final location of a removable node such that its movement distance is the shortest and the associated cut-node becomes a non-cut-node
关键词：Wireless ad hoc networks; biconnectivity; fault tolerance; cut -node
