Routing in 2-D Meshes: A Tutorial

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3758)


As we know, the performance of networks systems is dependent on the end-to-end cost of communication mechanisms. Routing is a process of finding a path from the source node to the destination node in a given network system. The ability to route message efficiently becomes increasingly important. Routing in mesh-connected networks, such as 2-D meshes, has been commonly discussed due to the structural regularity for easy construction and the high potential legibility for variety of algorithms.


Sensor Network Wireless Network Network Routing Structural Regularity Easy Construction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.Computer Science Department, Information Assurance CenterWest Chester University of PAWest ChesterU.S.A.

Personalised recommendations