This paper investigates the problem of computing the optimal trajectories of multiple mobile elements (e.g. robots, vehicles, aircrafts, etc.) to minimize energy consumption in the Wireless Sensor Networks (WSNs). We consider the real situation, take full advantage of sensor's communication range and construct the multiple Traveling Salesman Problem with Communication Range (mTSP-CR). An optimization-based two-stage algorithm is proposed to solve mTSP-CR where a relaxed optimization problem is solved in the first stage and a modified TSP-algorithm is implemented to obtain a feasible solution in the second stage. Numerical simulation indicates that the algorithm can obtain a feasible solution for mTSP-CR. Communication range is beneficial to minimize the total travel distance and to save energy in WSNs.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Optimization-Based mTSP-CR Mobile Data Gathering Algorithm for Large-Scale Wireless Sensor Networks


    Contributors:
    Ma, Jianxin (author) / Shi, Shuo (author) / Gu, Xuemai (author)


    Publication date :

    2018-08-01


    Size :

    1191497 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Optimization of UAV path for wireless sensor network data gathering

    Kashuba, S.V. / Novikov, V.I. / Lysenko, O.I. et al. | IEEE | 2015



    A Novel Cross-layer Mobile Data-gathering Protocol for Underwater Sensor Networks

    Alfouzan, Faisal Abdulaziz / Ghoreyshi, Seyed Mohammad / Shahrabi, Alireza et al. | IEEE | 2020



    4.0506 Simulation-Based Optimization of Communication Protocols for Large-Scale Wireless Sensor Networks

    Institute of Electrical and Electronics Engineers | British Library Conference Proceedings | 2003