KR101108934B1 - routing method based on location information for wireless ad-hoc network and apparatus thereof - Google Patents

Abstract

A location information based routing method and apparatus for a wireless ad-hoc network according to the present invention are disclosed. In the location-based routing method for a wireless ad-hoc network according to the present invention, the first node calculates a cost value that can consider location information and energy remaining for each of at least one neighboring node within its transmission range. Making; Calculating, by the first node, a first distance from itself to the second node and a second distance from the neighboring node to the second node; And selecting a next-hop node based on a cost value for the at least one neighboring node from which the first node is calculated, and the first distance and the second distance. Through this, the present invention can efficiently configure the path, prevent unnecessary energy consumption, extend the life of the entire network, and reduce the number of flooding to reduce the traffic of the entire network.

Wireless Ad-Hoc Networks, GPSR, Greedy Perimeter Stateless Routing, Greedy Forwarding, Nodes

Description

Routing method based on location information for wireless ad-hoc network and apparatus

The present invention relates to a location-based routing method and apparatus for a wireless ad-hoc network.

Unlike wired communication, wireless ad-hoc network communicates with its own nodes in the absence of infrastructure. In such a wireless communication environment, many considerations exist such as transmission range of a node and disconnection of a path due to frequent change of position. Wireless network nodes also have limited resources, so it is important to use these resources efficiently. One of the important factors to consider among the limited resources is the limited energy of each node.

1 is a first exemplary view for describing a location information based routing method and apparatus thereof according to the prior art.

As shown in FIG. 1, the greedy forwarding used in the conventional Greedy Perimeter Stateless Routing (GPSR) protocol always sets only the node closest to the destination as the next-hop network. Due to the communication, the energy consumption of a particular node tends to increase rapidly.

For example, the source node S sets a neighbor node A located closest to the destination node D among neighbor nodes located within its transmission area or transmission range as the next-hop.

As such, wireless ad-hoc networks must efficiently use the limited energy of each node in order to maximize network life. In greedy forwarding, the traffic to any particular node is chosen since it always selects the nearest node to the next hop. traffic is concentrated, resulting in a fast drain on the battery of that particular node. In other words, the energy of a specific node is consumed in a short time so that the specific node disappears from the path configuration of the wireless ad-hoc network, which causes the network to be disconnected. In addition, the number of available paths is reduced due to network withdrawal of a specific node, resulting in data transmission failure resulting in network imbalance.

2 is a second exemplary view for describing a location information based routing method and apparatus according to the related art.

As shown in FIG. 2, in the Energy Aware Greedy Perimeter Stateless Routing (EAGPSR) protocol according to the prior art, routing is selected based on the remaining energy of each node. That is, EAGPSR considers both aspects of the method of setting nodes closer to the destination of GPSR described in FIG. 1 as next-hop and the method of setting nodes with higher energy remaining in each node as next-hop. The method is called Energy Aware Greedy Forwarding (EAGF).

The path setting in this EAGF method considers the distance to the destination, and determines the Cost value which can also consider the remaining energy of the next-hop as shown in [Equation 1].

[Equation 1]

Cost (n _i , n _{i + 1} ) = L (n _{i + 1} ) / E (n _{i + 1} )

In this case, n _i denotes a node performing flooding, n _{i + 1} denotes a neighboring node located 1-hop distance from node n _i , and L (n _{i + 1} ) denotes a neighboring node. The distance from n _{i + 1} to the destination node, E (n _{i + 1} ) means the remaining energy of the neighbor node n _{i + 1} , respectively.

For example, when attempting to establish a path from the source node S to the destination node D, the source node S must select one neighbor node among neighbor nodes A and B located within its transmission range. At this time, the neighboring nodes A and B can be seen that the distance to the destination node is the same 300m, node A is 300J, node B has the remaining energy of 200J. Therefore, the cost value of each node has a value of A = 1 and B = 1.5 through Equation 1 above, so the source node S selects a node A having a low cost value as the next-hop to set the path. .

