KR20110094544A - Wireless sensor and wireless ad-hoc network using ligr algorithm - Google Patents

Abstract

PURPOSE: A wireless sensor and a wireless ad-hoc network using an LIGR(Location Information-based Gradient Routing) algorithm is provided to partly establish routing path by determining a transmitting direction and search range. CONSTITUTION: An RPM(Region Partitioning Module) determines a transmission direction and a search range. The RPM selects a forwarding node by performing search. The RPM transmits a data packet. An ELM(Energy Level Module) checks an energy level after completing the data packet transmission. The ELM broadcasts the determined result in order to correct the neighboring node table.

Description

Wireless Sensor and Wireless Ad-hoc Network Using LIGR Algorithm}

The present invention relates to a wireless sensor and a wireless ad hoc network using the LAI algorithm, and more particularly, to determine a forwarding node according to the energy level of the sensor node, determine a transmission direction and a search range, and partially set a routing path. The present invention relates to a wireless sensor and a wireless ad hoc network using the LAI algorithm which can guarantee the packet reception rate and reduce the occurrence of unnecessary traffic for routing.

Recently, there is a great interest in the technology for realizing the ubiquitous environment, which refers to an information and communication environment in which users can freely access the network anytime, anywhere, and anytime, anywhere, regardless of network or computer. .

In the core technology of the ubiquitous environment, each sensor node functions as a data collection node, and at the same time, a wireless ad hoc network that functions as a router for autonomously configuring and transmitting and transmitting the collected data. Ad-hoc network technology is included.

Data transmission and reception in a wireless ad hoc network has a limited energy and limited transmission range, unlike a wired network environment in which physical infrastructure such as cables, routers, bridges, and the like exist, and thus communication is performed in a multi-hop manner.

Therefore, the wireless ad hoc network should be able to construct the network autonomously by making the most of the information and resources that each sensor node can have, and the characteristics of the wireless ad hoc network with limited resources can be used effectively to extend network life and maintain the environment. It should be configured to allow.

Routing protocols for wireless ad hoc networks can be classified according to routing method or network structure. Among them, Logical Grid Routing (LGR) protocol proposed for surveillance reconnaissance in Exscal (Extreme Scale) project is used. It is possible to apply effectively on the sensor field with evenly distributed sensor nodes.

The LGR protocol is a routing protocol between sensor nodes and a base station for data collection. The protocol is small and simple, and builds a spanning tree that is the root and through the spanning tree. And transmit the collected data to the base station. In the LP protocol, every sensor node has a unique ID in two dimensions, and sensor nodes except the base station calculate their potential parent of the extension tree using their ID.

For example, the LG protocol is one of the potential parents of the sensor node (i, j) when the sensor node (i, j) is setting the sensor node (x, y) as a parent (parent). If a connected message is received from an in-sensor node x ', y', the sensor node i, j sets the sensor node x ', y' as its new parent. In addition, each sensor node has a potential parent, and the base station periodically transmits a connected message, and as a data transmission method, a connected message uses broadcast and collected data is unicast. Use unicast.

However, the LGR protocol increases the energy usage rate of the forwarding node due to the nature of the routing protocol, and there is no problem in that it cannot faithfully perform its function as a host thereafter.

In addition, sensor nodes in a sensor network may not be arranged at regular intervals and at a certain location due to geographic or environmental factors such as slopes and obstacles, depending on applications such as areas where people are difficult to access or disaster relief. The LGR protocol using the logical location information of the existing sensor node is not applicable in such an environment, and there is an increasing need for a mechanism for overcoming this.

Furthermore, as the energy utilization rate of the forwarding node increases, there is an urgent need for a routing routing mechanism that allows various routing paths to take into account energy levels.

The present invention has been made in view of the above points, and the routing can be applied even in a situation where sensor nodes are not evenly distributed due to geographical characteristics by extending the LGR protocol using physical location information. We propose a new algorithm, LGI (Locaton Information-based Gradient Routing) algorithm, and determine the forwarding node according to the energy level of the sensor node, and determine the transmission direction and search range to partially set the routing path. It is to provide a wireless ad hoc network using the LG algorithm which can be, and its purpose.

In addition, another object of the present invention is to apply the forwarding node selection priority according to the energy level of each sensor node when transmitting the data packet from the sensor node that collected the data to the destination node selected for the ad-hoc (Ad-hoc) It is to provide a wireless ad hoc network using the LAI algorithm which solves the problem of energy usage concentration.

Another object of the present invention is to provide a routing message transmission method for exchanging logical location information for constructing a spanning tree in an LGR protocol using an LGR algorithm, which is a location-based gradient routing algorithm. Using the LG algorithm, which extends the DIR (compass routing) method to exchange physical location information and minimize the spatial distance by selecting nodes adjacent to the paths of the data collection node and the destination node as forwarding nodes. To provide a wireless ad hoc network.

Furthermore, another object of the present invention is to use a neighbor node table that inputs an energy level of a neighbor node and a wireless algorithm using an EL algorithm that efficiently selects a path to transmit a received data packet using an LIGR algorithm. It is to provide a sensor.

In an embodiment of the wireless ad hoc network using the LG algorithm according to the present invention, when a data packet is received at each source node, a check is performed on whether a packet is retransmitted request and retransmitted. In the case of a request packet, a Retransmitting Request Module (RRM) which processes a process of deleting an ID of a related node from a neighbor node information table, a transmission direction and a search range is determined and searched. Region Partitioning Module (RPM) that handles the process of selecting a forwarding node and transmitting data packets, and after completing the transmission of data packets, examines and determines its energy level. The process of modifying the neighbor node table in the neighbor node by transmitting it to the neighbor node through broadcast. Comprising one; (Energy Level Module ELM) energy level module for processing.

When receiving the data packet from each source node, the retransmission request module (RRM) checks whether the packet is a retransmission request, checks whether the node has generated the data packet, and then retransmits the packet. If it is received, the node that receives it simply deletes the retransmission request ID from its neighbor node table if it exists, and even if the originating node of the received data packet is itself, the ID of the previous node in the neighbor node table. Perform the process of deleting.

