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

Optimized Performance Evaluation of LTE Hard Handover Algorithm with Average RSRP Constraint

Hard handover mechanism is adopted to be used in 3GPP Long Term Evolution (3GPP LTE) in order to reduce the complexity of the LTE network architecture. This mechanism comes with degradation in system throughput as well as a higher system delay. This paper proposes a new handover algorithm known as LTE Hard Handover Algorithm with Average Received Signal Reference Power (RSRP) Constraint (LHHAARC) in order to minimize number of handovers and the system delay as well as maximize the system throughput. An optimized system performance of the LHHAARC is evaluated and compared with three well-known handover algorithms via computer simulation. The simulation results show that the LHHAARC outperforms three well-known handover algorithms by having less number of average handovers per UE per second, shorter total system delay whilst maintaining a higher total system throughput.Comment: 16 pages, 9 figures, International Journal of Wireless & Mobile Networks (IJWMN