Skip to Main Content
This paper discusses a scheduling algorithm for the sub-tasks of an application in a Wireless Sensor Network. With the next generation of sensor networks, task-based systems are needed to provide services to entities outside the network. Allocation of tasks on different wireless nodes must take into account energy constraints, compatibility of tasks to a given node or topology and must be in agreement with the purpose of the network. The problem described in this paper requires maximizing network lifetime and satisfying these allocation constraints. The solution proves to be correct though in some cases it can lead to algorithmic complexity, such that further work on an approximation algorithm might be indicated.