The regional partitioning module (RPM) checks whether a destination node exists in its neighbor node table, and if the destination node exists in the neighbor node table, sets the destination node as the next hop, and The first search range for finding and selecting the transmission direction and forwarding node having the shortest distance through the slope of the straight line connecting the two nodes using the location information and the location information of the destination node. And the second search range, the neighboring node located in the first search range is selected as the forwarding node that is the closest to the shortest path, and the second search range if the forwarding node is not selected in the first search range. Selects the neighboring node closest to the shortest path as the forwarding node, and the data packet is a retransmission request packet. Determines the transmission direction through the slope with the previous node in the secondary search range, selects the neighboring node farthest in the path with the previous node as the forwarding node, and sends the data packet to itself if the forwarding node is not selected. Select the previous node as a forwarding node, request retransmission by putting its ID (retransmission ID) in the packet, and if the forwarding node is selected, the ID of the previous node that has transmitted the data packet to respond to the retransmission request from the selected forwarding node. A routing caching operation for storing and managing the ID in its neighbor node table is performed and a data packet is transmitted to the selected forwarding node.

In the above case, when the neighboring node that is the nearest to the shortest path among the neighboring nodes located in the primary search range is an energy shortage node, it is given a priority priority and is not selected as a forwarding node. If the neighboring node that is closest to the shortest path is the low energy node, it is given a priority priority and is not selected as a forwarding node, and if the forwarding node is not selected in the primary search range and the secondary search range, the previously set 2 The second or third node is selected as a forwarding node depending on whether the priority node and the third node exist.

If the second and third nodes do not exist and the node collects data, the neighboring node farthest from the shortest path in the search range except the first search range and the second search range is referred to as the forwarding node. Choose.

The energy level module completes the transmission and forwarding of the data packet, and then performs its own energy level check. If the energy level check indicates that the energy level is 20% or less of the initial energy, the user's ID ( ID) and energy level are broadcasted to neighboring nodes through a broadcast, and the neighboring node that receives this checks the energy level, registers the ID of the received neighboring node as an energy shortage node, and checks the energy level. As a result, if his energy level is less than 5% of the initial energy, his ID and energy level are broadcasted to the neighbor node through broadcast, and the neighboring node receiving the energy level checks the energy level. energy exhaustion node) and receives the ID of the neighbor node. Deletes from the table and low energy node table.

In addition, when the energy level module receives the information on the energy level check result from the neighbor through a broadcast, the process of modifying the information of its neighbor node table and the energy depletion node table is similarly performed.

Furthermore, in the embodiment of the wireless sensor using the LG algorithm according to the present invention, upon receiving the data packet, the wireless sensor performs a check on whether the packet is retransmitted and, in the case of the retransmission request packet, receives the data packet received from its neighbor node table. A retransmission request module (RRM) that processes the process of deleting the ID of the related node that has been transmitted, and an area that processes the process of selecting the forwarding node and transmitting the data packet by determining the transmission direction and the search range and performing the search. After completing the transmission of the splitting module (RPM) and the data packet, the energy that checks and determines its energy level and transmits it to the neighbor node through broadcast to guide the neighbor node to modify the neighbor node table. It comprises a level module (ELM).

When the data packet is received, the retransmission request module (RRM) checks whether the packet is a retransmission request, checks whether the node has generated the data packet, and if the retransmission packet is received, its neighbor node. Deletes the ID of the previous node that sent the received data packet from the table, and the ID of the previous node that sent the received data packet in its neighbor node table even if the received data packet is the data packet that it created. Perform the process of deleting it.

The regional partitioning module (RPM) checks whether a destination node exists in its neighbor node table, and if the destination node exists in the neighbor node table, sets the destination node as the next hop, and The first search range for finding and selecting the transmission direction and forwarding node having the shortest distance through the slope of the straight line connecting the two nodes using the location information and the location information of the destination node. And the second search range, the neighboring node located in the first search range is selected as the forwarding node that is the closest to the shortest path, and the second search range if the forwarding node is not selected in the first search range. Selects the neighboring node closest to the shortest path as the forwarding node, and the data packet is a retransmission request packet. Determines the transmission direction through the slope with the previous node in the secondary search range, selects the neighboring node farthest in the path with the previous node as the forwarding node, and sends the data packet to itself if the forwarding node is not selected. Select the previous node as a forwarding node, request retransmission by putting its ID (retransmission ID) in the packet, and if the forwarding node is selected, the ID of the previous node that has transmitted the data packet to respond to the retransmission request from the selected forwarding node. A routing caching operation for storing and managing the ID in the neighbor node table is performed and a data packet is transmitted to the selected forwarding node.

The energy level module completes the transmission and forwarding of the data packet, and then performs its own energy level check. If the energy level check indicates that the energy level is 20% or less of the initial energy, the user's ID ( ID) and energy level is broadcasted to neighboring nodes to guide them to register as energy deficient nodes.If the energy level check shows that the energy level is less than 5% of the initial energy, the ID and energy Broadcasts the level to the neighbor node by broadcasting it to treat it as an energy exhaustion node, and when the information on the energy level is received through the broadcast from the neighbor node, it modifies the information in its neighbor node table and the low energy node table. To perform.

According to an embodiment of the wireless sensor and the wireless ad hoc network using the LG algorithm according to the present invention, the data is collected in a static environment, and the node ID (ID), location information, energy information, speed information, time, etc. It is possible to check the physical location information and energy level of the routing message transmission method in the LGR protocol that is more suitable for the static environment than the identification of the neighbor node through the periodic beacon message containing the information. Since it is configured to identify neighboring nodes by extending to, it is possible to apply not only the environment where sensor nodes are evenly distributed but also irregularly distributed using the physical location information of each sensor node.

In addition, according to the embodiment of the wireless ad hoc network using the LG algorithm according to the present invention, the partial routing path setting using only the location information does not generate a separate traffic for the path setting, it is necessary to maintain the network with limited energy By distributing energy usage by knowing the energy levels of neighboring nodes in the sensor network, it is possible to increase energy efficiency and performance as a host.

According to an embodiment of the wireless ad hoc network using the LG algorithm according to the present invention, the transmission direction and the search range for the selection of the forwarding node are determined by using the location coordinates of each collection node and the location coordinates of the destination node, Since the sensor node located in the distance path is selected as the forwarding node, it is possible to provide a mechanism for reducing the path search time and the packet propagation delay time.

