Abstract
While Cluster-Tree network topologies look promising for WSN applications with timeliness and energy-efficiency requirements, we are yet to witness its adoption in commercial and academic solutions. One of the arguments that hinder the use of these topologies concerns the lack of flexibility in adapting to changes in the network, such as in traffic flows. This paper presents a solution to enable these networks with the ability to self-adapt their clusters' duty-cycle and scheduling, to provide increased quality of service to multiple traffic flows. Importantly, our approach enables a network to change its cluster scheduling without requiring long inaccessibility times or the re-association of the nodes. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs without significant changes to the protocol. Finally, we analyze and demonstrate the validity of our methodology through a comprehensive simulation and experimental validation using commercially available technology on a Structural Health Monitoring application scenario.

Abstract
Several concurrent applications running on a sensor network may cause a node to transmit packets at distinct periods, which increases the radio-switching rate and has significant impact in terms of the overall energy consumption. We propose to batch the transmissions together by defining a harmonizing period to align the transmissions from multiple applications at periodic boundaries. This harmonizing period is then leveraged to design a distributed protocol called Network-Harmonized Scheduling (NHS) that coordinates transmissions across nodes and provides real-time guarantees in a multi-hop network. Categories and Subject Descriptors-C. 3 [Computer Systems Organization]: Special-purpose and Application-Based Systems: Real-time and embedded systems

Abstract
IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC. PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned.

Abstract
The low-complexity encoding, as fundamental requirement of Distributed Video Coding, relies on performing the bulk of computation at decoder, including tasks as the generation of side information and particularly, inter-camera registration in the case of multi-view systems with complete-overlapped views and free motion of the cameras (e.g., video surveillance). In Ciobanu and Corte-Real (Multimedia Tools Appl 48(3):411-436, 2010) we introduced a codec-independent solution for such tasks at decoder. In this paper, we present a multi-view Wyner-Ziv codec (IWZ) designed for the architecture and scenarios from Ciobanu and Corte-Real (2010) (e.g., free motion of the cameras, no a priori knowledge of the instant camera positions, no feedback channel), based on transform domain (DCT), block-based coset coding. We aimed to achieve a compromise between the low encoder complexity and the rate-distortion performance. A detailed evaluation is presented for comparison with conventional coding (Intra 4x4 and Intra 16x16). Practical results show a better overall performance of the proposed codec at low bitrates.

Abstract
A key issue in video object tracking is the representation of the objects and how effectively it discriminates between different objects. Several techniques have been proposed, but without a generally accepted method. While analysis and comparisons of these individual methods have been presented in the literature, their evaluation as part of a global solution has been overlooked. The appearance model for the objects is a component of a video object tracking framework, depending on previous processing stages and affecting those that succeed it. As a result, these interdependencies should be taken into account when analysing the performance of the object description techniques. We propose an integrated analysis of object descriptors and appearance models through their comparison in a common object tracking solution. The goal is to contribute to a better understanding of object description methods and their impact on the tracking process. Our contributions are threefold: propose a novel descriptor evaluation and characterisation paradigm; perform the first integrated analysis of state-of-the-art description methods in a scenario of people tracking; put forward some ideas for appearance models to use in this context. This work provides foundations for future tests and the proposed assessment approach contributes to the informed selection of techniques more adequately for a given tracking application context.

Abstract
The back propagation algorithm is one of the best methods known for simultaneous linear and nonlinear impairment mitigation in long-haul fibre-optic links. Better understanding the full potential of such algorithm is key to improve the capacity of future links, whose design is likely to depend on the algorithm performance under different link configurations. In this paper, we carry out a novel and pertinent comparison in terms of the computational complexity requirements of both symmetric and asymmetric back-propagation implementation approaches for different dispersion map configurations, using simple single channel transmission, which results in the proposal of several design rules for the optimized deployment of ultra-long haul optical transport systems. In particular, it is concluded that dispersion unmanaged transmission is preferable in the sense of compatibility with different link design configurations as well as computational complexity requirements and maximum performance that can be achieved.