Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks

摘要: Coverage of interest points and network connectivity are two main challenging practically important issues Wireless Sensor Networks (WSNs). Although many studies have exploited the mobility sensors to improve quality coverage andconnectivity, little attention has been paid minimization sensors’ movement, which often consumes majority limited energy thus shortens lifetime significantly. To fill in this gap, paper addresses challenges Mobile Deployment (MSD) problem investigates how deploy mobile with minimum movement form a WSN that provides both target connectivity. end, MSD is decomposed into sub-problems: Target COVerage (TCOV) Network CONnectivity (NCON) problem. We then solve TCOV NCON one by combine their solutions address The NP-hardness proved. For special case where targets disperse from each other farther than double radius, an exact algorithm based on Hungarian method proposed find optimal solution. general cases TCOV, heuristic algorithms, i.e., Basic clique partition TV-Greedy Voronoi deployment region, reduce total distance ofsensors. NCON, efficient solution Steiner tree constrained edge length proposed. Thecombination as demonstrated extensive simulation experiments, offers promising solutionto original balances load different prolongs consequently.