This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts

for publication in the IEEE ICC 2011 proceedings

A Development of Network Topology of Wireless Packet Communications for Disaster Situation with Genetic Algorithms or with Dijkstra's
Isao Nakajima, Tokai University School of Medicine; Hiroshi Juzoji, Tokai University Shcool of Medicine; and Toshihiko Kitano, Tokai University
discusses the use of genetic algorithms (GAs) and Dijkstra's algorithm to optimize load network topologies in distributed packet communication systems. These algorithm is fully distributed in which information is dynamically updated at each movement of packet terminal almost realtime. Multiple distributed paradigms are adopted so that each terminal transmits information on the network topology throughout the wireless and satellite network. A GA model is effective when a network is configured with a sufficiently large number (n) of units. However, in marine applications or for use at a disaster site, the number (n) of units may be low, such as 7 or 8. In such cases, Dijkstras algorithm is more efficient than GA. Based on field experiments, we will seek to manage network topologies by transmitting the adjacency matrix determinant bilaterally.
Index Terms electromagnetic propagation, telecommunication network tolopogy AbstractThis paper

applied to different optimization problems with relatively few modifications to make them suitable for a specific problem. Devendra Kumar has reported on simulations of network topology, especially low distributed network analyzed with Dijkstra[1]. The idea for the metaheuristic approach was first reported by Dorigo in 1996 based on an analysis of ant colony optimization [2]. Two years thereafter, we applied a metaheuristic approach to packet communications involving wireless devices and telecommunications satellites [3]. The use of metaheuristic approximations based on genetic algorithms has been reported in a wide range of telecommunications fields [4-15]. . B. Problems with this approach Metaheuristics are generally applied to problems for which no satisfactory problem-specific algorithm or heuristic exists, or when implementing such methods would be impractical. The most commonly used metaheuristics target combinatorial optimization problems, but can, of course, handle any problems that can be recast into that form, such as solving Boolean equations. While many scientists are enthusiastic advocates of metaheuristics, many others are highly critical of the concept and have little regard for much of the research based on this approach. Critics point out, among other issues, that the general goal of the typical metaheuristicthe efficient optimization of an arbitrary black-box functioncannot be solved efficiently, since for any metaheuristic M one can easily build a function f that will force M to enumerate the entire search space. Indeed, the no free lunch theorem says that over the set of all mathematically possible problems, each optimization algorithm will, on average, do as well as any other. At best, a specific metaheuristic can be efficient only for restricted classes of goal functions (usually those that are partially "smooth"). However, these restrictions tend to exclude most applications of interest or make the problem amenable to specific solution methods that are much more efficient than the metaheuristic. II. TECHNICAL DEVEOPMENTS A. Using a Genetic Algorithm to Solve the Traveling Salesman Problem (TSP) A genetic algorithm can be used to find a solution in much less time. Although it might not find the best solution, it can find a near-optimal solution for a 30-city tour in less than a minute. Solving the traveling salesman problem using a GA entails a couple of basic steps.

I. INTRODUCTION HE well-known ant colony optimization (ACO) algorithm has Tproven successful as a metaheuristic approach to optimization for several network applications, including routing and load balancing. This paper presents some proposals related to the application of genetic algorithms and Dijkstra's algorithm for load network topologies in distributed packet communication systems. These algorithm is fully distributed in which information is dynamically updated at each movement of packet terminal almost realtime. A multiple distributed paradigm (Network topology: NET_ROM) will be adopted such that each terminal transmits the network topology throughout the wireless and satellite network. A. Metaheuristics Simulations of animal and insect behavior suggest a set of concepts that can be used to define heuristic methods for application to a wide range of problems. Metaheuristics can be regarded as a general algorithmic framework that can be

I. Nakajima is with Tokai University, 143 Shimokasuya, Isehara, Kanagawa, 259-1143, Japan (email: jh1rnz@aol.com) H. Juzoji with Tokai University, 143 Shimokasuya, Isehara, Kanagawa, 259-1143, Japan (email::uzoji@yahoo.co.jp) .T. Kitana is Tokai University, 143 Shimokasuya, Isehara, Kanagawa, 259-1143, Japan (email: toshihiko-kitano@nifty.com)

