Object tracking sensor networks in smart cities: Taxonomy, architecture, applications, research challenges and future directions

The development of pervasive communication devices and the emergence of the Internet of Things (IoT) have acted as an essential part in the feasibility of smart city initiatives. Wireless sensor network (WSN) as a key enabling technology in IoT offers the potential for cities to get smatter. WSNs gained tremendous attention during the recent years because of their rising number of applications that enables remote monitoring and tracking in smart cities. One of the most exciting applications of WSNs in smart cities is detection, monitoring, and tracking which is referred to as object tracking sensor networks (OTSN). The adaptation of OTSN into urban cities brought new exciting challenges for reaching the goal of future smart cities. Such challenges focus primarily on problems related to active monitoring and tracking in smart cities. In this paper, we present the essential characteristics of OTSN, monitoring and tracking application used with the content of smart city. Moreover, we discussed the taxonomy of OTSN along with analysis and comparison. Furthermore, research challenges are investigated concerning energy reservation, object detection, object speed, accuracy in tracking, sensor node collaboration, data aggregation and object recovery position estimation. This review can serve as a benchmark for researchers for future development of smart cities in the context of OTSN. Lastly, we provide future research direction

Communication Efficiency in Information Gathering through Dynamic Information Flow

This thesis addresses the problem of how to improve the performance of multi-robot information gathering tasks by actively controlling the rate of communication between robots. Examples of such tasks include cooperative tracking and cooperative environmental monitoring. Communication is essential in such systems for both decentralised data fusion and decision making, but wireless networks impose capacity constraints that are frequently overlooked. While existing research has focussed on improving available communication throughput, the aim in this thesis is to develop algorithms that make more efficient use of the available communication capacity. Since information may be shared at various levels of abstraction, another challenge is the decision of where information should be processed based on limits of the computational resources available. Therefore, the flow of information needs to be controlled based on the trade-off between communication limits, computation limits and information value. In this thesis, we approach the trade-off by introducing the dynamic information flow (DIF) problem. We suggest variants of DIF that either consider data fusion communication independently or both data fusion and decision making communication simultaneously. For the data fusion case, we propose efficient decentralised solutions that dynamically adjust the flow of information. For the decision making case, we present an algorithm for communication efficiency based on local LQ approximations of information gathering problems. The algorithm is then integrated with our solution for the data fusion case to produce a complete communication efficiency solution for information gathering. We analyse our suggested algorithms and present important performance guarantees. The algorithms are validated in a custom-designed decentralised simulation framework and through field-robotic experimental demonstrations