Please use this identifier to cite or link to this item:
https://ir.iimcal.ac.in:8443/jspui/handle/123456789/347
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Saha, Debashis | |
dc.date.accessioned | 2017-05-03T10:35:57Z | |
dc.date.accessioned | 2021-08-26T03:54:33Z | - |
dc.date.available | 2017-05-03T10:35:57Z | |
dc.date.available | 2021-08-26T03:54:33Z | - |
dc.date.issued | 2008-02-01 | |
dc.identifier.uri | https://ir.iimcal.ac.in:8443/jspui/handle/123456789/347 | - |
dc.description.abstract | Mobility Management is one of the major functions of wireless networks to allow mobile terminals (MTs) to stay connected. The aim of mobility management is to track where MTs are, so that calls and other services can be delivered to them. In this paper, we suggest a complete framework for mobility management in hierarchical cellular networks (HCNs), where MTs receive signal from both micro and macro cell tiers. It takes into account the dynamic factors for location area update along with a cost effective paging strategy suitable for HCNs. Comparative performance analyses indicate that this new technique outperforms the basic techniques (originally proposed for HCNs) considerably in terms of both signaling cost and delay. | en_US |
dc.description.sponsorship | INDIAN INSTITUTE OF MANAGEMENT CALCUTTA | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | INDIAN INSTITUTE OF MANAGEMENT CALCUTTA | en_US |
dc.relation.ispartofseries | WORKING PAPER SERIES;WPS No. 624/ February 2008 | |
dc.subject | Mobility management | en_US |
dc.subject | hierarchical cellular networks | en_US |
dc.subject | macro/micro paging | en_US |
dc.subject | dynamic location update | en_US |
dc.title | A Hierarchical Mobility Management Technique for Wireless Cellular Networks | en_US |
dc.type | Working Paper | en_US |
Appears in Collections: | 2008 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
wps-624_1.pdf | 316.29 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.