Affiliation:
1. University of Patras, Greece
2. University of Geneva, Switzerland
Abstract
Geographic routing is becoming the protocol of choice for many sensor network applications. Some very efficient geographic routing algorithms exist, however they require a preliminary planarization of the communication graph. Planarization induces overhead which makes this approach not optimal when lightweight protocols are required. On the other hand, georouting algorithms which do not rely on planarization have fairly low success rates and either fail to route messages around all but the simplest obstacles or have a high topology control overhead (e.g. contour detection algorithms). This chapter describes the GRIC algorithm which was designed to overcome some of those limitations. The GRIC algorithm was proposed in (Powell & Nikoletseas, 2007a). It is the first lightweight and efficient on demand (i.e. all-to-all) geographic routing algorithm which does not require planarization, has almost 100% delivery rates (when no obstacles are added), and behaves well in the presence of large communication blocking obstacles.
Reference49 articles.
1. Ahmed, N., Kanhere, S. S., & Jha, S. (2005). The holes problem in wireless sensor networks: a survey. SIGMOBILE Mob. Comput. Commun. Rev.
2. Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). Wireless sensor networks: a survey. Computer Networks.
3. Antoniou, T., Chatzigiannakis, I., Mylonas, G., Nikoletseas, S., & Boukerche, A. (2004). A new energy efficient and fault-tolerant protocol for data propagation in smart dust networks using varying transmission range. In Annual Simulation Symposium (ANSS). ACM/IEEE.
4. Barriere, L., Fraigniaud, P., Narayanan, L., & Opatrny, J. (2003). Robust position-based routing in wireless ad hoc networks with irregular transmission ranges. Wireless Communications and Mobile Computing.
5. Beutel, J. (2005). Location management in wireless sensor networks. In Handbook of Sensor Networks: Compact Wireless and Wired Systems. CRC Press.