In this paper1, we propose a simple method to introduce a-priori information in position estimation for mobile ad hoc and sensor networks, in order to improve the estimation accuracy. The a-priori information is derived from the movement of the mobile node with respect to the position of fixed anchor nodes, and it is exploited to perform Bayesian estimation procedure. Numerical simulation resul...

We address the problem of localising a mobile terrminal (“blind” node) in unknown position from a set of “anchor” nodes in known positions. The proposed method does not require any form of node synchronisation nor measurement (or control) of the transmission times, which is difficult or anyway costly to achieve in practice. It relies exclusively on reception timestamps collected by the anchor n...

Reactive routing protocols for mobile ad-hoc networks usually discover routes by disseminating control packets across the entire network; this technique is known as brute-force flooding. This paper presents NARD, which stands for neighbor-assisted route discovery protocol for mobile ad-hoc networks. In NARD, a source node floods a limited portion of the network searching not only for the destin...

This paper presents a novel range-free single chord localization algorithm with low energy consumption and high accuracy for wireless sensor networks. A mobile anchor node and a mobile reference node are employed to periodically broadcast beacon messages and reference messages, respectively. Each sensor node is equipped with a received signal strength indicator for comparing the signal strength...

The Hierarchical Mobile IPv6 (HMIPv6), which is drawn up by the IETF (Internet Engineering Task Force), utilizes the Mobile Anchor Point (MAP) to reduce the considerable number of binding update (BU) messages among the mobile node (MN), the correspondent node (CN), and the home agent (HA). According to the HMIPv6 mechanism, the MAP of higher layer can efficiently reduce the frequency of perform...

In wireless sensor networks (WSNs), node’s locations play a critical role in many applications. Having a GPS receiver on every sensor node is costly. In this paper, we propose an adaptive mobile anchor localization algorithm based on ant colony optimization , firstly, some virtual anchor nodes are distributed in the area, second, ant colony was used which has the maximum of transition probabili...

The traditional DV-Hop sensor location algorithm estimates the distance between unknown nodes and anchor nodes by hop distance instead of straight-line distance. In the actual location condition, unknown nodes and anchor nodes mostly connect to each other through broken line. When the deviation of the estimated value and the actual value of average distance per hop is large, the error of estima...

The Location-based service on Wireless Sensor Networks, mainly depend on the Receiver Signal Strength (RSS) to measure the distance between the sender and receiver. The location unaware sensor nodes send beacon periodically which captured by anchor sensor nodes. However, the estimated distances may incur large error, and will risk the localization precision. A secant location estimation algorit...

Mobile IPv6 enables mobile node to roam transparently in any network. It shows good performance for macro mobility but it is not proper for supporting micro mobility because of large latency. Accordingly, IETF (Internet Engineering Task Force) mobileip WG(Working Group) suggests Fast Handover Protocol and HMIPv6(Hierarchical Mobile IPv6) for micro mobility management. However, HMIPv6 has some p...

Malicious anchor nodes will constantly hinder genuine and appropriate localization. Discovering the malicious or vulnerable anchor node is an essential problem in wireless sensor networks (WSNs). In wireless sensor networks, anchor nodes are the nodes that know its current location. Neighboring nodes or non-anchor nodes calculate its location (or its location reference) with the help of anchor ...