Minimum latency joint scheduling and routing in wireless sensor networks

Abstract

Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient communication; however, latency remains an important concern for many applications that require fast response. In this paper, we address the important problem of minimizing average communication latency for the active flows while providing energy-efficiency in wireless sensor networks. As the flows in some wireless sensor network can be long-lived and predictable, it is possible to design schedules for sensor nodes so that nodes can wake up only when it is necessary and asleep during other times. Clearly, the routing layer decision is closely coupled to the wakeup/sleep schedule of the sensor nodes.We formulate a joint scheduling and routing problem with the objective of finding the schedules and routes for current active flows with minimum average latency. By constructing a novel delay graph, the problem can be solved optimally by employing the M node-disjoint paths algorithm under FDMA channel model. We further extend the algorithm to handle dynamic traffic changes and topology changes in wireless sensor networks. We also propose a heuristic solution for the minimum latency joint scheduling and routing problem under single channel interference.Numerical results show the latency can reduced 15% under stationary scenario and 50% under dynamic traffic or topology changes.

A Survey of Visual Sensor Networks

“…Such an approach is taken in [39], where Lu and Krishnamachari look into the joint problem of finding the routes and nodes activity schedules that provide the minimum average latency for current active data flows. It is assumed an FDMA channel model, which enables simultaneous packet transmissions from neighboring nodes with minimized interference.…”

“…Thus, although it is desirable to have high-resolution data features, costly feature extractions actually should be limited. This implies the need for finding optimal ways to determine when Routing protocols SPEED-He et al [37] Transmission delay of a packet depends on the distance to the sink and delivery speed MMSPEED-Felemban et al [38] Multispeed transmission and the establishment of more than one path to the destination Lu and Krishnamachari [39] Joint routing and delay optimization…”

“…Wireless networking Signal processing Middleware [72], [73], [74] Camera calibration: [18], [19], [21] Vision processing: * Object detection [22], [23] * Object tracking [25], [26], [27], [28], [29] * Advanced signal processing [30], [31] Sensor management [25], [29], [52], [53], [54], [55], [56] [32], [33], [38] Energy consumption: [60], [62], [64] Visual sensor node platformas: [5], [58], [66], [67] VSN architectures: [59], [68], [70] Hardware architectures Application * Reliability [35], [36], [37] * Delay sensitive communication [39], [40], [41], [42], [43], [44], [45], [46], [47] * Collaborative routing [49], [50] algorithms should explore how the o...…”

Monitoring Technologies in Mission-Critical Environment by Using Wireless Sensor Networks

“…The methods with joint optimal scheduling, routing and power control are proposed to achieve goals such as: fair rate allocation, minimize overhead and maximal resource utilization, etc. Recently, Lu et al proposed to minimize average communication latency for the active flows with emergency efficiency by joint scheduling and routing in wireless sensor networks (Lu & Krishnamachari, 2007). Joseph et al considered the problem of obtaining jointly optimal power control, routing and scheduling policies to ensure a fair utilization of network resources for energy harvesting sensor networks (Joseph et al, 2009).…”

Multi-channel wireless sensor networks : protocols, design and evaluation

“…Scheduling with considering the traffic demands on different links is addressed in several papers [233,242,285]. Maximizing throughput [57,103,265], minimizing latency [62,130,178], fairness [132,234,252,267] and scheduling with deadlines [168] are the other most common objectives presented in scheduling wireless multi-hop networks.…”