PATH SELECTION METHOD FOR RELAY NODE IN DISJOINT NETWORKS

摘要

A method for determining a moving path of a relay node for a divided network comprises the steps of: a computer device modeling an area, in which a plurality of segments are located, as a grid comprising a plurality of cells; when a relay node is located on the cell, the computer device using information on communicable segments to determine one reference cell for each segment among the plurality of cells; the computer device using the reference cell and grouping the plurality of segments into k numbers of temporal clusters; and the computer device grouping the plurality of segments into k numbers of final clusters on the basis of energy consumed by the relay node which moves the temporal clusters and transmits information. The segment corresponds to one connected network, and a path connecting a plurality of reference cells contained in each cluster in the final clusters is a path where the relay node moves. The present invention uses a limited numbers of relay nodes to transmit information between divided networks, and makes energy used by each relay node be uniform to the most, such that the relay node can perform a relay service for a long time.