Random Waypoint Mobility Model Research Articles

Performance Analysis of RAW Impact on IEEE 802.11ah Standard affected by Doppler Effect

Internet of Things (IOT) offers a new dimension of technology and information where connectivity is available anywhere, anytime, and for any purpose. IEEE 802.11 Wireless Local Area Network group is a standard that developed to answer the needs of wireless communication technology (WI-Fi). Recently, IEEE 802.11 working group released the 802.11ah technology or Wi-Fi HaLow as a Wi-fi standard. This standard works on the 1 GHz frequency band with a broader coverage area, massive device and the energy efficiency issues. This research addresses, the influence of Doppler Effect using Random Waypoint mobility model on 802.11ah with different RAW slot and RAW slot duration are analyzed. The design of the simulation system is done by changing RAW slot and RAW slot duration. Based on the result, it can be concluded that the overall performance of the network with all of the parameter scenarios is decreasing along with the increasing RAW slot, RAW slot duration, and fluctuation. In the RAW slot = 5 scenario with v = 10 km/h has the worst performance with an average delay which is about 0.128225 s, and average throughput is about 0.284337 Mbps while for RAW slot = 1 with an average PDR which is about 99.1076 %. While in the RAW slot duration = 0.020 s scenario with v = 10 km/h has the worst performance with an average delay which is about 0.135581 s, average throughput is about 0.286828 Mbps, and average PDR which is about 99.3165 %.

Enhanced Geographic Routing with Two-Hop Neighborhood Information in Sparse MANETs

The advance of wireless and mobile communications and networking technologies enables networked nodes to transmit and receive data in ad hoc manners without resorting to dedicated network infrastructures. When nodes arbitrarily move in a geographic area, they carry data and attempt to exchange data during encountering each other in one-hop or multi-hop transmission range. Such a basic data delivery model is practical in many emerging application environments, like disaster, military and rural fields, etc., which turns out to be the research of routing in sparse mobile ad hoc networks (MANET). In sparse MANETs with lower node population or node density relatively, the performance of data delivery is highly affected by communication voids that arise from unpredictable transmission failure while no neighbors exist in mutual transmission ranges. This paper proposes a new geographic routing scheme to deal with critical communication voids in sparse MANETs. The proposed scheme exploits the geographic location and two-hop neighborhood information, and then devises a forwarding node selection policy for determining appropriate relay candidates that move towards target nodes in a network. To this end, this geographic routing scheme is able to reduce transmission overhead and end-to-end delay against communication voids in infrastructure-less environments. In addition, this paper examines the proposed scheme using synthetic studies on a dedicated opportunistic networking simulator. Simulated results show that this scheme obtains considerable performance in terms of successful delivery ratio and transmission overhead under the random waypoint mobility models in synthetic contexts of sparse MANETs.

Modeling the Random Orientation of Mobile Devices: Measurement, Analysis and LiFi Use Case

Light-fidelity (LiFi) is a networked optical wireless communication (OWC) solution for high-speed indoor connectivity for fixed and mobile optical communications. Unlike conventional radio frequency wireless systems, the OWC channel is not isotropic, meaning that the device orientation affects the channel gain significantly, particularly for mobile users. However, due to the lack of a proper model for device orientation, many studies have assumed that the receiver is vertically upward and fixed. In this paper, a novel model for device orientation based on experimental measurements of 40 participants has been proposed. It is shown that the probability density function (PDF) of the polar angle can be modeled either based on a Laplace (for static users) or a Gaussian (for mobile users) distribution. In addition, a closed-form expression is obtained for the PDF of the cosine of the incidence angle based on which the line-of-sight (LOS) channel gain is described in OWC channels. An approximation of this PDF based on the truncated Laplace is proposed and the accuracy of this approximation is confirmed by the Kolmogorov-Smirnov distance. Moreover, the statistics of the LOS channel gain are calculated and the random orientation of a user equipment (UE) is modeled as a random process. The influence of the random orientation on signal-to-noise-ratio performance of OWC systems has been evaluated. Finally, an orientation-based random waypoint (ORWP) mobility model is proposed by considering the random orientation of the UE during the user's movement. The performance of ORWP is assessed on the handover rate and it is shown that it is important to take the random orientation into account.

Coverage Probability of 3-D Mobile UAV Networks

