A Development of Network Topology of Wireless Packet Communications for Disaster Situation with Genetic Algorithms or with Dijkstra's

• Published in: 2011 IEEE International Conference on Communications (ICC) pp. 1 - 5
• Main Authors: Juzoji, H., Nakajima, I., Kitano, T.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-06-2011
• Subjects: Algorithm design and analysis; Genetic algorithms; Heuristic algorithms; Network topology; Optimization; Routing; Satellites
• ISBN: 9781612842325; 1612842321
• ISSN: 1550-3607; 1938-1883
• DOI: 10.1109/icc.2011.5962439

This paper 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, Dijkstra's algorithm is more efficient than genetic algorithms. With Dijkstra's algorithm, a system of 0 or 1 is not used in the adjacency matrix determinant, but each path can be assigned a weight (corresponding to the distance of each terminal). Based on field experiments, we will seek to manage network topologies by transmitting the adjacency matrix determinant bilaterally.