Network system for establishing path using redundancy degree and method thereof
First Claim
1. A method of establishing a communication path between nodes in a wireless network system comprising a plurality of nodes, one of which operates as a source node, one or more of which operate as mobile nodes, and another of which operates as a destination node receiving a message from the source node, the method comprising:
- broadcasting a route request (RREQ) packet from the source node for the destination node;
receiving the RREQ packet at one or more of the mobile nodes, appending a redundancy degree with respect to an adjacent node to the RREQ packet at each mobile node and broadcasting the RREQ packet from each mobile node for the destination node along one or more paths;
selecting an optimal path at the destination node by checking the redundancy degree contained in the RREQ packet received along each path when the RREQ packet is received along at least one path;
establishing the communication path to the source node by transmitting a route reply (RREP) packet along the optimal path; and
calculating the redundancy degree at each mobile node by checking a temporal association, a spatial association, and a mobility with respect to an adjacent node of the respective mobile node.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for establishing a path between nodes in a wireless network system. A source node broadcasts a route request (RREQ) packet for a destination node. A mobile node between the source node and the destination node, upon receiving the RREQ packet, appends a redundancy degree with respect to an adjacent node to the RREQ packet and broadcasts the RREQ packet. The destination node selects an optimal path by checking the redundancy degree received along each path when the RREQ packet is received along multiple paths, and the destination node establishes an optimal path to the source node by transmitting a route reply (RREP) packet along the optimal path. Accordingly, the path is established suitable for the quality of service of data to be transmitted and a lost path is promptly recoverable by reference to information stored at each mobile node identifying redundant paths available to the mobile node.
-
Citations
31 Claims
-
1. A method of establishing a communication path between nodes in a wireless network system comprising a plurality of nodes, one of which operates as a source node, one or more of which operate as mobile nodes, and another of which operates as a destination node receiving a message from the source node, the method comprising:
-
broadcasting a route request (RREQ) packet from the source node for the destination node; receiving the RREQ packet at one or more of the mobile nodes, appending a redundancy degree with respect to an adjacent node to the RREQ packet at each mobile node and broadcasting the RREQ packet from each mobile node for the destination node along one or more paths; selecting an optimal path at the destination node by checking the redundancy degree contained in the RREQ packet received along each path when the RREQ packet is received along at least one path; establishing the communication path to the source node by transmitting a route reply (RREP) packet along the optimal path; and calculating the redundancy degree at each mobile node by checking a temporal association, a spatial association, and a mobility with respect to an adjacent node of the respective mobile node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 9)
-
-
8. A method of establishing a communication path between nodes in a wireless network system comprising a plurality of nodes, one of which operates as a source node, one or more of which operate as mobile nodes, and another of which operates as a destination node receiving a message from the source node, the method comprising:
-
broadcasting a route request (RREQ) packet from the source node for the destination node; receiving the RREQ packet at one or more of the mobile nodes, appending a redundancy degree with respect to an adjacent node to the RREQ packet at each mobile node and broadcasting the RREQ packet from each mobile node for the destination node along one or more paths; selecting an optimal path at the destination node by checking the redundancy degree contained in the RREQ packet received along each path when the RREQ packet is received along at least one path; establishing the communication path to the source node by transmitting a route reply (RREP) packet along the optimal path; and including a quality of service (QoS) information required for data transferred from the source node in the RREQ packet, wherein the selecting of the optimal path at the destination node comprises; receiving at least one RREQ packet at the destination node over a certain standby time; checking the QoS information and the redundancy degree with respect to each received RREQ packet at the destination node; selecting the optimal path among the paths of the RREQ packet transmission based on the QoS information and the redundancy degree in each received RREQ packet; and setting the standby time by checking the QoS information contained in the RREQ packet first received at the destination node.
-
-
10. A method of establishing a communication path between nodes in a wireless network system comprising a plurality of nodes, one of which operates as a source node, one or more of which operate as mobile nodes, and another of which operates as a destination node receiving a message from the source node, the method comprising:
-
broadcasting a route request (RREQ) packet from the source node for the destination node; receiving the RREQ packet at one or more of the mobile nodes, appending a redundancy degree with respect to an adjacent node to the RREQ packet at each mobile node and broadcasting the RREQ packet from each mobile node for the destination node along one or more paths; selecting an optimal path at the destination node by checking the redundancy degree contained in the RREQ packet received along each path when the RREQ packet is received along at least one path; and establishing the communication path to the source node by transmitting a route reply (RREP) packet along the optimal path; detecting disconnection of a second mobile node and a registered downstream node on the path between the source node and the destination node; determining, at the second mobile node, whether there is a redundant path to the downstream node by checking the redundancy degree of the second mobile node; and recovering the path between the source node and the destination node using the redundant path when there is the redundant path; transmitting to a failure notification (FN) packet from the second mobile node to a registered upstream node indicating the path loss when it is determined that there is no redundant path; and recovering the lost path at the upstream node using the redundant path when there is the redundant path by checking the redundancy degree, wherein the recovering of the lost path at the upstream node comprises; selecting an optimal redundant path among redundant paths in accordance with the following equations; wherein Rdr is a redundancy degree of the redundant paths excluding a main path, |p| is a total number of links on the path p, Rdn (p) is a generalized value of Rdr, Mrr(i,j) and Trr(i,j) respectively are functions for calculating a mobile scale and a temporal association scale of a link between the node i and the node i, Imr(i,j) is a mobile scale function of the nodes i and i, and α and
β
respectively are weight functions for the temporal association and the mobility.- View Dependent Claims (11)
-
-
12. A method of establishing a communication path between nodes in a wireless network system comprising a plurality of nodes, one of which operates as a source node, one or more of which operate as mobile nodes, and another of which operates as a destination node receiving a message from the source node, the method comprising:
-
broadcasting a route request (RREQ) packet from the source node for the destination node; receiving the RREQ packet at one or more of the mobile nodes, appending a redundancy degree with respect to an adjacent node to the RREQ packet at each mobile node and broadcasting the RREQ packet from each mobile node for the destination node along one or more paths; selecting an optimal path at the destination node by checking the redundancy degree contained in the RREQ packet received along each path when the RREQ packet is received along at least one path; and establishing the communication path to the source node by transmitting a route reply (RREP) packet along the optimal path; calculating the redundancy degree in accordance with the following equation;
Rd(i,j)=|{kε
{Mr(i)∩
Sr(i)}|Tlink(i,j)e≦
Tlink(i,k)e}|,wherein i, j, and k respectively are the mobile nodes, Rd(i,j) is the redundancy degree between nodes i and j, Mr(i) is an adjacent node moving toward the node i, Sr(i) is an adjacent node having a spatial association with the node i, and Tlink(i,j)e is an expected time of the path establishment between the node i and the node j. - View Dependent Claims (13)
-
-
14. A method of establishing a communication path between nodes in a wireless network system comprising a plurality of nodes, one of which operates as a source node, one or more of which operate as mobile nodes, and another of which operates as a destination node receiving a message from the source node, the method comprising:
-
broadcasting a route request (RREQ) packet from the source node for the destination node; receiving the RREQ packet at one or more of the mobile nodes, appending a redundancy degree with respect to an adjacent node to the RREQ packet at each mobile node and broadcasting the RREQ packet from each mobile node for the destination node along one or more paths; selecting an optimal path at the destination node by checking the redundancy degree contained in the RREQ packet received along each path when the RREQ packet is received along at least one path; establishing the communication path to the source node by transmitting a route reply (RREP) packet along the optimal path; detecting disconnection of a second mobile node and a registered downstream node on the path between the source node and the destination node; determining, at the second mobile node, whether there is a redundant path to the downstream node by checking the redundancy degree of the second mobile node; recovering the path between the source node and the destination node using the redundant path when there is the redundant path; transmitting to a failure notification (FN) packet from the second mobile node to a registered upstream node indicating the path loss when it is determined that there is no redundant path; and recovering the lost path at the upstream node using the redundant path when there is the redundant path by checking the redundancy degree, wherein the recovering of the lost path at the upstream node comprises; selecting an optimal redundant path among redundant paths in accordance with the following equations; wherein Rdr is a redundancy degree of the redundant paths excluding a main path, |p| is a total number of links on the path p, Rdn (p) is a generalized value of Rdr, Mrr(i,j) and Trr(i,j) respectively are functions for calculating a mobile scale and a temporal association scale of a link between the node i and the node j, Imr(i,j) is a mobile scale function of the nodes i and j, and α and
β
respectively are weight functions for the temporal association and the mobility.
-
-
15. A mobile node for establishing a communication path between a source node and a destination node, the mobile node comprising:
-
a calculator to calculate a redundancy degree for the mobile node with respect to at least one node adjacent to the mobile node; a packet receiver to receive a route request (RREQ) packet transmitted by the source node or another mobile node; a controller to register the transmitting node as an upstream node and append the redundancy degree to the RREQ packet; a packet transmitter to broadcast the RREQ packet having the appended redundancy degree for the destination node; and a storage to store the redundancy degree and information on the registered upstream node, wherein the controller registers the transmitting node as a redundant upstream node where the RREQ packet is redundantly received by the mobile node; the packet receiver receives a route reply (RREP) transmitted by the destination node or yet another node; the controller registers the node transmitting the (RREP) packet as a downstream node and controls the packet transmitter to transmits the RREP packet to the registered upstream node; the controller controls the packet transmitter to transmit a redundant route reply (RRR) packet to the redundant upstream node when the redundant upstream node is registered by the mobile node; and the controller registers the node transmitting the RRR packet as a downstream node, appends the redundancy degree to the RRR packet, and controls the packet transmitter to transmit the RRR packet to the upstream node. - View Dependent Claims (16, 17, 18)
-
-
19. A wireless network system comprising:
-
a source node to broadcast a route request (RREQ) packet for path establishment; at least one mobile node to calculate and store a redundancy degree with respect to an adjacent node, append the redundancy degree to the RREQ packet when the RREQ packet is received, and broadcast the RREQ packet; and a destination node to receive the RREQ packet via a plurality of paths and select an optimal path from among the plurality of paths by checking the redundancy degree of the RREQ packet received via at least one of the plurality of paths and to transmit a route reply (RREP) packet to the source node along the optimal path, wherein the mobile node determines whether the RREQ packet is received redundantly, and if the RREQ packet is not redundantly received, the mobile node registers an adjacent node transmitting the RREQ packet as an upstream node and broadcasts the RREQ packet for the destination node; the mobile node registers the adjacent node transmitting the RREQ packet as a redundant upstream node and drops the RREQ packet when the RREQ packet is received redundantly; and the destination node sets a standby time by checking a quality of service (QoS) information contained in the RREQ packet first received, and selects the optimal path from the paths of the RREQ packet transmission within the standby time. - View Dependent Claims (20, 21, 22, 23)
-
-
24. A packet transceiver comprising:
-
a calculator which calculates a redundancy degree based on a temporal association, a spatial association and a mobility association of the packet transceiver with respect to a node which transmits a route request (RREQ) packet having a packet ID, a destination ID and a quality of service (QoS) information; a controller which registers the transmitting node as an upstream node, and appends the calculated redundancy degree to the RREQ packet; and a packet transmitter which transmits the RREQ packet having the appended redundancy degree. - View Dependent Claims (25)
-
-
26. A packet transceiver, comprising:
-
a packet receiver which receives one or a plurality of route request (RREQ) packets, each RREQ packet having a packet ID, a destination ID, a quality of service (QoS) information and an appended redundancy degree based on respective temporal, spatial and mobility associations of other packet transceivers which forward the RREQ packets; a controller which; checks whether a node ID of the receiving packet transceiver corresponds to the destination ID, and determines an optimal communication path based on the appended redundancy degree and the QoS information, if the node ID corresponds to the destination ID; and a packet transmitter which transmits a route reply (RREP) packet on the optimal communication path, If the node ID corresponds to the destination ID. - View Dependent Claims (27)
-
-
28. A packet transceiver which operates as one of a plurality of nodes in a wireless system, the packet transceiver comprising:
-
a storage which stores respective redundancy degrees based on respective temporal associations, spatial associations and mobility associations of the packet transceiver with respect to other nodes which transmits a route request (RREQ) packet having a packet ID and a quality of service (QoS) information via the packet transceiver in route to a destination node; and a controller which uses the stored redundancy degree to complete a communication path in response to a reply route (RREP) packet transmitted from the destination node toward a source node, wherein, where a main route to one of the other nodes, which main route is specified in the RREP packet based on the QoS information, is lost, the controller selects a redundant route based on the stored redundancy degree.
-
-
29. A method of establishing a communication path between a first mobile node operating as a source node and a second mobile node operating as a destination node, the communication path established through one or more mobile nodes operating as intermediate nodes, the method comprising:
-
forwarding a route request (RREQ) packet from the source node to the destination node via one or a plurality of the intermediate nodes, the RREQ packet having a packet ID and a quality of service (QoS) information; appending a redundancy degree to the RREQ packet at each intermediate node; storing information at each intermediate node indicating other nodes from which the RREQ packet is received; determining an optimal communication path at the destination node based on the respective appended redundancy degrees of the RREQ packets received at the destination node and the QoS information; transmitting a route reply (RREP) packet identified to the packet ID on the optimal communication path; determining the optimal communication path as a path having a smallest number of intermediate nodes where the QoS information indicates a swift communication is required; and determining the optimal communication path as a path having a greatest number of redundant paths where the QoS information indicates that a stable communication is required. - View Dependent Claims (31)
-
-
30. A method of establishing a communication path between a first mobile node operating as a source node and a second mobile node operating as a destination node, the communication path established through one or more mobile nodes operating as intermediate nodes, the method comprising:
-
forwarding a route request (RREQ) packet from the source node to the destination node via one or a plurality of the intermediate nodes, the RREQ packet having a packet ID and a quality of service (QoS) information; appending a redundancy degree to the RREQ packet at each intermediate node; storing information at each intermediate node indicating other nodes from which the RREQ packet is received; determining an optimal communication path at the destination node based on the respective appended redundancy degrees of the RREQ packets received at the destination node and the QoS information; transmitting a route reply (RREP) packet identified to the racket ID on the optimal communication path; and basing the redundancy degree on respective temporal, spatial and mobility associations of the intermediate nodes which forward the RREQ packet toward the destination node.
-
Specification