Furthermore, according to an embodiment of the wireless sensor and the wireless ad hoc network using the LG algorithm according to the present invention, it is possible to manage and route neighbor nodes through energy level broadcast and routing caching by energy level recognition. Therefore, it is possible to guarantee the reception rate of the data packet by providing a mechanism to partially bypass the energy exhaustion node or even the neighbor node in the transmission path.

1 is a block diagram illustrating an operation process of an embodiment of a wireless ad hoc network using the LIG algorithm according to the present invention.
2 is a flowchart illustrating an operation process of an embodiment of a wireless sensor and a wireless ad hoc network using the LIG algorithm according to the present invention.
3 to 8 are conceptual diagrams for explaining a process of selecting a forwarding node in a regional segmentation module in an embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention.
9 to 29 are graphs showing the results of performing network simulation and performance evaluation for one embodiment of the wireless ad hoc network using the LG algorithm according to the present invention and the conventional LG protocol.
9 is a graph showing the degree of improvement (performance) of the performance of one embodiment of the wireless ad hoc network using the LG algorithm according to the present invention in comparison with the conventional LG protocol when the initial energy is 1 Joule.
10 is a graph showing the reception rate of each node of the conventional LG protocol when the initial energy is 1 Joule.
FIG. 11 is a graph illustrating a reception rate for each node of an embodiment of the wireless ad hoc network using the LIG algorithm according to the present invention when the initial energy is 1 Joule.
12 is a graph showing the degree of improvement (performance) of the performance of one embodiment of the wireless ad hoc network using the LG algorithm according to the present invention compared to the conventional LG protocol when the initial energy is 5 Joule.
13 is a graph showing the reception rate of each node of the conventional LG protocol when the initial energy is 5 Joule.
14 is a graph showing the reception rate for each node of an embodiment of the wireless ad hoc network using the LAI algorithm according to the present invention when the initial energy is 5 Joule.
FIG. 15 is a graph showing an embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention and an average reception rate of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 0.3 seconds (sec).
FIG. 16 is a graph illustrating an embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention and an average reception rate of a conventional DSDC protocol and an AODV protocol when data packets are generated at 0.5 second intervals.
FIG. 17 is a graph showing an embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention and average reception rates of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 1.0 second (sec).
18 is a graph illustrating an exemplary embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention and average delay times of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 0.3 seconds (sec). .
19 is a graph illustrating an exemplary embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention and an average delay time of a conventional DSDC protocol and an AODV protocol when a data packet is generated and tested at an interval of 0.5 seconds (sec). .
20 is a graph showing an embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention and average delay times of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 1.0 second (sec). .
FIG. 21 is a graph illustrating an embodiment of a wireless ad hoc network using an LG algorithm according to the present invention and a network throughput of a conventional DSDC protocol and an AODV protocol when a data packet is generated at 0.3 second intervals.
FIG. 22 is a graph illustrating an embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention and a network throughput of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at an interval of 0.5 seconds (sec).
FIG. 23 is a graph illustrating an embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention and a network throughput of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 1.0 second (sec).
FIG. 24 is a graph illustrating an embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention and a network participation rate of a conventional DSDC protocol and an AODV protocol when a data packet is generated at 0.3 second intervals.
FIG. 25 is a graph illustrating an embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention and a network participation rate of a conventional DSDC protocol and an AODV protocol when a data packet is generated at 0.5 second intervals.
FIG. 26 is a graph illustrating an embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention and a network participation rate of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 1.0 second (sec).
FIG. 27 is a graph illustrating an embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention and average residual energy of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 0.3 seconds (sec). .
FIG. 28 is a graph illustrating an embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention and average residual energy of a conventional DSDC protocol and an AODV protocol when a data packet is generated at 0.5 second intervals and tested. .
FIG. 29 is a graph illustrating an embodiment of a wireless ad hoc network using an LAI algorithm according to the present invention and average residual energy of a conventional DSDC protocol and an AODV protocol when data packets are generated and tested at intervals of 1.0 second (sec). .

Next, a preferred embodiment of a wireless sensor and a wireless ad hoc network using the LIG algorithm according to the present invention will be described in detail with reference to the accompanying drawings.

First, an embodiment of the wireless ad hoc network using the LG algorithm according to the present invention includes a retransmission request module (RRM), a regional partition module (RPM), and an energy level module (ELM), as shown in FIG. Is done.

The retransmission request module (RRM), the regional division module (RPM), and the energy level module (ELM) constitute a LAG (Locaton Information-based Gradient Routing) algorithm as shown in FIG.

Hereinafter, the processing of the retransmission request module RRM, the region splitting module RPM, and the energy level module ELM will be described with reference to FIGS. 1 and 2.

When the RRM receives a data packet at each source node, the RRM checks whether the packet is a retransmitted request, and if it is a retransmission request packet, the neighbor node table. Process to delete the ID of the relevant node from the (neighbor node information table).

First, when the data transmission packet is received at each source node, the retransmission request module RRM checks whether the packet is retransmission request.

In the above, the source node is one of the sensor nodes, and is defined as a source node when receiving a data packet and as a neighbor node when not receiving a data packet.

The sensor nodes functioning as each source node know their physical location (the location set or defined by the ID of each sensor node) through the GPS device, and the data using a fixed type of sensor node. Collect it.

Each source node determines whether the received data packet is a retransmission request packet by checking whether the received data packet includes a retransmission request ID.

As a result of the above checking, if a retransmission packet (retransmission request packet) is received, the node (source node) receiving the retransmission packet is simply selected from the corresponding table when a retransmission request ID exists in its neighbor node information table. Delete the ID of the node (sensor node that sent the data packet to itself).

The retransmission request module (RRM) checks whether the source node that received the data packet is the node that generated the data packet.

 Even if the generation node of the data packet received by the self is itself, the process of deleting the ID of the previous node (the sensor node that sent the data packet to itself) from its neighbor node table.

The regional partitioning module (RPM) processes a process of determining a forwarding direction and a search range, performing a search to select a forwarding node, and transmitting a data packet.

First, the regional partitioning module (RPM) checks whether a destination node exists in its neighbor node table.

If the destination node exists in the neighbor node table, the destination node is set as the next hop.

Next, the slope of the straight line connecting the two nodes is obtained by using the location information of the node and the location information of the destination node, and the transmission direction and the forwarding node having the shortest distance are determined by the slope of the straight line (shortest distance). Determine the primary and secondary search ranges for searching and selecting.

