Hop count based distance estimation in mobile ad hoc networks – Challenges and consequences

Merkel, Sabrina; Mostaghim, Sanaz; Schmeck, Hartmut

doi:10.1016/j.adhoc.2013.08.013

Cited by 18 publications

(10 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…4,5,[8][9][10][11][12][13][14][15][16][17] Algorithms for vehicular networks have also been suggested. 18 The use of methods of either category depends on the application scenario and the network's nodes hardware capabilities. In sensor networks, the simplicity of the nodes is usually demanded and the range-free approach seems more appropriate, since the use of additional hardware is not required.…”

Section: Range Freementioning

confidence: 99%

“…Most recent research in the range-free area focuses on improving the accuracy of estimating the distance traveled per hop. The proposed approaches can be categorized as follows: (a) simply using the node range as a rough estimate, 19 (b) finding an estimate for the expected error in localization and using that information to improve performance, 4,9,17,18 (c) heuristically finding an estimate for the distance, 14 (d) using support vector machines, 13 and (e) proposing complex analytical solutions that bound the error of the estimation 8 or any combination of the above methods. A drawback of most of the popular range-free methods (eg, DV-Hop 10,13,14,16,17 ) is the requirement for special nodes, called anchors.…”

Section: Range Freementioning

confidence: 99%

See 1 more Smart Citation

Anchor‐free distance estimation: A new approach to distance estimation for multihop ad hoc wireless networks

Mavridopoulos

Nicopolitidis

Papadimitriou

2018

Int J Communication

View full text Add to dashboard Cite

In ad hoc wireless networks, devices that normally cannot directly communicate route their messages through intermediate nodes. The number of those nodes is called hop count, a useful metric in estimating the distance between 2 nodes. Current methods usually depend on special nodes, called anchors, that need accurate localization information, in order to calculate an estimate for the average distance traversed per hop. The drawback of this approach is that anchor nodes increase the overall cost and complexity of the system. To address this problem, this letter proposes a novel, anchor node-free algorithm that can achieve a useful estimate for actual distance between 2 nodes, by analytically finding an estimate for the average maximum distance traveled per hop and multiplying with the hop count. The only requirement is the a priori knowledge of the networks' node density and the node range. The performance of our method is compared with a recent anchor node-based method and is shown to yield similar location estimation accuracy, despite the fact that it does not use anchor nodes.

show abstract

Section: Range Freementioning

confidence: 99%

Section: Range Freementioning

confidence: 99%

Anchor‐free distance estimation: A new approach to distance estimation for multihop ad hoc wireless networks

Mavridopoulos

Nicopolitidis

Papadimitriou

2018

Int J Communication

View full text Add to dashboard Cite

show abstract

“…La literatura hace referencia a DV-Hop como el algoritmo estándar en la categoría de algoritmos de posicionamiento libres de distancias. El algoritmo DV-Hop emplea el conteo de saltos [22,23,16] como técnica de medición de distancia entre nodos y el método de trilateración [23,16,37] como técnica para estimar la posición de sus nodos. El método tradicional de trilateración es un método empleado para determinar la posición de un punto o nodo 1 .…”

Section: Multilateración Probabilística: Un Nuevo Método De Estimacióunclassified

Integrated Routing and Positioning in Mobile Ad Hoc Networks

Pineda-Briseño

Menchaca-Mendez

Guzmán

2016

CyS

View full text Add to dashboard Cite

“…In Euclidean distance-based schemes, nodes have to be equipped with a positioning system like a GPS in order to obtain the Euclidean distance between two nodes [115,69]. Alternatively, as the number of hops is the common metric used by routing protocols to measure the distance between the source node and the destination node [72], this can also be used by the probabilistic broadcast [80] Degree schemes to determine the distance between two nodes. In hints-based schemes, nodes estimate the relative distance between two nodes based on the history of connectivity of the two nodes [17].…”

Section: Adaptive Non-counter-based Schemesmentioning

confidence: 99%

A survey on probabilistic broadcast schemes for wireless ad hoc networks

et al. 2015

View full text Add to dashboard Cite

a b s t r a c tBroadcast or flooding is a dissemination technique of paramount importance in wireless ad hoc networks. The broadcast scheme is widely used within routing protocols by a wide range of wireless ad hoc networks such as mobile ad hoc networks, vehicular ad hoc networks, and wireless sensor networks, and used to spread emergency messages in critical scenarios after a disaster scenario and/or an accidents. As the type broadcast scheme used plays an important role in the performance of the network, it has to be selected carefully. Though several types of broadcast schemes have been proposed, probabilistic broadcast schemes have been demonstrated to be suitable schemes for wireless ad hoc networks due to a range of benefits offered by them such as low overhead, balanced energy consumption, and robustness against failures and mobility of nodes. In the last decade, many probabilistic broadcast schemes have been proposed by researchers. In addition to reviewing the main features of the probabilistic schemes found in the literature, we also present a classification of the probabilistic schemes, an exhaustive review of the evaluation methodology including their performance metrics, types of network simulators, their comparisons, and present some examples of real implementations, in this paper.

show abstract

Hop count based distance estimation in mobile ad hoc networks – Challenges and consequences

Cited by 18 publications

References 32 publications

Anchor‐free distance estimation: A new approach to distance estimation for multihop ad hoc wireless networks

Anchor‐free distance estimation: A new approach to distance estimation for multihop ad hoc wireless networks

Integrated Routing and Positioning in Mobile Ad Hoc Networks

A survey on probabilistic broadcast schemes for wireless ad hoc networks

Contact Info

Product

Resources

About