KR20040050425A - Battery lifetime and signal based adaptive routing and apparatus for mobile ad-hoc networks - Google Patents

Abstract

PURPOSE: A mobile ad-hoc network routing method in consideration of a remaining battery amount and signal stability of a communication node is provided to set a routing path in consideration of a remaining battery amount of intermediate/receiving nodes that are involved in a multi-hop path, thereby extending a lifetime of a mobile ad-hoc network. CONSTITUTION: When an RREQ(Routing Request Message) control packet is received, an intermediate node updates a routing entry of a self node as initializing data and driving a routing process(S601,S602), and confirms a UDP(User Datagram Protocol) receiving port of an IP datagram received from a UDP upper layer(S603,S604). If the UDP receiving port is a port 654, the intermediate node confirms whether RREQ link quality exceeds a restricted value(S605) and confirms whether a remaining battery amount is sufficient(S606). If so, the intermediate node decides whether an originating sequence number of the RREQ control packet is bigger or identical with a sequence number value of the routing entry and whether the number of hops is less than the number of hops of the routing entry(S607,S608). If so, the intermediate node adds a reverse path to a routing table.

Description

Mobile Adaptive Network Routing Method and Apparatus Considering Battery Level and Signal Stability of Communication Node {BATTERY LIFETIME AND SIGNAL BASED ADAPTIVE ROUTING AND APPARATUS FOR MOBILE AD-HOC NETWORKS}

The present invention relates to a routing method and an apparatus thereof, and more particularly, to a mobile adaptive network routing method and apparatus considering a battery level and signal stability of a communication node supporting a multi-hop communication environment between communication nodes of a mobile adaptive network. It is about.

In general, mobile ad-hoc networks are networks that are autonomously configured between mobile nodes and do not require other based network devices such as base stations. That is, the mobile adaptation network communicates with each other by using a radio interface, and due to limitations in the radio transmission distance, multi-hop communication based on routing is required.

In this mobile adaptation network, the topology of the network can change due to the mobility of the communication node. Because of this, reconfiguration of the routing path from the source node to the destination node may be required.

Therefore, since the service quality of the mobile adaptation network may be affected by the change of the routing path, research on this is being actively conducted.

As a technique related to such a routing method, when the shortest distance routing path is applied to a mobile adaptive network, wireless transmission data may be lost due to radio transmission distance limitation. A routing path that exceeds the strength threshold is chosen to ensure the safety of the radio link.

The technical problem to be solved by the present invention is to solve such a problem, and when each communication node of the mobile adaptation network is divided into a source, an intermediate and a destination node according to its role, an intermediate and destination node involved in a multi-hop path To provide a mobile adaptive network routing method and apparatus that considers the remaining battery power and signal stability of a communication node that can extend the life cycle of the mobile adaptive network by setting the routing path in consideration of the battery remaining of the It is for.

In addition, the present invention provides a shortest routing path by exceeding an appropriate link quality limit in order to prevent wireless transmission data loss due to wireless transmission distance limitation due to mobility in case of excessively directing the shortest routing path to the mobile adaptation network. To provide a mobile adaptive network routing method and apparatus in consideration of the battery level and signal stability of the communication node that can be directed to.

1 is a diagram illustrating a protocol stack structure mounted on each communication node according to an embodiment of the present invention.

2 is a conceptual structural diagram of a UDP / IP datagram for carrying a BLSSA signal message according to an embodiment of the present invention.

3 is a diagram illustrating the structure of a BLSSA routing table entry according to an embodiment of the present invention.

4 is a diagram illustrating an RREQ / RREQ signal message structure of a BLSSA according to an embodiment of the present invention.

5 is a diagram illustrating a RREQ / RREP signal message flow of a BLSSA according to an embodiment of the present invention.

6A through 6C are flowcharts sequentially illustrating routing path search and setup procedures considering battery levels and signal stability of a communication node according to an exemplary embodiment of the present invention.

※ Explanation of code for main part of drawing ※

