Self-Organized Hybrid Wireless Sensor Network for Finding Randomly Moving Target in Unknown Environment

Unknown target search, in an unknown environment, is a complex problem in Wireless Sensor Network (WSN). It does not have a linear solution when target’s location and searching space is unknown. For the past few years, many researchers have invented novel techniques for finding a target using either Static Sensor Node (SSN) or Mobile Sensor Node (MSN) in WSN i.e. Hybrid WSN. But there is a lack of research to find a solution using hybrid WSN. In the current research, the problem has been addressed mostly using non-biological techniques. Due to its complexity and having a non-linear solution, Bio-inspired techniques are most suited to solve the problem. This paper proposes a solution for searching of randomly moving target in unknown area using only Mobile sensor nodes and combination of both Static and Mobile sensor nodes. In proposed technique coverage area is determined and compared. To perform the work, novel algorithms like MSNs Movement Prediction Algorithm (MMPA), Leader Selection Algorithm (LSA), Leader’s Movement Prediction Algorithm (LMPA) and follower algorithm are implemented. Simulation results validate the effectiveness of proposed work. Through the result, it is shown that proposed hybrid WSN approach with less number of sensor nodes (combination of Static and Mobile sensor nodes) finds target faster than only MSN approach

Mobile Cell Data Structure Quality Improvement For User Positioning Purposes

In wireless telephony networks, each cell is a geographical coverage area which can distribute frequency among cellular networks for different specific mobile network regions. Good cell and bad cell are used in the cellular network to identify the proper user position in a certain geographical area. The good cell is identified by assuming a maximum distance between latitude and longitude of two cell points with reasonable shape in a particular geographical area. The bad cell is identified while the cell shapes are become as irregular shape. However, mobile location accuracy is important for good cells data. Some cell data are not precise in shape to become good cells. Moreover, locations of handset are dependent for the accuracy of cell data shape. Most of the cases mobile operators are facing problem for the positioning purposes due to inaccuracy of the shape of cell data. The proper position accuracy of user is not visualized due to inaccuracy of cell data shape. The proposed system identifies the bad cell and repairs as good cell using visualize tool. An XML data file contains cell data information with longitude and latitude. A data base has been created to store the longitude and latitude of cell data in a standard format using PHP code. The visualize tool identify bad cell and good cell from the database. Furthermore, the tool converts the bad cell into good cell. Moreover, the tool can able to repair the cells which are not converted as good cell shape. The system can able to help to improve quality of user position accuracy for GSM and CDMA mobile operator

Relocating sensor nodes to maximize cumulative connected coverage in wireless sensor networks

PubMed ID: 27879850In order to extend the availability of the wireless sensor network and to extract maximum possible information from the surveillance area, proper usage of the power capacity of the sensor nodes is important. Our work describes a dynamic relocation algorithm called MaxNetLife, which is mainly based on utilizing the remaining power of individual sensor nodes as well as properly relocating sensor nodes so that all sensor nodes can transmit the data they sense to the sink. Hence, the algorithm maximizes total collected information from the surveillance area before the possible death of the sensor network by increasing cumulative connected coverage parameter of the network. A deterministic approach is used to deploy sensor nodes into the sensor field where Hexagonal Grid positioning is used to address and locate each sensor node. Sensor nodes those are not planned to be actively used in the close future in a specific cell are preemptively relocated to the cells those will be in need of additional sensor nodes to improve cumulative connected coverage of the network. MaxNetLife algorithm also includes the details of the relocation activities, which include preemptive migration of the redundant nodes to the cells before any coverage hole occurs because of death of a sensor node. Relocation Model, Data Aggregation Model, and Energy model of the algorithm are studied in detail. MaxNetLife algorithm is proved to be effective, scalable, and applicable through simulations.Publisher's Versio

A Hybrid Sink Repositioning Technique for Data Gathering in Wireless Sensor Networks

Wireless sensor network (WSN) is a wireless network that consists of spatially distributed autonomous devices using sensors to cooperatively investigate physical or environmental conditions. WSN has a hundreds or thousands of nodes that can communicate with each other and pass data from one node to another. Energy can be supplied to sensor nodes by batteries only and they are configured in a harsh environment in which the batteries cannot be charged or recharged simply. Sensor nodes can be randomly installed and they autonomously organize themselves into a communication network. The main constraint in wireless sensor networks is limited energy supply at the sensor nodes so it is important to deploy the sink at a position with respect to the specific area which is the area of interest; which would result in minimization of energy consumption. Sink repositioning is very important in modern day wireless sensor network since repositioning the sink at regular interval of time can balance the traffic load thereby decreasing the failure rate of the real time packets. More attention needs to be given on the Sink repositioning methods in order to increase the efficiency of the network. Existing work on sink repositioning techniques in wireless sensor networks consider only static and mobile sink. Not much importance is given to the hybrid sink deployment techniques. Multiple sink deployment and sink mobility can be considered to perform sink repositioning. Precise information of the area being monitored is needed to offer an ideal solution by the sink deployment method but this method is not a realistic often. To reallocate the sink, its odd pattern of energy must be considered. In this chapter a hybrid sink repositioning technique is developed for wireless sensor network where static and mobile sinks are used to gather the data from the sensor nodes. The nodes with low residual energy and high data generation rate are categorized as urgent and the nodes with high residual energy and low data generation rate are categorized as non-urgent. Static sink located within the center of the network collects the data from the urgent nodes. A relay is selected for each urgent sensor based on their residual energy. The urgent sensor sends their data to the static sink through these relay. Mobile sink collects the data from the non-urgent sensors. The performance of the proposed technique is compared with mobile base station placement scheme mainly based on the performance according to the metrics such as average end-to-end delay, drop, average packet delivery ratio and average energy consumption. Through the simulation results it is observed that the proposed hybrid sink repositioning technique reduces the energy hold problem and minimizes the buffer overflow problem thereby elongating the sensor network lifetime

