Mobility Modeling (Mobile Ad Hoc Networks) Research Papers (original) (raw)

From the radar and military research world's, the Ultra-WideBand Impulse Radio (UWB-IR) was adopted in the telecommunications world in the 1990'. Currently, the UWB-IR technology is an interesting candidate for close range Wireless Sensors Networks (WSNs). It is particularly attractive for industrial sensor networks due to its resilience to multipath interference, simple transceiver circuitry, accurate ranging ability, and low transmission power. In order to secure data and communications in the Ad-Hoc UWB-IR networks, UWB-IR requires suitable encryption protocols. In this paper, we review and summarize the IEEE 802.15.4 security sub-layer protocol of UWB-IR based Symmetric Key Cryptography scheme. Then, we highlight the different vulnerabilities and weaknesses present in this type of scheme. Finally, we prove, after a deep examination of multiple Public Key Cryptography (PKC) schemes, that the certificateless one is the most suitable for Ad-Hoc UWB-IR networks characterized by nodes mobility. Indeed, we have also evaluated and analyzed the different public key cryptosystems (PKCS) and concluded that NTRU is the most optimum public key cryptosystem to be used with the certificateless scheme in order to secure data and communications in Ad-Hoc UWB-IR Networks. This is due to the fact that it is the fastest PKCS to provide different security levels at a high speed with very constrained resources.

- by
- •
- Mobile Learning, Mobile Robotics, Mobile Ad Hoc Networks, Mobility/Mobilities

Depicting realistically, the complex movement patterns of nodes is critical in the study of Mobile Ad hoc Networks (MANETs). As the existing mobility models cannot realistically model the identified movement patterns and characteristics in disaster area scenarios, this paper proposes a disaster area mobility model that realistically represents the movements of nodes in a disaster area scenario. This model is heterogeneous-based and pulls together the strengths of some selected homogenous mobility models. The proposed model is evaluated and compared to existing homogenous models in ns-2 simulations. Results show that the idea of heterogeneous model is a possibility, capturing realistically, the defined features of disaster scenarios and when compared to existing models, performed better.

International Journal of Ad hoc, sensor & Ubiquitous Computing (IJASUC) is a bi monthly open access peer-reviewed journal provides excellent international forum for sharing knowledge and results in theory, methodology and applications of Ad Hoc & Ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ad hoc, Sensor & Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life

In order to evaluate performance of protocols for ad hoc networks, the protocols have to be tested under realistic conditions. These conditions may include a reasonable transmission range, a limited buffer size, and realistic movement of mobile users (mobility models). In this paper, we propose a new and realistic type of random mobility models in which the mobile node has to decelerate to reach the point of direction change and accelerates with a defined acceleration to reach its intended speed. This realistic mobility model is proposed based on random mobility models. In reality, mobile objects tend to change their speed when they are going to change their direction, i.e. decelerate when approaching a direction change point and accelerate when they start their movement in a new direction. Therefore, in this paper, we implement this behavior in random mobility models which lack such specification. In fact, this paper represents our effort to use this accelerated movement to anticipate a probable direction change of a mobile node with reasonable confidence. The simulation type of this paper is based on traces produced by a mobility trace generator tool. We use a data mining concept called association rule mining to find any possible correlations between accelerated movement of mobile node and the probability that mobile node wants to change its direction. We calculate confidence and lift parameters for this matter, and simulate this mobility model based on random mobility models. These simulations show a meaningful correlation between occurrence of an accelerated movement and event of mobile node's direction change.

- by Masoud Zarifneshat and +1
- •
- Wireless Sensor Networks, Mobility Modeling (Mobile Ad Hoc Networks), Target Tracking, Association Rules Mining

A Mobile Ad hoc Network (MANET) is a collection of mobile stations with wireless interfaces which form a temporary network without using any central administration. MANETs are more vulnerable to attacks because they have some specific characteristics as complexity of wireless communication and lack of infrastructure. Hence security is an important requirement in mobile ad hoc networks. One of the attacks against network integrity in MANETs is the Black Hole Attack. In this type of attack all data packets are absorbed by malicious node, hence data loss occurs. In this paper we investigated the impacts of Black Hole attacks on the network performance. We have simulated black hole attacks using Network Simulator 2 (NS-2) and have measured the packet loss in the network without and with a black hole attacks. Also, we measured the packet loss when the number of black hole attacks increases.

Existing mobility models for wireless sensor networks generally do not preserve a uniform scattering of the sensor nodes within the monitored area. This paper proposes a coverage-preserving random mobility model called DPRMM. Direction and velocity are randomly chosen according to the local information about sensor density. Our mobility model is devised in a manner that sensors move towards the least covered regions within their neighborhood. We show that this guarantees a rapid convergence to the steady state while preserving a uniform coverage degree on the monitored region. Throughout the simulations we have carried out, we find that the analytical study is corroborated by practical experiments. Our experiments show that the average distance made by a target without being detected is approximately enhanced at least by a factor of 2 using DPRMM.

- by Alul New
- •
- Robotics, Embedded Systems, Linux, Wireless Sensor Networks