100: source node 101: air interface

102: MAC layer 103: IP layer

104: UDP layer 105, 115, 125: BLSSA

106, 116, 126: routing table 110: intermediate node

120: destination node

In order to achieve the above object, a mobile adaptive network routing method considering battery level and signal stability of a communication node according to the present invention includes a method of routing a mobile adaptive network in which communication nodes transmit and receive data through an air interface, including: a) a communication node; Classifying the source node, the intermediate node, and the destination node according to each role of; b) generating a routing request signal message if a message transmission path from the classified source node to the destination node is not established; c) transmitting the generated routing request signal message to the destination node through the intermediate node; And d) when the routing request signal message is transmitted to a destination node, the intermediate and destination nodes generate and transmit a routing response signal message that satisfies the battery level limit and the signal strength to the source node in a reverse path made during the message transmission. Characterized in that it comprises a.

In addition, the mobile adaptive network routing device according to another aspect of the present invention, in the routing device of the mobile adaptive network in which the communication nodes transmit and receive data through the air interface, according to each role of the communication node, the source node, the intermediate node and the destination node A node classification unit classified as; A message generator for generating a routing request signal message when a message transmission path from the classified source node to the destination node is not set; A message transmitter which transmits the generated routing request signal message to the destination node through the intermediate node; And when the routing request signal message is transmitted to a destination node, the intermediate and destination nodes generate and transmit a routing response signal message that satisfies a battery level threshold and signal strength to a source node in a reverse path made during message transmission. It is characterized by including.

In addition, in a recording medium including a routing method of a mobile adaptive network in which communication nodes transmit and receive data through an air interface, according to another aspect of the present invention, a) a source node, an intermediate node, and a destination node according to each role of the communication node; Classify as; b) generating a routing request signal message if a message transmission path from the classified source node to the destination node is not set; c) transmitting the generated routing request signal message to the destination node through the intermediate node; And d) when the routing request signal message is transmitted to a destination node, the intermediate and destination nodes generate and transmit a routing response signal message that satisfies the battery level limit and the signal strength to the source node in the reverse path created during the message transmission. Characterized in that the recording medium is stored program containing.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a diagram illustrating a protocol stack structure mounted on each communication node according to an embodiment of the present invention.

As shown in FIG. 1, a communication node of a mobile communication network according to an embodiment of the present invention is divided into a source node 100, an intermediate node 110, and a destination node 120 according to its role. ) Serves as a client, destination node 120 serves as a server, and intermediate node 110 connects a routing path from source node 100 to destination node 120.

In detail about the protocol stack structure mounted on each communication node in this role, the protocol stack mounted on the source, intermediate, and destination nodes 100, 110, and 120 supports peer-to-peer communication. Is composed of a wireless interface 101 having a wireless standard such as IEEE802.11a, IEEE802.11b, IEEE802.11g or Bluetooth, MAC layer 102, IP layer 103, and UDP layer 104.

In addition, BLSSA (Battery Lifetime and Signal Based Adaptive, BLSSA) considering battery level and signal stability of a communication node (intermediate and destination node) according to an embodiment of the present invention is IP (Internet Protocol) 103 and UDP. It is mounted in a layer (User Datagram Protocol) 104 to perform a multi-hop routing function, and the BLSSA routing table 106 related thereto is managed and operated in the IP layer 103.

The UDP / IP datagram for carrying BLSSA signal messages between communication nodes equipped with a protocol stack having such a structure will be described with reference to the accompanying drawings.

2 is a conceptual structural diagram of a UDP / IP datagram for carrying a BLSSA signal message according to an embodiment of the present invention.

As shown, the data structure of the UDP / IP datagram for transporting BLSSA control packets is the same as that used in the existing Internet (INTERNET), and the UDP transporting signaling messages when BLSSA routing is performed on an IP-based mobile adaptation network. / IP datagram structure.

