Modeling and Analysis of Zone-Based Registration in Mobile Communication Network by Considering Busy-Line Effect and Implicit Registration

In this study, we consider zone-based registration (ZBR) in mobile communication networks. In ZBR, when a mobile moves to a new zone, it registers its zone to the network database to keep the mobile’s current zone, and to connect an incoming call to the mobile when it is generated. A mobile can store one zone, or more than one zones. Among various types of ZBR, we focus on two-zone-based registration (TZR), which is known to have good performance. In TZR, a mobile can store two zones that it has recently registered, and does not register when it crosses either zone that it has already kept. In general, in TZR, a mobile registers its zone less often than in single-zone-based registration (SZR). However, TZR increases the paging cost, because the network may not know the exact zone where the mobile is. Mathematical modeling and performance analysis are performed to obtain the exact performance of SZR and TZR, by considering the busy-line effect and implicit registration effect of outgoing calls from a mobile. From numerical results for various circumstances, it is shown that TZR is superior to SZR in most cases.

Information Theoretic Approach with Reduced Paging Cost in Wireless Networks for Remote Healthcare Systems

This paper introduces an information theoretic approach for location management in cellular/mobile networks and allows the network to maintain the record of the mobility pattern of every user. The critical nature of remote healthcare service demands for continuous updates on the location of healthcare expert with the patient monitoring device. To reduce the paging cost, the proposed work uses the information from the system database by representing given past knowledge of the mobility pattern using Markov Chain. The expected search under the proposed work reduces number of search required in the earlier techniques. An entropy-per-location based scheme has also been introduced for comparative analysis among different models. This scheme can also be utilized as a general comparative framework for schemes to be introduced in future m-Health framework.

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

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.

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

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.

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

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.