Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function.
Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.
References
[1]
Acharya, S. 2007. Distributed self-organisation in dense wireless ad hoc sensor networks. M.S. thesis, Indian Institute of Science, Chapter 4, Section 4.4.1.
Costa, J., Patwari, N., and Hero III, A. 2006. Distributed weighted-multidimensional scaling for node localization in sensor networks. ACM Trans. Sensor Netw. 2, 1, 39--64.
Crick, C. and Pfeffer, A. 2003. Loopy belief propagation as a basis for communication in sensor networks. In Uncertainty in Artificial Intelligence, Vol. 18.
De, S., Caruso, A., Chaira, T., and Chessa, S. 2006. Bounds on hop distance in greedy routing approach in wireless ad hoc networks. Int. J. Wirel. Mobile Comput. 1, 2, 131--140.
Ding, Y., Krislock, N., Qian, J., and Wolkowicz, H. 2008. Sensor network localization, Euclidian distance matrix completions, and graph realization. In Proceedings of the Workshop on Mobile Entity Localization and Tracking in GPS-Less Environments.
Dulman, S., Rossi, M., Havinga, P., and Zorzi, M. 2006. On the hop count statistics for randomly deployed wireless sensor networks. Int. J. Sensor Netw. 1, 1--2.
Gupta, P. and Kumar, P. R. 1998. Critical power for asymptotic connectivity in wireless networks. In Proceedings of the Conference on Stochastic Analysis, Control, Optimization and Applications.
He, T., Huang, C., Blum, B. M., Stankovic, J. A., and Abdelzaher, T. 2003. Range-Free localization schemes for large scale sensor networks. In Proceedings of the ACM Annual International Conference on Mobile Computing and Networking (MobiCom'03). 81--95.
Hu, L. and Evans, D. 2004. Localization for mobile sensor networks. In Proceedings of the ACM Annual International Conference on Mobile Computing and Networking (MobiCom'04). 45--57.
Ihler, A., Fisher III, J., Moses, R., and Willsky, A. 2005. Nonparametric belief propagation for self-localization of sensor networks. IEEE J. Select. Areas Comm. 23, 4, 809--819.
Khan, U., Kar, S., and Moura, J. 2009. Distributed sensor localization in random environments using minimal number of anchor nodes. IEEE Trans. Signal Process. 57, 5, 2000--2016.
Kuo, J.-C. and Liao, W. 2007. Hop count distance in flooding-based mobile ad hoc networks with high node density. IEEE Trans. Vehic. Technol. 56, 1357--1365.
Li, M. and Liu, Y. 2007. Rendered path: Range-Free localization in anisotropic sensor networks with holes. In Proceedings of the ACM Annual International Conference on Mobile Computing and Networking (MobiCom'07), ACM Press, New York.
Lim, H. and Hou, J. 2005. Localization for anisotropic sensor networks. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'05). Vol. 1.
Nagpal, R., Shrobe, H., and Bachrach, J. 2003. Organizing a global coordinate system from local information on an ad hoc sensor network. In Proceedings of the IEEE International Conference on Information Processing in Sensor Networks (IPSN'03).
Narayanaswamy, S., Kawadia, V., Sreenivas, R., and Kumar, P. R. 2002. Power control in ad hoc networks: Theory, architecture, algorithm and implementation of the compow protocol. In Proceedings of the European Conference on Wireless, Next-Generation Wireless Networks: Techniques, Protocols, Services and Applications.
Nath, S. and Kumar, A. 2008. Performance evaluation of distance-hop proportionality on geometric graph models of dense sensor networks. In Proceedings of the Performance Evaluation Methodologies and Tools Conference (ValueTools).
Ozgur, A., Leveque, O., and Tse, D. 2007. Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks. IEEE Trans. Inf. Theory 53, 10, 3549--3572.
Ta, X., Mao, G., and Anderson, B. D. O. 2007a. Evaluation of the probability of k-hop connection in homogeneous wireless sensor networks. In Proceedings of the IEEE Global Communications Conference (GlobeCom'07).
Vural, S. and Ekici, E. 2005. Analysis of hop distance relationship in spatially random sensor networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'05). ACM Press, New York.
Yang, S., Yi, J., and Cha, H. 2007. HCRL: A hop-count-ratio based localization in wireless sensor networks. In Proceedings of the Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON'07).
Yedidia, J., Freeman, W., and Weiss, Y. 2003. Understanding belief propagation and its generalizations. In Exploring Artificial Intelligence in the New Millenium. 239--246.
Yedidia, J., Freeman, W. T., and Weiss, Y. 2001. Generalized belief propagation. In Proceedings of the Conference on Neural Information Processing Systems (NIPS'01). MIT Press, 689--695.
Zorzi, M. and Rao, R. R. 2003. Geographic random forwarding (GeRaF) for ad hoc and sensor networks: Multihop performance. IEEE Trans. Mobile Comput. 2, 337--348.
Li WJelfs BKealy AWang XMoran B(2021)Cooperative Localization Using Distance Measurements for Mobile NodesSensors10.3390/s2104150721:4(1507)Online publication date: 22-Feb-2021
Villalpando-Hernandez RMunoz-Rodriguez DVargas-Rosales C(2021)Relational Positioning Method for 2D and 3D Ad Hoc Sensor Networks in Industry 4.0Applied Sciences10.3390/app1119890711:19(8907)Online publication date: 24-Sep-2021
Freschi VLattanzi E(2021)A Prim–Dijkstra Algorithm for Multihop Calibration of Networked Embedded SystemsIEEE Internet of Things Journal10.1109/JIOT.2021.30512708:14(11320-11328)Online publication date: 15-Jul-2021
ICCSA'10: Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part III
Due to the fact that most of the sensor network applications are based on the location information of sensor nodes, localization is an essential research area. Some localization schemes in the literature require sensor nodes to have additional devices ...
This paper proposes a novel node localization method in sparse underwater wireless sensor networks (UWSNs) where the locations of only a small number of anchor nodes are available. The proposed method estimates the Euclidean distances ...
An improved DV-HOP localization algorithm is proposed based on the traditional DV-HOP localization algorithm in the paper. There will be a big error that using the nearest anchor node's average hop distance instead of the average hop distance of all the ...
This paper investigates the frequently used approximation of the Euclidean distance between nodes as proportional to the hop distance between them. This approximation is quite often used in range-free localization protocols to avoid the cost of actually measuring the distance between the nodes. Studying the relationship between Euclidean distance (ED) and hop-count distance (HD) between nodes is motivated by range-free localization approaches that are based on hop count.
The authors consider the sensor network as "a large number of nodes in a region of Euclidean space" viewed as a random geometric graph. There are a number of anchor nodes that can determine their own location, for instance, using the global positioning system (GPS).
After introducing the problem and the assumptions, the authors obtain high probability bounds on ED for the nodes that are located h hops away from a given anchor. For this purpose, they consider four different cases, which are discussed in section 4.
In the first case, nodes are located randomly and uniformly in the area, and the radius of the geometric graph is chosen as
r ( n ) = c
√ ln ( n )/ n
where n is the number of nodes in the unit area and c is a constant. Given these values, the network remains asymptotically connected. The radius of the geometric graph refers to the maximum distance between two nodes that can still be considered neighbors and therefore connected in the graph. This kind of radius scaling is called the critical radius, and is based on the lemma proved in the paper. It guarantees the connectivity of nodes to all anchors with a high probability. In this case, the authors prove that ED is bounded as (1- e ) ( h a -1) r ( n ) < ED < h a r ( n ), in which h a is the hop distance from anchor a , and e is given such that e >0. The probability of the bounds is also calculated as a function of e . The lesson learned from this is that, in a dense network (where n is very large), the bounds of node distances to anchors is met because their probability converges to 1. Also, one can see that the smaller the value is for e , the slower the rate will be for convergence of the probability. Based on this result, the precision of localization assuming these ED bounds will increase with n , as the probability converges more rapidly for high n values.
In the second case, the radius of a geometric graph is fixed to r . As in sensor networks, it should be the radio range of the nodes, which is constant and does not decrease with n as in r ( n ). Therefore, we have (1- e ) ( h a -1) r < ED < h a r . Here, the calculated bound probability convergence shows an exponential convergence and therefore, unlike the previous case, the precision of localization remains fixed at r and does not increase with n .
In the third case, instead of the previously used uniform deployment, the nodes are placed in the area using a randomized lattice deployment, in which the unit area is divided into n cells and exactly one node is located in each cell. The authors have shown that, with this setting for both geometric graphs of r ( n ) and fixed r , the same results obtained for uniform node placement in the previous sections are valid.
Finally, in the fourth case, the number of nodes is considered to have a Poisson distribution with a mean of n . Here, because the union bound is not used, the expression for the probability is exact, but it converges with ab = n , following the exponential power law.
After the discussion of cases, the authors verify the validation of the bounds obtained in the previous section using simulations. The simulations show that the obtained bounds get tighter with increases in the number of nodes, n , in the unit of area. This is because of the definition of r ( n ), which decreases with n and squeezes the range for ED. The simulations also show how the lower bound on the probability of the bounds being respected increases with n .
In section 5, the paper deals with obtaining the probability density function (pdf) of the pairwise ED given HD, that is, determining the probability distribution of ED when HD is given. After reviewing the state of the art, the authors obtain the probability distribution of the ED of a node that is located a given number of hops away from an anchor using a greedy algorithm in which the central limit theorem is used to estimate the pdf. Naturally, the estimation is more valid for large n values, because the central limit theorem is exploited. With this value, they can determine the distribution of the location of the node located HD hops away from the considered anchor.
After demonstrating the relationship between ED and HD, the results are used in section 6 to develop two hop-count-derived localization algorithms, hop-count-derived ED bounds-based localization (HCBL) and hop-count-derived ED distribution-based localization (HCDL). These algorithms use the hop count information of the nodes to estimate their locations. HCBL localizes a node by finding the intersection of the areas given by the upper and lower bounds of its ED from L anchors when HDs are known. HCDL measures the hop distance of a node to L anchors, and uses the distribution function of the location of such a node based on the HDs to estimate its location via the minimum mean square error method. The authors then show with simulations that these localization approaches outperform some well-known existing approaches in the literature.
Section 7 aims to improve the accuracy of the hop-count-based localization algorithms using belief propagation (BP). In this context, belief propagation means using the hop count information of neighboring nodes to improve the accuracy of the estimation of a node's location. On average, simulation results show a noticeable improvement in localization accuracy when it is combined with BP.
The authors' approach to the relationship between hop-count distance and Euclidean distance in wireless networks is novel. In addition, the two localization approaches that are based on this relationship perform better than existing approaches, according to the presented results.
Online Computing Reviews Service
Access critical reviews of Computing literature here
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Li WJelfs BKealy AWang XMoran B(2021)Cooperative Localization Using Distance Measurements for Mobile NodesSensors10.3390/s2104150721:4(1507)Online publication date: 22-Feb-2021
Villalpando-Hernandez RMunoz-Rodriguez DVargas-Rosales C(2021)Relational Positioning Method for 2D and 3D Ad Hoc Sensor Networks in Industry 4.0Applied Sciences10.3390/app1119890711:19(8907)Online publication date: 24-Sep-2021
Freschi VLattanzi E(2021)A Prim–Dijkstra Algorithm for Multihop Calibration of Networked Embedded SystemsIEEE Internet of Things Journal10.1109/JIOT.2021.30512708:14(11320-11328)Online publication date: 15-Jul-2021
Padmavathy NSri Vani A(2019)Effect of Network Parameters on Hop Count Estimation of Mobile Ad Hoc Network2019 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT)10.1109/ICECCT.2019.8869483(1-8)Online publication date: Feb-2019
Beyme SLeung C(2018)A stochastic process model of the hop count distribution in wireless sensor networksAd Hoc Networks10.1016/j.adhoc.2014.01.00617(60-70)Online publication date: 27-Dec-2018
Freschi VLattanzi EBogliolo A(2017)Fast Distributed Consensus Through Path Averaging on Random WalksWireless Personal Communications: An International Journal10.1007/s11277-017-4451-596:4(5865-5879)Online publication date: 1-Oct-2017
Freschi VLattanzi EBogliolo A(2015)Randomized Gossip With Power of Two Choices for Energy Aware Distributed AveragingIEEE Communications Letters10.1109/LCOMM.2015.244698719:8(1410-1413)Online publication date: Aug-2015