The Experts below are selected from a list of 16815 Experts worldwide ranked by ideXlab platform
Ian F. Akyildiz - One of the best experts on this subject based on the ideXlab platform.
-
user mobility pattern scheme for Location Update and paging in wireless systems
IEEE Transactions on Mobile Computing, 2002Co-Authors: E Clayirci, Ian F. AkyildizAbstract:The user mobility pattern (UMP) scheme is introduced for Location Update and paging in wireless systems where mobile terminals (MTs) maintain their history data in a database called user mobility history (UMH). During a Location Update, a UMP is derived from UMH and registered to the network. Unless the MT detects that it has moved out of the registered UMP, it does not perform any other Location Update. On the other hand, cells are paged selectively according to the cell entry times in the registered UMP upon a call arrival for the MT. The related data structures and the protocols for the UMP scheme are presented in the paper. The experimental results show that the UMP scheme outperforms the time-based and movement-based Location Update schemes as well as the blanket, selective, and velocity paging schemes.
-
intersystem Location Update and paging schemes for multitier wireless networks
ACM IEEE International Conference on Mobile Computing and Networking, 2000Co-Authors: Wenye Wang, Ian F. AkyildizAbstract:Global wireless networks enable mobile users to communicate regardless of their Locations. One of the most important issues is Location management in a highly dynamic environment because mobile users may roam between different wireless networks, network operators, and geographical regions. In this paper, a Location tracking mechanism is introduced, which consists of intersystem Location Updates using the concept of boundary Location area (BLA) and paging using the concept of boundary Location register (BLR). The BLA is determined by a dynamic Location Update policy in which the velocity and the quality of service (QoS) are taken into account on a per-user basis. The BLR is used to maintain the records of mobile users crossing the boundary of networks. This mechanism not only reduces Location tracking costs but also significantly decreases call loss rates and average paging delays. The performance evaluation of the proposed schemes is provided to demonstrate their effectiveness in multitier wireless networks.
-
Movement-based Location Update and selective paging for PCS networks
IEEE ACM Transactions on Networking, 1996Co-Authors: Ian F. Akyildiz, Yi-bing LinAbstract:This paper introduces a mobility tracking mechanism that combines a movement-based Location Update policy with a selective paging scheme. Movement-based Location Update is selected for its simplicity. It does not require each mobile terminal to store information about the arrangement and the distance relationship of all cells. In fact, each mobile terminal only keeps a counter of the number of cells visited. A Location Update is performed when this counter exceeds a predefined threshold value. This scheme allows the dynamic selection of the movement threshold on a per-user basis. This is desirable as different users may have very different mobility patterns. Selective paging reduces the cost for locating a mobile terminal in the expense of an increase in the paging delay. We propose a selective paging scheme which significantly decreases the Location tracking cost under a small increase in the allowable paging delay. We introduce an analytical model for the proposed Location tracking mechanism which captures the mobility and the incoming call arrival patterns of each mobile terminal. Analytical results are provided to demonstrate the cost-effectiveness of the proposed scheme under various parameters.
-
Mobile user Location Update and paging under delay constraints
Wireless Networks, 1995Co-Authors: Ian F. AkyildizAbstract:Wireless personal communication networks (PCNs) consist of a fixed wireline network and a large number of mobile terminals. These terminals are free to travel within the PCN coverage area without service interruption. Each terminal periodically reports its Location to the network by a process called Location Update . When a call for a specific terminal arrives, the network will determine the exact Location of the destination terminal by a process called terminal paging . This paper introduces a mobile user Location management mechanism that incorporates a distance based Location Update scheme and a selective paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and call arrival pattern of a terminal. Given the respective costs for Location Update and terminal paging, the average total Location Update and terminal paging cost is determined. An iterative algorithm is then used to determine the optimal Location Update threshold distance that results in the minimum cost. Analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements.
-
a mobile user Location Update and paging mechanism under delay constraints
ACM Special Interest Group on Data Communication, 1995Co-Authors: Ian F. AkyildizAbstract:A mobile user Location management mechanism is introduced that incorporates a distance based Location Update scheme and a paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and call arrival pattern of a terminal. Given the respective costs for Location Update and terminal paging, the average total Location Update and terminal paging cost is determined. An iterative algorithm is then used to determine the optimal Location Update threshold distance that results in the minimum cost. Analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements.
Bharat Bhargava - One of the best experts on this subject based on the ideXlab platform.
-
a crossing tier Location Update paging scheme in hierarchical cellular networks
IEEE Transactions on Wireless Communications, 2006Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:Location Update/paging strategies have been widely studied in the traditional single-tier cellular networks. We propose and evaluate a novel crossing-tier Location Update/paging scheme that can be used in a hierarchical macrocell/microcell cellular network. Location Update is proceeded only in the macrocell tier, where a Location area (LA) is made up by larger macrocells. A mobile user will stay in such a LA for longer time. Therefore, the cost on Location Update can be reduced due to the decreased frequency of Location Update. To reduce the paging delay, the paged mobile user will be searched in the macrocell tier only when the paging load is not high. Otherwise, it will be searched in the microcell tier, where a sequential searching method is applied. The operation for the scheme is simple, as the macrocell/microcell cellular network has the advantage because a mobile user can receive a signal from both a microcell and the overlaid macrocell. Analytical models have been built for cost and delay evaluation. Numerical results show that, at relatively low cost, the crossing-tier scheme also achieves low paging delay.
-
A crossing-tier Location Update/paging scheme in hierarchical cellular networks
IEEE Transactions on Wireless Communications, 2006Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:Location Update/paging strategies have been widely studied in the traditional single-tier cellular networks. We propose and evaluate a novel crossing-tier Location Update/paging scheme that can be used in a hierarchical macrocell/microcell cellular network. Location Update is proceeded only in the macrocell tier, where a Location area (LA) is made up by larger macrocells. A mobile user will stay in such a LA for longer time. Therefore, the cost on Location Update can be reduced due to the decreased frequency of Location Update. To reduce the paging delay, the paged mobile user will be searched in the macrocell tier only when the paging load is not high. Otherwise, it will be searched in the microcell tier, where a sequential searching method is applied. The operation for the scheme is simple, as the macrocell/microcell cellular network has the advantage because a mobile user can receive a signal from both a microcell and the overlaid macrocell. Analytical models have been built for cost and delay evaluation. Numerical results show that, at relatively low cost, the crossing-tier scheme also achieves low paging delay.
-
a low cost low delay Location Update paging scheme in hierarchical cellular networks
Data Engineering for Wireless and Mobile Access, 2003Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:A low-cost, two-step Location Update/paging scheme in a macrocell/microcell network is proposed and investigated. To reduce operating cost, the Location Update is operated only in the macrocell tier. A callee will be paged in the macrocell tier first. If the paging delay in the macrocell tier is too high due to large queuing delay, the callee will then be paged in the microcell tier. Original searching method is used in the microcell tier paging. The operation for the scheme is simple, since the macrocell/microcell cellular network has the advantage that a mobile user in such a cellular network can receive a signal from both a macrocell and a microcell. The analytical results show that, along with the low Location Update/paging cost, the two-step paging scheme also achieves low paging delay.
-
MobiDE - A low-cost, low-delay Location Update/paging scheme in hierarchical cellular networks
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access - MobiDe '03, 2003Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:A low-cost, two-step Location Update/paging scheme in a macrocell/microcell network is proposed and investigated. To reduce operating cost, the Location Update is operated only in the macrocell tier. A callee will be paged in the macrocell tier first. If the paging delay in the macrocell tier is too high due to large queuing delay, the callee will then be paged in the microcell tier. Original searching method is used in the microcell tier paging. The operation for the scheme is simple, since the macrocell/microcell cellular network has the advantage that a mobile user in such a cellular network can receive a signal from both a macrocell and a microcell. The analytical results show that, along with the low Location Update/paging cost, the two-step paging scheme also achieves low paging delay.
Biswanath Mukherjee - One of the best experts on this subject based on the ideXlab platform.
-
a crossing tier Location Update paging scheme in hierarchical cellular networks
IEEE Transactions on Wireless Communications, 2006Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:Location Update/paging strategies have been widely studied in the traditional single-tier cellular networks. We propose and evaluate a novel crossing-tier Location Update/paging scheme that can be used in a hierarchical macrocell/microcell cellular network. Location Update is proceeded only in the macrocell tier, where a Location area (LA) is made up by larger macrocells. A mobile user will stay in such a LA for longer time. Therefore, the cost on Location Update can be reduced due to the decreased frequency of Location Update. To reduce the paging delay, the paged mobile user will be searched in the macrocell tier only when the paging load is not high. Otherwise, it will be searched in the microcell tier, where a sequential searching method is applied. The operation for the scheme is simple, as the macrocell/microcell cellular network has the advantage because a mobile user can receive a signal from both a microcell and the overlaid macrocell. Analytical models have been built for cost and delay evaluation. Numerical results show that, at relatively low cost, the crossing-tier scheme also achieves low paging delay.
-
A crossing-tier Location Update/paging scheme in hierarchical cellular networks
IEEE Transactions on Wireless Communications, 2006Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:Location Update/paging strategies have been widely studied in the traditional single-tier cellular networks. We propose and evaluate a novel crossing-tier Location Update/paging scheme that can be used in a hierarchical macrocell/microcell cellular network. Location Update is proceeded only in the macrocell tier, where a Location area (LA) is made up by larger macrocells. A mobile user will stay in such a LA for longer time. Therefore, the cost on Location Update can be reduced due to the decreased frequency of Location Update. To reduce the paging delay, the paged mobile user will be searched in the macrocell tier only when the paging load is not high. Otherwise, it will be searched in the microcell tier, where a sequential searching method is applied. The operation for the scheme is simple, as the macrocell/microcell cellular network has the advantage because a mobile user can receive a signal from both a microcell and the overlaid macrocell. Analytical models have been built for cost and delay evaluation. Numerical results show that, at relatively low cost, the crossing-tier scheme also achieves low paging delay.
-
a low cost low delay Location Update paging scheme in hierarchical cellular networks
Data Engineering for Wireless and Mobile Access, 2003Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:A low-cost, two-step Location Update/paging scheme in a macrocell/microcell network is proposed and investigated. To reduce operating cost, the Location Update is operated only in the macrocell tier. A callee will be paged in the macrocell tier first. If the paging delay in the macrocell tier is too high due to large queuing delay, the callee will then be paged in the microcell tier. Original searching method is used in the microcell tier paging. The operation for the scheme is simple, since the macrocell/microcell cellular network has the advantage that a mobile user in such a cellular network can receive a signal from both a macrocell and a microcell. The analytical results show that, along with the low Location Update/paging cost, the two-step paging scheme also achieves low paging delay.
-
MobiDE - A low-cost, low-delay Location Update/paging scheme in hierarchical cellular networks
Proceedings of the 3rd ACM international workshop on Data engineering for wireless and mobile access - MobiDe '03, 2003Co-Authors: Biswanath Mukherjee, Bharat BhargavaAbstract:A low-cost, two-step Location Update/paging scheme in a macrocell/microcell network is proposed and investigated. To reduce operating cost, the Location Update is operated only in the macrocell tier. A callee will be paged in the macrocell tier first. If the paging delay in the macrocell tier is too high due to large queuing delay, the callee will then be paged in the microcell tier. Original searching method is used in the microcell tier paging. The operation for the scheme is simple, since the macrocell/microcell cellular network has the advantage that a mobile user in such a cellular network can receive a signal from both a macrocell and a microcell. The analytical results show that, along with the low Location Update/paging cost, the two-step paging scheme also achieves low paging delay.
Daeyoung Kim - One of the best experts on this subject based on the ideXlab platform.
-
A multi-hop pointer forwarding scheme for efficient Location Update in low-rate wireless mesh networks
Journal of Parallel and Distributed Computing, 2018Co-Authors: Seong Hoon Kim, Daeyoung KimAbstract:Abstract Recently, a pointer forwarding scheme (PFS) was proposed to reduce Location Update overhead in wireless mesh networks. Using PFS, a Location Update is replaced with a simple forwarding pointer setup between two neighboring mesh routers (MRs). However, in PFS, if the two MRs are not one hop neighbors, PFS fails to set up a forwarding pointer, thus increasing Location Update overhead. To improve PFS, we present a multi-hop pointer forwarding scheme (MPFS). MPFS allows forwarding pointers to be constructed over multi-hop at once even if MRs are not one hop neighbor by using logical tree distance constructed during network formation. The tree distance is used to relay forwarding pointer packets over multi-hop links without additional control overhead during forwarding pointer setup and to estimate hop distance between two MRs. By doing so, MPFS improves the probability of success in forwarding pointer setup while ensuring k ≤ k m , resulting in lowering the Location Update overhead. Also, we analyze pointer forwarding success probability and average chain length and discuss why MPFS is suitable for resource-constrained LRWMNs. Using ns-2, we show that MPFS significantly reduces the number of Location Update events, Location Update delay and signaling overhead, and packet losses during Location Updates. With real-world implementation, we also confirm feasibility of MPFS.
-
WCNC - A Location Update scheme using multi-hop pointer forwarding in low-rate wireless mesh networks
2012 IEEE Wireless Communications and Networking Conference (WCNC), 2012Co-Authors: Seong Hoon Kim, Daeyoung KimAbstract:Recently, a pointer forwarding scheme (PFS) was proposed to reduce Location Update overhead in wireless mesh networks. Using the PFS, Location Update is replaced with a simple forwarding pointer setup between two neighboring MRs until the forwarding chain K is less than or equal to the configurable parameter K max for each MC. However, in PFS, if the two MRs are not one hop neighbors, the PFS fails to set up a forwarding pointer, and a Location Update event must be triggered, increasing Location Update overhead. To improve PFS, we present a novel Location Update scheme called a multi-hop pointer forwarding scheme (MPFS). The MPFS allows forwarding pointers to be constructed over multi-hop at once even if MRs are not one hop neighbor with each other. The key to achieving this lies in the logical tree distance constructed during network formation. The tree distance is used to relay forwarding pointer packets over multi-hop links without additional control overhead and to estimate hop distance between two MRs. By doing so, the MPFS improves the probability of success in forwarding pointer setup while ensuring K ≤ K max , resulting in lowering the Location Update overhead. To evaluate our scheme we implement both the PFS and the MPFS in ns-2 and compare them. As a result, we show that the MPFS significantly reduces the number of Location Update events, resulting in reduction of Location Update delay and signaling overhead, and packet losses during Location Updates.
Chaihien Gan - One of the best experts on this subject based on the ideXlab platform.
-
a study for Location Update cost in a femtocell network
Vehicular Technology Conference, 2010Co-Authors: Shinneng Wang, Phone Lin, Chaihien GanAbstract:The indoor femtocell technology (known as femto BSs) with low power and low cost is proposed to provide comprehensive indoor wireless converge of macro BSs, which is known as the femtocell network. The Location Area ID for a femtocell is different from that for the macrocell that covers the femtocell, which results in frequent Location Update procedure (i.e., the Location Update cost increases) when the Mobile Station has a significant level of mobility between femtocells and macrocells. We propose the Cell Priority Transition (CPT) mechanism to reduce the Location Update cost for the femtocell network. The simulation experiments and analysis are conducted to investigate the performance of the CPT mechanism. Our study shows that the proposed CPT mechanism significantly reduces the Location Update cost for femtocell networks.
-
VTC Fall - A Study for Location Update Cost in a Femtocell Network
2010 IEEE 72nd Vehicular Technology Conference - Fall, 2010Co-Authors: Shinneng Wang, Phone Lin, Chaihien GanAbstract:The indoor femtocell technology (known as femto BSs) with low power and low cost is proposed to provide comprehensive indoor wireless converge of macro BSs, which is known as the femtocell network. The Location Area ID for a femtocell is different from that for the macrocell that covers the femtocell, which results in frequent Location Update procedure (i.e., the Location Update cost increases) when the Mobile Station has a significant level of mobility between femtocells and macrocells. We propose the Cell Priority Transition (CPT) mechanism to reduce the Location Update cost for the femtocell network. The simulation experiments and analysis are conducted to investigate the performance of the CPT mechanism. Our study shows that the proposed CPT mechanism significantly reduces the Location Update cost for femtocell networks.
