Abstract
Widely used positioning systems like GPS are not a valid solution in large networks with small size, low cost sensors, due both to their size and their cost. Thus, new solutions for localization awareness are emerging, commonly based on the existence of a few references spread into the network.
We propose a localization algorithm to reduce the number of transmitting nodes. The algorithm relies on self selecting nodes for location information disclosure. Each node makes a decision based on its proximity to the nodes in the area covered only by two of the references used for its own localization. We analyze different aspects of the location awareness propagation problem: communication overhead, redundant transmissions, network coverage.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Luo, H., Ye, F., Cheng, J., Lu, S., Zhang, L.: Ttdd: A two-tier data dissemination model for large-scale wireless sensor networks (2003)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Mobile Computing and Networking, pp. 56–67 (2000)
Powell, O., Leone, P., Rolim, J.: Energy optimal data propagation in wireless sensor networks. arXiv.org automated e-print archives, Report CS-0508052, journal version submitted for publication (2005)
Efthymiou, C., Nikoletseas, S., Rolim, J.: Energy balanced data propagation in wireless sensor networks (Invited paper in the Wireless Networks (WINET, Kluwer Academic Publishers) Journal, Special Issue on Best papers of the 4th Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN 2004) (2004)
Leone, P., Nikoletseas, S.E., Rolim, J.D.P.: An adaptive blind algorithm for energy balanced data propagation in wireless sensors networks. In: Prasanna, V.K., Iyengar, S.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol. 3560, pp. 35–48. Springer, Heidelberg (2005)
Savvides, A., Han, C.C., Strivastava, M.B.: Dynamic fine-grained localization in ad-hoc networks of sensors. In: Mobile Computing and Networking, pp. 166–179 (2001)
Savarese, C., Rabay, J., Langendoen, K.: Robust positioning algorithms for distributed ad-hoc wireless sensor networks usenix technical annual conference (2002)
Aspnes, J., Eren, T., Goldenberg, D.K., Morse, A.S., Whiteley, W., Yang, Y.R., Anderson, B.D.O., Belhumeur, P.N.: A theory of network localization. IEEE Transactions on Mobile Computing (to appear, 2006) (unpublished manuscript)
Bulusu, N., Heidemann, J., Estrin, D.: Gps-less low cost outdoor localization for very small devices (2000)
Niculescu, D., Nath, B.: Ad hoc positioning system (aps) using aoa (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leone, P., Moraru, L., Powell, O., Rolim, J. (2006). Localization Algorithm for Wireless Ad-Hoc Sensor Networks with Traffic Overhead Minimization by Emission Inhibition. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2006. Lecture Notes in Computer Science, vol 4240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963271_11
Download citation
DOI: https://doi.org/10.1007/11963271_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69085-6
Online ISBN: 978-3-540-69087-0
eBook Packages: Computer ScienceComputer Science (R0)