This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
October-December 2003 (vol. 2 no. 4)
pp. 337-348

Abstract—In this paper, we propose a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We focus on the multihop performance of such a solution, in terms of the average number of hops to reach a destination as a function of the distance and of the average number of available neighbors. An idealized scheme (in which the best relay node is always chosen) is discussed and its performance is evaluated by means of both simulation and analytical techniques. A practical scheme to select one of the best relays is shown to achieve performance very close to that of the ideal case. Some discussion about design issues for practical implementation is also given.

[1] M. Zorzi and R.R. Rao, Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance IEEE Trans. Mobile Computing, vol. 2, no. 4, Oct.-Dec. 2003.
[2] B. Chen, K. Jamieson, H. Balakrishnan, and R. Morris, Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks Proc. Seventh Ann. Int'l Conf. Mobile Computing and Networking, July 2001.
[3] C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Srivastava, Optimizing Sensor Networks in the Energy-Latency-Density Design Space IEEE Trans. Mobile Computing, vol. 1, no. 1, pp. 70-80, Jan.-Mar. 2002.
[4] Y. Xu, J. Heidemann, and D. Estrin, Geography-Informed Energy Conservation for Ad Hoc Routing Proc. Seventh Ann. Int'l Conf. Mobile Computing and Networking, July 2001.
[5] C. Bettstetter, On the Minimum Node Degree and Connectivity of a Wireless Multihop Network Proc. Third ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 80-91, 2002.
[6] P. Santi, D.M. Blough, and F. Vainstein, A Probabilistic Analysis for the Range Assignment Problem in Ad Hoc Networks Proc. 2001 ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 212-220, 2001.
[7] A. Salhieh, J. Weinmann, M. Kochha, and L. Schwiebert, Power Efficient Topologies for Wireless Sensor Networks Proc. IEEE Int'l Conf. Parallel Processing, pp. 156-163, 2001.
[8] R. Min and A. Chandrakasan, Energy-Efficient Communication for Ad-Hoc Wireless Sensor Networks Proc. Conf. Record 35th Asilomar Conf. Signals, Systems, and Computers, vol. 1, pp. 139-143, 2001.
[9] X.-Y. Li and P.-J. Wan, Constructing Minimum Energy Mobile Wireless Networks ACM SIGMOBILE Mobile Computing and Comm. Rev., vol. 5, no. 4, pp. 55-67, 2001.
[10] L.J. Dowell and M.L. Bruno, Connectivity of Random Graphs and Mobile Networks: Validation of Monte Carlo Simulation Results Proc. 2001 ACM Symp. Applied Computing, pp. 77-81, 2001.
[11] E. Shih et al., Physical Layer Driven Protocol and Algorithm Design for Energy-Efficient Wireless Sensor Networks Proc. Seventh Ann. Int'l Conf. Mobile Computing and Networking, July 2001.
[12] A. Spyropoulos and C. Raghavendra, A Token-Based Greedy Chain Scheduling Algorithm (T-GCSA) for Situation Aware Wireless LANs IEEE Aerospace Conf. Proc., pp. 3-1229-3-1237, 2002.
[13] K. Sohrabi, J. Gao, V. Ailawadhi, and G. Pottie, “Protocols for Self-Organization of a Wireless Sensor Network,” IEEE Personal Comm. Magazine, vol. 7, no. 5, pp. 16-27, Oct. 2000.
[14] C. Guo, L. Zhong, and J. Rabaey, “Low-Power Distributed MAC for Ad Hoc Sensor Radio Networks,” Proc. Internet Performance Symp. (Globecom '01), Nov. 2001.
[15] W. Ye, J. Heidemann, and D. Estrin, “An Energy-Efficient MAC Protocol for Wireless Sensor Networks,” IEEE Infocom '02, June 2002.
[16] A. Woo and D. Culler, A Transmission Control Scheme for Media Access in Sensor Networks Proc. Seventh Ann. Int'l Conf. Mobile Computing and Networking, July 2001.
[17] J. Kulik, W. Heinzelman, and H. Balakrishnan, Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks Wireless Networks, vol. 8, nos. 2/3, pp. 169-185, 2002.
[18] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energy-Efficient Communication Protocols for Wireless Microsensor Networks Proc. Hawaiian Int'l Conf. Systems Science, Jan. 2000.
[19] S. Lindsey, C. Raghavendra, and K.M. Sivalingam, Data Gathering Algorithms in Sensor Networks Using Energy Metrics IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 9, pp. 924-935, Sept. 2002.
[20] R.C. Shah and J.M. Rabaey, Energy Aware Routing for Low Energy Ad Hoc Sensor Networks Proc. IEEE Wireless Comm. and Networking Conf. (WCNC 2002), pp. 350-355, 2002.
[21] A. Manjeshwar and D.P. Agrawal, TEEN: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks Proc. Int'l Parallel and Distributed Processing Symp., (IPDPS 2001), Apr. 2001.
[22] A. Manjeshwar and D.P. Agrawal, APTEEN: A Hybrid Protocol for Efficient Routing and Comprehensive Information Retrieval in Wireless Sensor Networks Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2002), Apr. 2002.
[23] G. Kunito, K. Yamazaki, H. Morikawa, and T. Aoyama, An Ad-Hoc Routing Control Method in Sensor Networks Proc. 26th Ann. Conf. IEEE Industrial Electronics Soc. (IECON 2000), pp. 1147-1152, 2000.
[24] C. Schurgers and M.B. Srivastava, Energy Efficient Routing in Wireless Sensor Networks Proc. IEEE Military Comm. Conf. (MILCOM 2001), pp. 357-361, 2001.
[25] M.A. Youssef, M.F. Younis, and K.A. Arisha, A Constrained Shortest-Path Energy-Aware Routing Algorithm for Wireless Sensor Networks Proc. IEEE Wireless Comm. and Networking Conf. (WCNC 2002), pp. 794-799, 2002.
[26] T.X. Brown, H.N. Gabow, and Q. Zhang, Maximum Flow-Life Curve for a Wireless Ad Hoc Network Proc. 2001 ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 128-136, 2001.
[27] F. Ye, A. Chen, and S. Lu, L. Zhang, A Scalable Solution to Minimum Cost Forwarding in Large Sensor Networks Proc. IEEE 10th Int'l Conf. Computer Comm. and Networks, pp. 304-309, 2001.
[28] J. Mirkovic, G.P. Venkataramani, S. Lu, and L. Zhang, A Self-Organizing Approach to Data Forwarding in Large-Scale Sensor Networks Proc. IEEE Int'l Conf. Comm. (ICC 2001), pp. 1357-1361, 2001.
[29] V. Tsiatsis, S. Zimbeck, and M. Srivastava, Architecture Strategies for Energy-Efficient Packet Forwarding in Wireless Sensor Networks Proc. 2001 Int'l Symp. Low Power Electronics and Design, pp. 92-95, 2001.
[30] B. Karp and H.T. Kung, Greedy Perimeter Stateless Routing for Wireless Networks Proc. Sixth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom 2000), pp. 243-254, Aug. 2000.
[31] Y. Yu, R. Govindan, and D. Estrin, Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks UCLA Computer Science Dept., Technical Report UCLA/CSD-TR-01-0023, May 2001, available athttp://cens.cs.ucla.eduEstrin.
[32] Y. Ko and N. H. Vaidya, Location-Aided Routing (LAR) in Mobile Ad Hoc Networks Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '98), Oct. 1998.
[33] S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, A Distance Routing Effect Algorithm for Mobility (DREAM) Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '98), pp. 76-84, Oct. 1998.
[34] F. Ye, S. Lu, and L. Zhang, GRAdient Broadcast: A Robust, Long-Lived Large Sensor Network UCLA Technical Report,http://irl. cs.ucla.edu/papersgrab-tech-report.ps , 2001.
[35] R.D. Poor, Gradient Routing in Ad Hoc Networks www. media.mit.edu/pia/Research/ESP/texts poorieeepaper.pdf, 2000.
[36] A. Gut, Stopped Random Walks: Limit Theorems and Applications. New York: Springer-Verlag, 1988.
[37] S. M. Ross, Stochastic Processes. New York: Wiley, 1983.

Index Terms:
Geographic forwarding, multihop performance, ad hoc networks, sensor networks, energy, routing, MAC.
Citation:
Michele Zorzi, Ramesh R. Rao, "Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance," IEEE Transactions on Mobile Computing, vol. 2, no. 4, pp. 337-348, Oct.-Dec. 2003, doi:10.1109/TMC.2003.1255648
Usage of this product signifies your acceptance of the Terms of Use.