Perfect Simulations for Random Trip Mobility Models

PalChaudhuri, Santashil; Boudec, Jean-Yves Le; Vojnović, Milan

doi:10.1109/anss.2005.33

Cited by 80 publications

(57 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nodes are initially aligned in an equally spaced grid before a selected percentage of nodes become mobile. Nodes move within the set topology according to the random waypoint model developed and described in [16], and all results are averaged across 50 independent trials of the same configuration. We make use of the static addressing scheme described in section II for mesh routing.…”

Section: Discussionmentioning

confidence: 99%

Impact of Node Heterogeneity in ZigBee Mesh Network Routing

Liang

Chen

Sun

et al. 2006

2006 IEEE International Conference on Systems, Man and Cybernetics

View full text Add to dashboard Cite

Abstract-Based on the IEEE 802.15.4 LR-WPAN standard, the ZigBee standard has been proposed to interconnect simple, low rate, and battery powered wireless devices. The deployment of ZigBee networks is expected to facilitate numerous applications, such as home-appliance networks, home healthcare, medical monitoring, consumer electronics, and environmental sensors. An effective routing scheme in a ZigBee network is particularly important in that it is the key to achieve resource (e.g., bandwidth and energy) efficiency in ZigBee networks. Routing in a ZigBee network is not exactly the same as in a MANET. In particular, while Full Function Devices (FFD) can serve as network coordinators or network routers, Reduced Function Devices (RFD) can only associate and communicate with FFDs in a ZigBee network. Therefore, different from traditional MANET routing algorithms, which only take into account node mobility to figure out a best route to a given destination, node heterogeneity plays an important role in ZigBee network routing. In this paper, we perform extensive evaluation, using NS-2 simulator, to study the impact of node heterogeneity on ZigBee mesh network routing. The results show that the ZigBee mesh routing algorithm exhibits significant performance difference when the network is highly heterogenous. We also reveal that the node type and the role of the node plays a critical role in deciding routing performances.

show abstract

Section: Discussionmentioning

confidence: 99%

Impact of Node Heterogeneity in ZigBee Mesh Network Routing

Liang

Chen

Sun

et al. 2006

2006 IEEE International Conference on Systems, Man and Cybernetics

View full text Add to dashboard Cite

show abstract

“…Since f p (t) is equal to f r (t) plus the number of focal points that are not connected to a quorum of focal points (see Section 7), we set f p (t) to n−c, where n is the total number of focal points and c is the size of the maximum connected component of a graph whose vertex are the subregions that are populated at time t. Note that since the focus of this paper is on the analysis of our mobility constraints and mobile quorums in terms of focal points, we do not simulate at this stage message transmissions and the read/write protocols. In our simulation results we use the random waypoint and the restricted random waypoint on a city section implemented in (23). We refer the reader to (25) for a survey on mobility models.…”

Section: Simulation Settingmentioning

confidence: 99%

“…The tool generates a ns-2 trace for a given number of mobile nodes, simulation duration and space graph containing road id, average road speed and coordinates of the road endpoints. We analyze traces relative to a real road map of a residential 1200 × 1200 meter area closed to Rice University 1 provided by (23) and illustrated in Figure 7. We partition this area into 12 × 12 squared grid of length 100 meters.…”

Section: Simulation Settingmentioning

confidence: 99%

Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems

Tulone¹

2007

Ad Hoc Networks

View full text Add to dashboard Cite

Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous work provides strong data guarantees by limiting the motion and the speed of the mobile nodes during the entire system lifetime, and by relying on assumptions that are not realistic for most mobile applications. We provide a small set of mobility constraints that are sufficient to ensure strong data guarantees and that can be applied when nodes move along unknown paths and speed, and are sparsely distributed.In the second part of the paper we analyze the problem of conserving energy while ensuring strong data guarantees, using quorum system techniques. We devise a condition necessary for a quorum system to guarantee data consistency and data availability under our mobility model. This condition shows the unsuitability of previous quorum systems and is the basis for a novel class of quorum systems suitable for highly mobile networks, called Mobile Dissemination Quorum (MDQ) systems. We also show a MDQ system that is provably optimal in terms of communication cost by proposing an efficient implementation of a read/write atomic shared memory.The suitability of our mobility model and MDQ systems is validated through simulations using the random waypoint model and the restricted random waypoint on a city section. Finally, we apply our results to assist routing and coordinate the low duty cycle of mobile nodes while maintaining network connectivity.

show abstract

“…Each mobile node is assigned a unique identifier from a finite set I. The RMNs travel arbitrarily within the specified region by using the random waypoint model as their mobility model [2] [8].…”

Section: A Underlying System Modelmentioning

confidence: 99%

Multi-Path Intelligent Virtual Mobile Nodes for Ad Hoc Networks

Qian

2008

2008 Proceedings of 17th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

Abstract-In mobile ad hoc networks, solving the standard problems encountered in fixed networks can be challenging because of the unpredictable motion of mobile nodes. Due to the lack of a fixed infrastructure to serve as the backbone of the network, it is difficult to manage nodes' locations and ensure stable node performance. In this paper, we introduce an extension of an algorithm, Multi-path Intelligent Virtual Mobile Node (MIVMN) Abstraction, which effectively processes the unpredictable motion and availability of mobile nodes in MANETs. Earlier work has applied an abstract node, or virtual mobile node, that consists of a set of real nodes traveling on a predetermined path, or virtual path, which causes unavoidable failure when all the nodes that are emulating the virtual mobile node leave its region. The objective of this paper is to increase the message delivery ratio and decrease the fail ratio of the virtual mobile nodes. In order to achieve this, we allow the messages to switch between multiple Hamiltonian circles. Through simulation results we show that the MIVMN abstraction successfully meets our goals.

show abstract

Perfect Simulations for Random Trip Mobility Models

Abstract: Abstract

Cited by 80 publications

References 9 publications

Impact of Node Heterogeneity in ZigBee Mesh Network Routing

Impact of Node Heterogeneity in ZigBee Mesh Network Routing

Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems

Multi-Path Intelligent Virtual Mobile Nodes for Ad Hoc Networks

Contact Info

Product

Resources

About