Coverage and Energy Analysis of Mobile Sensor Nodes in Obstructed Noisy Indoor Environment: A Voronoi Approach

The rapid deployment of wireless sensor network (WSN) poses the challenge of finding optimal locations for the network nodes, especially so in (i) unknown and (ii) obstacle-rich environments. This paper addresses this challenge with BISON (Bio-Inspired Self-Organizing Network), a variant of the Voronoi algorithm. In line with the scenario challenges, BISON nodes are restricted to (i) locally sensed as well as (ii) noisy information on the basis of which they move, avoid obstacles and connect with neighboring nodes. Performance is measured as (i) the percentage of area covered, (ii) the total distance traveled by the nodes, (iii) the cumulative energy consumption and (iv) the uniformity of nodes distribution. Obstacle constellations and noise levels are studied systematically and a collision-free recovery strategy for failing nodes is proposed. Results obtained from extensive simulations show the algorithm outperforming previously reported approaches in both, convergence speed, as well as deployment cost.Comment: 17 pages, 24 figures, 1 tabl

Reliable cost-optimal deployment of wireless sensor networks

Wireless Sensor Networks (WSNs) technology is currently considered one of the key technologies for realizing the Internet of Things (IoT). Many of the important WSNs applications are critical in nature such that the failure of the WSN to carry out its required tasks can have serious detrimental effects. Consequently, guaranteeing that the WSN functions satisfactorily during its intended mission time, i.e. the WSN is reliable, is one of the fundamental requirements of the network deployment strategy. Achieving this requirement at a minimum deployment cost is particularly important for critical applications in which deployed SNs are equipped with expensive hardware. However, WSN reliability, defined in the traditional sense, especially in conjunction with minimizing the deployment cost, has not been considered as a deployment requirement in existing WSN deployment algorithms to the best of our knowledge. Addressing this major limitation is the central focus of this dissertation. We define the reliable cost-optimal WSN deployment as the one that has minimum deployment cost with a reliability level that meets or exceeds a minimum level specified by the targeted application. We coin the problem of finding such deployments, for a given set of application-specific parameters, the Minimum-Cost Reliability-Constrained Sensor Node Deployment Problem (MCRC-SDP). To accomplish the aim of the dissertation, we propose a novel WSN reliability metric which adopts a more accurate SN model than the model used in the existing metrics. The proposed reliability metric is used to formulate the MCRC-SDP as a constrained combinatorial optimization problem which we prove to be NP-Complete. Two heuristic WSN deployment optimization algorithms are then developed to find high quality solutions for the MCRC-SDP. Finally, we investigate the practical realization of the techniques that we developed as solutions of the MCRC-SDP. For this purpose, we discuss why existing WSN Topology Control Protocols (TCPs) are not suitable for managing such reliable cost-optimal deployments. Accordingly, we propose a practical TCP that is suitable for managing the sleep/active cycles of the redundant SNs in such deployments. Experimental results suggest that the proposed TCP\u27s overhead and network Time To Repair (TTR) are relatively low which demonstrates the applicability of our proposed deployment solution in practice

Swarm Robotics

Collectively working robot teams can solve a problem more efficiently than a single robot, while also providing robustness and flexibility to the group. Swarm robotics model is a key component of a cooperative algorithm that controls the behaviors and interactions of all individuals. The robots in the swarm should have some basic functions, such as sensing, communicating, and monitoring, and satisfy the following properties

Distributed navigation of multi-robot systems for sensing coverage

A team of coordinating mobile robots equipped with operation specific sensors can perform different coverage tasks. If the required number of robots in the team is very large then a centralized control system becomes a complex strategy. There are also some areas where centralized communication turns into an issue. So, a team of mobile robots for coverage tasks should have the ability of decentralized or distributed decision making. This thesis investigates decentralized control of mobile robots specifically for coverage problems. A decentralized control strategy is ideally based on local information and it can offer flexibility in case there is an increment or decrement in the number of mobile robots. We perform a broad survey of the existing literature for coverage control problems. There are different approaches associated with decentralized control strategy for coverage control problems. We perform a comparative review of these approaches and use the approach based on simple local coordination rules. These locally computed nearest neighbour rules are used to develop decentralized control algorithms for coverage control problems. We investigate this extensively used nearest neighbour rule-based approach for developing coverage control algorithms. In this approach, a mobile robot gives an equal importance to every neighbour robot coming under its communication range. We develop our control approach by making some of the mobile robots playing a more influential role than other members of the team. We develop the control algorithm based on nearest neighbour rules with weighted average functions. The approach based on this control strategy becomes efficient in terms of achieving a consensus on control inputs, say heading angle, velocity, etc. The decentralized control of mobile robots can also exhibit a cyclic behaviour under some physical constraints like a quantized orientation of the mobile robot. We further investigate the cyclic behaviour appearing due to the quantized control of mobile robots under some conditions. Our nearest neighbour rule-based approach offers a biased strategy in case of cyclic behaviour appearing in the team of mobile robots. We consider a clustering technique inside the team of mobile robots. Our decentralized control strategy calculates the similarity measure among the neighbours of a mobile robot. The team of mobile robots with the similarity measure based approach becomes efficient in achieving a fast consensus like on heading angle or velocity. We perform a rigorous mathematical analysis of our developed approach. We also develop a condition based on relaxed criteria for achieving consensus on velocity or heading angle of the mobile robots. Our validation approach is based on mathematical arguments and extensive computer simulations