978-1-61284-231-8/11/$26.00 2011 IEEE

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings

First, create a group of many random tours in what is called a population. The algorithm uses a "greedy" initial population that gives preference to linking cities that are close to each other.

vertex to move to next). It does so by refining an approximation of the best shortest-path policy for all vertices with each iteration, until the full solution is realized. The algorithm is efficient in practice because each iteration relies on previously determined information. We apply this algorithm to determine the shortest path between packet terminals. Each packet terminal can change the signal strength transmitted by the other by sending the appropriate control signals. Based on this protocol, each terminal can create a dynamic digraph that reflects the network topology. Implementation of Dijkstras To grasp the topology of a given network, terminals must obtain data such as signal intensity from the physical layer and GPS data from the application layer, then seek to identify the overall network topology by exchanging data such as information on administrative traffic (equivalent to lazy ants).

Fig.1. 30 cities visiting with GA

Technique for determining the minimal path We calculate the distance of the shortest path based on (1) GPS navigation data and (2) the signal strength of the radio wave received. The algorithm then finds the best path to the goal node from the data source node. For example, the topological matrix can be used to create a Dijkstra table; can be used as a Dijkstra table. In other words, the shortest path between each pair of nodes can be determined by the algorithm; identified, then the shortest overall path calculated. We can implement this by the following C++ code: /* depth first search of Dijkstra method */ #include <stdio.h> #define N 7 int a[N+1][N+1]={ { 0,0,0,0,0,0,0,0}, { 0,0,1,0,0,0,0,0}, { 0,1,0,1,0,0,0,0}, { 0,0,3,1,0,0,1,0}, { 0,0,2,0,0,1,0,0}, { 0,0,0,0,2,0,1,1}, { 0,0,0,5 0,1,0,1}, { 0,0,0,0,0,2,1,0}}; int v[N+1]; void Ikerutokoro(int); ROM prototyping We validated our communications algorithm via computer modeling and calculated throughput for several network configurations using a communications simulator. However, the simulated situations differed significantly from actual conditions, since the relationship between the environment and wireless terminals were represented only by the Markov propagation model in computer simulations, providing either: (1) the Rice probability density function; (2) the Rayleigh probability density function; or (3) the Loo function approximation between (1) and (2). After determining whether this approach was effective in the simulation, we prototyped a ROM-based packet communications board having essential arguments as programmable variables.

Fig. 2 Results of the total distance of 30 cities with GA A small percentage of the time, child tours are allowed to mutate. This is done to prevent all tours in the population from looking identical. The new child tours are inserted into the population to replace two of the longer tours. The size of the population remains the same. New child tours are repeatedly created and used to replace longer tours until the desired goal is reached. As the name implies, genetic algorithms mimic nature and evolution, applying the survival of the fittest principle. B. What is the Dijkstras algorithm Dijkstra's algorithm is one of the most widely used methods for finding single-source shortest paths in a simple digraph. In other words, Dijkstra's algorithm determines the shortest paths from a common vertex to all other vertices in a digraph, if they exist. Dijkstra's algorithm is also an instance of dynamic programming. Let Si equal the value of S in the ith iteration of the algorithm, where i=0 initially and S0={S}. Let w(v,Si)denote the weight of the shortest path from s to v, given the knowledge of Si. Then

The purpose of Dijkstra's algorithm is to determine the best policy for transforming the state of the problem (i.e., which

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings

III. CONSIDERATIONS A. Packet Communications The two crucial control issues in managing a packet communications network are routing and flow control. This paper focuses on the former and discusses how optimal routing can be achieved in a network configured with distributed terminals. The flow control issue will be discussed on another occasion. Flow control Two types (see A and B below) of flow control are used to achieve maximum throughput. Both types control packet size, packet flow, and the flow of packets entering terminals. Network flow control This controls the flows of packets entering the network to prevent network congestion. End-to-end flow control This checks large volumes of data entering terminals, performs multi-stage relays of data from the data source, and calculates data traffic and buffers up to the destination in advance, then performs packet control to minimize delays. Routing We examined network topology diagrams to relay data by the shortest route. Here, we plan to release a number of rescue buoys equipped with hardware incorporating the algorithm developed during the course of this research and capable of transmitting physiological data on a victim. Using the WINDS satellite, we will verify the effectiveness of the algorithm for network administration in wireless packet communications. B. Control for networks with a small number (N) of units The model described thus far is valid when a network is configured with a sufficiently large number (n) of units. In marine applications or for use at a disaster site, the number (n) of units can be as few as 6, 7, or 8. If so, since the operations required to compute all combinations (all possible combinations: 0.5(n-1)!) is small, Dijkstras algorithm is more efficient. With Dijkstras algorithm, a system of 0 or 1 is not used in the adjacency matrix determinant, but each path can be assigned a weight, as shown in the diagram. The network can be managed by transmitting the adjacency matrix determinant bilaterally. In a wireless network, the network topology changes dynamically over time. This makes packet communication control boards capable of performing autonomous distributed control of paths extremely important. This type of autonomous distributed control processing is called ant colony optimization (ACO). Various related techniques have been developed and reported.

C. Effect of the optimization in small number Unlike GA, Dijkstras has no evolution operators such as crossover and mutation. In case of small number of nodes, Dijkstras has a potential solutions fly through the problem space by optimum particles. This problem was pointed out by Dr. Eberhart and Dr. Kennedy in 1995 in the Particle Swarm Optimization (PSO) that was a population based stochastic optimization technique developed by inspired by social behavior of bird flocking or fish schooling. I intend to simulate the speed and the direction of the buoy(Fig.4, and Fig. 6) using the random number. The arithmetic expression with the speed of the buoy is as follows.

gBouy:a value with the best computation number of times is called. vi: speed of the buoy(node) of the order n. c1, c2 : the learning coefficient which takes the value from 0 to 2. r1,r2: random number value which comes off from 0 to 1.

random number value which comes off from 0 to 1. It was compared by the CPU task in GA or in Dijkstras with a simulation at the best route to the buoy of n which moves at their speed. The evaluation function is time code at the reaching the solution of the optimal-path(Fig.3).

Fig. 3 one of optimal results with time code comparison with GA and Dijkstras D. Applications COSPAS SARSAT The International COSPAS-SARSAT system provides accurate, timely, and reliable distress alert and location data to help search and rescue authorities assist persons in distress. However, this system has lots of problem in the function of the FFB(free floating buoy) on sea surface. Of the 7,771 individuals on board ships requiring rescue in waters near Japan in 1997, 1,450 were assisted by the Japan Coast Guard, 4,062 were rescued by organizations other than the Japan Coast Guard, 2,089 found safety on their own, and 170 are presumed to be dead or missing. The number of victims saved by COSPAS-SARSAT was a mere 119 (14 cases). Japan

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings

introduced the COSPAS-SARSAT system based on suggestions by the IMO, deploying LUTs (Local User Terminals) to receive rescue signals around the clock. However, it has thus far not played a significant role in saving lives. We believe a new system needs to be developed, and this research is intended to contribute to the creation of such a rescue system. Proposed system and field tests Given several arguments that computers were unable to simulate, we checked the operation of the prototype in field tests include electric field strength near sea surface(Fig.5). Why we focus on communications during disasters In the event of large-scale natural disasters in urban areas such as earthquakes, the communications infrastructure may be physically destroyed by the disaster and phone switches rendered unreliable by excessive traffic. In addition to functional damage, traffic volume is likely to increase at a catastrophic rate, concentrating in limited areas and rendering existing public networks useless. To resolve such problems, individual terminals must be able to grasp network topologies and provide autonomous distributed-processing capabilities to transmit messages of the minimum size, selecting the most reliable communications routes. Such networks will significantly improve the quality of first aid. Field test (using eight FFBs ) From remote control centers, it is often difficult to grasp the actual conditions at a problem site. We performed an experiment using free-floating buoys (FFBs) (Fig.4), assuming an accident at sea in which individual terminals would be required to grasp the network topology corresponding to the circumstances. The experiment was carried out under the following assumptions: 1: Two or more buoys are automatically released in the case of a shipwreck. 2: The lifejacket of the victims can transmit physiological data with packet communications. 3: A FFB (free-floating buoy) can transmit physiological data on the victim (white circle in Fig.6) to a satellite. 4: A FFB can transmit data to neighboring buoys. Fig. 5 Surface propagation data of FFB with Rayleigh fading