In this paper, we consider a network of multiple unmanned aerial vehicles (UAVs) where a given number of UAVs are placed at three-dimensional (3D) locations in a finite circular disk shaped region to serve a reference ground user equipment (UE) located at its center. Herein, a serving UAV is assumed to be located at fixed altitude which communicates with the reference UE. All the other UAVs in the network are designated as interfering UAVs to the UE and are assumed to have 3D mobility. To characterize the 3D UAV movement process, we hereby propose an effective 3D mobility model based on the mixed random waypoint mobility (RWPM) and uniform mobility (UM) models in the vertical and spatial directions. Further, considering the proposed 3D mobility model, we first characterize the interference received at reference UE, and then evaluate its coverage probability under Nakagami-m fading. We quantify the achievable performance gains for the ground UE under various system and channel conditions. Moreover, we corroborate our analytical results through simulations.

Wireless-Powered Communication Networks With Random Mobility

In this paper, we consider a wireless-powered communication network (WPCN), where an energy-limited multi-antenna information source, powered by a dedicated power beacon, communicates with a mobile user (MU). The MU is equipped with a single-antenna and its mobility is characterized by the well-known random waypoint mobility model. To gain the advantages with the use of multiple antennas at the source, we adopt two popular multiple-antenna transmission schemes, namely maximal-ratio transmission (MRT) and transmit antenna selection (TAS). Differently from previous works which considered only static scenarios, this paper aims to investigate wireless power and information transfer in the scenario with a random mobile user under Nakagami-$m$ fading. It is noteworthy that a special case of our analysis, i.e., the Rayleigh fading case, has not been examined in the literature as well, which enhances the contribution value of the proposed analysis. Considering both MRT and TAS schemes, closed-form expressions for the outage probability, average delay-limit throughput, average delay-tolerant throughput, average bit error rate (BER), and throughput under average BER constraint are derived. The analysis quantifies the impact of the mobility and propagation environments, which are characterized by the path-loss exponent and multipath parameter for the PB-AP link and AP-MU link, on the performance of a WPCN. The analytical results are compared with Monte-Carlo simulations in order to validate the analysis and provide useful insights on the impact of different parameters on the system performance.

Deep Validation of Spatial Temporal Features of Synthetic Mobility Models

This paper analyzes the most relevant spatial-temporal stochastic properties of benchmark synthetic mobility models. Each pattern suffers from various mobility flaws, as will be shown by the models’ validation. A set of metrics is used to describe mobility features, such as the speed decay problem, the density wave phenomenon, the spatial node distribution, and the average neighbor percentage. These metrics have already been validated for the random waypoint mobility model (RWPMM), but they have not yet been verified for other mobility patterns that are most frequently used. For this reason, this investigation attempts to deeply validate those metrics for other mobility models, namely the Manhattan Grid mobility, the Reference Point Group mobility, the Nomadic Community mobility, the Self-Similar Least Action Walk, and SMOOTH models. Moreover, we propose a novel mobility metric named the “node neighbors range”. The relevance of this new metric is that it proves at once the set of outcomes of previous metrics. It offers a global view of the overall range of mobile neighbors during the experimental time. The current research aims to more rigorously understand mobility features in order to conduct a precise assessment of each mobility flaw, given that this fact further impacts the performance of the whole network. These validations aim to summarize several parameters into 18,126 different scenarios with an average of 486 validated files. An exhaustive analysis with details like those found in this paper leads to a good understanding of the accurate behaviors of mobility models by displaying the ability of every pattern to deal with certain topology changes, as well as to ensure network performances. Validation results confirm the effectiveness and robustness of our novel metric.

Location-Based Lattice Mobility Model for Wireless Sensor Networks.