Indoor Positioning and Navigation

In recent years, rapid development in robotics, mobile, and communication technologies has encouraged many studies in the field of localization and navigation in indoor environments. An accurate localization system that can operate in an indoor environment has considerable practical value, because it can be built into autonomous mobile systems or a personal navigation system on a smartphone for guiding people through airports, shopping malls, museums and other public institutions, etc. Such a system would be particularly useful for blind people. Modern smartphones are equipped with numerous sensors (such as inertial sensors, cameras, and barometers) and communication modules (such as WiFi, Bluetooth, NFC, LTE/5G, and UWB capabilities), which enable the implementation of various localization algorithms, namely, visual localization, inertial navigation system, and radio localization. For the mapping of indoor environments and localization of autonomous mobile sysems, LIDAR sensors are also frequently used in addition to smartphone sensors. Visual localization and inertial navigation systems are sensitive to external disturbances; therefore, sensor fusion approaches can be used for the implementation of robust localization algorithms. These have to be optimized in order to be computationally efficient, which is essential for real-time processing and low energy consumption on a smartphone or robot

Biologically inspired, self organizing communication networks.

PhDThe problem of energy-efficient, reliable, accurate and self-organized target tracking in Wireless Sensor Networks (WSNs) is considered for sensor nodes with limited physical resources and abrupt manoeuvring mobile targets. A biologically inspired, adaptive multi-sensor scheme is proposed for collaborative Single Target Tracking (STT) and Multi-Target Tracking (MTT). Behavioural data obtained while tracking the targets including the targets’ previous locations is recorded as metadata to compute the target sampling interval, target importance and local monitoring interval so that tracking continuity and energy-efficiency are improved. The subsequent sensor groups that track the targets are selected proactively according to the information associated with the predicted target location probability such that the overall tracking performance is optimized or nearly-optimized. One sensor node from each of the selected groups is elected as a main node for management operations so that energy efficiency and load balancing are improved. A decision algorithm is proposed to allow the “conflict” nodes that are located in the sensing areas of more than one target at the same time to decide their preferred target according to the target importance and the distance to the target. A tracking recovery mechanism is developed to provide the tracking reliability in the event of target loss. The problem of task mapping and scheduling in WSNs is also considered. A Biological Independent Task Allocation (BITA) algorithm and a Biological Task Mapping and Scheduling (BTMS) algorithm are developed to execute an application using a group of sensor nodes. BITA, BTMS and the functional specialization of the sensor groups in target tracking are all inspired from biological behaviours of differentiation in zygote formation. Simulation results show that compared with other well-known schemes, the proposed tracking, task mapping and scheduling schemes can provide a significant improvement in energy-efficiency and computational time, whilst maintaining acceptable accuracy and seamless tracking, even with abrupt manoeuvring targets.Queen Mary university of London full Scholarshi

Intelligent Circuits and Systems

ICICS-2020 is the third conference initiated by the School of Electronics and Electrical Engineering at Lovely Professional University that explored recent innovations of researchers working for the development of smart and green technologies in the fields of Energy, Electronics, Communications, Computers, and Control. ICICS provides innovators to identify new opportunities for the social and economic benefits of society.　 This conference bridges the gap between academics and R&D institutions, social visionaries, and experts from all strata of society to present their ongoing research activities and foster research relations between them. It provides opportunities for the exchange of new ideas, applications, and experiences in the field of smart technologies and finding global partners for future collaboration. The ICICS-2020 was conducted in two broad categories, Intelligent Circuits & Intelligent Systems and Emerging Technologies in Electrical Engineering

Computational Intelligence for Cooperative Swarm Control