Fig. 6 Topology change at sea The topologies of such networks change with time at sea, influenced by environmental factors such as tides, waves, and wind. We plan to investigate whether individual terminals can grasp such changes in network topology on their own and whether it is possible to link a deadwood FFB to a satellite on behalf of other FFBs to conserve battery power, since satellite communications consume significant electrical power. In a preliminary experiment with this goal, we obtained surface propagation data (Fig.5.) using singular FFB in the Sea of Japan. IV. CONCLUSIONS

Fig. 4 Prototype FFB

A GA model is effective when a network is configured with a sufficiently large number (n) of units. However, in marine applications or for use at a disaster site, when the number (n) of

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings

units may be low as 7 or 8, Dijkstras algorithm is more efficient than GA. With Dijkstras algorithm, a system of 0 or 1 is not used in the adjacent matrix determinant, but each path can be assigned a weight (corresponding to the distance of each terminal). We will report on our experiences managing network topologies by transmitting the adjacency matrix determinant bilaterally. REFERENCES
[1] Shen,S.M., Abu-Amara,H., Wei K. Tsai,W.K.,et.al.:Simulation and Theoretical Results on Cluster Management and Directory Management in Dynamic Hierarchical Networks, IEEE Trans. Communications, 40(1992),pp. 312-323. Dorigo M., Colorni A.:The Ant System: Optimization by a colony of cooperating agents, IEEE Trans. System, Man, Cybernetics-Part B, 26,1(1996),pp.1-13. Nakajima I., Hama S., et.al.: Wireless networks based on information exchange between ants, Proceeding of the 3rd International Symposium on Multi-Dimensional Mobile Communications, IEEE Vehicular Technology Society, 1998:pp.116-119. Rango,F.D., Tropea, M., Santamaria, A.F., et.al.:Multicast QoS Core-Based Tree Routing Protocol and Genetic Algorithm Over an HAP-Satellite Architecture, IEEE Trans Vehicular Technology, 58(2009),pp.4447-4461.

Bigham, editors, Software Agents for Future Communication Systems Springer, 1999, pp.305325.

[2] [3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

Kompella,S., Mao,S., Hou, Y.T., et.al.:On Path Selection and Rate Allocation for Video in Wireless Mesh Networks, IEEE/ACM Trans. Networking, 17(2009),pp.212-224. Quintero, A., Pierre, S.:On the Design of Large-Scale UMTS Mobile Networks Using Hybrid Genetic Algorithms, IEEE Trans. Vehicular Technology, 57(2008), pp.2498-2508. Morillo,P., Rueda,S., Orduna, J.M. et.al.: A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems, IEEE Trans. Parallel and Distributed Systems, 18(2007),pp.1215-1226. Kumar,D.:Svstems with Low Distributed Simulation Overhead, IEEE Trans. Parallel and Distributed Systems,3(1992), pp.155-165. Nakajima I., Juzoji H., Kitano T. et.al.: Apply Biologically-Inspired Topology to Disaster Communications, proceeding of the 10th IEEE Intl. Conf. on e-Health Networking, Applications and Service,2008,pp.1-6. Bulut, E., Wang, Z., Szymanski, B.K.:A Cost-Quality Tradeoff in Cooperative Sensor Networking, This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 2008 workshop proceedings, 2008, pp.112-117. Onishi R., Yamaguchi S., Morino N. et. al.:A Multi-Agent System for Dynamic Network Routing, IEICE Trans. INF. & SYST.,E84D(2001),pp.1-8. Miner, N., Kramer,K.H., Maes.P.:Cooperating mobile agents for dynamic network routing, In AlexHeyzelden and John Bigham, editors, Software Agents for Future Communication Systems Springer,1999,pp.287304.

[13] Appleby S., Steward S.: Mobile software agents for control in telecommunications networks, BT Technology Journal, 12(1994), pp.104113. [14] Caro, G. D., M. Dorigo, M:Mobile agents for adaptive routing, In Proceedings of the 31st Hawaii International Conference of System Sciences,1998,pp.7483. [15] Schoonderwoerd, R., Holland, O.:Minimal agents for communication network routing: The social insect paradigm. In AlexHeyzelden and John