Abstract
A new decision making problem for wireless sensor networks is considered in the paper. A coverage of data sources, the routing of measured data as well as a scheduling of working periods of sensors are assumed as the decision to be made. All decisions as interconnected are determined jointly. The energy consumption and execution time of sensors are used as criteria. The corresponding combinatorial NP-hard optimization problem is formulated. To solve it, two heuristic algorithms are proposed. Some initial analitical evaluations of algorithms are presented as well as the result of computational experiments are given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kulkarini, R.V., Fox Andrster, A., Venayagamoorthy, G.K.: Computational intelligence in wireless sensor networks: A survey. Communications Surveys Tutorials 13(1), 68–96 (2011)
Bin, W., Wenxin, L., Liu, L.: A survey of energy conservation, routing and coverage in wireless sensor networks. In: Zhong, N., Callaghan, V., Ghorbani, A.A., Hu, B. (eds.) AMT 2011. LNCS, vol. 6890, pp. 59–70. Springer, Heidelberg (2011)
Chuan, Z., Chunlin, Z., Lei, S., Guangjie, H.: A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications 35(2), 619–632 (2012)
Zou, L., Lu, M., Xiong, Z.: A distributed algorithm for the dead end problem of location based routing in sensor networks. IEEE Transactions on Vehicular Technology 54(4), 1509–1522 (2005)
Shankarananda, B.M., Saxena, A.: Energy efficient localized routing algorithm for wireless sensor networks. In: Proceedings of 3rd International Conference on Electronics Computer Technology (ICECT), pp. 72–75 (2011)
Guney, E., Aras, N., Altinel, I.K., Ersoy, C.: Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks. Computers & Operations Research 39(7), 1530–1539 (2012)
Abbasi, A.A., Younis, M.: A survey on clustering algorithms for wireless sensor networks. Computer Communications 30(14-15), 2826–2841 (2007)
Mo, W., Qiao, D., Wang, Z.: Mostly-sleeping wireless sensor networks: connectivity, k-coverage, and alpha-lifetime. In: Proceedings of the 43rd Annual Allerton Conference on Communication, Control, and Computing (2005)
Deng, J., Han, Y.S., Heinzelman, W.B., Varashney, P.K.: Scheduling sleeping nodes in high density cluster-based sensor networks. Mobi. Netw. Appl. 10(6), 825–835 (2005)
Chuan, Z., Chunlin, Z., Lei, S., Guangjie, H.: A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications 35(2), 619–632 (2012)
Golden, B.: Shortest-Path Algorithms: A Comparison. Operations Research 24(6), 1164–1168 (1976)
Jagusiak, S., Józefczk, J.: An algorithm for joint location, coverage and routing in wireless sensor networks. In: XII BOS Conference, Polish Operational and Systems Research Society, Warsaw (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jagusiak, S., Józefczyk, J. (2014). Algorithms for Joint Coverage, Routing and Scheduling Problem in Wireless Sensor Networks. In: Swiątek, J., Grzech, A., Swiątek, P., Tomczak, J. (eds) Advances in Systems Science. Advances in Intelligent Systems and Computing, vol 240. Springer, Cham. https://doi.org/10.1007/978-3-319-01857-7_56
Download citation
DOI: https://doi.org/10.1007/978-3-319-01857-7_56
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01856-0
Online ISBN: 978-3-319-01857-7
eBook Packages: EngineeringEngineering (R0)