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.
In this paper, we propose a novel range-free localization algorithm tailored for mobile wireless sensor networks (MWSN)s. In contrast to the most existing range- free algorithms, the nodes mobility is taken into accounts when designing our algorithm. We show that nodes are able to estimate their positions using solely their locally-available information, thereby avoiding any unnecessary overhead and...
In this paper, we present the performance of an RSSI based localization scheme for wireless sensor networks (WSN) that is proposed to reduce the adverse effects of shadowing caused by obstacles in the field of deployment. The proposed scheme applies spatial correlations between a set of candidate solutions that are obtained from subsets of beacon signals that are used for localization. We analyze...
Point-based approach is a well-known localization approach in Wireless Sensor Networks (WSNs). However, by applying the point-based approach, the communication disk (communication range) of each sensor has to be passed through by the mobile anchor twice at least. To address this problem, this paper presents a Rapid Localization (RL) scheme which aims at reducing the time duration required for each...
This paper presents a multihop range-free localization algorithm to enhance the localization accuracy in anisotropic networks with a small number of anchors. We derive potential locations of a normal node and corresponding probabilities in terms of the average one-hop internodal distance, the average hop progress and the hop counts to anchors. A novel distance estimation based on the potential locations...
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...
In this paper we consider adapting links selection criteria to assist the localization of Mobile Terminals in heterogeneous and cooperative wireless networks. Integrating asynchronously the velocity and location estimates of neighboring terminals in a performance indicator based on a Cramer Rao Lower Bound, one can reliably anticipate on the instantaneous location estimation errors that would be committed...
Localizability and accuracy are two fundamental problems in many range-based localization schemes for sensor networks. This poster addresses the two problems theoretically by introducing two new concepts: the effective degree and the lower bound of geometric dilution of precision (GDOP). We prove that the network is not localizable unless the average effective degree is greater than or equal to the...
In this paper, we present experimental results of the deployment of a wireless sensor network for inventory and localization of mobile assets in an indoor office building. The system is based on the IEEE 802.15.4 standard at 2.4 GHz and the localization scheme is based on RSSI measurements between mobile tags and an infrastructure of reference nodes located in the ceiling of the building. We present...
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...
Self-localization of sensor nodes is one of the important technologies in wireless sensor networks. APIT is a range-free localization algorithm; it has the advantages of high localization accuracy and low communication overhead. However, the localization coverage of APIT is low, and when the proportion of anchor nodes is low, APIT is prone to OutToIn and InToOut error. To solve the above problems,...
Node localization is one of the important issues in wireless sensor networks. In order to lower the cost of a sensor network and improve localization accuracy and efficiency, we put forward a virtual cluster based mobile beacon aided localization algorithm (VCMBLA) in this paper. A multi-hop distance estimation method based on neighbor distribution (MDEND) is presented and a path planning strategy...
The position information is usually needed when wireless sensor networks are applied for surveillance within certain region. Thus the localization of nodes is critical for WSNs. However, the present localization schemes mostly focus on static sensor networks, and in mobile WSNs, these schemes will not work well. This paper proposes a range-free Monte Carlo localization algorithm TSBMCL, which is extended...
Considerable literature on wireless network localization has assumed that each wireless station has a spherical radio range. This assumption, however, is generally untenable because wireless signals are subject to physical reflection, diffraction, refraction, and scattering of electromagnetic waves. In consequence, radio signals become irregular, making position assessment complex and susceptible...
In many applications of wireless sensor networks, sensor nodes are required to move around to complete their job assignments, e.g., collecting data or exploring the environment. In those cases, the location of sensor nodes is an important information. In previous localization studies, it is required that certain anchor nodes be fixed in locations to provide location references. In this paper, we propose...
Quality-of-information (QoI) in sensor networks measures attributes such as accuracy, timeliness, completeness and usefulness of data ultimately delivered to users. It is a challenge to provide the required QoI in mobile sensor networks given the large scale and complexity of the networks with heterogeneous mobile and sensing devices. In this paper, we provide a comprehensive study on major QoI metrics...
Localization of constituent nodes is of fundamental importance in many wireless sensor networks (WSNs) related applications. Existing research has mainly investigated the problem of localization in static WSNs, where the localization is performed mainly at the time of the node deployment. In contrast, it is important to keep track of the current locations of the nodes by invoking the localization...
This paper presents Nest, a novel system using wirelessly connected smartphones to localize remote targets based on sound and image inputs. The system has four major components: image-based localization, acoustics-based localization, wireless ad-hoc networking, and middle-ware services for time synchronization and secure communication. Single-image, two-image, and TDOA-acoustics based methods have...
To meet the needs of node mobility of Internet of thing (IOT), a localization algorithm named Weighted Monte Carlo Localization based on Smallest Enclosing Circle is proposed, which is based on the classic Monte Carlo Localization algorithm, aiming to solve the localization problem of mobile nodes. The algorithm uses the hops of anchor nodes and generates the smallest enclosing circle of anchor nodes...
With the increasing proliferation of small and cheap GPS receivers, a new way of generating road maps could be witnessed over the last few years. Participatory mapping approaches like OpenStreetMap introduced a way to generate road maps collaboratively from scratch. Moreover, automatic mapping algorithms were proposed, which automatically infer road maps from a set of given GPS traces. Nevertheless,...
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.