That is, the IP datagram 200 includes an IP header 202 and a UDP datagram 201 area including a source port number, a destination port number, a UDP length field, and the like. UDP datagram 201 includes a UDP header 203 and a BLSSA composed of a source IP address and a destination IP address field. UDP data 204 field corresponding to the RREQ and RREP control packet region of the.

Next, the structure of the BLSSA routing table 106 in this regard will be described in detail with reference to the accompanying drawings.

3 is a diagram illustrating the structure of a BLSSA routing table entry according to an embodiment of the present invention.

As shown in FIG. 3, the entry 300 of the BLSSA routing table 106 according to an embodiment of the present invention is a destination node field (Destination IP Address) 302 and a destination node from a node managing the routing table entry. Next Node Address (301), which provides route configuration, Sequence Number (303), and Destination Node (302), which provides a way to solve loop-free problems of routing paths. Hop count field (Hop Count, 304), BLSSA signal message reception strength field (Signal Stability, 305), own battery level field (Battery Lifetime, 306), and whether the same RREQ message was received from the source node. The destination field of the RREQ control message (Destination IP Address of RREQ, 307) and the life cycle field (Route Lifetime, 308) of the routing entry are used.

Here, the structure of the routing request control packet (Routing Request Message, hereinafter referred to as RREQ) and the response control packet (Routing Response Message, hereinafter referred to as RREP) of the BLSSA will be described in detail with reference to the accompanying drawings.

4 is a diagram illustrating an RREQ / RREQ signal message structure of a BLSSA according to an embodiment of the present invention.

Referring to FIG. 4, the RREQ control packet Q includes a control packet type field (Type, 400), a reserved field for message structure scalability (Reserved, 401), and a hop number field for indicating the number of hops passed by the message. (Hop Count, 402), source IP address, sequence number field (RREQ ID, 403) that uniquely identifies the RREQ, destination IP address (404), and loop-free route resolution It includes a destination sequence number / origination IP address (405, 407) and a destination IP address (Origination Sequence Number, 406).

Next, the RREP control packet P includes a control packet type field (Type) 410, a reserved field for message structure scalability (Reserved) 411, and a hop count field for indicating the number of hops passed by the message. 412), Destination IP Address field 413, Origination IP Address field 415 that originally generated the RREQ, and Destination Sequence Number field for loop-free routing. Sequence Number (414), and a Life Time field (416) indicating a usefulness period of the control packet.

The flow of RREQ / RREQ control packets (Q, P) constituting this structure will be described in detail with reference to the accompanying drawings.

5 is a diagram illustrating a RREQ / RREP signal message flow of a BLSSA according to an embodiment of the present invention.

First, the BLSSA according to an embodiment of the present invention is a reactive routing protocol for maintaining routing information on a required path, and nodes that are not involved in the routing path from the source node 500 to the destination node 505 are selected. It is not included in the routing table.

In detail, when a path from the source node 500 to the destination node 505 is not made in advance, each communication node performs a path searching procedure. That is, the source node 500 broadcasts the RREQ to the neighbor nodes 501 and 502. When the neighbor nodes 501 and 502 have their battery level and the RREQ received signal stability exceeding the link quality threshold, the source node 500 again broadcasts the RREQ. By broadcasting to its neighbor nodes 503, a route search is performed.

Referring to FIG. 5, a flow diagram illustrating the propagation of an RREQ to a destination node 505 via a final relay node (D, 504), wherein intermediate nodes broadcast the packet while transmitting an RREQ control packet. By recording the address of a neighbor node in the routing table, a reverse path of the shortest distance is created, and subsequent RREQ control packets that are not the shortest distance received are discarded.

Through this, the BLSSA solves a loop-free using the source sequence number (302 of FIG. 3) of the RREQ and has the latest routing information.

On the other hand, when the RREQ control packet reaches the destination node 505 or reaches a node where a routing path to the destination node 505 already exists, when the battery level and the link quality threshold are exceeded, an RREP control packet is generated to transmit the RREQ. The RREP control packet is sent on the reverse path that was created. In the process of unicasting the RREP control packet to the source node, each pass-through node records the forward path in the routing table.

