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

A novel energy efficient wireless sensor network framework for object tracking

Object tracking is a typical application of Wireless Sensor Networks (WSNs), which refers to the process of locating a moving object (or multiple objects) over time using a sensor network. Object tracking in WSNs can be a time consuming and resource hungry process due to factors, such as the amount of data generated or limited resources available to the sensor network. The traditional centralised approaches where a number of sensors transmit all information to a base station or a sink node, increase computation burden. More recently static or dynamic clustering approaches have been explored. Both clustering approaches suffer from certain problems, such as, large clusters, redundant data collection and excessive energy consumption. In addition, most existing object tracking algorithms mainly focus on tracking an object instead of predicting the destination of an object. To address the limitations of existing approaches, this thesis presents a novel framework for efficient object tracking using sensor networks. It consists of a Hierarchical Hybrid Clustering Mechanism (HHCM) with a Prediction-based Algorithm for Destinationestimation (PAD). The proposed framework can track the destination of the object without prior information of the objects movement, while providing significant reduction in energy consumption. The costs of computation and communication are also reduced by collecting the most relevant information and discarding irrelevant information at the initial stages of communication. The contributions of this thesis are: Firstly, a novel Prediction-based Algorithm for Destination-estimation (PAD) has been presented, that predicts the final destination of the object and the path that particular object will take to that destination. The principles of origin destination (OD) estimation have been adopted to create a set of trajectories that a particular object could follow. These paths are made up of a number of mini-clusters, formed for tracking the object, combined together. PAD also contains a Multi-level Recovery Mechanism (MRM) that recovers tracking if the object is lost. MRM minimises the number of nodes involved in the recovery process by initiating the process at local level and then expanding to add more nodes till the object is recovered. Secondly, a network architecture called Hierarchical Hybrid Clustering Mechanism (HHCM) has been developed, that forms dynamic mini-clusters within and across static clusters to reduce the number of nodes involved in the tracking process and to distribute the initial computational tasks amoung a larger number of mini-cluster heads. Lastly, building upon the HHCM to create a novel multi-hierarchy aggregation and next-step prediction mechanism to gather the most relevant data about the movement of the tracked object and its next-step location, a Kalman-filter based approach for prediction of next state of an object in order to increase accuracy has been proposed. In addition, a dynamic sampling mechanism has been devised to collect the most relevant data. Extensive simulations were carried out and results were compared with the existing approaches to prove that HHCM and PAD make significant improvements in energy conservation. To the best of my knowledge the framework developed in unique and novel, which can predicts the destination of the moving object without any prior historic knowledge of the moving object

Predictive Duty Cycling of Radios and Cameras using Augmented Sensing in Wireless Camera Networks

Energy efficiency dominates practically every aspect of the design of wireless camera networks (WCNs), and duty cycling of radios and cameras is an important tool for achieving high energy efficiencies. However, duty cycling in WCNs is made complex by the camera nodes having to anticipate the arrival of the objects in their field-of-view. What adds to this complexity is the fact that radio duty cycling and camera duty cycling are tightly coupled notions in WCNs. Abstract In this dissertation, we present a predictive framework to provide camera nodes with an ability to anticipate the arrival of an object in the field-of-view of their cameras. This allows a predictive adaption of network parameters simultaneously in multiple layers. Such anticipatory approach is made possible by enabling each camera node in the network to track an object beyond its direct sensing range and to adapt network parameters in multiple layers before the arrival of the object in its sensing range. The proposed framework exploits a single spare bit in the MAC header of the 802.15.4 protocol for creating this beyond-the-sensing-rage capability for the camera nodes. In this manner, our proposed approach for notifying the nodes about the current state of the object location entails no additional communication overhead. Our experimental evaluations based on large-scale simulations as well as an Imote2-based wireless camera network demonstrate that the proposed predictive adaptation approach, while providing comparable application-level performance, significantly reduces energy consumption compared to the approaches addressing only a single layer adaptation or those with reactive adaptation

