Self-Adaptive Routing for Temporary Information Sharing in Wireless Mesh Networks

The present paper proposes a self-adaptive routing method for temporary information sharing in a wireless mesh network without a global connection that is deployed in a geographically limited area. The temporary information sharing indicates that for the case in which information senders and receivers freely appear in the network, information is forwarded from an information sender to a receiver. The self-adaptive routing method determines a unique route by operations among numerical values assigned to each node and adaptively changes the assigned numerical values according to the routing results. A variety of types of operations and numerical values can be used for this routing method. In simulations, the method is evaluated in terms of routing reliability under an appearance pattern of an information sender-receiver pair in which a location of the receiver is fixed. Simulation results reveal that routing reliability depends on the types of operations and numerical values and is related to how frequently a closed route is generated in the routing. The results also suggest that the degree of randomness in routing is important for reliable routing and varies with the types of operations and numerical values.