A Routing Algorithm for Extending Mobile Sensor Network’s Lifetime using Connectivity and Target Coverage

In this paper, we propose an approach to improving the network lifetime by enhancing Network CONnectivity (NCON) and Target COVerage (TCOV) in randomly deployed Mobile Sensor Network (MSN). Generally, MSN refers to the collection of independent and scattered sensors with the capability of being mobile, if need be. Target coverage, network connectivity, and network lifetime are the three most critical issues of MSN. Any MSN formed with a set of randomly distributed sensors should be able to select and successfully activate some subsets of nodes so that they completely monitor or cover the entire Area of Interest (AOI). Network connectivity, on the other hand ensures that the nodes are connected for the full lifetime of the network so that collection and reporting of data to the sink node are kept uninterrupted through the sensor nodes. Keeping these three critical aspects into consideration, here we propose Socratic Random Algorithm (SRA) that ensures efficient target coverage and network connectivity alongside extending the lifetime of the network. The proposed method has been experimentally compared with other existing alternative mechanisms taking appropriate performance metrics into consideration. Our simulation results and analysis show that SRA performs significantly better than the existing schemes in the recent literature

Efficient Actor Recovery Paradigm For Wireless Sensor And Actor Networks

Wireless sensor networks (WSNs) are becoming widely used worldwide. Wireless Sensor and Actor Networks (WSANs) represent a special category of WSNs wherein actors and sensors collaborate to perform specific tasks. WSANs have become one of the most preeminent emerging type of WSNs. Sensors with nodes having limited power resources are responsible for sensing and transmitting events to actor nodes. Actors are high-performance nodes equipped with rich resources that have the ability to collect, process, transmit data and perform various actions. WSANs have a unique architecture that distinguishes them from WSNs. Due to the characteristics of WSANs, numerous challenges arise. Determining the importance of factors usually depends on the application requirements. The actor nodes are the spine of WSANs that collaborate to perform the specific tasks in an unsubstantiated and uneven environment. Thus, there is a possibility of high failure rate in such unfriendly scenarios due to several factors such as power fatigue of devices, electronic circuit failure, software errors in nodes or physical impairment of the actor nodes and inter-actor connectivity problem. It is essential to keep inter-actor connectivity in order to insure network connectivity. Thus, it is extremely important to discover the failure of a cut-vertex actor and network-disjoint in order to improve the Quality-of-Service (QoS). For network recovery process from actor node failure, optimal re-localization and coordination techniques should take place. In this work, we propose an efficient actor recovery (EAR) paradigm to guarantee the contention-free traffic-forwarding capacity. The EAR paradigm consists of Node Monitoring and Critical Node Detection (NMCND) algorithm that monitors the activities of the nodes to determine the critical node. In addition, it replaces the critical node with backup node prior to complete node-failure which helps balances the network performance. The packet is handled using Network Integration and Message Forwarding (NIMF) algorithm that determines the source of forwarding the packets (Either from actor or sensor). This decision-making capability of the algorithm controls the packet forwarding rate to maintain the network for longer time. Furthermore, for handling the proper routing strategy, Priority-Based Routing for Node Failure Avoidance (PRNFA) algorithm is deployed to decide the priority of the packets to be forwarded based on the significance of information available in the packet. To validate the effectiveness of the proposed EAR paradigm, we compare the performance of our proposed work with state-of the art localization algorithms. Our experimental results show superior performance in regards to network life, residual energy, reliability, sensor/ actor recovery time and data recovery

Multi-objective hierarchical algorithms for restoring Wireless Sensor Network connectivity in known environments

A Wireless Sensor Network can become partitioned due to node failure, requiring the deployment of additional relay nodes in order to restore network connectivity. This introduces an optimisation problem involving a tradeoff between the number of additional nodes that are required and the costs of moving through the sensor field for the purpose of node placement. This tradeoff is application-dependent, influenced for example by the relative urgency of network restoration. We propose a family of algorithms based on hierarchical objectives including complete algorithms and heuristics which integrate network design with path planning, recognising the impact of obstacles on mobility and communication. We conduct an empirical evaluation of the algorithms on random connectivity and mobility graphs, showing their relative performance in terms of node and path costs, and assessing their execution speeds. Finally, we examine how the relative importance of the two objectives influences the choice of algorithm. In summary, the algorithms which prioritise the node cost tend to find graphs with fewer nodes, while the algorithm which prioritise the cost of moving find slightly larger solutions but with cheaper mobility costs. The heuristic algorithms are close to the optimal algorithms in node cost, and higher in mobility costs. For fast moving agents, the node algorithms are preferred for total restoration time, and for slow agents, the path algorithms are preferred