Modeling and Management of Location and Mobility

2011 ◽  
pp. 177-212 ◽  
Author(s):  
Wenye Wang

Location modeling represents inclusive mobile objects and their relationship in space, dealing with how to describe a mobile object’s location. The goal of mobility modeling, on the other hand, is to predict or statistically estimate the movement of mobile objects. With the increasing demand for multimedia applications, location-aware services, and system capacity, many recognize that modeling and management of location and mobility is becoming critical to locating mobile objects in wireless information networks. Mobility modeling and location management strongly influence the design and performance of wireless networks in many aspects, such as routing, network planning, handoff, call admission control, and so forth. In this chapter, we present a comprehensive survey of mobility and location models, and schemes used for location-mobility management in cellular and ad hoc networks, which are discussed along with necessary, but understandable, formulation, analysis, and discussions.

Author(s):  
Wenye Wang

One of the most salient features of wireless communications is that users can deploy a variety of wireless devices to communicate with others, regardless of their locations. Although mobility support provides flexibility and convenience, it introduces many challenging issues to network design, planning, and performance evaluation. With the increasing demand for multimedia applications, location-aware services, and system capacity, many recognize that modeling and management of location and mobility are becoming critical to locating mobile objects in wireless information networks. Location management and mobility modeling strongly influence the choice and performance of mobility and resource management algorithms, such as routing, handoff, and call admission control in many types of wireless networks. For these reasons, it is important to understand mobility modeling and location management mechanisms and the manner in which these mechanisms depend on the characteristics of mobile environments. This article is concerned with issues in, and methods for, location management and mobility modeling in wireless data networks. The most distinguished features of next generation wireless systems can be highlighted as reliable quality of service (QoS) for various applications and global roaming. Since the intrinsic characteristic of mobile communications is mobility support, wireless systems must be able to locate roaming mobile terminals (MTs) at any time to deliver services and to maintain connections, as the MTs move from one service area to another. Location management techniques enable mobile users to move around, even between different systems with dissimilar signaling formats and protocols, while simultaneously offering them incoming calls and maintaining services in progress. Therefore, the objective of mobility modeling is to estimate the current and future locations of a mobile user upon the arrival of a connection request, which involves many parameters, such as moving speed, call duration time, distance between the last known position and destination, and geographical conditions. Location management, however, deals with the problem of how to register or update new location of a mobile user with a wireless system, and how to locate a mobile terminal given the information in system databases.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Peter Baumann ◽  
Dimitar Misev ◽  
Vlad Merticariu ◽  
Bang Pham Huu

AbstractMulti-dimensional arrays (also known as raster data or gridded data) play a key role in many, if not all science and engineering domains where they typically represent spatio-temporal sensor, image, simulation output, or statistics “datacubes”. As classic database technology does not support arrays adequately, such data today are maintained mostly in silo solutions, with architectures that tend to erode and not keep up with the increasing requirements on performance and service quality. Array Database systems attempt to close this gap by providing declarative query support for flexible ad-hoc analytics on large n-D arrays, similar to what SQL offers on set-oriented data, XQuery on hierarchical data, and SPARQL and CIPHER on graph data. Today, Petascale Array Database installations exist, employing massive parallelism and distributed processing. Hence, questions arise about technology and standards available, usability, and overall maturity. Several papers have compared models and formalisms, and benchmarks have been undertaken as well, typically comparing two systems against each other. While each of these represent valuable research to the best of our knowledge there is no comprehensive survey combining model, query language, architecture, and practical usability, and performance aspects. The size of this comparison differentiates our study as well with 19 systems compared, four benchmarked to an extent and depth clearly exceeding previous papers in the field; for example, subsetting tests were designed in a way that systems cannot be tuned to specifically these queries. It is hoped that this gives a representative overview to all who want to immerse into the field as well as a clear guidance to those who need to choose the best suited datacube tool for their application. This article presents results of the Research Data Alliance (RDA) Array Database Assessment Working Group (ADA:WG), a subgroup of the Big Data Interest Group. It has elicited the state of the art in Array Databases, technically supported by IEEE GRSS and CODATA Germany, to answer the question: how can data scientists and engineers benefit from Array Database technology? As it turns out, Array Databases can offer significant advantages in terms of flexibility, functionality, extensibility, as well as performance and scalability—in total, the database approach of offering “datacubes” analysis-ready heralds a new level of service quality. Investigation shows that there is a lively ecosystem of technology with increasing uptake, and proven array analytics standards are in place. Consequently, such approaches have to be considered a serious option for datacube services in science, engineering and beyond. Tools, though, vary greatly in functionality and performance as it turns out.


