Validation of the Random Waypoint Mobility Model Through a Real World Mobility Trace

Rojas, Andres; Branch, Philip; Armitage, Grenville

doi:10.1109/tencon.2005.301339

Cited by 14 publications

(3 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table II lists our simulation environment. We [27] proved with the real evidence that the RWP is valid in simulating networks with mobile nodes. In every simulation, each node starts its movement at a random location with a speed chosen from [0 ∼ SpeedMax].…”

Section: Simulation Environmentsmentioning

confidence: 59%

A framework for intrusion detection systems by social network analysis methods in ad hoc networks

Wang

Man

Liu

2009

Security Comm Networks

View full text Add to dashboard Cite

Social network analysis (SNA), originally introduced to provide a mathematical framework for analyzing human interactions and economic relationships, has recently been successfully applied to characterizing information propagation in wireless networks. In this paper, we introduce a SNA method as a new approach to build an intrusion detection system (SN-IDS) in mobile ad hoc networks. The SN-IDS utilizes social relations as metrics-of-interest for anomaly detections, which is different from most traditional IDS approaches. The social system can capture and represent similar network statistics as those used in data mining based IDSs. To construct proper social networks, we first investigate ad hoc MAC and network layer data attributes and select relevant social feature sets; then we build up a set of socio-matrices based on these features. Social analysis methods are applied to these matrices to detect suspicious activities and behaviors of mobile nodes. The detection results can be based on single or multi-relation rules. Finally, we analyze the performance of this SN-IDS under different simulated mobility conditions and traffic patterns. NS-2 simulation results show that this SN-IDS system can effectively detect common attacks with high detection rates and low false alarm rates. Furthermore, it has clear advantages over the conventional association rule based data mining IDS in terms of computation and system complexity.tances. It has been found pervasive in many networks arising in nature and technology (Watts and Strogatz's model) [1].Since social networks show relationships among different actors, many works on data networking have taken the advantage of such capability to enhance application functions, performance, or system security [2--4]. Social Path Routing (SPROUT) algorithm exploits social path trust rating in structured p2p networks, and the probability of successful routing is

show abstract

Section: Simulation Environmentsmentioning

confidence: 59%

A framework for intrusion detection systems by social network analysis methods in ad hoc networks

Wang

Man

Liu

2009

Security Comm Networks

View full text Add to dashboard Cite

show abstract

“…The authors in [11] have used Continuous Time Markov Chain (CTMC) model to study the propagation of message from source to destination node under RandomWay-Point (RWP) mobility model [17]. Performance modeling of epidemic routing under the same mobility model has been studied using ODE model in [23].…”

Section: Analytical Performance Modeling Toolsmentioning

confidence: 99%

Message-driven based energy-efficient routing in heterogeneous delay-tolerant networks

Manam

Mahendran

Murthy

2012

Proceedings of the 1st ACM Workshop on High Performance Mobile Opportunistic Systems

View full text Add to dashboard Cite

Delay-Tolerant Network (DTN) nodes are mostly energylimited devices that run on battery power. DTN routing strategies on such resource-constrained nodes therefore need to be energy efficient. Contemporary routing protocols such as Two-Hop Routing (2HR) and Epidemic Routing (ER) due to their conservative nature, use same forwarding strategy for all types of messages irrespective of their lifetime and delivery probability requirements. This inherently impacts the energy consumption via unwanted forwards. We propose a message-driven based algorithm add-on to the existing routing protocols, that enables intelligent forwards based on individual message lifetime and delivery requirements, thereby improving energy efficiency. Further we analytically model the performance of these protocols in a realistic DTN setting that comprises of nodes with different transmission radii. The results show that the routing protocols with the proposed energy-efficient add-on improves the energy efficiency up to 60% and 75% for the respective 2HR and ER protocols. The analysis is validated by extensive simulation results.

show abstract

“…Despite it has been criticized for not being representative of how humans actually move, it is still largely used in many studies [8][9][10][11][12][13]. Rojas et al [14] validate the RWP against real mobility data. With small changes to the distributions used in the RWP (e.g., non-uniform distribution of the waypoints), the authors show that it can be used as a good model for mobility in large geographic areas such as a city.…”

Section: Introductionmentioning

confidence: 99%

Forecasting the next handoff for users moving with the Random Waypoint mobility model

Zola

Barcelo-Arroyo

Martín-Escalona

2013

J Wireless Com Network

View full text Add to dashboard Cite

Users in a cellular network can move while their connections are handed off to different access points. Studies prove that the mobility pattern followed have a strong impact on performance metrics (i.e., handoff (HO) rate, cell residence time). Recently, some key aspects of the Random Waypoint mobility model have been studied in depth, but relating those studies with different cellular layouts has not been reported. Interest in forecasting the cell to which a device may be handed off depending on the movement pattern is twofold. First, it gives insight into properties and statistics of the mobility model. Second, and from a more practical perspective, it is useful to manage resource allocation and reservation strategies in order to smooth the HO process. The goal of this article is to provide an analytical framework for these predictions in a simple layout. Given a node's current location and the timestamp and location of the last waypoint, an approximation for HO during time Δt is derived. The analysis is provided along with numerical examples and simulations for a symmetrical layout and uniform speed distribution. Results shed light on how useful more advanced strategies can be.

show abstract

Validation of the Random Waypoint Mobility Model Through a Real World Mobility Trace

Cited by 14 publications

References 10 publications

A framework for intrusion detection systems by social network analysis methods in ad hoc networks

A framework for intrusion detection systems by social network analysis methods in ad hoc networks

Message-driven based energy-efficient routing in heterogeneous delay-tolerant networks

Forecasting the next handoff for users moving with the Random Waypoint mobility model

Contact Info

Product

Resources

About