Self organized terminode routing simulation

ABSTRACT

We simulated terminode routing as presented in [6]. This routing scheme is designed for wide area networks, where a large part or all the nodes are mobile. Terminode routing is a combination of two protocols called Terminode Local Routing (TLR) and Terminode Remote Routing (TRR). TLR is used to route packets to close destinations. TRR is used to route to remote destinations and is composed of the following elements: Anchored Geodesic Packet Forwarding (AGPF), Anchored Path Discovery (APD), multipath routing and path maintenance. We performed simulations of the TLR and TRR protocols using the GloMoSim simulator. In order to do that, we have implemented a new mobility model that we call “restricted random waypoint”. This model is closer to a real-life situation for a wide-area mobile ad hoc network than the random waypoint model. We performed our simulation on a topology based on towns and highways. Towns are areas that are connected with highways. Inside town areas, terminodes move with the random waypoint mobility model. After a certain number of movements in the same town, a terminode moves to another town. The simulation results for a large, highly mobile ad-hoc environment demonstrate benefits of the combination of TLR and TRR over an existing protocol that uses geographical information for packet forwarding.

References

1. 1.R. Bagrodia, R. Meyer, M. Takai, Y. Chen, X. Zeng, J. Martin, and H.Y. Song. PARSEC: A Parallel Simulation Environment for Complex Systems. IEEE Computer, 31(10), October 1998.
2. 2.J. Broch, D.A. Maltz, D.B. Johnson, Y.C Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom '98), Dallas, Texas, USA, August 1998.
3. 3.IEEE Computer Society LAN MAN Standards Committee. Wireless LAN Medium Access Protocol (MAC) and Physical Layer (PHY) Specification. IEEE Std 802.11-1997, The Institute of Electrical and Electronics Engineers, New York, 1997.
4. 4.J.-P. Hubaux, J.-Y. Le Boudec, S. Giordano, M. Hamdi, L. Blazevic, L. Buttyan, and M. Vojnovic. Towards Mobile Ad-Hoc WANs: Terminodes. Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC'O0), Chicago, USA, September 2000.
5. 5.Brad Karp and H.T. Kung. GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. Proceedings of ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'O0), August 2000.
6. 6.L. Blazevic, S. Giordano and J.-Y. Le Boudec. Self Organized Terminode Routing. Technical report, DSC/2001/024, Swiss Federal Insitute of Techology, Lausanne.
7. 7.J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris. A Scalable Location Service for Geographic Ad Hoc Routing. Mobicom'O0, Boston, 2000.
8. 8.Marc R. Perlman and Zygmunt J. Haas. Determining the Optimal Configuration for the Zone Routing Protocol. IEEE JSAC, 17(8), August 1999.
9. 9.M. Takai, L. Bajaj, R. Ahuja, R. Bagrodia, and M. Gerla. GloMoSim:A Scalable Network Simulation Environment. Technical Report 990027, UCLA, Computer Science Department, 1999.
10. 10.D. J. Watts. In Small Worlds, The dynamics of networks between order and randomness. Princeton University Press, 1999.

Index Terms

• Computer systems organization

  • Dependable and fault-tolerant systems and networks

• Computing methodologies

  • Modeling and simulation

    • Model development and analysis

      • Model verification and validation

    • Simulation evaluation

• General and reference

  • Cross-computing tools and techniques

    • Performance

• Networks

  • Network performance evaluation

  • Network properties

    • Network range

      • Local area networks

      • Wide area networks

  • Network types

    • Mobile networks

    • Wireless access networks

• Theory of computation

  • Design and analysis of algorithms

    • Approximation algorithms analysis

      • Routing and network design problems