Location Management in PCS Networks Using Base Areas (BAs) and 2 Level Paging (2LP) Schemes

Author(s):  
Hesham A. Ali ◽  
Ahmed I. Saleh ◽  
Mohammed H. Ali

The main objective of PCS networks is to provide “anytime-anywhere” cellular services. Accordingly, lost calls as well as the network slow response have become the major problems that hardly degrade the network reliability. Those problems can be overcome by perfectly managing the Mobile Terminals (MTs) locations. In the existing location management (LM) scheme, Location Area (LA) is the smallest unit for registration. A MT must register itself when passing through its LA boundary to a neighboring one. Moreover, such registration takes place at the MTs’ master HLR (even though currently managed by another HLR), which increases communication costs. As a result, existing LM scheme suffers from; (1) excessive location registrations by MTs located around LA boundaries (ping-pong effect) and (2) requiring the network to poll all LA cells to locate the callee MT. In this paper, a novel LM strategy is introduced by restructuring LAs into smaller areas called Base Areas (BAs), which impacts the paging cost. The proposed LM strategy uses caching to reduce unwanted updates and 2LP to reduce paging cost. Experimental results show that the proposed scheme introduces a distinct improvement in network response and tracing process.

2013 ◽  
pp. 1448-1475
Author(s):  
Hesham A. Ali ◽  
Ahmed I. Saleh ◽  
Mohammed H. Ali

The main objective of PCS networks is to provide “anytime-anywhere” cellular services. Accordingly, lost calls as well as the network slow response have become the major problems that hardly degrade the network reliability. Those problems can be overcome by perfectly managing the Mobile Terminals (MTs) locations. In the existing location management (LM) scheme, Location Area (LA) is the smallest unit for registration. A MT must register itself when passing through its LA boundary to a neighboring one. Moreover, such registration takes place at the MTs’ master HLR (even though currently managed by another HLR), which increases communication costs. As a result, existing LM scheme suffers from; (1) excessive location registrations by MTs located around LA boundaries (ping-pong effect) and (2) requiring the network to poll all LA cells to locate the callee MT. In this paper, a novel LM strategy is introduced by restructuring LAs into smaller areas called Base Areas (BAs), which impacts the paging cost. The proposed LM strategy uses caching to reduce unwanted updates and 2LP to reduce paging cost. Experimental results show that the proposed scheme introduces a distinct improvement in network response and tracing process.


Author(s):  
Hesham A. Ali ◽  
Ahmed I. Saleh ◽  
Mohammed H. Ali

The main objective of PCS networks is to provide “anytime-anywhere” cellular services. Accordingly, lost calls as well as the network slow response have become the major problems that hardly degrade the network reliability. Those problems can be overcome by perfectly managing the Mobile Terminals (MTs) locations. In the existing location management (LM) scheme, Location Area (LA) is the smallest unit for registration. A MT must register itself when passing through its LA boundary to a neighboring one. Moreover, such registration takes place at the MTs’ master HLR (even though currently managed by another HLR), which increases communication costs. As a result, existing LM scheme suffers from; (1) excessive location registrations by MTs located around LA boundaries (ping-pong effect) and (2) requiring the network to poll all LA cells to locate the callee MT. In this paper, a novel LM strategy is introduced by restructuring LAs into smaller areas called Base Areas (BAs), which impacts the paging cost. The proposed LM strategy uses caching to reduce unwanted updates and 2LP to reduce paging cost. Experimental results show that the proposed scheme introduces a distinct improvement in network response and tracing process.


Author(s):  
Ahmed I. Saleh

As PCS networks aim to provide “anytime-anywhere” cellular services, they enable Mobile Terminals (MTs) to communicate regardless of their locations. However, in order to guarantee a successful service delivery, MTs’ real time location should be continuously managed by the network. Location management plays the central role in providing ubiquitous network communications services, which includes two fundamental processes, i.e., registration and paging. Registration is concerned with the reporting of the current locations of the MTs, while paging is used to locate the MT. Both processes incur signaling cost, and due to the scarcity of PCS wireless bandwidth and for more scalable mobile services, it is important to reduce that signaling cost. As The blanket paging in current PCS networks wastes a lot of wireless bandwidth, the author focuses on the subject of paging in attempt to reduce the paging signaling cost under delay bounds. This paper challenges the signaling cost problem and successfully establishes a family of probability based paging strategies. The author will introduce a novel topology for the network registration area, which is called the hot spot topology (HST) and based on HST, a novel location management strategy, which is called “Flower Based Strategy” (FBS) is also introduced.


Sign in / Sign up

Export Citation Format

Share Document