363 research outputs found

    Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

    Full text link
    The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

    Machine Learning in Wireless Sensor Networks: Algorithms, Strategies, and Applications

    Get PDF
    Wireless sensor networks monitor dynamic environments that change rapidly over time. This dynamic behavior is either caused by external factors or initiated by the system designers themselves. To adapt to such conditions, sensor networks often adopt machine learning techniques to eliminate the need for unnecessary redesign. Machine learning also inspires many practical solutions that maximize resource utilization and prolong the lifespan of the network. In this paper, we present an extensive literature review over the period 2002-2013 of machine learning methods that were used to address common issues in wireless sensor networks (WSNs). The advantages and disadvantages of each proposed algorithm are evaluated against the corresponding problem. We also provide a comparative guide to aid WSN designers in developing suitable machine learning solutions for their specific application challenges.Comment: Accepted for publication in IEEE Communications Surveys and Tutorial

    Indoor localisation by using wireless sensor nodes

    Get PDF
    This study is devoted to investigating and developing WSN based localisation approaches with high position accuracies indoors. The study initially summarises the design and implementation of localisation systems and WSN architecture together with the characteristics of LQI and RSSI values. A fingerprint localisation approach is utilised for indoor positioning applications. A k-nearest neighbourhood algorithm (k-NN) is deployed, using Euclidean distances between the fingerprint database and the object fingerprints, to estimate unknown object positions. Weighted LQI and RSSI values are calculated and the k-NN algorithm with different weights is utilised to improve the position detection accuracy. Different weight functions are investigated with the fingerprint localisation technique. A novel weight function which produced the maximum position accuracy is determined and employed in calculations. The study covered designing and developing the centroid localisation (CL) and weighted centroid localisation (WCL) approaches by using LQI values. A reference node localisation approach is proposed. A star topology of reference nodes are to be utilized and a 3-NN algorithm is employed to determine the nearest reference nodes to the object location. The closest reference nodes are employed to each nearest reference nodes and the object locations are calculated by using the differences between the closest and nearest reference nodes. A neighbourhood weighted localisation approach is proposed between the nearest reference nodes in star topology. Weights between nearest reference nodes are calculated by using Euclidean and physical distances. The physical distances between the object and the nearest reference nodes are calculated and the trigonometric techniques are employed to derive the object coordinates. An environmentally adaptive centroid localisation approach is proposed.Weighted standard deviation (STD) techniques are employed adaptively to estimate the unknown object positions. WSNs with minimum RSSI mean values are considered as reference nodes across the sensing area. The object localisation is carried out in two phases with respect to these reference nodes. Calculated object coordinates are later translated into the universal coordinate system to determine the actual object coordinates. Virtual fingerprint localisation technique is introduced to determine the object locations by using virtual fingerprint database. A physical fingerprint database is organised in the form of virtual database by using LQI distribution functions. Virtual database elements are generated among the physical database elements with linear and exponential distribution functions between the fingerprint points. Localisation procedures are repeated with virtual database and localisation accuracies are improved compared to the basic fingerprint approach. In order to reduce the computation time and effort, segmentation of the sensing area is introduced. Static and dynamic segmentation techniques are deployed. Segments are defined by RSS ranges and the unknown object is localised in one of these segments. Fingerprint techniques are applied only in the relevant segment to find the object location. Finally, graphical user interfaces (GUI) are utilised with application program interfaces (API), in all calculations to visualise unknown object locations indoors

    Investigations on real time RSSI based outdoor target tracking using kalman filter in wireless sensor networks

    Get PDF
    Target tracking is essential for localization and many other applications in Wireless Sensor Networks (WSNs). Kalman filter is used to reduce measurement noise in target tracking. In this research TelosB motes are used to measure Received Signal Strength Indication (RSSI). RSSI measurement doesn’t require any external hardware compare to other distance estimation methods such as Time of Arrival (TOA), Time Difference of Arrival (TDoA) and Angle of Arrival (AoA). Distances between beacon and non-anchor nodes are estimated using the measured RSSI values. Position of the non-anchor node is estimated after finding the distance between beacon and non-anchor nodes. A new algorithm is proposed with Kalman filter for location estimation and target tracking in order to improve localization accuracy called as MoteTrack InOut system. This system is implemented in real time for indoor and outdoor tracking. Localization error reduction obtained in an outdoor environment is 75%

    Error Minimization in Indoor Wireless Sensor Network Localization Using Genetic Technique

    Get PDF
    Using the genetic technique, error minimisation in indoor wireless sensor network localisation improves indoor wireless sensor network localisation during this field research. Sensor localisation-based techniques; several wireless device network applications require awareness of each node's physical location. The discovery of the position complete utilising range measurements also as sensor localisation received signal strength in time of arrival and sensor localisation received signal strength in a time difference of arrival and angle of arrival. WSN in positioning algorithms like the angle of arrival between two neighbour nodes. A wireless sensor network using positioning techniques in the area is assumed as localisation. WSNs always operate in an unattended manner, various situations like dynamic situations in the wireless network. It's impossible to exchange sensor manner after deployment. Therefore, a fundamental objective is to optimise the sensor manner lifetime. There has been much specialising in mobile sensor networks, and we have even seen the event of small-profile sensing devices that are ready to control their movement. Although it's been shown that mobility alleviates several issues regarding sensor network coverage and connectivity, many challenges remain node localisation in wireless device network is extremely important for several applications and received signal strength indicator has the capability of sensing, actuating the environmental data the actual-time and favourable information are often collected using the sensor in WSN systems. WSN is often combined with the internet of things to permit the association and extensive access to sensor data, and genetic techniques search the position of the nodes in WSN using all anchor nodes. A proposed algorithm as a genetic technique supported received signal strength, angle of arrival, receptive wireless device and also localisation wireless network. In the study, this paper problem that accuracy is low and error more, but the proposed algorithm overcomes this problem and minimises the error rate. Finally, the simplest possible location satisfies each factor with a minimal error rate and absolute best solution using GA

    A Robust Frame of WSN Utilizing Localization Technique

    Get PDF
    Wireless sensor networks are becoming increasingly popular due to their low cost and wide applicability to support a large number of diverse application areas. Localization of sensor nodes is a fundamental requirement that makes the sensor data meaningful. A wireless sensor network (WSN) consist of spatially distributed autonomous devices using sensors to monitor cooperatively physical or environmental conditions such as temperature, sound, vibration, pressure, motion or pollutants at different locations. The development of wireless sensor networks was originally motivated by a military application like battlefield surveillance. Node localization is required to report the origin of events, assist group querying of sensors, routing and to answer questions on the network coverage. So one of the fundamental challenges in wireless sensor network is node localization. This paper discusses different approaches of node localization discovery in wireless sensor networks. The overview of the schemes proposed by different scholars for the improvement of localization in wireless sensor networks is also presented. Keywords: Localization, Particle Swarm Optimization, Received Signal Strength, Angle of Arrival

    A practical approach for outdoors distributed target localization in wireless sensor networks

    Get PDF
    Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensusbased implementation of the algorithm is proposed based on an augmented Lagrangian approach and primaldual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate

    Wireless Sensor Networks for Building Robotic Paths - A Survey of Problems and Restrictions

    Get PDF
    The conjugation of small nodes with sensing, communication and processing capabilities allows for the creation of wireless sensor networks (WSNs). These networks can be deployed to measure a very wide range of environmental phenomena and send data from remote locations back to users. They offer new and exciting possibilities for applications and research. This paper presents the background of WSNs by firstly exploring the different fields applications, with examples for each of these fields, then the challenges faced by these networks in areas such as energy-efficiency, node localization, node deployment, limited storage and routing. It aims at explaining each issue and giving solutions that have been proposed in the research literature. Finally, the paper proposes a practical scenario of deploying a WSN by autonomous robot path construction. The requirements for such a scenario and the open issues that can be tackled by it are exposed, namely the issues of associated with measuring RSSI, the degree of autonomy of the robot and connectivity restoration.The authors would like to acknowledge the company Inspiring Sci, Lda for the interest and valuable contribution to the successful development of this work.info:eu-repo/semantics/publishedVersio
    • …
    corecore