Abstract
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing protocols are preferred because sensor networks have limited battery life. Location aware routing protocols are good candidates for sensor network applications, nevertheless they need either an external location service like GPS or Galileo (which are bulky, energy consuming devices) or internal location services providing non-unique virtual coordinates leading to low delivery rates. In this paper we introduce Position Trees a collision free, distributed labeling algorithm based on hop counting, which embed a spanning tree of the underlying network . The Routing with Position Trees (RTP) is a guaranteed delivery, non-flooding, efficient implicit routing protocol based on Position Trees. We study experimentally the statistical properties of memory requirements and the routing efficiency of the RPT.
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
Ben-Asher, Y., Feldman, M., Feldman, S.: Ad-hoc routing using virtual coordinates based on rooted trees. In: Sensor Networks, Ubiquitous, and Trustworthy Computing, 2006, pp. 6–13. IEEE Computer Society Press, Los Alamitos (2006)
Benbadis, F., Puig, J., de Amorim, M.D., Chaudet, C., Friedman, T., Simplot-Ryl, D.: JUMPS: Enhanced hop-count positioning in sensor networks using multiple coordinates. Elsevier, Amsterdam (2007)
Blazevic, L., Giordano, S., Le Boudec, J.: Anchored path discovery in terminode routing. In: Networking, Pisa, Italy (2002)
Boone, P., Chavez, E., Gleitzky, L., Kranakis, E., Opartny, J., Salazar, G., Urrutia, J.: Morelia test: Improving the efficiency of the gabriel test and face routing in ad-hoc networks. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 23–24. Springer, Heidelberg (2004)
Capkun, S., Hamdi, M., Hubaux, J.: GPS-free positioning in mobile ad-hoc networks. In: HICSS (2001)
Caruso, A., Chessa, S., De, S., Urpi, A.: GPS free coordinate assignment and routing in wireless sensor networks. INFOCOM 1, 150–160 (2005)
Clark, B.N., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Math. 86(1-3), 165–177 (1990)
Clausen, T., Jacquet, P., Laouiti, A., Muhlethaler, P., Qayyum, A., Viennot, L.: Optimized Link State Routing Protocol (OLSR). RFC 3626 (October 2003)
Ermel, E., Fladenmuller, A., Pujolle, G., Cotton, A.: On selecting nodes to improve estimated positions. In: MWCM (2004)
Fang, Q., Gao, J., Guibas, L., Silva, V., Li, Z.: Glider: gradient landmark-based distributed routing for sensor networks. INFOCOM 1, 339–350 (2005)
Fonseca, R., Ratnasamy, S., Culler, D., Shenker, S., Stoica, I.: Beacon vector routing: Scalable point-to-point in wireless sensornets. Technical Report Tech. Rep. IRB-TR-04-012, Intel Research Berkeley (2004)
Frey, H., Stojmenovic, I.: On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In: MOBICOM (2006)
Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology 18, 259–278 (1969)
Hill, J., Culler, D.: Mica: a wireless platform for deeply embedded networks. IEEE Micro 22(6), 12–24 (2002)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: MOBICOM (2000)
Johnson, D., Maltz, D., Broch, J.: Ad Hoc Networking, DSR The dynamic source routing protocol for multihop wireless networks, pp. 139–172 (2001)
Kuruvila, J., Nayak, A., Stojmenovic, I.: Progress and location based localized power aware routing for ah hoc sensor wireless networks. IJDSN 2, 147–159 (2006)
Leong, B., Liskov, B., Morris, R.: Gdstr: Geographic routing without planarization. In: NSDI 2006. Proceedings of the 3rd Symposium on Network Systems Design and Implementation, pp. 25–25 (2006)
Li, J., Gewali, L., Selvaraj, H., Muthukumar, V.: Hybrid greedy/face routing for ad-hoc sensor network. DSD 0, 574–578 (2004)
Madden, S., Franklin, M., Hellerstein, J., Hong, W.: TAG: a tiny aggregation service for ad-hoc sensor networks. SIGOPS Operating Systems 36, 131–146 (2002)
Mitton, N., Fleury, E.: Distributed node location in clustered multi-hop wireless networks. In: Cho, K., Jacquet, P. (eds.) AINTEC 2005. LNCS, vol. 3837, Springer, Heidelberg (2005)
Newsome, J., Song, D.: Gem: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In: Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 76–88 (2003)
Niculescu, D., Nath, B.: Ad hoc positioning system. In: GLOBECOM (2001)
Niculescu, D., Nath, B.: Ad hoc positioning system (APS) using AOA. In: INFOCOM (2003)
Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-demand Distance Vector Routing. RFC 3561 (July 2003)
Priyantha, N., Miu, A., Balakrishnan, H., Teller, S.: The cricket compass for context-aware mobile applications. In: MOBICOM, pp. 1–14 (2001)
Cao, T.A.Q.: A scalable logical coordinates framework for routing in wireless sensor networks. In: RTSS, pp. 349–358 (2004)
Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The computer journal 28(1), 427–442 (1985)
Takagi, H., Kleinrock, L.: Optimal transmission ranges for randomly distributed packet radio terminals. IEEE transaction on communications com-22(3) (1984)
Tejeda, H., Chávez, E., Sánchez, J., Ruiz, P.: Energy-efficient face routing on the virtual spanner. In: Kunz, T., Ravi, S.S. (eds.) ADHOC-NOW 2006. LNCS, vol. 4104, pp. 101–113. Springer, Heidelberg (2006)
Tejeda, H., Chávez, E., Sánchez, J., Ruiz, P.: A virtual spanner for efficient face routing in multihop wireless networks. In: Cuenca, P., Orozco-Barbosa, L. (eds.) PWC 2006. LNCS, vol. 4217, pp. 459–470. Springer, Heidelberg (2006)
Toussaint, G.: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12(4), 261–268 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chávez, E., Mitton, N., Tejeda, H. (2007). Routing in Wireless Networks with Position Trees. In: Kranakis, E., Opatrny, J. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2007. Lecture Notes in Computer Science, vol 4686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74823-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-74823-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74822-9
Online ISBN: 978-3-540-74823-6
eBook Packages: Computer ScienceComputer Science (R0)