Related papers: VRAC: Virtual Raw Anchor Coordinates Routing in Se…
This paper addresses the problem of bearing-based network localization, which aims to localize all the nodes in a static network given the locations of a subset of nodes termed anchors and inter-node bearings measured in a common reference…
Packet routing in nanonetworks requires novel approaches, which can cope with the extreme limitations posed by the nano-scale. Highly lossy wireless channels, extremely limited hardware capabilities and non-unique node identifiers are among…
This paper considers node localization in static sensor networks using range-only measurements. Similar to state- of-the-art algorithms, such as ECHO and DILOC, we rely on barycentric coordinates of the nodes to transform the non-convex…
We analyze the problem of localization algorithms for underwater sensor networks. We first characterize the underwater channel for radio communications and adjust a linear model with measurements of real transmissions. We propose an…
This paper investigates node deployment strategies for robust multi-node cooperative localization in integrated sensing and communication (ISAC) networks.We first analyze how steering vector correlation across different positions affects…
Range-based localization is ubiquitous: global navigation satellite systems (GNSS) power mobile phone-based navigation, and autonomous mobile robots can use range measurements from a variety of modalities including sonar, radar, and even…
Large-scale operations in quantum networks require efficient sorting of desired paths between nodes. In this article, we consider entanglement routing, which involves establishing an entanglement link between specific nodes in a large…
Geographic routing provides relatively good performance at a much lower overhead than conventional routing protocols such as AODV. However, the performance of these protocols is impacted by physical voids, and localization errors.…
When nodes in a mobile network use relative noisy measurements with respect to their neighbors to estimate their positions, the overall connectivity and geometry of the measurement network has a critical influence on the achievable…
Geographic routing consists in using the position information of nodes to assist in the routing process, and has been a widely studied subject in sensor networks. One of the outstanding challenges facing geographic routing has been its…
Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets…
In the recent years, there has been a huge advancement in wireless sensor computing technology. Today, wireless sensor network (WSN) has become a key technology for different types of smart environment. Nodes localization in WSN has arisen…
The use of wireless signals for purposes of localization enables a host of applications relating to the determination and verification of the positions of network participants, ranging from radar to satellite navigation. Consequently, it…
A network is called localizable if the positions of all the nodes of the network can be computed uniquely. If a network is localizable and embedded in plane with generic configuration, the positions of the nodes may be computed uniquely in…
We investigate a wireless network localization scenario in which the need for synchronized nodes is avoided. It consists of a set of fixed anchor nodes transmitting according to a given sequence and a self-localizing receiver node. The…
We propose a localization algorithm for wireless sensor networks, which is simple in design, does not involve significant overhead and yet provides acceptable position estimates of sensor nodes. The algorithm uses settled nodes as beacon…
Localization is expected to play a significant role in future wireless networks as positioning and situational awareness, navigation and tracking, are integral parts of 6G usage scenarios. Nevertheless, in many cases localization requires…
This paper investigates the localization problem of a network in 2-D and 3-D spaces given the positions of anchor nodes in a global frame and inter-node relative measurements in local coordinate frames. It is assumed that the local frames…
We tackle the challenge of reliably determining the geo-location of nodes in decentralized networks, considering adversarial settings and without depending on any trusted landmarks. In particular, we consider active adversaries that control…
In this paper we describe three methods for localizing a wireless sensor network node, using anchor nodes in its neighbourhood, when there is an error in distance estimation present. We use the intersection points of the circles formed with…