SLGP Header

Interoperable Geographic Forwading For Ad Hoc And Sensor Networkse

IJEECC Front Page

In this paper, we propose a technique for forwarding the data packets among the nodes that are connected to the ad hoc network. The algorithm is designed in such a way the energy utilized by the batterypowered devices during data transmission can be minimized, so that the devices can stay alive for a longer period of time. This technique implements the concepts of geographic random forwarding and interoperability and cooperation. These techniques when used together, helps to save the energy of the battery powered devices. This also solves the problem of detection and isolation of uncooperative nodes. The key point of this algorithm is its simplicity. It also will guarantee easy portability and maximal compatibility.
Keywords: Geographic forwading,interopability and cooperation,ad hoc networks, energy saving.
An ad-hoc network is a local area network (LAN) that is built spontaneously as devices connect. Instead of relying on a base station to coordinate the flow of messages to each node in the network, the individual network nodes forward packets to and from each other. In an ad hoc network all the devices have an equal status and are free to associate with any other device in the link state. The earliest wireless ad hoc network was the Packet Radio. An ad hoc network is made up of multiple nodes connected together by a link. The network then allows any two nodes to communicate at a time through the link. In most of the cases nodes compete to obtain the access of the link to communicate which indeed leads to collision at times. Suitable algorithms are being designed to avoid the collisions that occur in the network. Also, the battery powered devices lose a lot of their energy while communication with the other nodes in the network. So, the sooner the battery gets over the sooner the device shuts down. Various algorithms are also being designed to overcome this problem. Many existing algorithms propose techniques to share the data between the nodes with minimal amount of energy consumption. This paper also focuses on overcoming this problem. Along with which the paper also focuses on achieving maximum compatibility. The geographic forwarding technique states that the contention arises at the receiver’s side which is untraditional. Here, the sender node does not refer a relay node as its priori beforehand. Thus the intended recipient will not be known, and multiple nodes will receive the packet. Using the receiver contention scheme, single relay will be chosen to avoid the packet duplication. A strategy of blocking the connectivity between the neighboring nodes and the sender node will enhance the previously mentioned strategy. The encapsulation of these two strategies will enable us to overcome to difficulties faced in the ad hoc sensor networks. A technique used to isolate the rogue nodes of a MANET can be used in wireless ad hoc network, in addition to geographic forwarding technique, to achieve greater optimality.


  1. [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 EnergyLatency-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 Analysisfor 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.
  11. IETF, “OLSR Routing Protocol (RFC3626),” 2005, [Online; accessed 19-March-2008], [Online], Available:
  12. Wikipedia, “Optimized Link State Routing protocol,” 2008, [Online; accessed 28-March-2008], [Online], Available: wiki/OLSR