Random Waypoint Model Research Articles

Information spreading in dynamic graphs

We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary ergodic Markovian dynamic graph processes, that is, processes in which the topology of the graph at time \(t\) depends only on its topology at time \(t-1\) and which have a unique stationary distribution. The most well studied models of dynamic graphs are all Markovian and ergodic. Under general conditions, we bound the flooding time in terms of the mixing time of the dynamic graph process. We recover, as special cases of our result, bounds on the flooding time for the random trip model and the random path one; previous analysis techniques provided bounds only in restricted settings for such models. Our result also provides the first bound for the random waypoint model whose analysis had been an important open question. The bound is tight for the most realistic ranges of the network parameters.

Adaptive Scheme for suppressing unnecessary Hello messages used for Neighbor Discovery in MANET routing protocols

Mobile ad-hoc networks are widely used these days as in smart phones but energy efficiency is a major issue when discovering neighbor nodes to maintain connectivity as periodically exchanging hello messages are used for it. Overhead goes high due to neighbor discovery messages in the MANET routing protocols, such as in AODV, DYMO. In an attempt to enhance the scheme, this paper proposes a new approach to solve the problem by reducing unnecessary hello messages. In this paper we consider MANET under random waypoint model and investigated the relationship between the hello interval and event intervals. Finally we evaluate our study through simulations, the proposed scheme reduces the energy consumption and overhead of neighbor discovery processes.

A QoS-Oriented Distributed Routing Protocol for Hybrid Wireless Networks

As wireless communication gains popularity, significant research has been devoted to supporting real-time transmission with stringent Quality of Service (QoS) requirements for wireless applications. At the same time, a wireless hybrid network that integrates a mobile wireless ad hoc network (MANET) and a wireless infrastructure network has been proven to be a better alternative for the next generation wireless networks. By directly adopting resource reservation-based QoS routing for MANETs, hybrids networks inherit invalid reservation and race condition problems in MANETs. How to guarantee the QoS in hybrid networks remains an open problem. In this paper, we propose a QoS-Oriented Distributed routing protocol (QOD) to enhance the QoS support capability of hybrid networks. Taking advantage of fewer transmission hops and anycast transmission features of the hybrid networks, QOD transforms the packet routing problem to a resource scheduling problem. QOD incorporates five algorithms: 1) a QoS-guaranteed neighbor selection algorithm to meet the transmission delay requirement, 2) a distributed packet scheduling algorithm to further reduce transmission delay, 3) a mobility-based segment resizing algorithm that adaptively adjusts segment size according to node mobility in order to reduce transmission time, 4) a traffic redundant elimination algorithm to increase the transmission throughput, and 5) a data redundancy elimination-based transmission algorithm to eliminate the redundant data to further improve the transmission QoS. Analytical and simulation results based on the random way-point model and the real human mobility model show that QOD can provide high QoS performance in terms of overhead, transmission delay, mobility-resilience, and scalability.

Performance Assessment of an Epidemic Protocol in VANET Using Real Traces

Many vehicular ad-hoc network protocols have been validated using complex urban mobility simulators or by means of the few publicly available real mobility traces. This work presents an extensive measurement campaign of the positions of a fleet of 370 taxi cabs moving around the city of Rome, Italy. Due to its street network and its traffic conditions, Rome presents a characteristic mobility pattern representative of an ancient city with heavy road congestion, and therefor provides a valuable test case to experiment VANET protocols. We exploit these traces to run a set of experiments to assess the performance of a simple epidemic protocol that we compare with the basic random waypoint model in order to quantify how far the performance metrics are from this baseline. The results show the possible outcomes of implementing data dissemination through an opportunistic network that uses taxi cabs as an information vector.

The random waypoint mobility model with uniform node spatial distribution

In this paper, we tackle the problem of designing a random mobility model generating a target node spatial distribution. More specifically, we solve a long standing open problem by presenting two versions of the well-known random waypoint (RWP) mobility model in bounded regions generating a uniform steady-state node spatial distribution. In the first version, named temporal-RWP, we exploit the temporal dimension of node mobility and achieve uniformity by continuously changing the speed of a mobile node as a function of its location and of the density function of trajectories in the movement region R. In the second version, named spatial-RWP, we instead exploit the spatial dimension and achieve uniformity by selecting waypoints according to a suitably defined mix of probability density functions. Both proposed models can be easily incorporated in wireless network simulators, and are thus of practical use. The RWP models presented in this paper allow for the first time completely removing the well-known border effect causing possible inaccuracies in mobile network simulation, thus completing the picture of a “perfect” simulation methodology drawn in existing literature.