2018 ◽  
Vol 14 (11) ◽  
pp. 155014771881505 ◽  
Author(s):  
Ishtiaq Wahid ◽  
Ata Ul Aziz Ikram ◽  
Masood Ahmad ◽  
Fasee Ullah

With resource constraint’s distributed architecture and dynamic topology, network issues such as congestion, latency, power awareness, mobility, and other quality of service issues need to be addressed by optimizing the routing protocols. As a result, a number of routing protocols have been proposed. Routing protocols have trade-offs in performance parameters and their performance varies with the underlying mobility model. For designing an improved vehicular ad hoc network, three components of the network are to be focused: routing protocols, mobility models, and performance metrics. This article describes the relationship of these components, trade-offs in performance, and proposes a supervisory protocol, which monitors the scenario and detects the realistic mobility model through analysis of the microscopic features of the mobility model. An analytical model is used to determine the best protocol for a particular mobility model. The supervisory protocol then selects the best routing protocol for the mobility model of the current operational environment. For this, EstiNet 8.1 Simulator is used to validate the proposed scheme and compare its performance with existing schemes. Simulation results of the proposed scheme show the consistency in the performance of network throughout its operation.


2021 ◽  
Vol 12 (4) ◽  
pp. 1-30
Author(s):  
Zhenchang Xia ◽  
Jia Wu ◽  
Libing Wu ◽  
Yanjiao Chen ◽  
Jian Yang ◽  
...  

Vehicular ad hoc networks ( VANETs ) and the services they support are an essential part of intelligent transportation. Through physical technologies, applications, protocols, and standards, they help to ensure traffic moves efficiently and vehicles operate safely. This article surveys the current state of play in VANETs development. The summarized and classified include the key technologies critical to the field, the resource-management and safety applications needed for smooth operations, the communications and data transmission protocols that support networking, and the theoretical and environmental constructs underpinning research and development, such as graph neural networks and the Internet of Things. Additionally, we identify and discuss several challenges facing VANETs, including poor safety, poor reliability, non-uniform standards, and low intelligence levels. Finally, we touch on hot technologies and techniques, such as reinforcement learning and 5G communications, to provide an outlook for the future of intelligent transportation systems.


Author(s):  
Irina Tal ◽  
Gabriel-Miro Muntean

This chapter highlights the importance of Vehicular Ad-Hoc Networks (VANETs) in the context of smarter cities and roads, a topic that currently attracts significant academic, industrial, and governmental planning, research, and development efforts. In order for VANETs to become reality, a very promising avenue is to bring together multiple wireless technologies in the architectural design. Clustering can be employed in designing such a VANET architecture that successfully uses different technologies. Moreover, as clustering addresses some of VANETs' major challenges, such as scalability and stability, it seems clustering will have an important role in the desired vehicular connectivity in the cities and roads of the future. This chapter presents a comprehensive survey of clustering schemes in the VANET research area, covering aspects that have never been addressed before in a structured manner. The survey presented in this chapter provides a general classification of the clustering algorithms, presents some of the most advanced and latest algorithms in VANETs, and in addition, constitutes the only work in the literature to the best of authors' knowledge that also reviews the performance assessment of clustering algorithms.


Author(s):  
P. Subathra ◽  
S. Sivagurunathan

A Mobile Ad hoc Network (MANET) is a collection of wireless nodes communicating over multi-hop paths without any infrastructure. Nodes must cooperate to provide necessary network functionalities. The security in routing protocols like Dynamic Source Routing (DSR) can be compromised by a “Black Hole” attack. Here, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops them, leading to performance degradation. The situation becomes worse when two or more nodes cooperate and perform the “Cooperative black hole” attack. This chapter proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating the attacking nodes. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio, and false negative probability in comparison with trust and probe based schemes.


Sign in / Sign up

Export Citation Format

Share Document