Configuring heterogeneous wireless sensor networks under quality-of-service constraints

Wireless sensor networks (WSNs) are useful for a diversity of applications, such as structural monitoring of buildings, farming, assistance in rescue operations, in-home entertainment systems or to monitor people's health. A WSN is a large collection of small sensor devices that provide a detailed view on all sides of the area or object one is interested in. A large variety of WSN hardware platforms is readily available these days. Many operating systems and protocols exist to support essential functionality such as communication, power management, data fusion, localisation, and much more. A typical sensor node has a number of settings that affect its behaviour and the function of the network itself, such as the transmission power of its radio and the number of measurements taken by its sensor per minute. As the number of nodes in a WSN may be very large, the collection of independent parameters in these networks – the configuration space – tends to be enormous. The user of the WSN would have certain expectations on the Quality of Service (QoS) of the network. A WSN is deployed for a specific purpose, and has a number of measurable properties that indicate how well the network's task is being performed. Examples of such quality metrics are the time needed for measured information to reach the user, the degree of coverage of the area, or the lifetime of the network. Each point in the configuration space of the network gives rise to a certain value in each of the quality metrics. The user may place constraints on the quality metrics, and wishes to optimise the configuration to meet their goals. Work on sensor networks often focuses on optimising only one metric at the time, ignoring the fact that improving one aspect of the system may deteriorate other important performance characteristics. The study of trade-offs between multiple quality metrics, and a method to optimally configure a WSN for several objectives simultaneously – until now a rather unexplored field – is the main contribution of this thesis. There are many steps involved in the realisation of a WSN that is fulfilling a task as desired. First of all, the task needs to be defined and specified, and appropriate hardware (sensor nodes) needs to be selected. After that, the network needs to be deployed and properly configured. This thesis deals with the configuration problem, starting with a possibly heterogeneous collection of nodes distributed in an area of interest, suitable models of the nodes and their interaction, and a set of task-level requirements in terms of quality metrics. We target the class of WSNs with a single data sink that use a routing tree for communication. We introduce two models of tasks running on a sensor network – target tracking and spatial mapping – which are used in the experiments in this thesis. The configuration process is split in a number of phases. After an initialisation phase to collect information about the network, the routing tree is formed in the second configuration phase. We explore the trade-off between two attributes of a tree: the average path length and the maximum node degree. These properties do not only affect the quality metrics, but also the complexity of the remaining optimisation trajectory. We introduce new algorithms to efficiently construct a shortest-path spanning tree in which all nodes have a degree not higher than a given target value. The next phase represents the core of the configuration method: it features a QoS optimiser that determines the Pareto-optimal configurations of the network given the routing tree. A configuration contains settings for the parameters of all nodes in the network, plus the metric values they give rise to. The Pareto-optimal configurations, also known as Pareto points, represent the best possible trade-offs between the quality metrics. Given the vastness of the configuration space, which is exponential in the size of the network, it is impossible to use a brute-force approach and try all possibilities. Still our method efficiently finds all Pareto points, by incrementally searching the configuration space, and discarding potential solutions immediately when they appear to be not Pareto optimal. An important condition for this to work is the ability to compute quality metrics for a group of nodes from the quality metrics of smaller groups of nodes. The precise requirements are derived and shown to hold for the example tasks. Experimental results show that the practical complexity of this algorithm is approximately linear in the number of nodes in the network, and thus scalable to very large networks. After computing the set of Pareto points, a configuration that satisfies the QoS constraints is selected, and the nodes are configured accordingly (the selection and loading phases). The configuration process can be executed in either a centralised or a distributed way. Centralised means that all computations are carried out on a central node, while the distributed algorithms do all the work on the sensor nodes themselves. Simulations show run times in the order of seconds for the centralised configuration of WSNs of hundreds of TelosB sensor nodes. The distributed algorithms take in the order of minutes for the same networks, but have a lower communication overhead. Hence, both approaches have their own pros and cons, and even a combination is possible in which the heavy work is performed by dedicated compute nodes spread across the network. Besides the trade-offs between quality metrics, there is a meta trade-off between the quality and the cost of the configuration process itself. A speed-up of the configuration process can be achieved in exchange for a reduction in the quality of the solutions. We provide complexity-control functionality to fine-tune this quality/cost trade-off. The methods described thus far configure a WSN given a fixed state (node locations, environmental conditions). WSNs, however, are notoriously dynamic during operation: nodes may move or run out of battery, channel conditions may fluctuate, or the demands from the user may change. The final part of this thesis describes methods to adapt the configuration to such dynamism at run time. Especially the case of a mobile sink is treated in detail. As frequently doing global reconfigurations would likely be too slow and too expensive, we use localised algorithms to maintain the routing tree and reconfigure the node parameters. Again, we are able to control the quality/cost trade-off, this time by adjusting the size of the locality in which the reconfiguration takes place. To conclude the thesis, a case study is presented, which highlights the use of the configuration method on a more complex example containing a lot of heterogeneity