Significant research has been conducted for maintaining a high standard of communication and good coverage in wireless sensor networks (WSNs), but extra power consumption and mobility issues are not yet fully resolved. This paper introduces a memory-less location mobility-aware Lattice Mobility Model (LMM) for WSNs. LMM is capable of concurrently determining the node and sink mobility. LMM has a lower pause time, fewer control packets, and less node dependency (e.g., the energy consumed by each node in each cycle that is independent of the data traffic). LMM accurately determines a node’s moving location, the distance from its previous location to its current location, and the distance from its existing location to its destination. Many existing mobility models only provide a model how nodes move (e.g., to mimic pedestrian behavior), but do not actually control the next position based on properties of the underlying network topology. To determine the strength of LMM, OMNet++ was used to generate the realistic scenario to safeguard the affected area. The operation in affected area comprises searching for, detecting, and saving survivors. Currently, this process involves a time-consuming, manual search of the disaster area. This contribution aims to identify an energy efficient mobility model for a walking pattern in this particular scenario. LMM outperforms other mobility models, including the geographic-based circular mobility model (CMM), the random waypoint mobility model (RWMM) and the wind mobility model (WMM), The simulation results also demonstrate that the LMM requires the least time to change the location, has a lower drop rate, and has more residual energy savings than do the WMM, RWMM, and CMM.

A Comparative Study of Mobility Models for Wireless Sensor Networks

Wireless sensor networks consist of hundreds or thousands of small, lightweight and low-powered sensor nodes that are deployed in the area of interest to collect information in an unattended manner. Since sensor nodes have limited battery, many research papers proposed techniques to enhance the performance and lifetime of wireless sensor networks. Using energy rich mobile sink to collect data from static sensor nodes is one of the techniques that can be used to improve the performance of wireless sensor networks. As a result, several mobility models were proposed to achieve this goal. In this study, we aim to study the performance of wireless sensor network under three mobility models for the mobile sink namely, depth first based mobility model, random waypoint mobility model and Gauss Markov mobility model. Consequently, ns-2 simulator is used to study the performance of the network under different scenarios and speeds of the mobile sink. Additionally, end-to-end delay, throughput and packet delivery ratio are the performance metrics considered in this study to measure the performance. Finally, AODV routing protocol is used to route messages from their sources to the mobile sink.

Statistics of SNR for an Indoor VLC System and Its Applications in System Performance

We present the statistics of signal to noise ratio (SNR) for an indoor visible light communication (VLC) system with a random waypoint mobility model. This letter is based on the fact that the distance between the VLC access point and the mobile user terminal is a random variable. Thus, the instantaneous SNR also becomes a random variable. We derive novel closed form expressions for the probability density function, cumulative distribution function, and moment generating function of the instantaneous SNR. Capitalizing on the derived expression, we evaluate the closed form expressions of performance metrics, such as outage probability and average bit-error rate, for the considered system with on-off keying. Finally, numerical results are discussed and the impact of various VLC parameters on the performance of system is also analyzed.

BIGM: A Biogeography Inspired Group Mobility Model for Mobile Ad Hoc Networks

This paper propounds a novel Biogeography Inspired Group Mobility model for Mobile Ad Hoc Networks (MANETs) based on the Biogeography Based Optimization (BBO) algorithm. BBO describes the migration behavior of species between the islands and how they become extinct and new species arise. Many mobility models present in the literature failed to realistically represent the movement of nodes within the group and migration of nodes from one group to another group. To address these issues, each group of nodes in the proposed mobility model follows the bird flocking rules; inspired from the movement of flock of birds. These nodes then migrate from one group to another group based on BBO approach, showing group mobility behavior among the group of nodes in MANETs which exhibit frequent group motion and network topology changes. The experimental results obtained through ns-2 simulator is compared with a Random Waypoint Mobility model and Reference Point Group Mobility model and evaluated their network performance under different routing protocols.

Bidirectional User Throughput Maximization Based on Feedback Reduction in LiFi Networks

Channel adaptive signaling, which is based on feedback, can result in almost any performance metric enhancement. Unlike the radio frequency channel, the optical wireless communication (OWC) channel is relatively deterministic. This feature of OWC channels enables a potential improvement of the bidirectional user throughput by reducing the amount of feedback. Light-Fidelity (LiFi) is a subset of OWCs, and it is a bidirectional, high-speed, and fully networked wireless communication technology where visible light and infrared are used in downlink and uplink, respectively. In this paper, two techniques for reducing the amount of feedback in LiFi cellular networks are proposed: 1) limited-content feedback scheme based on reducing the content of feedback information and 2) limited-frequency feedback scheme based on the update interval. Furthermore, based on the random waypoint mobility model, the optimum update interval, which provides maximum bidirectional user equipment throughput, has been derived. Results show that the proposed schemes can achieve better average overall throughput compared with the benchmark one-bit feedback and full-feedback mechanisms.

