An Optimal Node Scheduling for Flat Wireless Sensor Networks

详细信息    查看全文

• 作者：Fabíola Guerra Nakamura ; Frederico Paiva Quint?o ; Gustavo Campos Menezes ; Geraldo Robson Mateus
• 刊名：Lecture Notes in Computer Science
• 出版年：2005
• 出版时间：2005
• 年：2005
• 卷：3420
• 期：1
• 页码：p.475
• 全文大小：133 KB
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

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.