pcs networks
Recently Published Documents


TOTAL DOCUMENTS

191
(FIVE YEARS 0)

H-INDEX

26
(FIVE YEARS 0)

2017 ◽  
Vol 25 (2) ◽  
pp. 765-775 ◽  
Author(s):  
Ahmed I. Saleh ◽  
Mohamed S. Elkasas ◽  
Alyaa A. Hamza

2016 ◽  
Vol 23 (6) ◽  
pp. 1967-1992 ◽  
Author(s):  
Ahmed I. Saleh ◽  
Amr Ali-Eldin ◽  
Amr A. Mohamed

2015 ◽  
Vol 19 (1) ◽  
pp. 173-206 ◽  
Author(s):  
Ahmed Ibrahim Mohammed Saleh

2014 ◽  
Vol 63 (4) ◽  
pp. 1886-1902 ◽  
Author(s):  
Xian Wang ◽  
Xianfu Lei ◽  
Pingzhi Fan ◽  
Rose Qingyang Hu ◽  
Shi-Jinn Horng

2013 ◽  
Vol 86 (10) ◽  
pp. 2688-2699 ◽  
Author(s):  
Shih-Lin Wu ◽  
Jen-Jee Chen ◽  
Wen-Chiang Chou

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.


Sign in / Sign up

Export Citation Format

Share Document