In addition, as shown in Equation 2 below, when the cost value exceeds the threshold value δ at the node n _i , a route repair (RR) message is transmitted to reset the path.

[Equation 2]

C _n -C _d ≥ δ

Here, C _n means a Cost value at the time of initial setting, and C _d means a Cost value after a predetermined time elapses.

3 is an exemplary diagram for explaining a principle of resetting a threshold based path according to the related art.

As shown in FIG. 3, when it is assumed that the threshold value δ is set to 1, (a) the source node S sets node A having a cost value of 1 as the next-hop at the time of initial path setting, and (b) a predetermined time. After the elapse of time, when Node A's Cost becomes 2, (c) Node A sends an RR message to Source Node S.

Then, (d) the source node S uses a different path by setting node B with cost value 1.5 as next-hop instead of node A with cost value 2 as next-hop. That is, node n _i will continue to use the existing path until another path is found, and if it cannot find another path, it will use only the path that was used until it consumed all its energy.

As such, the method for constructing a route using a Cost value has a problem that may be an inefficient route setting in constructing a route, which will be described with reference to FIG. 4.

4 is an exemplary view for explaining a principle of setting a path according to the prior art.

As shown in FIG. 4, when the node having the smallest cost value is selected as the next-hop, the source node S sets path A (S → A) by setting node A having the lowest cost value as 0.8 to the next-hop. → B → C → D).

Thus, in the prior art, both node A and node B are located within the transmission range of the source node S, so that the node with the lowest cost value is selected as the next-hop, but the source node S selects node B instead of node A as the next-hop. If selected, since a path such as path 2 (S → B → C → D) is configured, it can be confirmed that the number of hops constituting the path is smaller.

That is, it generates unnecessary energy consumption of the node, shortening the lifespan of the entire network.

5 is an exemplary view for explaining a void situation according to the prior art.

As shown in FIG. 5, in the case of establishing a path according to the existing EAGF method, when a node does not have a node closer to itself to the destination node within its transmission range, that is, when the Void situation occurs, the node may proceed further. You will not be able to do this, and you will have to get out of the Void situation and choose the next-hop again.

6 is an exemplary view for explaining a principle of setting a path in a void situation according to the prior art.

As shown in FIG. 6, when a node encounters a void condition, the flooding is performed within the range set to a limited HC (Hop Count) without flooding the entire network. ) Method. This LF method can reduce the energy consumption of the entire network by reducing the traffic (traffic) of the entire network as compared to the general flooding method.

&Quot; (3) "

Here, C _a means the weighted sum of the costs and C _i means the i th hop from the node facing the void situation.

After the HC is initially set and flooded to a node set up to the HC-hop, the node having a void state waits for an RR message for t time. So if you find a node closer to the destination node than the node facing the void situation, you will receive an RR message. However, if the RR message is not received until a certain time t, the set HC is increased by 1 to perform the flooding. This situation is repeated until it finds a node closer to the destination node than the node facing the void situation.

The present invention is to solve the problems of the prior art as described above, when setting the next-hop neighbor node using a cost value that can take into account the location information and energy remaining for each of the at least one neighboring node The present invention provides a location information-based routing method and apparatus for a wireless ad-hoc network that can efficiently configure a path by comparing a distance from a neighbor node to a destination node.

The present invention compares the distance between the source node and each of the neighbor nodes to the destination node when setting the next-hop neighbor nodes using the Cost value, thereby preventing unnecessary energy consumption for the wireless ad-hoc network. A location information based routing method and apparatus are provided.

The present invention compares the distance from the source node and each of the neighbor nodes to the destination node when selecting the next-hop neighbor node by using the Cost value, so that the wireless ad-hoc network can be extended. To provide a location-based routing method and apparatus therefor.