For example, as shown in Figure 3, using the location information of the source node (S) that is its own and the location information of the destination node (D) to determine the transmission direction having the shortest distance between the two nodes, and the forwarding node Determine the primary search range (one red triangle) and the secondary search range (two blue triangles) for searching and selecting.

In Figures 3 to 8, small blue circles represent each sensor node, small circles with "S" inside represent source nodes, and small circles with "D" inside represent destination nodes. (sink node), a small circle with a plurality of horizontal lines inside represents an energy shortage node, a small circle with a white or gray interior represents an energy exhaustion node, and an arrow Characters such as "A", "B", "C", "D", "E", "F", and "G" indicated around the small circle representing each sensor node, indicate the path through which data packets are carried. It is randomly assigned to identify each sensor node.

As shown in FIG. 3, the first search range has a radiation angle (for example, 30 to 90 °) set at both sides with respect to a transmission direction having the shortest distance, and a radio wave radius r of the source node S. The secondary search range is determined to be radially disposed on both sides of the primary search range in the same size as the primary search range.

After determining the primary search range and the secondary search range as described above, as shown in FIG. 4, neighboring nodes B and C closest to the shortest path among the neighboring nodes located in the primary search range are selected as the forwarding nodes. do. That is, data packets are transmitted from the source node S to the destination node D in the order of A-B-C-D.

However, as shown in FIG. 5, when the neighboring node B closest to the shortest path located in the primary search range is an energy shortage node, a priority is given to the second priority and is not selected as a forwarding node. Do not.

In the case of Fig. 5, when the E node, which is the neighboring node next to the B node, is not an energy depleted node, the E node is selected as a forwarding node, and the data from the source node S to the destination node D in the order of AEFGD. The transmission of the packet may be made.

When the forwarding node is not selected in the primary search range, as shown in FIG. 6, the neighboring node E closest to the shortest path in the secondary search range is selected as the forwarding node.

However, when the neighboring node that is closest to the shortest path searched in the secondary search range is an energy depleted node, it is given a priority priority and is not selected as a forwarding node.

As shown in FIGS. 7 and 8, when the received data packet is a retransmission request packet, the transmission direction is determined through the inclination with the previous node (node B in FIGS. 7 and 8) in the secondary search range. The neighboring node that is furthest from the path with the previous node (node C in FIG. 7 and node D in FIG. 8) is selected as a forwarding node.

In the case of FIG. 7, the data packet received from the source node S is an example in which neighboring nodes are all energy exhaustion nodes in node B and then retransmits to node A, which is the source node S. Except for the C node of the secondary search range (the neighbor node farthest in the path between the previous node B and A node) is selected as the forwarding node. At this time, if the neighboring node farthest from the path between node A and node B is not selected as a forwarding node, the path is re-established toward the energy exhaustion node, which is the neighboring node of node B, and data packets are transmitted to the destination node D smoothly. There is a possibility that the retransmission request packet will be repeatedly repeated in place.

In the case of FIG. 8, the data packet received at the source node S is forwarded from node B to node C, and then neighbor nodes at node C are all energy exhaustion nodes, and then pass through node B again. As an example of requesting retransmission to node A, which is the source node S, forwarding node D of the secondary search range (the farthest neighbor in the path between node B and node C) except node C through node B. Select by node. At this time, if the neighboring node farthest from the path between node B and node C is not selected as a forwarding node, the path is re-established toward the energy exhaustion node, which is the neighboring node of node C, and data packets are transmitted to the destination node D smoothly. There is a possibility that the retransmission request packet will be repeatedly repeated in place.

If the forwarding node is not selected in the primary search range and the secondary search range through the above-described process, the second or third priority node is forwarded according to the existence of the second and third priority nodes configured above. To select.

For example, as shown in FIG. 5, when the neighboring node B closest to the shortest path in the primary search range is a low energy node and is given a second priority, it is normal in the primary search range and the secondary search range. If the forwarding node cannot be selected, the neighboring node B, which is the second-order node, is selected as the forwarding node.

In addition, if the neighboring node closest to the shortest path obtained by searching the secondary search range because the forwarding node is not selected in the primary search range is given the low priority node and is given the third priority, the first search range and the second search range If it fails to select a normal forwarding node, the third priority node is selected as the forwarding node.

If the second and third nodes do not exist and the node collects data, the neighboring node farthest from the shortest path in the search range except the first search range and the second search range is forwarded. To select.

If the neighboring node is selected as the forwarding node in the shortest path, the path is smoothly set up toward the first search range or the second search range in which the energy exhaustion node in which the second or third node is not selected also exists. There is a possibility that the data packet cannot be sent to the destination node (the possibility that the retransmission request packet is repeated in place).

If the forwarding node is not selected in the primary search range and the secondary search range through the above process, the previous node that has sent the data packet to itself is selected as the forwarding node and its ID (retransmission ID) is added to the packet. Request retransmission.

If the forwarding node is selected through the above process, the local partitioning module (RPM) stores and manages the ID of the previous node that has transmitted the data packet in response to the retransmission request from the selected forwarding node. Routing caching is performed and data packets are sent to the selected forwarding node. That is, the regional partitioning module (RPM) performs routing caching to store and manage the ID of the previous node that has transmitted the data packet in its neighbor node table.

The energy level module (ELM) completes the transmission of the data packet, then checks and determines its energy level and transmits it to the neighbor node through broadcast to process the process of modifying the neighbor node table in the neighbor node. do.

First, the energy level module ELM completes the transmission and forwarding of the data packet in the regional partitioning module RPM and then performs energy level check of itself (source node S).

As a result of the energy level test, if its energy level has a level corresponding to 20% or less of the initial energy, it informs its ID and energy level to the neighbor node through broadcast, and receives the neighbor. The node checks the energy level and then registers the ID of the received neighbor node (source node S) in its neighbor node table as an energy shortage node.

On the contrary, when each source node S receives information on an energy level (energy shortage level) from a neighbor through a broadcast, it registers an ID (ID) of the neighboring node as its energy shortage node in its neighbor node table.

If the energy level check indicates that the energy level has a level corresponding to 5% or less of the initial energy, the ID and energy level are notified to the neighbor node through broadcast. The identification is recognized as an energy exhaustion node and the received ID of the neighbor node (source node S) is deleted from the neighbor node table and the energy depletion node table.