Energy-Efficient Self-Organization of Wireless Acoustic Sensor Networks for Ground Target Tracking

With the developments in computing and communication technologies, wireless sensor networks have become popular in wide range of application areas such as health, military, environment and habitant monitoring. Moreover, wireless acoustic sensor networks have been widely used for target tracking applications due to their passive nature, reliability and low cost. Traditionally, acoustic sensor arrays built in linear, circular or other regular shapes are used for tracking acoustic sources. The maintaining of relative geometry of the acoustic sensors in the array is vital for accurate target tracking, which greatly reduces the flexibility of the sensor network. To overcome this limitation, we propose using only a single acoustic sensor at each sensor node. This design greatly improves the flexibility of the sensor network and makes it possible to deploy the sensor network in remote or hostile regions through air-drop or other stealth approaches. Acoustic arrays are capable of performing the target localization or generating the bearing estimations on their own. However, with only a single acoustic sensor, the sensor nodes will not be able to generate such measurements. Thus, self-organization of sensor nodes into virtual arrays to perform the target localization is essential. We developed an energy-efficient and distributed self-organization algorithm for target tracking using wireless acoustic sensor networks. The major error sources of the localization process were studied, and an energy-aware node selection criterion was developed to minimize the target localization errors. Using this node selection criterion, the self-organization algorithm selects a near-optimal localization sensor group to minimize the target tracking errors. In addition, a message passing protocol was developed to implement the self-organization algorithm in a distributed manner. In order to achieve extended sensor network lifetime, energy conservation was incorporated into the self-organization algorithm by incorporating a sleep-wakeup management mechanism with a novel cross layer adaptive wakeup probability adjustment scheme. The simulation results confirm that the developed self-organization algorithm provides satisfactory target tracking performance. Moreover, the energy saving analysis confirms the effectiveness of the cross layer power management scheme in achieving extended sensor network lifetime without degrading the target tracking performance

Department of Defense Dictionary of Military and Associated Terms

The Joint Publication 1-02, Department of Defense Dictionary of Military and Associated Terms sets forth standard US military and associated terminology to encompass the joint activity of the Armed Forces of the United States. These military and associated terms, together with their definitions, constitute approved Department of Defense (DOD) terminology for general use by all DOD components

1995 BRAC Commission

DoD Depot - Army Basing Study - Alternative Documentation Set; COBRA; Economic Impact. Box 269, XS-004

1995 BRAC Commission

Air Force Facilities - Site Presentations, April 1995. Documents and memos relating to Air Force facilities visits conducted in April 1995. Box 86, L-008

University of San Diego News Print Media Coverage 2005.04

Printed clippings housed in folders with a table of contents arranged by topic.https://digital.sandiego.edu/print-media/1027/thumbnail.jp