In addition, the present invention selects the next-hop neighbor node by using the Cost value, the node facing the void situation increases its transmission power to a certain size to extend the transmission range, reducing the number of fluding To provide a location-based routing method and apparatus for a wireless ad-hoc network that can reduce the traffic of the network.

To this end, a location-based routing method for a wireless ad-hoc network according to an aspect of the present invention may consider the location information and energy remaining for each of the at least one neighboring node whose first node is within its transmission range. Calculating a cost value; Calculating, by the first node, a first distance from itself to the second node and a second distance from the neighboring node to the second node; And selecting a next-hop node based on the cost value for the at least one neighboring node from which the first node is calculated, and the first distance and the second distance.

At this time, the cost value is calculated by the formula Cost (n _i , n _{i + 1} ) = L (n _{i + 1} ) / E (n _{i + 1} ), where n _i is the above N _{i + 1} refers to a neighboring node located 1-hop away from node n _i , and L (n _{i + 1} ) denotes the distance from neighboring node n _{i + 1} to a destination node. E (n _{i + 1} ) may mean the remaining energy of the neighbor node n _{i + 1} , respectively.

Preferably, the selecting of the next-hop node may include selecting a neighbor node having a lowest Cost value among neighboring nodes having a value less than or equal to the first distance if the first distance is less than the second distance. It is characterized by selecting as the node of the hop.

Preferably, the selecting of the next-hop node may include selecting a neighboring node having the lowest Cost value as the next-hop node if the first distance is greater than or equal to the second distance.

In addition, the invention further comprises the step of flooding the message to the next-hop node in which the first node is selected.

Preferably, the present invention includes the steps of increasing its transmit power by a certain amount when the first node is in a Void situation where there is no node closer to itself than the second node within its transmission range; And flooding the message by the first node throughout the wireless ad-hoc network.

At this time, the transmission power is calculated by the equation P _v = (R _v × (1 + 0.5 × i)) ² , where P _v represents the initial transmission power of the first node facing the Void situation , wherein R _v is characterized in that it represents the transmission range of the first node in the face of the Void situation.

Location-based routing device for a wireless ad-hoc network according to another aspect of the present invention calculates a Cost value that can take into account the location information and energy remaining for each of at least one neighboring node within its transmission range A first calculator; A second calculator for calculating a first distance from itself to the destination node and a second distance from the neighboring node and the destination node; And a selection unit for selecting a next-hop node based on the calculated Cost value for each of the at least one neighboring node, and the first distance and the second distance.

At this time, the cost value is calculated by the formula Cost (n _i , n _{i + 1} ) = L (n _{i + 1} ) / E (n _{i + 1} ), where n _i is the above N _{i + 1} refers to a neighboring node located 1-hop away from node n _i , and L (n _{i + 1} ) denotes the distance from neighboring node n _{i + 1} to a destination node. E (n _{i + 1} ) means the remaining energy of the neighbor node n _{i + 1} , respectively.

Preferably, when the first distance is less than the second distance, the selector selects a neighbor node having the lowest Cost value among the neighbor nodes having a value less than or equal to the first distance as the next-hop node. do.

Preferably, the selector selects a neighbor node having the lowest Cost value as the next-hop node when the first distance is greater than or equal to the second distance.

In addition, the present invention is characterized in that it further comprises a processing unit for flooding the message to the selected next-hop node.

Advantageously, if there is a Void situation where there is no node closer to itself to the second node within the transmission range, increase its transmission power by a certain amount, and increase the wireless ad-hoc according to the increased transmission power. And a processing unit for flooding the data over the entire network.

At this time, the transmission power is calculated by the equation P _v = (R _v × (1 + 0.5 × i)) ² , where P _v represents the initial transmission power of the first node facing the Void situation , wherein R _v is characterized in that it represents the transmission range of the first node in the face of the Void situation.

