Hash-based paging and location update using bloom filters: a paging algorithm that is best suitable for IPv6

Authors:
Pars Mutaf;Claude Castelluccia
Affiliations:
INRIA Rhône-Alpes, Planète Team, 655 avenue de l'Europe, Montbonnot, 38334 Saint Ismier Cedex, France;INRIA Rhône-Alpes, Planète Team, 655 avenue de l'Europe, Montbonnot, 38334 Saint Ismier Cedex, France
Venue:
Mobile Networks and Applications
Year:
2004

Citing 5
Cited 6

Summary cache: a scalable wide-area Web cache sharing protocol

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
IP paging service for mobile hosts

Proceedings of the 7th annual international conference on Mobile computing and networking
P-MIP: paging extensions for mobile IP

Mobile Networks and Applications - Analysis and Design of Multi-Service Wireless Networks
HAWAII: a domain-based approach for supporting mobility in wide-area wireless networks

IEEE/ACM Transactions on Networking (TON)

Impact of paging channel overloads or attacks on a cellular network

WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
Mining call and mobility data to improve paging efficiency in cellular networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Location Update versus Paging Trade-Off in Cellular Networks: An Approach Based on Vector Quantization

IEEE Transactions on Mobile Computing
Information-theory based optimal location management schemes for integrated multi-system wireless networks

IEEE/ACM Transactions on Networking (TON)
SIP paging and tracking of wireless LAN hosts for VoIP

IEEE/ACM Transactions on Networking (TON)
Measurement and modeling of paging channel overloads on a cellular network

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal identifier field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call "false location updates" although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.