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.
Node localization is an essential component of many wireless networks. It can be used to improve routing and enhance security. Localization can be divided into range-free and range-based algorithms. Range-based algorithms use measurements to estimate the distance between nodes. Range-free algorithms are based on proximity sensing between nodes. Range-based algorithms are more accurate but also more...
A lot of research has been done in finding range-based methods such as computing RSSI, time of arrival, angle of arrival or time difference of arrival and range-free methods such as centroid computation, DV-hop and approximate position in triangle, for localization in wireless sensor networks. Range-based methods estimate location more precisely than range-free methods. However, range-free methods...
Sensor localization is a necessary and key functionality for the deployment of wireless sensor network (WSN) applications. This paper investigates on the range-free localization approaches for low hardware requirement. A modified DV-Hop localization algorithm is designed to reduce the localization error. The modified DV-Hop uses a novel average hop size estimate scheme, in which the local property...
Localization problems of the WSNs (wireless sensor networks)geostationary nodes are studied,and the localization algorithm (Fast and Rough Nodes Location Algorithm) based on the communication power mediation for geostationary nodes by receiving the localization information from anchor nodes is presented.The localization estimate of localized nodes is executed in lesser field for higher accuracy.The...
Aiming at the positioning problem of Ad-Hoc networks of sensors node location, a beacon selected localization algorithm (BSLA) is proposed in this paper. The proposed method considers sufficiently both the topology relationship among beacons and the topology relationship between beacon nodes and unknown nodes. We introduce the concept of collinearity and apply it into the localization of the multihop...
A novel range-free localization approach, smallest enclosing Circle based Localization (SECL), has been proposed. This approach uses the center of smallest enclosing circle of neighboring anchor nodes to estimate the position of target. Comparing to centroid, SECL considers the geometrical coverage of anchors rather than the mass center of them. Consequently, SECL is robust to imperfect topology,...
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.