The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Wireless Sensor Network (WSN) has recently emerged as a new widely used technology. However, the deployment of such networks has reported high rates of failures. Due to resource constraints of sensor nodes, the design of efficient failure detection techniques has become a very challenging issue. Already proposed WSN fault detection protocols have reported either a high number of false suspicions,...
In order to solve the problem of poor localization accuracy of DV-Hop algorithm, an improved DV-Hop algorithm is proposed in this paper. The proposed algorithm is based on RSSI technology to modify the hop count between nodes. The concept of basic signal strength of node which will be used to modify hop count is proposed in this paper. The hop coefficient and hopsize coefficient are set up to modify...
Localization is a significant consideration in a Wireless Sensor Network (WSN), as it is essential to correlate sensor information with the geographic location it originates from. The DV-Hop algorithm, being a range-free, distributed algorithm, is an attractive option in this regard, due to its simplicity. In this paper, we present two algorithms to improve the localization accuracy of the DV-Hop...
Compressive sensing (CS) based techniques have been demonstrated to be suitable for UWB based applications to reduce the sampling rate required at the receiver. However, current CS based UWB positioning techniques require high-rate mixing operations to generate the PN sequence to achieve random mixing. This paper proposed a modified CS based implementation that employs relatively low-rate random pre-mixing...
Wireless Sensor Network as an important technology of Internet of things' development, is more and more widely used in various research fields. This paper mainly researches the part of localization application based on wireless sensor network, focuses on DV-Hop localization algorithm, and gives its algorithm simulation and analysis of the simulation results. Also this paper improves the algorithm...
Application areas of Wireless Sensor Networks (WSNs) are increasing from time to time. Failure detection and recovery mechanism is crucial for WSNs as sensor nodes are resource-constrained and deployed in distributed hostile environments that necessitate such mechanism. To avoid unnecessary constrained resource consumption and ensure the quality of services, it is important to use efficient failure...
To solve the problem that the localization accuracy of centroid algorithm depends heavily on the anchor density, an improved centroid algorithm based on possible position set is proposed. Firstly, the unknown node uses centroid algorithm to obtain a square region and then searches its possible position set in the square region. Finally, the centroid of all possible positions is the estimated coordinate...
Node localization is one of the most challenging issues in large scale sensor networks. Few bearing-only based methods are used to locate nodes in a large scale system. Existing bearing-only based Semidefinite Programming (BOSDP) method consumes a lot of energy and it may not yield good results if the beacons are placed randomly. Moreover, the BOSDP approach cannot estimate the locations and orientations...
Wireless sensor network (WSN) is a typical application of Ad hoc network in autonomous system (AS). It has attracted considerable attention in the past. Recent years have witnessed a growing interest in the study of localization algorithm for WSN. Self-localization of nodes is one of the key technologies for application of WSN. The localization accuracy is a significant criterion to evaluate the practical...
In this paper, we propose a novel range-free localization algorithm tailored for heterogeneous wireless sensor networks (WSNs), where nodes have different transmission capabilities. Two different approaches are developed to accurately derive the expected hop progress (EHP). It is shown that the obtained EHP depends solely on the information locally available at each node and, hence, can be computed...
Localization using sensor network has attracted much attention for its comparable low-cost and potential use with monitoring and targeting purposes in real and hostile application scenarios. Currently, there are many available approaches to locate persons/things based of GPS and RFID technologies. However, in some application scenario, e.g., disaster rescue application, such localization devices may...
This paper presents an analytical method for one to compute the centroid of the overlapping area of two intersecting circles with arbitrary orientation. We also extend the solution to estimate the centroid of the overlapping area of three intersecting circles. Furthermore, based on the analytical solution of centroid computing, we propose a cell-based localization technique, namely Centroid Based...
In this paper, we propose a novel range-free localization algorithm able to reduce errors due to mapping the hops into distance units. Using the proposed algorithm, the mean hop size h̄s is locally derived at each regular or position-unaware node, thereby avoiding its broadcast by anchors (i.e., a few nodes aware of their exact position) as usually required in current state-of-the-art solutions and,...
The application of wireless sensor networks (WSNs) has been greatly improved by the advance of micro-electromechanical systems (MEMS) and radio frequency (RF) technology. Compared with the traditional networks, WSNs are data-centric, self-configuring and self healing. In this paper, a novel probabilistic fuzzy logic based localisation algorithm is proposed which can be effectively used in three-dimensional...
Self-localization using unsynchronized low-complexity anchors has a number of attractive features. Traditional self-localization techniques are not suitable to this scenario or have their applicability limitations. In this paper, a two-step hybrid self-localization technique using unsynchronized low-complexity anchors is proposed, which can achieve two-dimensional (2-D) instantaneous localization...
The inherent characteristics of Wireless Sensor Network (WSN) make node localization become a major challenge. A high-precision weighted Bounding Box (HPWB) algorithm is proposed to improve the localization accuracy of original Bounding Box algorithm. In HPWB algorithm, unknown nodes are divided into three categories according to the number of neighbor anchors. As for nodes in category one, a weighted...
Localization is one of the fundamental issues in wireless sensor networks. Many approaches including range-based and range-free categories have been proposed to determine sensor node locations. The range-based algorithms often achieve higher accuracy, but they are easier to be interfered and an additional hardware is required. In this paper, we present a fast and simple localization scheme for wireless...
Range-free localization schemes could be a good approach to localize sensor nodes from the viewpoint of cost and energy consumption, because range-free schemes require no hardware for measuring distance or angle information. The use of a mobile beacon can improve the localization accuracy and reduce communication overhead between sensor nodes because of the mobility of a mobile beacon. A 3D range-free...
The area-based localization algorithms use only the location information of some reference nodes, called anchors, to give the residence area of the remaining nodes. The current algorithms use triangle, ring or circle as a geometric shape to determine the sensors' residence area. Existing works suffer from two major problems: (1) in some cases, they might issue wrong decisions about nodes' presence...
According to the common phenomenon that accuracy of range-based location algorithm for WSN could not satisfy the requirement of location accuracy, PSO algorithm is introduced into localization for WSN. Meantime, to solve the premature convergence problem of PSO, improved algorithms with hybrid and mutation operators are proposed, leading to obtain a high level of particle population diversity, decrease...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.