On the contrary, when each source node S receives information on an energy level (energy exhaustion level) through a broadcast from a neighbor node, the neighbor node ID and ID of the neighbor node are deleted from its neighbor node table and the energy depletion node table. .

The energy depletion node management can be performed separately by creating the energy depletion node table, or can be integrated into the neighbor node table. In other words, the energy depleted node table may not be used if necessary.

The neighbor node infomation table and the energy depletion node table are tables for managing a neighbor node in any sensor node. Manage. For example, the neighbor node table can be configured as shown in Table 1 below.

Node id Location information (x, y) Energy shortage 8 (10.87, 35.24) false 2 (13.39, 25.19) true .
.
. .
.
. .
.
. n (1.61, 38.07) true

In Table 1, the ID of each sensor node is sequentially numbered using natural numbers, the location information is indicated using xy coordinates, and the energy shortage is "true" when the node is in a normal state, not an energy shortage node. "" Or "false" if the energy is low.

In Table 1, when the neighboring node is an energy exhausting node, the neighboring node is deleted from the neighboring node table, so that a separate indication of energy shortage (indication of energy exhaustion node) is not required.

The retransmission request module (RRM) manages neighboring nodes that are in a position where communication is impossible for a retransmission request of a data packet, thereby ensuring a packet transmission delay time and a transmission rate and reducing unnecessary energy consumption.

The regional partitioning module (RPM) may reduce the search time of the forwarding node selection by dividing the search range of the forwarding node according to the transmission direction.

In addition, the region splitting module (RPM) can ensure the transmission rate by allowing the retransmission request and the neighbor node to be transmitted by bypassing it when there is no neighbor node.

The energy level module ELM checks the energy level of each sensor node and notifies the neighboring node of the energy level, thereby preventing the occurrence of holes in the sensor network.

In addition, the energy level module ELM is capable of minimizing the concentration of energy by dispersing energy.

In addition, the energy level module ELM may increase the weight of performing a function as a host for data collection by applying a priority of second and third ranks when energy is insufficient.

In the conventional LGR protocol, since each sensor node is evenly distributed at regular intervals, when the initial network is constructed, its logical location information is notified through broadcast, and the decompression tree is constructed and used as a routing path. There is an advantage in that data packets can be easily transmitted through a routing path established at initial network construction. However, in the LP protocol, by using a limited routing path, energy utilization can be concentrated on a specific node, which means that a specific node cannot be faithful to functioning as a host for data collection.

According to the routing path setting method of the LIGR algorithm according to the present invention, the neighbor node is recognized and managed by broadcasting its physical location information so that not only the sensor nodes are evenly distributed but also irregularly distributed. You can partially set up the routing path.

Therefore, according to the LIGR algorithm according to the present invention, it is possible to have a relatively large number of routing paths, and it is possible to distribute energy use by selecting a forwarding node according to the energy level state.

Furthermore, according to the LIG algorithm according to the present invention, by determining the search range and the transmission direction of the forwarding node through the slope between the previous node and the destination node, to guarantee the transmission delay time and the transmission rate of the data packet, routing caching If a routing caching operation is requested to retransmit to the previous node, a loop (repetitive cycle) between the two nodes can be prevented.

And even in the case of an embodiment of the wireless sensor using the LG algorithm according to the present invention, as shown in Figure 1, the retransmission request module described in detail in an embodiment of the wireless ad hoc network using the LG algorithm according to the present invention described above (RPM), regional division module (RPM), and energy level module (ELM), so detailed description thereof will be omitted.

One embodiment of the wireless sensor using the LG algorithm according to the present invention is a wireless ad hoc network using the LG algorithm according to the present invention described above, used as a sensor node, each source node and neighbor node, The destination node and so on.

That is, in one embodiment of the wireless sensor using the LIG algorithm according to the present invention, upon receiving a data packet from the RRM, a check is performed to determine whether the packet is a retransmission request, and if it is a retransmission request packet, its neighbor node. Process of deleting the ID of the node that sent the data packet to itself from the table.

Although one embodiment of the wireless sensor using the LG algorithm according to the present invention is not shown in the drawings, a GPS receiver is installed to know its physical location (a location set or defined by its ID).

In addition, the retransmission request module (RRM) checks whether the received data packet is generated by itself, and even if it is the generated data packet, the previous node (sensor node that sent the data packet to itself) in its neighbor node table. The process of deleting the ID is performed.

The regional partitioning module (RPM) processes a process of determining a forwarding direction and a search range and performing a search to select a forwarding node and transmit a data packet.

In other words, the regional partitioning module (RPM) checks whether a destination node exists in its neighbor node table, and if the destination node exists, sets the destination node as the next hop, and its location information and Find the slope of a straight line connecting two nodes by using the location information of the destination node, and the first search to search and select the forwarding node and forwarding node having the shortest distance through the slope of the straight line (shortest distance). After determining the range and the secondary search range, select the forwarding node and send the data packet to the forwarding node.

The process of selecting a forwarding node in the region splitting module (RPM) is similar to the process of selecting a forwarding node of the region splitting module (RPM) described in the embodiment of the wireless ad hoc network using the LAI algorithm according to the present invention. Since it can be made, detailed description is abbreviate | omitted.

When the energy level module (ELM) completes the transmission of the data packet to the forwarding node, the energy level module (ELM) checks and determines its energy level and transmits it to the neighbor node through broadcast to guide the neighbor node to modify the neighbor node table. Process the process.

As a result of the energy level check, if its energy level has a level corresponding to 20% or less of the initial energy, it informs its ID and energy level to the neighbor node through broadcast to neighbors stored in the neighbor node that receives it. Instructs the node table to register their ID as a low energy node.

On the contrary, when the energy level module ELM receives the information on the energy level (energy shortage level) from the neighbor through a broadcast, the energy level module (ELM) registers the ID (ID) of the neighboring node in its neighbor node table as the energy shortage node. Take care of the process.

If the energy level check indicates that the energy level has a level corresponding to 5% or less of the initial energy, the neighbor node table stored in the neighboring node receiving the ID and energy level by broadcasting to the neighboring node is notified. Instruct the user to remove his or her ID from the neighbor node table and the low energy node table.

