Prediction of Partitioning in Location-Aware Mobile Ad Hoc Networks

We propose an algorithm for detection of partitioning in location-aware mobile ad hoc networks. The partitioning occurs when movement pattern of nodes is such that they separate into groups that cannot communicate with each other. We use information about node position and speed in order to build a model that is able to predict when partitioning will occur and which link is critical using properties of planar graphs that represent the network. Our algorithm is distributed and uses only local topology knowledge where nodes keep track of position and speed of their one-hop neighbors.