A framework for modeling spatial node density in waypoint-based mobility

User mobility is of critical importance when designing mobile networks. In particular, "waypoint" mobility has been widely used as a simple way to describe how humans move. This paper introduces the first modeling framework to model waypoint-based mobility. The proposed framework is simple, yet general enough to model any waypoint-based mobility regimes. It employs first order ordinary differential equations to model the spatial density of participating nodes as a function of (1) the probability of moving between two locations within the geographic region under consideration, and (2) the rate at which nodes leave their current location. We validate our model against real user mobility recorded in GPS traces collected in three different scenarios. Moreover, we show that our modeling framework can be used to analyze the steady-state behavior of spatial node density resulting from a number of synthetic waypoint-based mobility regimes, including the widely used Random Waypoint model. Another contribution of the proposed framework is to show that using the well-known preferential attachment principle to model human mobility exhibits behavior similar to random mobility, where the original spatial node density distribution is not preserved. Finally, as an example application of our framework, we discuss using it to generate steady-state node density distributions to prime mobile network simulations.

A Minimum Interference Cross-Layer Routing Protocol for Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), channel contention and packet collision can seriously affect the performance of routing protocols, which will eventually affect the performance of the whole network. Besides, the arbitrary mobility of nodes makes contention and collision ever-changing and more complex. Thus, it is imperative to analyze the problem of contention and collision so as to build appropriate routes in MANETs. In this paper, by respectively predicting the durations of the contention and collision at every hop along the route, a minimum interference cross-layer routing protocol (MI-CLR) is proposed based on Random Waypoint (RWP) model. The new protocol classifies the interference in the network into two types; the first type of interference can only affect channel contention, while the other affects both channel contention and packet collision. Via taking the two types of interference together into account, we propose a new routing metric to build routes which guarantees that the established routes will not break frequently while having the minimum interference. Simulation results show that the MI-CLR protocol can significantly improve the network performance such as the average end-to-end delay, the packet loss ratio, the routing overhead and the throughput.

Analysing and Implementing the Mobility over MANETS using Random Way Point Model

Wireless networks are increasing in popularity with current advances in technology, The architecture of such networks is not based on a centralized base station but on each node which acts as a router and forwards data packets to other nodes in the network. The technologies have driven into new era with the introduction of ad hoc networks and the concept behind the ad hoc networks is it works without the access points. It has features like adaptive, self organizing and decentralized in nature. Due to these specialized features, it has become a popular technology. So, there has been an inevitable need of a good routing protocol in order to establish the connection between the nodes since the mobile nodes can change their topology frequently. The movement of the mobile node is one of the important characteristics because it can affect the performance of the ad hoc network protocol. This paper has analyzed the mobility of the random waypoint model for different routing protocols in mobile ad-hoc network.

Fast flooding over Manhattan

We consider a Mobile Ad-hoc NETwork (MANET) formed by $$n$$ agents that move at speed $$\text{ v}$$ according to the Manhattan Random-Waypoint model over a square region of side length $$L$$ . This model has stationary properties that strongly depart from the well-studied Random-Walk model and that are typical in scenarios of vehicular traffic in urban zones. For instance, the resulting stationary (agent) spatial probability distribution is far to be uniform: the average density over the “central zone” is asymptotically higher than that over the “Suburb”. Agents exchange data if and only if they are at (Euclidean) distance at most $$R$$ within each other. We study the flooding time of this MANET: the number of time steps required to broadcast a message from one source agent to all agents of the network in the stationary phase. We prove the first asymptotical upper bound on the flooding time. This bound holds with high probability, it is a decreasing function of $$R$$ and $$\text{ v}$$ , and it is tight for a wide and relevant range of the network parameters (i.e. $$L, R$$ and $$\text{ v}$$ ). A consequence of our result is that flooding over the sparse and highly-disconnected Suburb can be as fast as flooding over the dense and connected central zone. This property holds even when $$R$$ is exponentially below the connectivity threshold of the MANET and the speed $$\text{ v}$$ is very low.

Effective Performance of Dynamic Source Routing Protocol on Random Waypoint Model (RWM) Using CBR

