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 location is one of the core technologies of Wireless Sensor Network. In many applications, the accuracy of the location is the precondition of the useful of data information the node collected. Under the premise of cost limits, improving the accuracy of wireless sensor node position has crucial significance. After analyzing reasons of the location weakness of Dv-Distance algorithm due to...
In this paper, we propose a novel range-free localization algorithm tailored for anisotropic wireless sensors networks (WSN)s. Using the proposed algorithm, each regular or positionunaware node estimates its distances only to reliable anchors or position-aware nodes. The latter are properly chosen following a new reliable anchor selection strategy that ensures an accurate distance estimation making...
The 4G wireless network is proposed to integrate various radio access technologies into a common network known as open wireless architecture (OWA), this has led to the idea of cooperative user location estimation, in this paper we have proposed a cooperative TDoA/RSS/TDoA user location estimation method which uses information from two different Radio Access Networks (RANs) as the long range (LR) data...
In wireless ad hoc and sensor networks, localization is a fundamental service to provide location information for those nodes without GPS units. In this paper, we use a simple yet effective proximity measure, called Regulated Neighborhood Distance (RND), to measure the closeness between two neighboring nodes based on their neighbors' numbers. Furthermore, we propose a RND-based localization algorithm,...
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,...
In this paper, the localization accuracy of range-only sensors is investigated. Being different from most previous studies, we consider a more general measurement model with both additive and multiplicative noise other than with only additive noise. The main contributions lie in twofold. First, a CRLB(Cramer-Rao Lower Bound)-based metric is proposed to evaluate the localization accuracy. In addition,...
Localization of wireless ad hoc and sensor networks has gained research attentions for several years. This paper proposes a hybrid localization scheme which exploits Received Signal Strength (RSS)-based ranging and Self Organizing Maps (SOM)-based range free localization methods to obtain the tradeoff between cost, power and location accuracy. By utilizing RSS-based distance estimation and connectivity...
In wireless networks, localization or positioning of a mobile station (MS) is one of active research interests. Accurate, low-cost and efficient positioning is a critical requirement for the deployment of wireless network in a wide variety of applications. In this paper, we propose a new approach for accurate positioning using the angle of arrival (AOA) measurements. We perform the positioning of...
Given the locations of a small number of reference anchor nodes and the distances between neighbour nodes, various localization algorithms for wireless networks have been proposed. In this paper, we carry out a comparative evaluation of three different cluster based localization algorithms. The three different algorithms are based on the use of extended Kalman filter (EKF), semi-definite programming...
Indoor localization is an important issue in wireless sensor network (WSN) studies. Sensed data may become meaningless, if the locations of sensors are not known. Traditional localization techniques do not meet the requirements of low-cost and energy-conservation while performing localization tasks. Recently, the received signal strength indicator (RSSI)-based range measurement technology is widely...
The bandwidth reservation is one of most adopted solutions to meet QoS requirements in 802.11 ad hoc networks. The efficiency of these solutions depends on the accuracy of their estimations of available bandwidth; otherwise, their application can be catastrophic on networks. Therefore, accurate bandwidth estimation is fundamental, where each networks characteristic must be taken into consideration,...
We present a distributed algorithm for node localization based on the Newton method. In this algorithm, each node updates its own location estimate using the pairwise distance measurements and the local information it receives from the neighboring nodes. Once the location estimate is updated, the sensor node broadcasts the updated estimate to all the neighboring nodes. The extensive simulation shows...
It is often very useful to know the positions of the sensor nodes in a wireless sensor network. The semidefinite programming (SDP) solution usually has a rank higher than the underlying physical space, which when projected onto the lower dimensional space generally results in high estimation error. In this paper, We describe a general subset localization based on semidefinite programming (SLSDP) approach...
In this paper we present a practical approach to relative positioning of heterogeneous mass market devices. We propose a user-centric solution exploiting measurements from on-the-fly fixed reference points detected during scanning procedures. The technique implemented on mobile devices is able to locate neighboring nodes, demonstrating to be a feasible and practical solution for sensing spatial social...
Range-free localization schemes are much promising in wireless sensor networks because they can estimate the location of a sensor node without power-consuming and expensive devices for measuring distance or angle information. Among range-free schemes, multi-hop schemes can localize sensor nodes with a few beacon nodes through the multi-hop connection between nodes. Since the localization accuracy...
In our previous work, a node self-localization algorithm based on virtual central node (VCN) for wireless sensor network (WSN) is proposed. This method is adapted to WSN that anchor nodes present a uniform distribution in three dimensional spaces. During the localization process, by deducing a 3D special node, which is called virtual central node, unknown nodes can compute their own positions automatically...
Many applications that use sensor data from a wireless sensor network (WSN) require corresponding node position information as well. Additionally, some routing protocols use position to determine viable routes. Several localization algorithms have been proposed which can be categorized as: range-based and range-free algorithms. In this paper, we propose a Modified Gram Schmidt DV-Hop algorithm (MGDV-Hop)...
Cognitive Wireless Ad-Hoc Networks use cooperation in order to sense the spectrum accurately. However, the space diversity provided by the cooperative sensing is only efficient when the sensing users are selected appropriately. This paper proposes a distributed probability-based mechanism that allows the Secondary Users to decide what channels should be sensed by each user in order to reduce the sensing...
Self-localization is one of the basic problems in wireless sensor networks. In this paper, we propose a new localization algorithm using received signal strength (RSS) with seven anchors in order to balance the complex technology for distance estimation and the accuracy of the localization. First, based entirely on comparison of received signal strength transmitted by mobile anchors, the static nodes...
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.