Hereinafter, a location information based routing method and apparatus for a wireless ad-hoc network according to an embodiment of the present invention will be described in detail with reference to FIGS. 7 to 15. That is, the present invention uses a method that considers both aspects of the method of setting the node closer to the destination node as the next-hop and the method of setting the node having the high energy remaining of each node to the next-hop.

In particular, the present invention selects the next-hop neighbor node using a cost value that can consider the location information and energy remaining for each of the at least one neighbor node, the distance from the source node to the destination node and the destination node from the neighbor node The distance to the nodes is compared and the next-hop neighbor node is selected based on the result of the comparison.

In the Energy Aware Greedy Perimeter Stateless Routing (EAGPSR) protocol according to the present invention, routing is basically applied in a manner of selecting each node considering the remaining energy of each node when selecting a next-hop. That is, EAGPSR considers both aspects of the method of setting nodes closer to the destination of GPSR described in FIG. 1 as next-hop and the method of setting nodes with higher energy remaining in each node as next-hop. The method is called Energy Aware Greedy Forwarding (EAGF).

The path setting in this EAGF method determines the cost value considering the distance to the destination and the remaining energy of the next hop as shown in [Equation 1]. The hop is selected to set the path.

To this end, the present invention selects the next-hop neighbor node, and compares the distance L (n _i ) from the source node to the destination node and the distance L (n _{i + 1} ) from the neighbor node to the destination node. Based on the result, we want to select the next-hop neighbor node.

7 is an exemplary view for explaining an improved EAGF method according to an embodiment of the present invention.

As shown in FIG. 7, in Figure (a), when the cost value of node A is 1 and the cost value of node B is 0.8, the distance L (n _i ) from the source node S to the destination node D is assumed. Is 300m and the distance L (n _{i + 1} ) from the node B to the destination node is 200m and L (n _i ) ≥ L (n _{i + 1} ), the node B is finally selected according to the Cost value.

In Figure (b), assuming that the cost value of node A is 0.8 and the cost value of node B is 1, the distance L (n _i ) from source node S to destination node D is 300m and destination from node A When the distance L (n _{i + 1} ) to the node is 320m and L (n _i ) <L (n _{i + 1} ), the node with the lowest cost value among the nodes having a distance L (n _i ) or less B is finally selected.

8 is an exemplary diagram for explaining a principle of setting a path in a void situation according to a temporary embodiment of the present invention.

As shown in FIG. 8, the present invention intends to propose a method for reducing the number of times of flooding than the conventional limited flooding (LF), and reduces energy usage unnecessarily due to the reduced flooding to reduce energy of the entire network. Reduce consumption

As a method for reducing the number of such flooding, LRF (Limited Range Flooding) is used. The following Equation 4 is used as follows.

&Quot; (4) &quot;

P _v = (R _v × (1 + 0.5 × i)) ²

Here, P _v may represent initial transmission power of a node in a void state, and R _v may indicate a transmission range of a node facing a void state.

That is, a node in a void situation increases its transmission range by increasing its transmit power by a factor of 0.5. This increased transmission range solves the void situation.

This is because after performing the fluctuation to the increased transmission range as in the conventional method, a node with a void condition waits for an RR message for t time. If it finds a node closer to the destination node than the node facing the void condition, it will receive an RR message. However, if the RR message is not received until a predetermined time t, i is increased by 1 to increase the transmission power by 0.5 times to perform the flooding. This situation is repeated until it finds a node closer to the destination node than the node facing the void situation.

Hereinafter, the EAGF technique and the LRF technique of the improved EAGPSR protocol are applied to one simulation situation in the present invention. In other words, the network simulator NS-2 was used to evaluate the effectiveness of the proposed routing method, focusing on network performance, especially network life time. When the energy consumption of each node was consumed, it was designated as network leaving of the node, and performance evaluation was performed by comparing and analyzing the occurrence times of nodes leaving the network according to time in GPSR, EAGPSR, and the improved EAGPSR protocol.