Mobile ad hoc network is a collection of wireless nodes that communicate to each other without using any infrastructure, access point, or centralized network. Each nodes have own capability to receiving and forwarding packet each other device in mobile ad hoc network. In this article, showing the performance of dynamic source routing protocol based on the broadcasting data on nodes placement scenarios using random waypoint model (RWM). Broadcast packet on CBR that means constant bit rate data transfer constantly on random waypoint model and showing the effective performance of dynamic source routing protocol in mobile ad hoc network (MANET).The performance analysis is based on different network metrics such as Number of Hop Counts, Number of Routes Selected, Number of RREP Received, and Number of RREQ discarded for loop, Number of RREQ received, Number of Duplicate RREQ received, Number of RREQ Retried, and Number of Data Packets Dropped for no route, Number of RREQ Forwarded, Number of RREQ TTL expired and Residual Battery Capacity.

Broadcasting Traffic Load Performance Analysis of 802.11 MAC in Mobile Ad hoc Networks (MANET) Using Random Waypoint Model (RWM)

Wireless networks are playing a major role in the area of wireless communication. Ad hoc network is a collection of wireless nodes that are communicate from one node to other nodes without using any existing infrasturacture , access point, and centralized network. The wireless communication devices are transmitters, receivers and smart antennas. These antennas can be of any kind and nodes can be fixed or mobile. The term node referred to as, which are free to move arbitrarily in every direction. In this article showing the pefromance of 802.11 MAC on basis of broadcasting traffic load using random waypoint model In wireless mobile ad hoc network (MANET) . this article main aim showing effictive performance of constant bit rate based on broadcasting data from one network to other network. Mainly this article focus on the performance metric such as 80.11 MAC Broadcast packet sent to channel, Packet from network layar, Broadcast packets received, 802.11 MAC Unicast packet sent to channel,Unicast packets received clearly.

Two-terminal reliability of a mobile ad hoc network under the asymptotic spatial distribution of the random waypoint model

The random waypoint (RWP) mobility model is frequently used in describing the movement pattern of mobile users in a mobile ad hoc network (MANET). As the asymptotic spatial distribution of nodes under a RWP model exhibits central tendency, the two-terminal reliability of the MANET is investigated as a function of the source node location. In particular, analytical expressions for one and two hop connectivities are developed as well as an efficient simulation methodology for two-terminal reliability. A study is then performed to assess the effect of nodal density and network topology on network reliability.

Complex networks properties analysis for mobile ad hoc networks

Recently, research on complex network theory and applications draws a lot of attention in both academy and industry. In mobile ad hoc networks (MANETs) area of research, a critical issue is to design the most effective topology for given problems. It is natural and significant to consider complex networks topology when optimising the MANET topology. Current works usually transform MANET or sensor network topologies into either small-world or scale-free. However, some fundamental problems remain unsolved. Specifically, what are the average shortest path length, degree distribution and clustering characteristics of MANETs? Do MANETs have small-world effect and scale-free property? In this work, the authors introduce complex networks theory into the context of MANET topology and study complex network properties of the MANETs to answer the above questions. The authors have theoretically analysed the degree distribution and clustering coefficient of MANETs and proposed approach to computing them. The degree distribution and clustering coefficient of MANETs are theoretically deduced from node space probability distribution on different mobility models (including but not limited to random waypoint model). Simulation results on average shortest path length, clustering coefficient and degree distribution show that in most cases MANETs do not have the small-world effect and scale-free property.

Analysis of mobile ad-hoc network routing protocols using shadowing propagation model

In this paper, we present the implementation and analysis of our implemented MANET simulation system considering ad-hoc on demand distance vector (AODV), dynamic MANET on-demand (DYMO) and optimised link state routing (OLSR) protocols for wireless multi-hop networking. We investigate the effect of mobility and topology changing in MANET. We study the impact of source and destination movement for indoor environment. In this work, we consider five models: stationary, source movement scenario, destination movement scenario, source and destination movement scenario and random way-point models. We assess the performance of our simulation system in terms of throughput, number of received packets and hop distance. From the results, we found that the AODV protocol has a good performance when the source and destination nodes are moving. Also, the AODV protocol provides a flexible and effective routing for indoor environment.

A novel congestion control strategy in DTN

Delay tolerant networks (DTNs) are wireless networks where disconnections may occur frequently due to node mobility, power outages and propagation phenomena. To achieve date delivery, store-and-forward protocols are used in DTN and routing protocols based on epidemic message dissemination have been proposed, like epidemic routing. Under epidemic routing, messages can be delivered completely between every two nodes if every node buffer is big enough and the communication time is long enough after one node contacts another. But congestion will occur easily at a node if the buffer of this node is limited under epidemic routing in DTN. To solve this problem, a novel congestion control strategy is introduced. The strategy is called N-DC (drop the copying numbers over N). By using simulations based on a Random Waypoint model, the simulation results proved the improvement of this strategy.

