Genetic Local Search for Conflict-Free Minimum-Latency Aggregation Scheduling in Wireless Sensor Networks
We consider a Minimum-Latency Aggregation Scheduling problem in wireless sensor networks when aggregated data from all sensors are required to be transferred to the sink. During one time slot (time is discrete) each sensor can either send or receive one message or be idle. Moreover, only one message should be sent by each sensor during the aggregation session, and the conflicts caused by interference of radio waves must be excluded. It is required to find a min-length conflict-free schedule for transmitting messages along the arcs of the desired spanning aggregation tree (AT) with the root in the sink. This problem is NP-hard in a general case, and also remains NP-hard in a case when AT is given. In this paper, we present a new heuristic algorithm that uses a genetic algorithm and contains the local search procedures and the randomized mutation procedure. The extensive simulation demonstrates a superiority of our algorithm over the best of the previous approaches.
KeywordsWireless sensor networks Aggregation Minimum latency Genetic local search Simulation
The research is partly supported by the Russian Science Foundation (project 18-71-00084) (Sect. 4–5), by the Russian Foundation for Basic Research (project 16-07-00552) (Sect. 2–3), and by the program of fundamental scientific researches of the SB RAS No. I.5.1 (project 0314-2016-0014) (Sect. 1).
- 9.Erzin, A., Pyatkin, A.: Convergecast scheduling problem in case of given aggregation tree: the complexity status and some special cases. In: 10th International Symposium on Communication Systems Networks and Digital Signal Processing (CSNDSP), pp. 1–6. IEEE (2016) https://doi.org/10.1109/CSNDSP.2016.7574007
- 11.Huang, S.C.-H., Wan, P.J., Vu, C.T., et al.: Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: IEEE Conf. on Computer Communications (INFOCOM 2007), pp. 366–472 (2007)Google Scholar
- 12.Nguyen, T.D., Zalyubovskiy, V., Choo, H.: Efficient time latency of data aggregation based on neighboring dominators in WSNs. In: IEEE Globecom, 6133827 (2011)Google Scholar
- 17.Gruber, M., van Hemert, J., Raidl, G.R.: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, July 08–12, Seattle, Washington, USA (2006). https://doi.org/10.1145/1143997.1144185
- 18.Hussain, S., Matin, A.W., Islam, O.: Genetic algorithm for hierarchical wireless sensor networks. J. Netw. 2, 87–97 (2007)Google Scholar
- 19.Sudha, N., Valarmathi, M.L., Neyandar, T.C.: Optimizing energy in WSN using evolutionary algorithm. In: Proceeding of IJCA on International Conference on VLSI, Communications and Instrumentation (ICVCI 2011), Kerala, India, 7–9 April 2011, pp. 26–29 (2011)Google Scholar
- 24.Beier, R., Sibeyn, J.F.: A powerful heuristic for telephone gossiping. In: 17th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2000), pp. 17–36 (2000)Google Scholar