Timer-based bloom filter aggregation for reducing signaling overhead in distributed mobility management

Haneul Ko, Giwon Lee, Sangheon Pack, Kisuk Kweon

Research output: Contribution to journalArticle

11 Citations (Scopus)

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.

Original languageEnglish
Article number7065308
Pages (from-to)516-529
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume15
Issue number2
DOIs
Publication statusPublished - 2016 Feb 1

Fingerprint

Agglomeration
Analytical models
Explosions

Keywords

  • Analytical model
  • Bloom filter
  • Distributed mobility management
  • Latency
  • Signaling overhead
  • Timer

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Timer-based bloom filter aggregation for reducing signaling overhead in distributed mobility management. / Ko, Haneul; Lee, Giwon; Pack, Sangheon; Kweon, Kisuk.

In: IEEE Transactions on Mobile Computing, Vol. 15, No. 2, 7065308, 01.02.2016, p. 516-529.

Research output: Contribution to journalArticle

@article{b276d82b75bb4181a599f2fb04f637b0,
title = "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.",
keywords = "Analytical model, Bloom filter, Distributed mobility management, Latency, Signaling overhead, Timer",
author = "Haneul Ko and Giwon Lee and Sangheon Pack and Kisuk Kweon",
year = "2016",
month = "2",
day = "1",
doi = "10.1109/TMC.2015.2411603",
language = "English",
volume = "15",
pages = "516--529",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Timer-based bloom filter aggregation for reducing signaling overhead in distributed mobility management

AU - Ko, Haneul

AU - Lee, Giwon

AU - Pack, Sangheon

AU - Kweon, Kisuk

PY - 2016/2/1

Y1 - 2016/2/1

N2 - 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.

AB - 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.

KW - Analytical model

KW - Bloom filter

KW - Distributed mobility management

KW - Latency

KW - Signaling overhead

KW - Timer

UR - http://www.scopus.com/inward/record.url?scp=84978193804&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84978193804&partnerID=8YFLogxK

U2 - 10.1109/TMC.2015.2411603

DO - 10.1109/TMC.2015.2411603

M3 - Article

AN - SCOPUS:84978193804

VL - 15

SP - 516

EP - 529

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 2

M1 - 7065308

ER -