Timer-Based Bloom Filter Aggregation for Reducing Signaling Overhead in Distributed Mobility Management

Abstract

Distributed mobility management (DMM) is a promising technology to address the mobile data traffic explosion problem. Since the location information of mobile nodes (MNs) are distributed in several mobility agents (MAs), DMM requires an additional mechanism to share the location information of MNs between MAs. In the literature, multicast or distributed hash table (DHT)-based sharing methods have been suggested; however they incur significant signaling overhead owing to unnecessary location information updates under frequent handovers. To reduce the signaling overhead, we propose a timer-based Bloom filter aggregation (TBFA) scheme for distributing the location information. In the TBFA scheme, the location information of MNs is maintained by Bloom filters at each MA. Also, since the propagation of the whole Bloom filter for every MN movement leads to high signaling overhead, each MA only propagates changed indexes in the Bloom filter when a pre-defined timer expires. To verify the performance of the TBFA scheme, we develop analytical models on the signaling overhead and the latency and devise an algorithm to select an appropriate timer value. Extensive simulation results are given to show the accuracy of analytical models and effectiveness of the TBFA scheme over the existing DMM scheme.