Abstract
The determination of a topology that minimizes the energy consumption and assures the application requirements is one of the greatest challenges about Wireless Sensor Networks (WSNs). This work presents a dynamic mixed integer linear programming (MILP) model to solve the coverage and connectivity dynamic problems (CCDP) in flat WSNs. The model solution provides a node scheduling scheme indicating the network topology in pre-defined time periods. The objective consists of assuring the coverage area and network connectivity at each period minimizing the energy consumption. The model tests use the optimization commercial package CPLEX 7.0. The results show that the proposed node scheduling scheme allows the network operation during all the defined periods guaranteeing the best possible coverage, and can extend the network lifetime besides the horizon of time.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Rentala, P., Musunuri, R., Gandham, S., Saxena, U.: Survey on sensor network. Mobile Computing (CS6392) Course (2001)
Tilak, S., Abu-Ghazaleh, N.B., Heinzelman, W.: A taxonomy of wireless micro-sensor network models. ACM SIGMOBILE Mobile Computing and Communications Review 6, 28–36 (2002)
Ruiz, L., Nogueira, J., Loureiro, A.: Manna: A management architecture for wireless sensor networks. IEEE Communication Magazine 41 (2003)
Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: First ACM Conference on Embedded Networked Sensor Systems, SenSys 2003 (2003)
Bhardwaj, M., Chandrakasan, A., Garnett, T.: Upper bounds on the lifetime of sensor networks. In: IEEE International Conference on Communications, pp. 785–790 (2001)
Crossbow: (Mica2 - wireless measurement system), http://www.xbow.com/Products/Product_pdf_files/Wireless_pdf/MICA2.pdf
ILOG: (Cplex), http://www.ilog.com/products/cplex/
Megerian, S., Potkonjak, M.: Low power 0/1 coverage and scheduling techniques in sensor networks. Technical Reports 030001, University of California, Los Angeles (2003)
Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers 51(12), 1448–1453 (2002)
Hinojosa, Y., Puerto, J., Fernández, F.R.: A multiperiod two-echelon multicommodity capacitaded plant location problem. European Journal of Operational Research 123, 271–291 (2000)
Fisher, M.L.: An applications oriented guide to lagrangian relaxation. Interfaces 15, 10–21 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakamura, F.G., Quintão, F.P., Menezes, G.C., Mateus, G.R. (2005). An Optimal Node Scheduling for Flat Wireless Sensor Networks. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_56
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)