Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A Distributed Weighted Clustering Algorithm for Mobile Ad Hoc Networks
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
| Hi-index | 0.00 |
Mobile Ad Hoc Networks (MANET) is a collection of several wireless hosts, which form a network, without any infrastructure requirements. These are temporary networks, which cease to exist when no longer needed. In MANETs any node can act as a router, to provide connectivity to other nodes, within its transmission range. Several nodes in a Mobile Ad Hoc Network get connected via Shortest Paths to ensure minimal cost of transmission. In the process of computing the shortest path, certain critical points called articulation points are formed. Articulation points are those, when removed from the network, detaches a sub tree of nodes from the parent network, thereby disrupting the network connection. Therefore, if the node at the articulation point fails, other nodes, dependant on that node, are removed from the network. We propose an efficient method to identify and avoid formation of such articulation points, during the formation of an Ad Hoc Network. Our algorithm helps in finding alternate paths for connection, and hence improves the reliability and longevity of the network.