Download now Free registration required
This paper proposes an algorithm to identify groups of users connected to a mobile ad hoc network that remain stable over time. Several similar algorithms have been proposed to manage mobility either by predicting disconnections or by identifying groups of peers stable over time. They all rely on information such as GPS, signal strength or routes and result in message overhead. The algorithm proposed here uses information from the routing layer to detect groups that are stable over time. This algorithm is fully distributed and creates no message overhead as the result of using cross-layer information.
- Format: PDF
- Size: 534.3 KB