First, in the wireless ad-hoc network, 50 nodes are placed in a plane space of 1 km ² , each node's transmission range is set to 100 m, and the initial energy and transmit and receive power are respectively shown in Table 1 below. Setting, the simulation was run for a total of 8000 seconds.

[Table 1]

division Set value Network size (m × m) 1000 × 1000 Number of nodes 50 Simulation time (sec) 8000 Node Initial energy (J) 1000 Transmit power (w) 1.6 Receiving power (w) 1.3 Standby power (w) 0.1

9 is a first graph illustrating the number of nodes leaving a network according to an embodiment of the present invention.

As shown in FIG. 9, the performance of the conventional EAGF method and the proposed EAGF method is shown. In the proposed method, the interval between occurrences of nodes or dead nodes leaving the network increases. You can check it.

10 is a second graph showing the number of nodes leaving the network according to an embodiment of the present invention.

As shown in FIG. 10, the performance evaluation of the conventional LF method and the proposed LRF method is shown. The first node leaving the network is generated earlier in the proposed LRF method than the existing LF method in the Void situation. This is caused by an increase in the transmit power of the node in question. However, it can be seen that the performance of the entire network is further increased because the energy usage of a particular node is increased only for a certain time.

11 is a third graph illustrating the number of nodes leaving a network according to an embodiment of the present invention.

As shown in FIG. 11, the proposed two methods, that is, the generation time of the node leaving the network by comparing the protocols of EAGPSR and the existing EAGPSR and GPSR, which are improved overall by the EAGF technique and the LRF technique. As can be seen from the figure, it can be seen that the time taken for each node to leave the network increases by reducing the energy consumption of the nodes of the EAGPSR, which is an improvement over the existing EAGPSR.

In addition, as the number of nodes leaving the network increases, the time difference between GPSR and EAGPSR increases, and the interval between network exit times between the existing EAGPSR and the improved EAGPSR increases. .

12 is a fourth graph showing the number of nodes leaving the network according to an embodiment of the present invention.

As shown in FIG. 12, the gain in time is shown in the number of nodes leaving the network of the improved EAGPSR. First, it can be seen that the network leave time of the improved EAGPSR is shorter than that of the existing EAGPSR only at the node leaving the network. In the EAGPSR, which is an improvement over the existing EAGPSR, the occurrence time of the node leaving the network is about 165 seconds slower on average.

13 is a graph showing the average number of hops to a destination node according to an embodiment of the present invention.

As shown in FIG. 13, the average number of hops of the path configuration of the GPSR, the existing EAGPSR, and the improved EAGPSR is compared. It can be seen that the improved EAGPSR using the method of constructing a route by selecting a node closer to the destination than the existing EAGPSR generates fewer average hops for establishing a route.

14 is a graph illustrating end-to-end delay according to an embodiment of the present invention.

As shown in FIG. 14, the end-to-end delay before the node leaving the initial network is almost the same as the improved EAGPSR and the existing EAGPSR, but it is confirmed that the end-to-end delay characteristics of the proposed EAGPSR improve over time. Can be.

As such, the present invention maximizes network life, reduces network paths due to rapid energy consumption of specific nodes, and eventually considers remaining energy in the greedy forwarding scheme of GPSR to prevent network disconnection. As an improved EAGPSR with methods for solving the problem, the improved EAGPSR can be confirmed that the network withdrawal time of the entire node is slowed down, as can be seen from the simulation using ns-2 of FIGS. 9 to 14.

15 is an exemplary diagram illustrating a configuration of a node in a wireless ad-hoc network according to the present invention.

As shown in FIG. 15, any node in the wireless ad-hoc network according to the present invention may include a first calculator 1510, a second calculator 1520, a selector 1530, a processor 1540, and the like. It may include.

