sis 15(7): e1

Research Article

Large Scale Experiments of Multihop Networks in Mobile Scenarios

Download151 downloads
  • @ARTICLE{10.4108/icst.tridentcom.2015.259821,
        author={Yacine Bencha\~{n}b and Claude Chaudet},
        title={Large Scale Experiments of Multihop Networks in Mobile Scenarios},
        journal={EAI Endorsed Transactions on Scalable Information Systems},
        volume={2},
        number={7},
        publisher={EAI},
        journal_a={SIS},
        year={2015},
        month={8},
        keywords={wireless multihop networks, mobility simulation, virtualization, experimentation},
        doi={10.4108/icst.tridentcom.2015.259821}
    }
    
  • Yacine Benchaïb
    Claude Chaudet
    Year: 2015
    Large Scale Experiments of Multihop Networks in Mobile Scenarios
    SIS
    EAI
    DOI: 10.4108/icst.tridentcom.2015.259821
Yacine Benchaïb1,*, Claude Chaudet2
  • 1: Sorbonne Universités, UPMC Univ Paris 06, UMR 7606, LIP6
  • 2: Institut Mines-Télécom / Télécom ParisTech / LTCI CNRS UMR 5141
*Contact email: yacine.benchaib@lip6.fr

Abstract

This paper presents the latest advances in our research work focused on VIRMANEL and SILUMOD, a couple of tools developed for research in wireless mobile multihop networks. SILUMOD is a domain specific language dedicated to the definition of mobility models. This language contains key- words and special operators that make it easy to define a mobility model and calculate the positions of a trajectory. These positions are sent to VIRMANEL, a tool that man- ages virtual machines corresponding to mobile nodes, emu- lates their movements and the resulting connections and dis- connections, and displays the network evolution to the user, thanks to its graphical user interface. The virtualization ap- proach we take here allows to run real code and to test real protocol implementations without deploying an important experimental platform. For the experimentation of a large number of virtual mobile nodes, we defined and implemented a new algorithm for the nearest neighbor search to find the nodes that are within communication range. We then car- ried out a considerable measurement campaign in order to evaluate the performance of this algorithm. The results show that even with an experiment using a large number of mobile nodes, our algorithm make it possible to evaluate the state of connectivity between mobile nodes within a reasonable time and number of operations.