• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.639-639
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.839-846
• /
• 2001

In this paper we describe a distributed location management scheme to reduce the bottleneck problem of HLR in Large Personal Communication Networks (LPCNs). Using analytical modeling and numerical simulation, we show that replicating location information is both appropriate and efficient for small Personal Communication Network (PCN). Then, we extend the scheme in a hierarchical environment to reduce overhead traffic and scale to LPCNs. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard scheme.