The first calculator 1510 calculates a Cost value that can consider location information and energy remaining of each of the at least one neighboring node within its transmission range, and the second calculator 1520 is configured from itself to the destination node. The first distance and the second distance between the neighboring node and the destination node can be calculated.

The selector 1530 may select the next-hop node based on the calculated Cost value for each of the at least one neighboring node and the first distance and the second distance. That is, if the first distance is less than the second distance, the selector 1530 may select a neighbor node having the lowest Cost value among the neighbor nodes having a value less than or equal to the first distance as a next-hop node. On the other hand, if the first distance is greater than or equal to the second distance, the selector 1530 may select a neighbor node having the lowest Cost value as the next-hop node.

The processor 1540 may flood the message to the selected next-hop node. In addition, when the first node is in a Void situation where there is no node closer to itself than the second node within its transmission range, the processing unit 1540 increases its transmission power by a certain amount, and the first node is wireless. Messages can be flooded across ad-hoc networks.

As described above, when the next-hop neighbor node is configured using a cost value that can consider location information and energy remaining of each of the at least one neighbor node, the distance from the source node and each neighbor node to the destination node is determined. By comparing, we can efficiently route, avoid unnecessary energy consumption, and extend the life of the entire network.

In addition, the present invention selects the next-hop neighbor node by using the Cost value, the node facing the void situation increases its transmission power to a certain size to extend the transmission range, reducing the number of fluding It can reduce the traffic of the network.

Location-based routing method and apparatus for a wireless ad-hoc network according to the present invention can be modified and applied in various forms within the scope of the technical idea of the present invention and is not limited to the above embodiments. In addition, the embodiments and drawings are merely for the purpose of describing the contents of the invention in detail, not intended to limit the scope of the technical idea of the invention, the present invention described above is common knowledge in the technical field to which the present invention belongs As those skilled in the art can have various substitutions, modifications, and changes without departing from the technical spirit of the present invention, it is not limited to the above embodiments and the accompanying drawings, of course, and not only the claims to be described below but also claims Judgment should be made including scope and equivalence.

1 is a first exemplary view for explaining a location information-based routing method and apparatus according to the prior art,

2 is a second exemplary view for explaining a location information based routing method and apparatus according to the prior art;

3 is an exemplary view for explaining a principle of resetting a threshold based path according to the prior art;

4 is an exemplary view for explaining a principle of setting a path according to the prior art,

5 is an exemplary view for explaining a void situation according to the prior art,

6 is an exemplary diagram for explaining a principle of setting a path in a void situation according to the prior art;

7 is an exemplary view for explaining an improved EAGF method according to an embodiment of the present invention,

8 is an exemplary diagram for explaining a principle of setting a path in a void situation according to a temporary embodiment of the present invention;

9 is a first graph illustrating the number of nodes leaving a network according to an embodiment of the present invention.

10 is a second graph showing the number of nodes leaving the network according to an embodiment of the present invention.

11 is a third graph showing the number of nodes leaving the network according to an embodiment of the present invention.

12 is a fourth graph showing the number of nodes leaving the network according to an embodiment of the present invention;

13 is a graph showing the average number of hops to a destination node according to an embodiment of the present invention,

14 is a graph illustrating end-to-end delay according to an embodiment of the present invention.

15 is an exemplary diagram illustrating a configuration of a node in a wireless ad-hoc network according to the present invention.

<Description of Symbols for Main Parts of Drawings>

1510: first calculating unit

1520: second calculation unit

1530: selection

1540: processing unit

Claims (14)

