Efficient paging in large-scale urban mesh networks

Authors:
Stephan Bohacek;Vinay Sridhara;Lei Lou
Affiliations:
University of Delaware, Newark, DE;University of Delaware, Newark, DE;University of Delaware, Newark, DE
Venue:
WMASH '06 Proceedings of the 4th international workshop on Wireless mobile applications and services on WLAN hotspots
Year:
2006

Citing 9
Cited 1

Movement-based location update and selective paging for PCS networks

IEEE/ACM Transactions on Networking (TON)
A new location update strategy for cellular networks and its implementation using a genetic algorithm

MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Topology-based tracking strategies for personal communication networks

Mobile Networks and Applications - Special issue: mobility management
Minimizing the average cost of paging under delay constraints

Wireless Networks
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the reduction of broadcast redundancy in mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
P-MIP: paging in mobile IP

WOWMOM '01 Proceedings of the 4th ACM international workshop on Wireless mobile multimedia
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Locating strategies for personal communication networks, a novel tracking strategy

IEEE Journal on Selected Areas in Communications

Realistic mobility simulation of urban mesh networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The task of forming a route can be broken into two parts, finding any route to the desired host and refining that route so it is suitable for the conenction. We refer to this first task as paging and it consists of simply delivering a single packet to the destination. Traditional MANET routing protocols perform this task via flooding. However, when the number of nodes ranges into the thousands, flooding becomes highly inefficient. In the case of cellular networks, paging is performed with one or more base stations broadcasting a page message. However, in large-scale urban networks, nodes are not necessarily in direct contact with the infrastructure, hence such techniques are not applicable. In this paper, the topology and architecture of a large-scale urban mesh network is examined and a scheme is developed for paging. This scheme is designed for and takes advantage of the topology, mobility, and architecture found in urban mesh networks. The resulting scheme is highly efficient in that it generates little overhead and is scalable.