Addressed Query Gossip Resource Discovery Protocol for Mobile P2P Networks and Its Performance in Diverse Mobility Models

This article describes how P2P resource discovery protocols perform poorly over mobile ad hoc networks mainly due to the frequent network dynamics. Peer-to-Peer search techniques including structured and unstructured can be employed over MANETs. Empirical studies indicate that searching in such resultant networks are not efficient and effective due to peer discovery, connectivity and mobility issues. The author proposes Addressed Query Gossip Resource Discovery algorithm, a lightweight resource discovery designed to suit the mobility requirements of ad hoc networks to optimize the search performance while at the same time minimize the extra usage of mobile and network resources. Mobility models represent the movements of mobile nodes. Such models are used to represent how the location, velocity and acceleration change over time. The author conducts performance analyses of the proposed protocol and widely used unstructured search techniques over MANET under 2 realistic mobility models, i.e., Random Waypoint and Reference Point Group Mobility models. The results show that the proposed protocol has the best performance in almost every measured metrics. In addition, the protocol consumes less energy, has less message overhead and good success ratio for random waypoint movement as compared to the reference group mobility model. After extensive evaluations, the simulation results clarify that the mobility models have a significant impact on the performance of peer-to-peer content discovery protocols over mobile ad hoc networks.

Efficient way of implementing the random and GM (Gauss-Markov) mobility model in MANET

In Mobile Adhoc Network (MANET) nodes are communicating each other with the help of routing protocol. In Adhoc networks, a node having high mobility, with that node’s moving randomly from node to node. For observing the movement mobility, we are studying different forms of mobility. These models can deploy the mobility of the network condition, including the various parameters such as the size of the network, traffic models of data, throughput and the PDR (Packet Delivery Ratio) are used as performance Parameters. We are investigating the RWP (Random Waypoint) and GM (Gauss-Markov) mobility model to express efficiency of Adhoc routing protocol by using the OMNET++ simulator .The result of the simulator shows that the mobility has more influence upon MANET protocol with the increasing node density. Here, we evaluated RWP and GM mobility model with AODV protocol. The study of these models illustrates dissimilar outcomes related inputs with the increasing performance of the pause time rises among the speed and number of nodes.

Connectivity properties for UAVs networks in wireless ultraviolet communication

The ultraviolet (UV) scattering communication can be applied in military networked on-the-move and unattended ground sensor networks. This paper focuses on the connectivity properties of unmanned aerial vehicles (UAVs) network based on UV communication that ensures the secret communications between UAVs. UAVs network is consisting of a group of UAVs, each of which moving according to a particular mobility model. We discuss random waypoint (RWP) mobility model and circle movement based model (CMBM), which can describe the actual movement of UAVs, respectively. In this paper, the approximations of the probability that the network is k-connected are provided with consideration of transmission using on–off keying and pulse position modulation. More precisely, we evaluate the effects of node density, transmission power, and data rate on k-connectivity. The numerical examples show that the mobility degrades the connectivity probability. When the numbers of nodes $$n=500$$ and data rate $$R_b =10\,\hbox {kbps}$$ , the required transmission power for nodes moving according to RWP is lower than CMBM in order to achieve 2-connectivity of the UAVs network, but it is about twice that for uniformly distributed nodes.

A variant of Random WayPoint mobility model to improve routing in Wireless Sensor Networks

The mobility of nodes in a wireless sensor network is a factor affecting the quality of service offered by this network. We think that the mobility of the nodes presents an opportunity where the nodes move in an appropriate manner. Therefore, the routing algorithms can benefit from this opportunity. Studying a model of mobility and adapt it to ensure an optimal routing in an agitated network is the purpose of our work. We are interested in applying a variant of the mobility model RWP (named routing-random waypoint 'R-RWP') on the whole network in order to maximise the coverage radius of the base station (which will be fixed in our study) and thus to optimise the data delivery end-to-end delay.

Temporal Correlation of Interference and Outage in Mobile Networks over One-Dimensional Finite Regions

