Patent ID: 7751332

Claim:
A data routing method, comprising: locating a destination node using a destination locating packet; establishing a preliminary route comprising anchor nodes, based on a route where the destination locating packet is transmitted to the destination node; determining link costs between neighbor nodes of each of the anchor nodes, and also between the anchor nodes and the neighbor nodes of each of the anchor nodes; generating minimum cost information with respect to a route consuming a minimum cost from the destination node to a source node, using the link costs; and forming a data route from the destination node to the source node using the minimum cost information, wherein the generating of the minimum cost information comprises: generating, by a downstream anchor node of the anchor nodes in the preliminary route, downstream cost information using link costs between neighbor nodes of the downstream anchor node, and between the downstream anchor node and the neighbor nodes of the downstream anchor node; transmitting, by the downstream anchor node, the downstream cost information to a first upstream anchor node of the anchor nodes in the preliminary route; updating, by the first upstream anchor node, the downstream cost information using link costs between neighbor nodes of the first upstream anchor node, and between the first upstream anchor node and the neighbor nodes of the first upstream anchor node, the first upstream anchor node being adjacent to the downstream anchor node and being in an uplink direction from the downstream anchor node; and transmitting, by the first upstream anchor node, the updated downstream cost information to a second upstream anchor node of the anchor nodes in the preliminary route, the second upstream anchor node being adjacent to the first upstream anchor node and being in the uplink direction from the first upstream anchor node.