On the contrary, when the energy level module ELM receives the information on the energy level (energy exhaustion level) through the broadcast from the neighbor node, the neighbor node ID and ID of the neighbor node are deleted from the neighbor node table and the energy depletion node table. Process the process.

Next, an embodiment of the wireless sensor using the LG algorithm according to the present invention configured as described above and the L algorithm according to the present invention using each sensor node (functioning as a source node, a neighbor node, and a destination node) The performance of the wireless ad hoc network using the network simulator ns-2 was evaluated and analyzed. Here, the simulation environment and parameters for evaluating the performance were set as shown in Table 2 below.

Classification Contents Simulator ns-2 Version 2.29 MAC protocol IEEE 802.15.4 Channel type Wireless channel Radio propagation model Propagation / Two Ray Ground Network interface Phy / Drop Tail / Pri Queue Antenna model Antenna / Omni Antenna Networks bandwidth 250 kbps Routing protocol LGR (or AODV, DSDV), LIGR Simulation area 50m × 50m Grid size 7 × 7 (or not used) Number of nodes 49 (or 10, 20, 30, 40, 49) Traffic Constant Bit Rate Packet size 20 bytes Distance between nodes 5 m Transmission range 15 m Hop size 3m Initial energy 1 Joule or 5 Joule

Performance index Average Receiving Rate (%) Average delay time (sec) Network processing ratio (bytes / sec) Average residual energy (%) Network Participation Rate (%)

For example, as shown in Table 2 above, as in the conventional LGR protocol, 49 sensor nodes are arranged in a 50m × 50m area at 5m intervals, and set to have a transmission distance of up to 15m. .

The simulation time is set to 30 seconds, and during the simulation time, each node is set to transmit a packet having a size of 20 bytes to the destination node at intervals of 0.3 seconds for 15 seconds. At this time, the traffic was assumed to be CBR (Constant Bit Rate) traffic, and the experiment was performed assuming the initial energy of 1 Joule in the case of energy shortage and the initial energy of 5 Joule in the general state to evaluate energy efficiency.

In addition, 10, 20, 30, 40, and 49 sensor nodes are randomly distributed to one destination for the performance evaluation in an irregularly distributed environment instead of the sensor field with evenly distributed sensor fields. By generating packets at intervals of 0.3, 0.5, and 1.0 seconds, DSDV (Destination-Sequenced Distance Vector) protocol and Table-Driven routing protocol are on-demand routing protocols. The analysis was compared with the AODV (Ad-hoc On-Demand Distance Vector) protocol. Initial energy at this time is assumed to be 5Joule which is a general state.

And in Table 2, to evaluate the performance of the average receiving rate (Receiving rate), the average delay time (Delay time), network processing ratio (Network processing ratio), average residual energy (Residual energy), network participation rate (Participating rate) The indicators used are the following Equations 1, 2, 3, 4, and 5, respectively.

In Equation 1 to Equation 5, sendBytes represents a transmission byte per node, recvBytes represents a reception byte per node, pktSize represents a packet size, pktDelay represents a packet delay time per node, and partiResEnergy represents a network Remaining energy of participating nodes is shown, and partiNodes represents the number of nodes participating in the network. TotalSendBytes represents total transmitted bytes, totalRecvBytes represents total received bytes, totalDelay represents total packet latency, totalSec represents total time spent, totalPartiResEnergy represents the total remaining energy of the network, and initEnergy represents the initial energy per node. TotalNodes represents the total number of nodes in the network.

As a result of evaluating the performance in the simulation environment and parameters as described above, when the initial energy is 1 Joule in the grid size of 7 × 7 distribution environment, the performance was obtained as shown in Table 3 and FIG. In the case where the initial energy is 1 Joule, the reception rate for each node in the LGR protocol is shown in FIG. 10, and the reception rate for each node in the LGR algorithm according to the present invention is shown in FIG. 11.

division Routing protocol LGR LIGR algorithm Average Receiving Rate (%) 30.91 57.53 Average delay time (sec) 0.05 0.02 Network processing ratio (bytes / sec) 490.66 913.33 Average residual energy (%) 7.51 5.6 Network Participating Rate (%) 93.75 100

As can be seen from Table 3, the embodiment of the wireless ad hoc network using the LIGR algorithm according to the present invention shows much better performance in all five items than the conventional LGR protocol. .

9 shows the degree of improvement (rate of improvement) based on the conventional LGR protocol when the LIG algorithm according to the present invention is used. As can be seen from FIG. 9, in the embodiment of the present invention, the network throughput is improved by 86.14%, the average delay time is reduced by 60%, and the average reception rate is improved by 86.12%.

In addition, in contrast to the case of the LG (LGR) protocol shown in Figure 10 and the embodiment according to the present invention shown in Figure 11, it can be seen that the reception rate of each node also significantly improved over all areas.

Table 4 shows the results of the performance evaluation when the initial energy is 5 Joule, Figure 12 shows the degree of improvement (improved rate) in the case of the embodiment according to the present invention based on the LG protocol in each performance evaluation item. In the case where the initial energy is 5 Joule, the reception rate for each node in the LGR protocol is shown in FIG. 13, and the reception rate for each node in the LGR algorithm according to the present invention is shown in FIG. 14.

division Routing protocol LGR LIGR algorithm Average Receiving Rate (%) 75.81 93.43 Average delay time (sec) 0.07 0.03 Network processing ratio (bytes / sec) 1203.3 1483.3 Average residual energy (%) 54.66 60.15 Network Participating Rate (%) 100 100

As can be seen from Table 4 and FIGS. 12 to 14, although the improvement rate is small compared to the case where the initial energy is 1 Joule, even when the initial energy is 5 Joule, the embodiment according to the present invention is applied to the conventional LGR protocol. In comparison, performance is greatly improved in all sectors.

And the results of the performance evaluation for the case where the sensor nodes are irregularly distributed are shown in Figs. 15 to 29.

15 to 29, the average reception rate and network throughput in an environment where sensor nodes are irregularly distributed tend to increase in response to an increase in the number of nodes and a change in traffic intervals. It was found to exhibit a certain level of performance when distributed.

In addition, the average delay time shows a constant level of change in traffic interval and decreases as the number of nodes increases.

In addition, the network participation rate indicates a node participating in the network as a host and a router. When 30 or more sensor nodes are distributed, almost all sensor nodes operate correctly.