Over the last few decades, swarm intelligence (SI) has shown significant benefits in many practical applications. Real-world applications of swarm intelligence include disaster response and wildlife conservation. Swarm robots can collaborate to search for survivors, locate victims, and assess damage in hazardous environments during an earthquake or natural disaster. They can coordinate their movements and share data in real-time to increase their efficiency and effectiveness while guiding the survivors. In addition to tracking animal movements and behaviour, robots can guide animals to or away from specific areas. Sheep herding is a significant source of income in Australia that could be significantly enhanced if the human shepherd could be supported by single or multiple robots. Although the shepherding framework has become a popular SI mechanism, where a leading agent (sheepdog) controls a swarm of agents (sheep) to complete a task, controlling a swarm of agents is still not a trivial task, especially in the presence of some practical constraints. For example, most of the existing shepherding literature assumes that each swarm member has an unlimited sensing range to recognise all other members’ locations. However, this is not practical for physical systems. In addition, current approaches do not consider shepherding as a distributed system where an agent, namely a central unit, may observe the environment and commu- nicate with the shepherd to guide the swarm. However, this brings another hurdle when noisy communication channels between the central unit and the shepherd af- fect the success of the mission. Also, the literature lacks shepherding models that can cope with dynamic communication systems. Therefore, this thesis aims to design a multi-agent learning system for effective shepherding control systems in a partially observable environment under communication constraints. To achieve this goal, the thesis first introduces a new methodology to guide agents whose sensing range is limited. In this thesis, the sheep are modelled as an induced network to represent the sheep’s sensing range and propose a geometric method for finding a shepherd-impacted subset of sheep. The proposed swarm optimal herding point uses a particle swarm optimiser and a clustering mechanism to find the sheepdog’s near-optimal herding location while considering flock cohesion. Then, an improved version of the algorithm (named swarm optimal modified centroid push) is proposed to estimate the sheepdog’s intermediate waypoints to the herding point considering the sheep cohesion. The approaches outperform existing shepherding methods in reducing task time and increasing the success rate for herding. Next, to improve shepherding in noisy communication channels, this thesis pro- poses a collaborative learning-based method to enhance communication between the central unit and the herding agent. The proposed independent pre-training collab- orative learning technique decreases the transmission mean square error by half in 10% of the training time compared to existing approaches. The algorithm is then ex- tended so that the sheepdog can read the modulated herding points from the central unit. The results demonstrate the efficiency of the new technique in time-varying noisy channels. Finally, the central unit is modelled as a mobile agent to lower the time-varying noise caused by the sheepdog’s motion during the task. So, I propose a Q-learning- based incremental search to increase transmission success between the shepherd and the central unit. In addition, two unique reward functions are presented to ensure swarm guidance success with minimal energy consumption. The results demonstrate an increase in the success rate for shepherding

Temporospatial Context-Aware Vehicular Crash Risk Prediction

With the demand for more vehicles increasing, road safety is becoming a growing concern. Traffic collisions take many lives and cost billions of dollars in losses. This explains the growing interest of governments, academic institutions and companies in road safety. The vastness and availability of road accident data has provided new opportunities for gaining a better understanding of accident risk factors and for developing more effective accident prediction and prevention regimes. Much of the empirical research on road safety and accident analysis utilizes statistical models which capture limited aspects of crashes. On the other hand, data mining has recently gained interest as a reliable approach for investigating road-accident data and for providing predictive insights. While some risk factors contribute more frequently in the occurrence of a road accident, the importance of driver behavior, temporospatial factors, and real-time traffic dynamics have been underestimated. This study proposes a framework for predicting crash risk based on historical accident data. The proposed framework incorporates machine learning and data analytics techniques to identify driving patterns and other risk factors associated with potential vehicle crashes. These techniques include clustering, association rule mining, information fusion, and Bayesian networks. Swarm intelligence based association rule mining is employed to uncover the underlying relationships and dependencies in collision databases. Data segmentation methods are employed to eliminate the effect of dependent variables. Extracted rules can be used along with real-time mobility to predict crashes and their severity in real-time. The national collision database of Canada (NCDB) is used in this research to generate association rules with crash risk oriented subsequents, and to compare the performance of the swarm intelligence based approach with that of other association rule miners. Many industry-demanding datasets, including road-accident datasets, are deficient in descriptive factors. This is a significant barrier for uncovering meaningful risk factor relationships. To resolve this issue, this study proposes a knwoledgebase approximation framework to enhance the crash risk analysis by integrating pieces of evidence discovered from disparate datasets capturing different aspects of mobility. Dempster-Shafer theory is utilized as a key element of this knowledgebase approximation. This method can integrate association rules with acceptable accuracy under certain circumstances that are discussed in this thesis. The proposed framework is tested on the lymphography dataset and the road-accident database of the Great Britain. The derived insights are then used as the basis for constructing a Bayesian network that can estimate crash likelihood and risk levels so as to warn drivers and prevent accidents in real-time. This Bayesian network approach offers a way to implement a naturalistic driving analysis process for predicting traffic collision risk based on the findings from the data-driven model. A traffic incident detection and localization method is also proposed as a component of the risk analysis model. Detecting and localizing traffic incidents enables timely response to accidents and facilitates effective and efficient traffic flow management. The results obtained from the experimental work conducted on this component is indicative of the capability of our Dempster-Shafer data-fusion-based incident detection method in overcoming the challenges arising from erroneous and noisy sensor readings

Intelligent Sensor Networks

In the last decade, wireless or wired sensor networks have attracted much attention. However, most designs target general sensor network issues including protocol stack (routing, MAC, etc.) and security issues. This book focuses on the close integration of sensing, networking, and smart signal processing via machine learning. Based on their world-class research, the authors present the fundamentals of intelligent sensor networks. They cover sensing and sampling, distributed signal processing, and intelligent signal learning. In addition, they present cutting-edge research results from leading experts