The routing path search and configuration procedure based on this will be described in detail with reference to the accompanying drawings.

6A through 6C are flowcharts sequentially illustrating routing path search and setup procedures considering battery levels and signal stability of a communication node according to an exemplary embodiment of the present invention.

6A to 6C, the source node (100 of FIG. 1), together with the process driving (S600) to update the data and initialize the routing entry of its own node (S601, S602) to generate the RREQ control packet, the packet In the reception waiting state, it is checked whether the UDP destination port of the IP datagram received from the UDP upper layer 104 (S603) is 654 (S604). If the UDP destination port is not 654, the RREQ is generated (S670), broadcasted to the neighbor node (S671), and then terminated (S672).

Meanwhile, when the RREQ control packet is received, the intermediate node initializes the data and updates the routing entry of its own node (S601 and S602) together with the routing process 600 to regenerate the RREQ (S601 and S602). The UDP destination port of the IP datagram received from the layer (S603) is checked (S604).

As a result of the check, if the UDP destination port is 654, after checking whether the received RREQ link quality exceeds the system limit (S605), and if the remaining battery capacity is sufficient (S606), if it is sufficient, the received RREQ control packet If the source sequence number is greater than or equal to the sequence number value of the corresponding routing entry, and the number of hops from the origin is one or more smaller than the hop number of the corresponding routing entry (S608), then the source IP address 406 of the RREQ is sent to the destination of the routing entry. An inverse path using the IP address 302 and the source IP address 202 of the IP datagram as the next node 301 is added to the routing table 116 (S609).

If, as a result of the check, a duplicate RREQ is not received (S610), and a route to the destination IP address does not exist in the routing table (S611), the received RREQ control packet is analyzed and a new procedure is generated. One RREQ is broadcast to the neighbor node (S621). On the other hand, if the check result is a duplicate RREQ, it does not broadcast the RREQ to the neighbor node (S630).

On the other hand, the RREQ control packet reception process proceeds with the routing process driving, updating data (S601 and S602) and initializing the routing entry of its own node (S601 and S602), and then receiving the UDP data of the IP datagram received from the UDP upper layer (S603) in the standby state. If the port is 654 (S604), the incoming RREP link quality is above the system limit (S605), and the remaining battery capacity is sufficient (S606), the hop count of the incoming RREP is equal to the hop count of the existing routing entry (304). If the target sequence number 405 is greater than or equal to the sequence value 303 recorded in the existing routing table, the routing entry value is updated (S641 and S642).

If the source IP address 415 of the receiving RREP is the same as its own IP address (602 IP) (S643), the forward path is updated in the routing table 106 and terminated. On the other hand, if the source IP address 415 of the receiving RREP is different from its IP address 602, after analyzing the receiving RREP to generate a new RREP (S644), the source IP address 415 of the RREP is determined from the IP datagram. Search for the routing entry 300 with the destination IP address 202, unicast the newly created RREP to the next IP address 301, and then terminate (S645, S646).

Next, when the RREQ control packet is received through this process, the generation procedure of the RREQ control packet in the case where a routing path to the destination address already exists (S611), the data initialization and the routing of its own node along with the driving of the routing process. If the UDP destination port of the IP datagram received from the UDP upper layer (S603) is 654 (S604) after updating the entries (S601 and S602), the limit of the reception RREQ link quality is limited by the system. When the value exceeds S605 and the remaining battery level S606 is sufficient, the source sequence number of the received RREQ control packet is greater than or equal to the sequence number value of the corresponding routing entry, and the hops from the source are 1 more than the hop number of the corresponding routing entry. If the abnormality is small (S608), the source IP address 406 of the RREQ is the destination IP address 302 of the routing entry, and the source IP address 202 of the IP datagram. A reverse path, which is set as the next node 301, is added to the routing table 116 (S609).