In addition, the average residual energy shows a gentle form of energy use, such as the table-driven DSDV routing protocol, which is interpreted as being caused by no generation of traffic for routing. However, it can be seen that the average residual energy of the DSDV protocol is higher than the average residual energy of the embodiment according to the present invention.

The above results are analyzed in FIG. 24 to FIG. 26 showing the network participation rate, which are caused by the fact that the sensor nodes that do not participate in the network as hosts and routers are relatively large in the case of the DSDV protocol compared to the embodiment according to the present invention. It should be noted that the energy usage for these nodes is not included in Equation 4 above.

15 to 17 and 21 to 23, which show average reception and network throughput, in the case of the DSDV protocol, in the case of the DSDV protocol, the performance is equivalent to half of the embodiment of the present invention. It cannot be said that the energy consumption efficiency as shown in Figs.

In the case of the embodiment according to the present invention, it can be seen that the sensor nodes show similar performance in both the evenly distributed state and the irregularly distributed state.

That is, in the embodiment according to the present invention, since the sensor nodes have a fixed radio wave radius and as the number of sensor nodes increases, the probability of having neighboring nodes for data packet transmission increases with respect to each sensor node, thus receiving and delaying. It can be seen that sufficient performance can be guaranteed in terms of time, network throughput and participation rate.

In the case of the embodiment according to the present invention, since each sensor node establishes a partial routing path using only the location information of the neighboring nodes, no traffic for setting the path is generated and thus the energy usage level for the increase in the number of nodes is increased. There is no big difference, and considering the low energy node, the same energy can be used to process a larger amount of packets, and there is no big difference in the amount of traffic generated by the change of traffic interval.

In the above, a preferred embodiment of a wireless ad hoc network using the LAI algorithm according to the present invention has been described. However, the present invention is not limited thereto, and various modifications can be made within the scope of the claims, the specification, and the accompanying drawings. This also belongs to the scope of the present invention.

RRM-Retransmission Request Module, RPM-Regional Partition Module, ELM-Energy Level Module
S-source node, D-destination node, r-propagation radius

Claims (19)