MOBILITY SCENARIO-BASED PERFORMANCE EVALUATION OF PREEMPTIVE DSR PROTOCOL FOR MANET

Ad hoc wireless networks are characterized by multi-hop wireless connectivity, infrastructure less environment and frequently changing topology. To analyze the performance of routing protocols in MANETs in the real world, a scenario based simulation analysis is required since there is a lack of necessary infrastructure for their deployment. Most of the earlier work done in this field have assumed the Random Waypoint model, which fails to capture the realistic movement of the nodes. In this paper, we describe a set of experiments conducted to analyze the performance of the Preemptive DSR routing protocol in a battlefield scenario. BonnMotion Software(Java based) is used to create and analyses mobility scenarios. Initially an explanation of the experimental metrics and the setup is described, followed by the scenarios used for our simulations. The results give an idea of how the Preemptive DSR protocol behaves in the given scenario and helps identify the metrics for optimal performance of the protocol.

Analysis of MANET routing Protocols Using Random waypoint Model in DSR

Analysis of MANET routing Protocols Using Random waypoint Model in DSR

Probability Density of the Received Power in Mobile Networks

Probability density of the received power is well analyzed for wireless networks with static nodes. However, most of the present days networks are mobile and not much exploration has been done on statistical analysis of the received power for mobile networks in particular, for the network with random moving patterns. In this paper, we derive probability density of the received power for mobile networks with random mobility models. We consider the power received at an access point from a particular mobile node. Two mobility models are considered: Random Direction (RD) model and Random way-point (RWP) model. Wireless channel is assumed to have a small scale fading of Rayleigh distribution and path loss exponent of 4. 3D, 2D and 1D deployment of nodes are considered. Our findings show that the probability density of the received power for RD mobility models for all the three deployment topologies are weighted confluent hypergeometric functions. In case of RWP mobility models, the received power probability density for all the three deployment topologies are linear combinations of confluent hypergeometric functions. The analytical results are validated through NS2 simulations and a reasonably good match is found between analytical and simulation results.

Classification and Evaluation of Mobility Metrics for Mobility Model Movement Patterns in Mobile Ad-Hoc Networks

A mobile ad hoc network is collection of self configuring and adaption of wireless link between communicating devices (mobile devices) to form an arbitrary topology and multihop wireless connectivity without the use of existing infrastructure. It requires efficient dynamic routing protocol to determine the routes subsequent to a set of rules that enables two or more devices to communicate with each others. This paper basically classifies and evaluates the mobility metrics into two categories- direct mobility metrics and derived mobility metrics. These two mobility metrics has been used to measure different mobility models, this paper considers some of mobility models i.e Random Waypoint Model, Reference Point Group Mobility Model, Random Direction Mobility Model, Random Walk Mobility Model, Probabilistic Random Walk, Gauss Markov, Column Mobility Model, Nomadic Community Mobility Model and Manhattan Grid Model.

An Estimated Distance-Based Routing Protocol for Mobile Ad hoc Networks

In mobile ad hoc networks (MANETs), the network topology changes frequently and unpredictably due to the arbitrary mobility of nodes. This feature leads to frequent path failures and route reconstructions, which causes an increase in the routing control overhead. Thus, it is imperative to reduce the overhead of route discovery in the design of routing protocols of MANETs. In this paper, we propose an estimated distance (EstD)-based routing protocol (EDRP) to steer a route discovery in the general direction of a destination, which can restrict the propagation range of route request (RREQ) and reduce the routing overhead. In the EDRP, the change regularity of the received signal strength (RSS) is exploited to estimate the geometrical distance between a pair of nodes, which is called the estimated geometrical distance (EGD). Simulation experiments based on a random waypoint (RWP) model show that the EGD can effectively reflect the actual distance when it is less than the expected value of the distance [which is called the estimation radius (E-Radius)] between any node pairs. We also propose an estimated topological distance (ETD), which is a topology-based EstD, as an aid to the EGD, which can mitigate the effect of inaccurate EGD. The EstD is a combination of EGD and ETD. In the protocol, every node evaluates the link quality through the computational process of the EGD to eliminate the weak links and then uses the EstD (EGD and ETD) to steer the RREQ packets toward the general direction of the destination. Simulation results show that the proposed protocol can significantly reduce the routing overhead and improve the routing performance in dense or high-mobility networks.