If the path to the destination IP address exists in the routing table instead of the duplicated RREQ (S610), the source IP address and the destination IP address fields of the received RREQ are interchanged (S614) and then replaced. The RREP is transmitted (S615) and ends with the IP address of the source IP address field as the destination (S616).

As described above, the mobile adaptive network routing method and the device considering the remaining battery power and signal stability of the communication node according to the embodiment of the present invention are stable by searching and setting the shortest routing path in consideration of the limit of the routing signal strength and the remaining battery power limit. It can extend the path maintenance and the life cycle of the mobile adaptation network.

The drawings and detailed description of the invention are merely exemplary of the invention, which are used for the purpose of illustrating the invention only and are not intended to limit the scope of the invention as defined in the claims or in the claims. Therefore, those skilled in the art will understand that various modifications and equivalent other embodiments are possible from this. Therefore, the true technical protection scope of the present invention will be defined by the technical spirit of the appended claims.

The mobile adaptive network routing method and the device considering the remaining battery capacity and signal stability of the communication node according to the present invention, by searching and setting the shortest distance routing path in consideration of the limit of the routing signal strength and the battery remaining limit, There is an effect that can extend the life cycle of the mobile adaptation network.

Claims (9)

A routing method of a mobile adaptive network in which communication nodes transmit and receive data through an air interface, a) classifying the source node, the intermediate node and the destination node according to each role of the communication node; b) generating a routing request signal message if a message transmission path from the classified source node to the destination node is not established; c) transmitting the generated routing request signal message to the destination node through the intermediate node; And d) when the routing request signal message is transmitted to the destination node, the intermediate and destination nodes generate and transmit a routing response signal message that satisfies the battery level limit and the signal strength to the source node in the reverse path made during the message transmission. Routing method of a mobile adaptive network comprising a. According to claim 1, Step b), The source node broadcasting the generated routing request signal message to at least one first neighboring node; And The first neighbor node broadcasting the routing request signal message to at least one or more second neighbor nodes in consideration of its battery level threshold and signal strength. Routing method of a mobile adaptive network comprising a. The method of claim 2, Step c) is Generating an inverse path of the shortest distance by recording the addresses of the first and second neighbor nodes broadcast by the intermediate node in a routing table; And The intermediate node discarding the routing request signal message that is not the shortest distance; Routing method of a mobile adaptive network comprising a. The method of claim 3, wherein In step d), When the destination and intermediate nodes send the generated routing response signal message to the source node, a plurality of waypoint nodes recording information about the forward path in the routing table. Routing method of a mobile adaptive network comprising a. The method of claim 4, wherein The routing request signal message, A routing method of a mobile adaptation network, comprising: a call / destination sequence (SEQUENCE) number field for loop-free path resolution. The method of claim 5, Step c) is And the latest routing information using the included source sequence number field. The method of claim 4, wherein The routing response signal message, And a life cycle field indicating the usefulness period of the signal message. A routing device of a mobile adaptive network in which communication nodes transmit and receive data through an air interface, A node classification unit classifying the source node, the intermediate node, and the destination node according to each role of the communication node; A message generator for generating a routing request signal message when a message transmission path from the classified source node to the destination node is not set; A message transmitter which transmits the generated routing request signal message to the destination node through the intermediate node; And When the routing request signal message is transmitted to the destination node, the intermediate and destination nodes generate and transmit a routing response signal message that satisfies the battery level threshold and the signal strength to the source node in the reverse path created during the message transmission. Routing device of a mobile adaptive network comprising a. A recording medium comprising a routing method of a mobile adaptive network in which communication nodes transmit and receive data through an air interface, a) a function of classifying a source node, an intermediate node and a destination node according to each role of the communication node; b) generating a routing request signal message if a message transmission path from the classified source node to the destination node is not set; c) transmitting the generated routing request signal message to the destination node through the intermediate node; And d) when the routing request signal message is transmitted to the destination node, the intermediate and destination nodes generate and transmit a routing response signal message that satisfies the battery level threshold and the signal strength on the reverse path created during the message transmission. The recording medium in which the program is stored.