In practice, wireless networks are deployed over finite domains, the level of mobility is different at different locations, and user mobility is correlated over time. All these features have an impact on the temporal properties of interference which is often neglected. In this paper, we show how to incorporate correlated user mobility into the interference and outage correlation models. We use the random waypoint mobility model over a bounded one-dimensional domain as an example model inducing correlation, and we calculate its displacement law at different locations. Based on that, we illustrate that the temporal correlations of interference and outage are location-dependent, being lower close to the centre of the domain, where the level of mobility is higher than near the boundary. Close to the boundary, more time is also needed to see uncorrelated interference. Our findings suggest that an accurate description of the mobility pattern is important, because it leads to more accurate understanding/modeling of interference and receiver performance.

Energy efficient node selection algorithm based on node performance index and random waypoint mobility model in internet of vehicles

Internet of vehicles (IoV) is an improved version of internet of things to resolve a number of issues in urban traffic environment. In this paper IoV technology is used to select the best ambulance based on a novel node selection algorithm. The proposed IoT healthcare monitoring system consists of number of mobile doctors, patient and mobile ambulance. Performance rank (PR) index is calculated for each mobile ambulance based on the medical capacity (b) of the mobile ambulance, the number of patients currently using the mobile ambulance (n), and the Euclidean distance from a neighboring mobile ambulance. The minimum PR index is considered as best ambulance to provide a service to the patient. Random waypoint mobility model is used to simulate the proposed IoT based healthcare monitoring system. The proposed energy efficient node selection algorithm is compared with various node selection algorithms such as cluster based routing protocol, workload-aware channel assignment algorithm and scenario-based clustering algorithm for performance evaluation. The packet delivery fraction, normalized routing load and average end-to-end delay are calculated to evaluate the performance of the proposed energy efficient node selection algorithm. We have used NS-2 simulator for the node simulation to show the performance of the energy efficient node selection framework. Experimental results prove that the efficiency of the proposed energy efficient node selection algorithm in IoT healthcare environment.

Visualization of Spatial Distribution of Random Waypoint Mobility Models

Visualization of Spatial Distribution of Random Waypoint Mobility Models

End-to-End Link Reliable Energy Efficient Multipath Routing for Mobile Ad Hoc Networks

Among the many multipath routing protocols, the AOMDV is widely used in highly dynamic ad hoc networks because of its generic feature. Since the communicating nodes in AOMDV are prone to link failures and route breaks due to the selection of multiple routes between any source and destination pair based on minimal hop count which does not ensure end-to-end reliable data transmission. To overcome such problems, we propose a novel node disjoint multipath routing protocol called End-to-End Link Reliable Energy Efficient Multipath Routing (E2E-LREEMR) protocol by extending AOMDV. The E2E-LREEMR finds multiple link reliable energy efficient paths between any source and destination pair for data transmission using two metrics such as Path-Link Quality Estimator and Path-Node Energy Estimator. We evaluate the performance of E2E-LREEMR protocol using NS 2.34 with varying network flows under random way-point mobility model and compare it with AOMDV routing protocol in terms of Quality of Service metrics. When there is a hike in network flows, the E2E-LREEMR reduces 30.43 % of average end-to-end delay, 29.44 % of routing overhead, 32.65 % of packet loss ratio, 18.79 % of normalized routing overhead and 12.87 % of energy consumption. It also increases rather 10.26 % of packet delivery ratio and 6.96 % of throughput than AOMDV routing protocol.

BETA random waypoint mobility model for wireless network simulation

It is widely known that the instantaneous average node speed for the random waypoint (RWP) mobility model may not reach a steady state regime due to velocity gradual decaying which can cause inaccurate results in simulations and communication protocol validations for wireless networks. This paper presents a modification to the RWP model, in which we propose to choose node speeds from a BETA(α, β) distribution, demonstrating analytically and by simulations that depending on the values of α and β parameters the instantaneous average node speed and consequently other important network metrics, like control overhead and number of dropped data packets may reach (or not) a steady state regime. Therefore, by allowing α and β to vary, a multitude of probability distributions for speed choice is obtained and the resulting limiting state behavior for the mobility model can straightforwardly be determined, offering to the research community a generalized BETA random waypoint mobility model. Accordingly, the generic analytical closed form for the instantaneous average node velocity V¯ as Vmin → 0 is obtained as a function of α and β to be given by limVmin→0V¯=Vmaxα−1β+α−1 in which Vmin and Vmax are the minimum and maximum velocities, respectively, that a node can select.