A method for routing from a first node to a second node in a wireless ad-hoc network, the method comprising: Calculating a cost value that allows the first node to consider location information and energy remaining for each of at least one neighboring node within its transmission range; Calculating, by the first node, a first distance from itself to the second node and a second distance from the neighboring node to the second node; And Selecting a node of a next-hop based on a cost value for the at least one neighboring node from which the first node is calculated, and the first distance and the second distance, Selecting the next-hop node, A location for a wireless ad-hoc network that selects, as the next-hop node, the neighboring node having the lowest cost value among the neighboring nodes having a value less than or equal to the first distance if the first distance is less than the second distance. Information-based routing method. The method according to claim 1, The Cost value is Calculated by the equation Cost (n _i , n _{i + 1} ) = L (n _{i + 1} ) / E (n _{i + 1} ), Where n _i denotes the first node to be flooded, n _{i + 1} denotes a neighboring node located 1-hop away from node n _i , and L (n _{i + 1} ) denotes a neighboring node means the distance from the n _{i + 1} to the destination node, and, E (n _{i + 1)} is a wireless ad characterized in that the mean energy level of the neighboring node n _{i + 1} respectively - the location based for hoc network Routing method. delete The method according to claim 1 or 2, Selecting the next-hop node, If the first distance is greater than or equal to the second distance, the location information-based routing method for a wireless ad-hoc network, characterized in that for selecting the neighbor node having the lowest Cost value as the next-hop node. The method according to claim 1 or 2, Flooding the message to the next-hop node selected by the first node Location-based routing method for a wireless ad-hoc network, characterized in that it further comprises. The method according to claim 1 or 2, If the first node is in a Void situation where there is no node closer to itself to the second node within its transmission range, increasing its transmit power by a certain amount; And The first node flooding the message across the wireless ad-hoc network Location-based routing method for a wireless ad-hoc network, characterized in that it further comprises. The method according to claim 6, The transmission power is, Calculated by the equation P _v = (R _v × (1 + 0.5 × i)) ² , Here, the P _v represents the initial transmission power of the first node facing the Void situation, and the R _v represents the transmission range of the first node facing the Void situation. Location-based routing method for. An apparatus for routing to a given destination node in a wireless ad-hoc network, the apparatus comprising: A first calculator configured to calculate a cost value for considering location information and energy remaining of each of at least one neighboring node within its transmission range; A second calculator for calculating a first distance from itself to the destination node and a second distance from the neighboring node and the destination node; And A cost value for each of the calculated at least one neighboring nodes, and a selection unit for selecting a next-hop node based on the first distance and the second distance, The selection unit, A location for a wireless ad-hoc network that selects, as the next-hop node, the neighboring node having the lowest cost value among the neighboring nodes having a value less than or equal to the first distance if the first distance is less than the second distance. Information-based routing device. The method of claim 8, The Cost value is Calculated by the equation Cost (n _i , n _{i + 1} ) = L (n _{i + 1} ) / E (n _{i + 1} ), Where n _i denotes the first node to be flooded, n _{i + 1} denotes a neighboring node located 1-hop away from node n _i , and L (n _{i + 1} ) denotes a neighboring node means the distance from the n _{i + 1} to the destination node, and, E (n _{i + 1)} is a wireless ad characterized in that the mean energy level of the neighboring node n _{i + 1} respectively - the location based for hoc network Routing device. delete The method according to claim 8 or 9, The selection unit, If the first distance is greater than or equal to the second distance, the location-based routing device for a wireless ad-hoc network, characterized in that for selecting the neighbor node having the lowest Cost value as the next-hop node. The method according to claim 8 or 9, A processor for flooding the message to the selected next-hop node Location-based routing device for a wireless ad-hoc network, characterized in that it further comprises. The method according to claim 8 or 9, In a Void situation in which there is no node closer to itself to the second node within the transmission range, increase its transmission power by a certain amount and increase the transmission power to the entire wireless ad-hoc network according to the increased transmission power. Processing unit for flooding data Location-based routing device for a wireless ad-hoc network, characterized in that it further comprises. The method of claim 13, The transmission power is, Calculated by the equation P _v = (R _v × (1 + 0.5 × i)) ² , Here, the P _v represents the initial transmission power of the first node facing the Void situation, and the R _v represents the transmission range of the first node facing the Void situation. Location-based routing device for.

Images