41,832 research outputs found
MoMo: a group mobility model for future generation mobile wireless networks
Existing group mobility models were not designed to meet the requirements for
accurate simulation of current and future short distance wireless networks
scenarios, that need, in particular, accurate, up-to-date informa- tion on the
position of each node in the network, combined with a simple and flexible
approach to group mobility modeling. A new model for group mobility in wireless
networks, named MoMo, is proposed in this paper, based on the combination of a
memory-based individual mobility model with a flexible group behavior model.
MoMo is capable of accurately describing all mobility scenarios, from
individual mobility, in which nodes move inde- pendently one from the other, to
tight group mobility, where mobility patterns of different nodes are strictly
correlated. A new set of intrinsic properties for a mobility model is proposed
and adopted in the analysis and comparison of MoMo with existing models. Next,
MoMo is compared with existing group mobility models in a typical 5G network
scenario, in which a set of mobile nodes cooperate in the realization of a
distributed MIMO link. Results show that MoMo leads to accurate, robust and
flexible modeling of mobility of groups of nodes in discrete event simulators,
making it suitable for the performance evaluation of networking protocols and
resource allocation algorithms in the wide range of network scenarios expected
to characterize 5G networks.Comment: 25 pages, 17 figure
The impact of mobility models on the performance of mobile Ad Hoc network routing protocol
A mobility model represents nodes distribution and movement over the network. Several research works have shown that a selection of mobility model can affect the outcome of routing performance simulation in Mobile Ad Hoc Networks. Thus, a routing protocol may only be effective in a particular mobility model or scenario but performs inferiorly in another. As a result, analyses of routing protocol performance are often based on inadequate information leading to inaccurate argument and conclusion. In this paper, three different mobility models have been selected, where each of them is highly distinctive in terms of nodes movement behavior. In addition, a new measurement technique called probability of route connectivity is introduced. The technique is used to quantify the success rate of route established by a routing protocol. Extensive simulation runs are done and results are compared between each mobility model
Performance evaluation of an efficient counter-based scheme for mobile ad hoc networks based on realistic mobility model
Flooding is the simplest and commonly used mechanism for broadcasting in mobile ad hoc networks (MANETs). Despite its simplicity, it can result in high redundant retransmission, contention and collision in the network, a phenomenon referred to as broadcast storm problem. Several probabilistic broadcast schemes have been proposed to mitigate this problem inherent with flooding. Recently, we have proposed a hybrid-based scheme as one of the probabilistic scheme, which combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Despite these considerable numbers of proposed broadcast schemes, majority of these schemes’ performance evaluation was based on random waypoint model. In this paper, we evaluate the performance of our broadcast scheme using a community based mobility model which is based on social network theory and compare it against widely used random waypoint mobility model. Simulation results have shown that using unrealistic movement pattern does not truly reflect on the actual performance of the scheme in terms of saved-rebroadcast, reachability and end to end delay
Quantifying Link Stability in Ad Hoc Wireless Networks Subject to Ornstein-Uhlenbeck Mobility
The performance of mobile ad hoc networks in general and that of the routing
algorithm, in particular, can be heavily affected by the intrinsic dynamic
nature of the underlying topology. In this paper, we build a new
analytical/numerical framework that characterizes nodes' mobility and the
evolution of links between them. This formulation is based on a stationary
Markov chain representation of link connectivity. The existence of a link
between two nodes depends on their distance, which is governed by the mobility
model. In our analysis, nodes move randomly according to an Ornstein-Uhlenbeck
process using one tuning parameter to obtain different levels of randomness in
the mobility pattern. Finally, we propose an entropy-rate-based metric that
quantifies link uncertainty and evaluates its stability. Numerical results show
that the proposed approach can accurately reflect the random mobility in the
network and fully captures the link dynamics. It may thus be considered a
valuable performance metric for the evaluation of the link stability and
connectivity in these networks.Comment: 6 pages, 4 figures, Submitted to IEEE International Conference on
Communications 201
W-NINE: a two-stage emulation platform for mobile and wireless systems
More and more applications and protocols are now running on wireless networks. Testing the implementation of such applications and protocols is a real challenge as the position of the mobile terminals and environmental effects strongly affect the overall performance. Network emulation is often perceived as a good trade-off between experiments on operational wireless networks and discrete-event simulations on Opnet or ns-2. However, ensuring repeatability and realism in network emulation while taking into account mobility in a wireless environment is very difficult. This paper proposes a network emulation platform, called W-NINE, based on off-line computations preceding online pattern-based traffic shaping. The underlying concepts of repeatability, dynamicity, accuracy and realism are defined in the emulation context. Two different simple case studies illustrate the validity of our approach with respect to these concepts
- …