Complex Routing for Temporary Information Sharing in Wireless Mesh Networks

This paper presents Complex Routing for temporary information sharing in a wireless mesh network built in a geographically limited area. The Complex Routing determines a route from a sender to a receiver based on operations of complex numbers held by each node. In addition, it provides an adaptation mechanism for changing the complex numbers. The temporary information sharing means that in a situation that senders and receivers freely appear in the network, information forwarding from a sender to a receiver is conducted using freely assigned identifiers of information. In simulations, we consider several basic spatial patterns for appearance of senders and receivers, and examine if the Complex Routing can provide reliable information forwarding capability. Simulation results show that the Complex Routing is better than or equal to a random walk for comparison.

[1]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[2]  David E. Goldberg,et al.  Inducing Sequentiality Using Grammatical Genetic Codes , 2004, GECCO.

[3]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[4]  Michael O'Neill,et al.  Genetic Algorithms Using Grammatical Evolution , 2002, EuroGP.