A built-in memory model for reducing location update cost in mobile wireless networks

Safa, Haïdar; Pierre, Samuel; Conan, J.

doi:10.1016/s0140-3664(02)00012-9

Cited by 10 publications

(10 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The "Terminal caching" and "Timer" are also combined with the "anchor" in [5,6,8]. The terminal is also enhanced with a built-in memory [5,6] to cache the address of the anchor.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

The Optimization of Location Management

Zhao¹,

Pissinou²,

Makki³

2007

2007 4th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

Binding and tracking are the two major phases of Location Management System (LMS). Thus, the communication costs during these two phases should be considered mostly for LMS optimization, without impairing the LMS performance. This paper describes a new optimization algorithm and, the key points of our improvement are: first, for each mobile terminal, we define more than one "anchor" node between its HLR and the serving VLR and construct a logical chain among all of them; second, the mobile terminal would memorize the current chain structure. Whenever the mobile terminal moves into a region served by a new VLR, the terminal will submit the chain structure which is saved in its memory to the new VLR. Then, the optimizing algorithm is conducted at the new VLR. The Records (that come from the terminal) and the routing information (of the new VLR) are used in the optimizing algorithm. The result of the optimization is a new chain structure in which the new VLR is one end of the chain, (the other end is always HLR of the terminal). After that, the new VLR updates the anchor chain according to the optimization result, and also downloads the new chain structure (the optimization result) to update the terminal's memory. The binding cost and the tracking cost are both considered in the optimization algorithm. The complexity analysis shows that in the worst case, the total cost (binding plus tracking) with zero call blocking probability can be O(M), which is better than the latest result O(M·log(M)). Here, M is the distance that the terminal has moved. The simulation investigates the efficiency of our improvement with different CMR (Call-toMobility Ratio).

show abstract

“…The "Terminal caching" and "Timer" are also combined with the "anchor" in [5,6,8]. The terminal is also enhanced with a built-in memory [5,6] to cache the address of the anchor.…”

Section: Related Workmentioning

confidence: 99%

“…The terminal is also enhanced with a built-in memory [5,6] to cache the address of the anchor. When the terminal moves to a region served by a new VLR, the new VLR can inquire the terminal about the address of its anchor, and then bind to the anchor.…”

Section: Related Workmentioning

confidence: 99%

The Optimization of Location Management

Zhao¹,

Pissinou²,

Makki³

2007

2007 4th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…In these designs, a subscriber is enhanced with a built-in memory [Hai01,Hai02] to cache the address of its anchor. When the subscriber moves to a new location served by a new VLR, this new VLR queries the subscriber about the address of its anchor and then binds to the anchor.…”

Section: Location Publishing Over Cellular Networkmentioning

confidence: 99%

“…From the perspective of a subscriber, any of its VLRs can be selected as its anchor only if the selection can reduce the accumulative expense of its location publishing. Other techniques, such as "terminal caching" and "built-in timer" are also combined with the technology of anchor [Hai01,Hai02,Zho01], regarding the subscriber's location publishing. In these designs, a subscriber is enhanced with a built-in memory [Hai01,Hai02] to cache the address of its anchor.…”

mentioning

confidence: 99%

“…Other techniques, such as "terminal caching" and "built-in timer" are also combined with the technology of anchor [Hai01,Hai02,Zho01], regarding the subscriber's location publishing. In these designs, a subscriber is enhanced with a built-in memory [Hai01,Hai02] to cache the address of its anchor. When the subscriber moves to a new location served by a new VLR, this new VLR queries the subscriber about the address of its anchor and then binds to the anchor.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Foundational Forensic Techniques for Cellular and Ad Hoc Multi-hop Networks

Zhao¹

View full text Add to dashboard Cite

The Internet has become an integral part of our nation's critical socio-economic infrastructure. With its heightened use and growing complexity however, organizations are at greater risk of cyber crimes. To aid in the investigation of crimes committed on or via the Internet, a network forensics analysis tool pulls together needed digital evidence.It provides a platform for performing deep network analysis by capturing, recording and analyzing network events to find out the source of a security attack or other information security incidents. Existing network forensics work has been mostly focused on the Internet and fixed networks. But the exponential growth and use of wireless technologies, coupled with their unprecedented characteristics, necessitates the development of new network forensic analysis tools.This dissertation fostered the emergence of a new research field in cellular and ad-hoc network forensics. It was one of the first works to identify this problem and offer vi fundamental techniques and tools that laid the groundwork for future research. In particular, it introduced novel methods to record network incidents and report logged incidents. For recording incidents, location is considered essential to documenting network incidents. However, in network topology spaces, location cannot be measured due to absence of a 'distance metric'. Therefore, a novel solution was proposed to label locations of nodes within network topology spaces, and then to authenticate the identity of nodes in ad hoc environments. For reporting logged incidents, a novel technique based on Distributed Hash Tables (DHT) was adopted. Although the direct use of DHTs for reporting logged incidents would result in an uncontrollably recursive traffic, a new mechanism was introduced that overcome this recursive process.These logging and reporting techniques aided forensics over cellular and ad-hoc networks, which in turn increased their ability to track and trace attacks to their source.These techniques were a starting point for further research and development that would result in equipping future ad hoc networks with forensic components to complement existing security mechanisms.vii Background and MotivationNowadays, the Internet has become an integral part of our nation's critical socio-economic infrastructure and a progressively dominant role of an individual's life for almost everything from shopping and banking to power grid and defense systems.With its heightened use and growing complexity, the Internet together with other types of computer networks such as cellular networks, sensor networks, or ad hoc networks greatly enriched people's lives; however, the advances in computer networks also energize those with questionable motives to abuse services provided over networks and disrupt social framework. This situation makes network security a critical issue that should be a necessary in designing any types of computer networks.As a sub-field of network security, Network Forensics is "the next step in the analysis of network a...

show abstract

Dynamic intelligent paging in mobile telecommunication network

et al. 2018

View full text Add to dashboard Cite

The purpose of this work is to investigate the reduction in location management cost by profiling the subscriber with the sets of call data record (CDR) as inputs for a dynamic network simulation. We propose dynamic intelligent paging using the history of subscribers' behaviour directly from a CDR dataset along with knowledge of users' past location to predict their next location and thus reducing the paging resources. Simulated results with the actual user data show 4-5 times better performance than that of conventional paging and 3-4 times better than that of intelligent paging. The specific research contributions regarding the dynamic management algorithm, which can be used along with the existing system without any modifications, are outlined in this work. An illustrative scenario demonstrates the proposed approach with synthetic data. The novelty of this work is that instead of using theoretically predicted data it uses actual CDR data to profile the users.

show abstract

A built-in memory model for reducing location update cost in mobile wireless networks

Cited by 10 publications

References 16 publications

The Optimization of Location Management

The Optimization of Location Management

Foundational Forensic Techniques for Cellular and Ad Hoc Multi-hop Networks

Dynamic intelligent paging in mobile telecommunication network

Contact Info

Product

Resources

About