In literature, a few attempts have been made to model the mobility of the airborne networks. However, existing models are mostly application specific and oversimplify the system dynamics. This paper proposes a comprehensive mobility model for the airborne networks where the mobility of the airborne node is presented as a Gauss-Markov process comprising of three key parameters-the speed, angular velocity, and pitch angle. The consideration of the Gauss-Markov process and angular velocity enables the model to address the mobility more realistically and thus makes it capable of generating apparently all possible types of trajectories. Additionally, this model designs more realistic boundary effects to be practical. This paper also presents the stochastic analysis of the proposed model. Finally, by analyzing the extensive simulation results it has been affirmed that the proposed mobility model can be used as a fundamental template to model and analyze a wide range of practical airborne networks regardless of the application including both homogeneous and heterogeneous networks.

A mobile ad-hoc network (MANET) is a self structured infrastructure less network of mobile devices connected by wireless. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Load balancing is a technique to share out workload across network links, to achieve maximize throughput, minimize response time, and avoid overload. Load imbalance is a one of the critical issue in the ad-hoc network. Particle Swarm Optimization (PSO) method is used to implement our proposed technique. In this Paper two algorithms are used for balancing the nodes in the network. Identify the unfair nodes location next allocate and balance the load between the nodes in the network. The simulation results show that this approach is more effective in terms of packet delivery ratio, average end-to-end delay, load distribution, packet delay variation, packet reordering, and throughput. KEYWORDS dynamic MANET on-demand(DYMO);Lifetime prediction; Link lifetime (LLT); mobile ad hoc networks (MANETs);route discovery; particle swarm optimization(PSO).

Numerous studies have analyzed the performances of routing protocols in mobile Ad-hoc networks (MANETs); most of these studies vary at most one or two parameters in experiments and do not study the interactions among these parameters. Furthermore, efficient mathematical modeling of the performances has not been investigated; such models can be useful for performance analysis, optimization, and prediction. This study aims to show the effectiveness of the response surface methodology (RSM) on the performance analysis of routing protocols in MANETs and establish a relationship between the influential parameters and these performances through mathematical modeling. Given that routing performances usually do not follow a linear pattern according to the parameters; mathematical models of factorial designs are not suitable for establishing a valid and reliable relationship between performances and parameters. Therefore, a Box–Behnken design, which is an RSM technique and provides quadratic mathematical models, is used in this study to establish a relationship. The obtained models are statistically analyzed; the models show that the studied performances accurately follow a quadratic evolution. These models provide invaluable information and can be useful in analyzing, optimizing, and predicting performances for mobile Ad-hoc routing protocols.

Mobile Ad hoc Networks (MANETs) are wireless networks consisted of mobile free nodes that can move anywhere at any time without the need to any fixed infrastructure or any centralized administration. In this category of networks existing nodes must rely on each other to play the role of routers or switches instead of using central ones. The self-organized nature of such environments made MANETs vulnerable against many security threats. As a result, providing security requirements in MANETs is one of the most interesting challenges in such a network. In this group of networks, the use of cryptographic solutions is one of the most interesting security issues. The importance of this scientific area in MANETs is more drastic by considering that mentioned schemes must be lightweight enough to be appropriate for resource constrained platforms in such environment. This paper has tried to represent the position of cryptographic issues in MANETs. Moreover, security issues in mobile Ad hoc networks beside of different classes of public key cryptosystems have been introduced.

In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks (MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can operate without using focal access points, pre-existing infrastructures, or a centralized management point. In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead to various problems in the routing process such as increase of the overhead massages and inefficient routing between nodes of network. A large variety of clustering methods have been developed for establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having significant impact on MANETs performance. The K-means algorithm is one of the effective clustering methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption. This paper proposed a new K-means clustering algorithm to find out optimal path from source node to destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the performance of routing process in Mobile ad-hoc networks.

Deterministic channel models have been widely used in simulation and modeling of ad hoc network for a long time. But, deterministic channel models are too simple to represent a real-world ad hoc network scenario. Recently, random channel models have drawn considerable attention of the researchers in this field. The results presented in the literature show that random channel models have a grave impact on the performance of an ad hoc network. A comprehensive investigation on this issue is yet to be available in the literature. In this investigation, we consider both deterministic and random channel models to investigate their effects on ad hoc networks. We consider two different types of routing protocols namely single path and multipath routing protocols. We choose Destination Sequence Distance Vector (DSDV), Dynamic Source Routing Protocol (DSR), and Ad-hoc On-Demand Distance Vector (AODV) as the single path routing protocols. On the other hand, we choose Ad-hoc On-Demand Multiple Path Distance Vector (AOMDV) as the multipath routing protocol. The results show that some single path routing protocol can outperform multipath routing protocol under both deterministic and random channel conditions. These results surprisingly contradict the popular claim that multipath routing protocol always outperforms single path routing protocol. A guideline for choosing an appropriate routing protocol for adhoc network has also been provided in this work.

AbstractResearchers need to choose an appropriate scenario to study the performance of a Mobile Ad hoc NETwork (MANET) via simulation. For example, routing is not properly evaluated when the shortest path between each pair of nodes in... more