In manufacturing systems, resources are usually application specific with slight flexibility of resource assignment to tasks, whereas in mobile sensor networks, the resources are heterogeneous and capable of performing diverse tasks. Hence, we have shared resources where multiple tasks contend for a single shared resource, or multiple resources contend to perform a single task. In the former case, we have shared resources, and in the latter, routing resources. The need then arises to suitably assign, dispatch and schedule resources in such a manner so as to avoid contention, or circular wait (CW) of resources leading to deadlock. This chapter is organized into the following sections. Section 6.1 discusses the matrix-based discrete event controller (DEC), section 6.2 introduces deadlocks and presents the deadlock avoidance policy along with implementation on the wireless sensor network (WSN) test bed, section 6.3 discusses the issues of deadlock avoidance in the presence of routing resources and section 6.4 presents simulation results of deadlock avoidance both with and without routing resources. Experimental results of deadlock avoidance on the Automation & Robotics Research Institute (ARRI) WSN test bed are also presented in this section.

Inspec keywords: resource allocation; matrix algebra; discrete event systems; telecommunication network routing; wireless sensor networks

Other keywords: routing resources; mobile sensor networks; deadlock; wireless sensor network test bed; resource scheduling; circular wait; manufacturing systems; deadlock avoidance policy; matrix based discrete event controller

Subjects: Wireless sensor networks