When receiving a data packet from each source node, it checks whether it is a retransmission request packet, and if it is a retransmission request packet, deletes the ID of the related node from its neighbor node table. A retransmission request module,
A regional segmentation module for determining a transmission direction and a search range, performing a search to select a forwarding node, and transmitting a data packet;
After completing the transmission of the data packet, it checks the energy level of its own (source node), and then transmits it to the neighbor node through broadcast to modify the neighbor node table of the neighbor node. Wireless ad-hoc network using LIG algorithm including energy level module. The method according to claim 1,
When the retransmission request module receives the data packet at each source node, the retransmission request module checks whether it is a retransmission request packet, checks whether the node has generated the data packet, and if the retransmission packet is received, receives the retransmission packet. The node simply deletes the retransmission request ID if it exists in its (source node) neighbor node table, and the ID of the previous node in its (node node's) neighbor table even if the originating node of the received data packet is itself. Wireless ad hoc network using the LG algorithm to perform the process of deleting the. The method according to claim 1 or 2,
The regional partitioning module checks whether a destination node exists in its neighbor node table, and sets the destination node as the next hop if the destination node exists in its neighbor node table. To find the slope of a straight line connecting the two nodes using its own location information and the location information of the destination node, and to search and select the transmission direction and forwarding node having the shortest distance through the slope of the straight line (shortest distance). If the primary search range and the secondary search range are determined, and the neighboring node located in the primary search range that is the nearest to the shortest path is selected as the forwarding node, and the forwarding node is not selected in the primary search range, In the secondary search range, the neighboring node nearest the shortest path is selected as the forwarding node, and the data packet In the case of the transmission request packet, the transmission direction is determined by the slope of the previous node in the secondary search range, and then the neighboring node that is farthest in the path with the previous node is selected as the forwarding node. Select the previous node that sent the data packet as the forwarding node, request retransmission by putting its ID (retransmission ID) in the packet, and if the forwarding node is selected, transmit the data packet to respond to the retransmission request from the selected forwarding node. Wireless ad-hoc network using LGI algorithm which performs routing caching operation to store and manage ID of previous node and transmits data packet to selected forwarding node. The method according to claim 3,
In the regional partitioning module, if the neighboring node that is the nearest to the shortest path among the neighboring nodes located in the primary search range is an insufficient energy node, the second priority is given a priority and is not selected as a forwarding node. If the neighboring node closest to the path is a low energy node, give priority to the third node and do not select it as a forwarding node, and if the forwarding node is not selected in the primary and secondary search ranges, Wireless ad hoc network using the LG algorithm which selects the second or third node as a forwarding node according to the existence of the second and third nodes. The method according to claim 4,
In the regional segmentation module, if the second and third nodes do not exist and the node collects data, the neighboring node farthest from the shortest path in the search range except the first search range and the second search range is forwarded. Wireless ad-hoc network using LG algorithm selected by node. The method according to claim 1,
The energy level module completes the transmission and forwarding of the data packet, and then performs an energy level check of itself (source node). As a result of the energy level test, the energy level of the own (source node) corresponds to 20% or less of the initial energy. If it has a level, it broadcasts its ID and energy level to the neighbor node through broadcast, and the neighbor node that receives it checks the energy level, and then registers the ID of the received neighbor node (source node) as a low energy node. If the energy level check indicates that the energy level of the self (source node) is less than 5% of the initial energy, it broadcasts its ID and energy level to the neighbor node through the broadcast, and the neighbor node receiving the energy level receives the energy level. ID of neighboring node (source node) recognized and received as energy exhaustion node Wireless ad hoc network using LIG Al algorithm that performs the process of deleting from the neighboring node table of their own (neighboring nodes). When the data packet is received, a process for checking whether the packet is retransmitted is requested, and in the case of the retransmission request packet, a process of deleting an ID of an associated node that has transmitted the received data packet in its neighbor node table. Retransmission request module,
A regional segmentation module for determining a transmission direction and a search range, performing a search to select a forwarding node, and transmitting a data packet;
After completing the transmission of the data packet, it checks and judges its energy level, and then transmits it to the neighbor node through broadcast, and when the information about the energy level is transmitted through the broadcast from the neighbor node, the information of its neighbor node table is received. Wireless sensor using an LG algorithm including an energy level module to process the process of correcting. The method according to claim 7,
When the retransmission request module receives the data packet, the retransmission request module checks whether it is a retransmission request packet, checks whether the node has generated the data packet, and if the retransmission packet is received, it transmits itself to its neighbor node table. The process of deleting the ID of the node that sent the data packet to its neighbor node table even if the received data packet is the data packet generated by itself. Wireless sensor using the LG algorithm to perform the. The method according to claim 7 or 8,
The regional partitioning module checks whether a destination node exists in its neighbor node table. If the destination node exists in the neighbor node table, the destination node is set as the next hop, and its location information and Using the location information, the slope of the straight line connecting two nodes is obtained. The slope of the straight line (shortest distance) is used to determine the first and second search ranges for searching and selecting the transmission direction having the shortest distance and the forwarding node. The neighboring node located in the primary search range is selected as the forwarding node that is the closest to the shortest path, and if the forwarding node is not selected in the primary search range, the nearest to the shortest path in the secondary search range. Select the neighbor neighbor node as the forwarding node, and if the data packet is a retransmission request packet, the secondary probe Determines the direction of transmission based on the slope with the previous node in the range, and then selects the neighboring node furthest in the path to the previous node as the forwarding node, or forwarding the previous node that has sent data packets to itself if no forwarding node is selected. It selects a node and requests retransmission by putting its own ID (retransmission ID) in the packet.If the forwarding node is selected, the ID of the previous node that has transmitted the data packet to respond to the retransmission request from the selected forwarding node is selected. A wireless sensor using an LG algorithm which performs routing caching for storing and managing and transmitting a data packet to a selected forwarding node. The method according to claim 9,
In the regional partitioning module, if the neighboring node that is the nearest to the shortest path among the neighboring nodes located in the primary search range is an insufficient energy node, the second priority is given a priority and is not selected as a forwarding node. If the neighboring node closest to the path is a low energy node, give priority to the third node and do not select it as a forwarding node, and if the forwarding node is not selected in the primary and secondary search ranges, And a wireless sensor using an LG algorithm which selects a second or third node as a forwarding node depending on whether a third and third node exist. The method according to claim 10,
In the regional segmentation module, if the second and third nodes do not exist and the node collects data, the neighboring node farthest from the shortest path in the search range except the first search range and the second search range is forwarded. Wireless sensor using LG algorithm selected by node. The method according to claim 7,
The energy level module completes the transmission and forwarding of the data packet, and then performs its own energy level check. If the energy level check indicates that the energy level is 20% or less of the initial energy, the user's ID ( Broadcasts its ID and energy level to neighbor nodes, and if its energy level is less than 5% of its initial energy, it broadcasts its ID and energy level to neighbor nodes. And informs the user of the energy level when receiving the energy level information from the neighbor node. The wireless sensor using the LG algorithm which performs the process of checking the energy level of the neighbor node and modifying the information on the neighbor node in its neighbor node table. When each source node receives a data packet, it checks whether the packet is retransmitted.
If the check of the received data packet is confirmed as the retransmission request packet, the ID of the related node is deleted from the neighbor node table of the own (source node),
Determine a transmission direction and a search range for transmitting the received data packet, perform a search to select a forwarding node,
Send a data packet to the selected forwarding node,
After completing the transmission of the data packet, it checks and judges the energy level of itself (source node), transmits it to the neighbor node through broadcast and receives the energy level through broadcast, and the neighbor node receives its energy level Wireless ad-hoc networking method using LGI algorithm including modifying node table. The method according to claim 13,
When a data packet is received, it checks to see if it is the node that generated the data packet.
If the generating node of the received data packet is itself, the wireless ad hoc using the LAI algorithm further comprises the step of deleting the ID of the previous node that transmitted the data packet to the neighbor node table of the source node. Networking method. The method according to claim 13 or 14,
In the step of selecting the forwarding node, it is determined whether a destination node exists in a neighbor node table of its own (source node). If the destination node exists in a neighbor node table, the destination node is set to the next hop, and Find the slope of a straight line connecting two nodes by using the location information of the node and the location information of the destination node, and find the transmission direction and forwarding node having the shortest distance through the slope of the straight line (shortest distance). Determines the range and the secondary search range, selects the neighboring node nearest the shortest path among the neighboring nodes located in the primary search range as the forwarding node, and if the forwarding node is not selected in the primary search range, the secondary search Selects the neighboring node nearest the shortest path in the range as the forwarding node, and retransmits the data packet In the case of a request packet, the transmission direction is determined by the slope with the previous node in the secondary search range, and then the neighboring node that is furthest in the path with the previous node is selected as the forwarding node. A wireless ad-hoc networking method using an LG algorithm which consists of selecting a forwarding node as a forwarding node. The method according to claim 15,
LGE performs routing caching that selects a forwarding node and then stores and manages the ID of the previous node that sent the data packet in its own neighbor node table to respond to retransmission requests from the selected forwarding node. Wireless ad hoc networking method using AL algorithm. The method according to claim 15,
If the neighboring node that is closest to the shortest path among the neighboring nodes located in the first search range is an insufficient energy node, a priority is given to the second priority and is not selected as a forwarding node.
If the neighboring node that is closest to the shortest path to the secondary search range is the depleted node, it is given a third priority and is not selected as a forwarding node.
If the forwarding node is not selected in the first search range and the second search range, an LG algorithm which selects a second or third rank node as a forwarding node according to the existence of the second and third rank nodes configured above is used. Wireless ad hoc networking method. 18. The method of claim 17,
When the second and third nodes do not exist and the node collects data, the neighboring node farthest from the shortest path in the search range except the first search range and the second search range is selected as a forwarding node. Wireless ad hoc networking method using LIG algorithm. The method according to claim 13,
The step of performing the own energy level check to inform the broadcast and modifying the neighbor node table may be performed if the energy level of the self (source node) has a level corresponding to 20% or less of the initial energy. The ID and energy level are broadcasted to the neighbor node through broadcast, and the neighbor node that receives it checks the energy level, and registers the received neighbor node's ID as a low energy node in its neighbor node table. If the energy level check indicates that the energy level of the self (source node) is less than 5% of the initial energy, it broadcasts its ID and energy level to the neighbor node through the broadcast. ID of neighboring node recognized and received as energy exhaustion node Wireless ad hoc networking methods using LIG al algorithm comprising a step of deleting from the table of the neighboring node itself (neighboring nodes).

Images