KR100563954B1 - Parking management system - Google Patents

Abstract

The present invention relates to a wireless network based automatic parking management system employing a routing algorithm and a method of setting the same. Parking management system according to the present invention is disposed at a predetermined position of each parking space or aisle in the parking lot and a plurality of sensor nodes for detecting the presence of the vehicle or whether the vehicle passes, and installed at the branch point of the vehicle moving line or the direction of movement of the entry vehicle or At least one indicator node for guiding the number of spare parking spaces, and a control node for integrating and managing the parking management system by wireless communication with the sensor node and the indicator node, wherein the vehicle detection data generated at each sensor node It is wirelessly transmitted to the associated indicator node via the sensor node or indicator node according to a predetermined routing path. Parking management system according to the present invention, since the transmission of the vehicle sensing data is made through a wireless routing algorithm, the power consumption is significantly reduced, the maintenance cost is reduced, it can be easily installed as a low-cost product.

Description

Parking Management System {PARKING MANAGEMENT SYSTEM}

1 is a configuration diagram schematically showing a structure of a parking lot to which a parking management system according to an exemplary embodiment of the present invention is applied.

Figure 2a is a block diagram schematically showing the configuration of the sensor node shown in Figure 1, in a preferred embodiment according to the present invention.

FIG. 2B is a block diagram schematically showing the configuration of the indicating node shown in FIG. 1 in the preferred embodiment according to the present invention; FIG.

3 is a diagram showing the configuration of a PS packet according to a preferred embodiment of the present invention.

4 is a flow diagram illustrating a routing path establishment algorithm performed at a sensor node and an indication node in a preferred embodiment according to the present invention.

Fig. 5 is a diagram showing an example of a routing table created at a sensor node and an indication node in a preferred embodiment according to the present invention.

<Description of main parts of reference numerals>

10: parking monitoring node

11: mobile vehicle monitoring node

20: indicating node

30: control node

50: breaker

100: parking management system

The present invention relates to a parking management system, and more particularly, to a wireless network-based automatic parking management system employing a routing algorithm and a setting method thereof.

Recently, the traffic volume in the city has exploded due to the expansion of vehicle supply, and securing a parking space is a big problem. Accordingly, in a place where vehicle access is frequent such as a large parking lot such as a large building, especially a department store or a large discount store, accommodating more vehicles and efficient parking management are very important tasks.

In general, such a large parking lot employs a parking management agent, and parking management through such manpower has various problems. That is, even if the parking management personnel are arranged in the parking lot, it is difficult to accurately check the parking situation of the large parking lot, and it is difficult to expect effective parking management because the parking management is performed under the arbitrary judgment of the parking agent. For example, even though there is a parking space nearby, the customer often returns to the distant place, or incorrectly guides the place where there is no parking space, so that the customer comes back again, causing inconvenience and discomfort to the customer. In addition, the user is burdened with management costs in accordance with labor costs, such as the employment of parking management personnel.

Recently, an unmanned parking management system using a wired or wireless network has been introduced.

However, in the case of an unmanned parking management system using a wired network, since the equipment such as vehicle sensors, indicators, central control devices, etc. installed in each parking space where the vehicle is parked must all be wired, the installation cost of a large parking lot There is a problem that a lot of installation work is also very difficult. In addition, it takes a long time to use the parking lot because it takes a long time to install.

In the case of a conventional unmanned parking management system using a wireless network, after installing a vehicle sensor and a wireless transceiver for each parking space, and transmits the data detected by the vehicle sensor directly to the central control unit through the wireless transceiver. Is taking. However, in this case, since the wireless transceiver of each parking space and the central control apparatus must perform 1: 1 communication directly, a high power wireless transceiver is employed. Therefore, there is a problem that the cost of the wireless transceiver is increased and power consumption is large.

Due to these problems, the unmanned parking management system is rarely used in reality despite the recognition of the necessity and the urgency of its introduction.

The present invention has been proposed to solve the above-mentioned problems of the prior art, and an object thereof is to provide a wireless network-based parking management system and method which can be easily installed at low cost.

In addition, another object of the present invention is a wireless network-based parking management system in which the data sensed in the sensor node installed in each parking space is transmitted directly through the surrounding nodes through a predetermined routing algorithm, rather than directly transmitted to the central control unit; To provide a way.

Other objects and advantages in addition to the above objects and advantages of the present invention will become apparent from the following detailed description and the accompanying drawings.

The parking management system according to the first aspect of the present invention includes a plurality of sensor nodes disposed at a predetermined position of each parking space or aisle in a parking lot and detecting whether a vehicle is present or whether the vehicle passes through the vehicle, and installed at a branching point of a vehicle moving line. At least one indicator node for guiding the direction of movement or the number of extra parking spaces of the vehicle; and a control node configured to wirelessly communicate with the sensor node and the indicator node to manage and manage the parking management system. Vehicle sensing data is wirelessly transmitted to the associated indicating node via the sensor node or the indicating node according to a predetermined routing path.

In a preferred embodiment according to the above feature, the associated indication node is an indication node to which vehicle detection data generated at each sensor node is to be finally transmitted, and the vehicle detection data includes address information of the associated indication node.

In another preferred embodiment according to the above feature, each sensor node and command node comprises a routing table for transmitting vehicle sensing data received from an adjacent sensor node or an indication node to the next adjacent sensor node or indication node. do.

In another preferred embodiment according to the above feature, the routing table includes address information of the next adjacent sensor node or indicator node corresponding to the address information of the associated indicator node included in the received vehicle sensing data.

In another preferred embodiment according to the above features, the sensor node is a vehicle detection sensor for detecting the presence or absence of the vehicle or whether the vehicle passes, a wireless transceiver for performing wireless data communication with the adjacent sensor node or the indication node, and The data input from the vehicle detection sensor is converted into a predetermined vehicle detection data format and transmitted to the adjacent sensor node or the indication node through the wireless transceiver, and the vehicle detection data received from the adjacent sensor node or the indication node is next to the next sensor. It has a microcomputer relaying to a node or an indication node.

In another preferred embodiment according to the above feature, the indication node comprises a neighboring sensor node or indication node, a wireless transceiver for performing wireless communication with the control node, a vehicle sensor generated and received at an associated sensor node or indication node. Based on the data, the driving direction of the entering vehicle or the number of extra parking spaces is determined, and the vehicle detection data generated and received from an unrelated sensor node or an indication node is relayed to the next adjacent sensor node or the indication node. And an indicator for indicating the direction of travel of the entry vehicle or the number of extra parking spaces in response to a predetermined control signal input from the micom.

According to a second aspect of the present invention, a method for establishing a routing path of a sensor node and an indication node installed in a parking lot includes: (a) wirelessly receiving a PS (Path Setup) packet from an adjacent sensor node or an indication node; (b) calculating the level of the current node based on the level information included in the PS packet; (c) adjusting the level of the received PS packet; and (d) the node of the node from which the PS packet was generated. Recording an address and an address of an adjacent node receiving the PS packet; and (e) wirelessly transmitting the PS packet to an adjacent sensor node or an indication node.

In a preferred embodiment according to the above feature, the routing path establishment method comprises the steps of (i) checking whether the PS packet was first received before step (b), and (ii) receiving the PS packet for the first time. If yes, the method further includes recording it in the transport packet list.

In addition, as a result of the determination in step (ii), if the PS packet is not initially received, confirming whether the level of the current node calculated through the received PS packet is appropriate or not, and the level of the current node is Discarding the PS packet if appropriate, and performing steps (b) to (e) if the level of the current node is not appropriate.

In a preferred embodiment according to the above feature, the PS packet includes a destination (DST) field in which address information of an indication node generated by the PS packet is recorded, and a transmission (TX) in which address information of a node currently transmitting the PS packet is recorded. Field) and a level (LEVEL) field indicating how many hops the node currently transmitting the PS packet is from the indicating node recorded in the destination field.

DESCRIPTION OF THE PREFERRED EMBODIMENTS Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings.

1 is a configuration diagram schematically showing a structure of a parking lot to which a parking management system according to an exemplary embodiment of the present invention is applied.

Referring to FIG. 1, the parking management system 100 is installed in each parking space to monitor a parking monitoring node 10 for detecting the presence of a vehicle, and a mobile vehicle monitoring disposed at a predetermined position of a passage to detect whether a vehicle passes. A node (11), an instruction node (20) installed at a branching point of the vehicle traffic line indicated by an arrow to guide the direction of movement of the entry vehicle and the number of extra parking spaces, and the parking monitoring node, the moving vehicle monitoring node, or the indicating node; And a control node 30 for wirelessly managing the parking management system.

The parking lot of this embodiment has a total of 72 parking spaces divided into 12 zones (S1 to S12) each having six parking spaces, and the entrance and exit vehicle moves along the moving line indicated by the arrow. In addition, the breaker 50 is installed at the entrance of the parking lot to control vehicle entry.

The parking monitoring node 10 is disposed at a predetermined position (for example, a ceiling) of each parking space, and the moving vehicle monitoring node 11 is a gist of a vehicle moving line (eg, an entrance, a branch point of the moving line, etc.). The instruction node 20 may be arranged at a branch point of the vehicle moving line, and the control node 30 may be disposed at any position in the parking lot. The parking monitoring node 10 and the moving vehicle monitoring node 11 detect the presence or absence of the vehicle and whether the vehicle passes, and transmit the same to the associated indication node 20 or the control node 30. The actual configuration is the same. . In this embodiment, the parking monitoring node 10 and the moving vehicle monitoring node 11 are collectively referred to as sensor nodes.

In the present embodiment, the parking monitoring nodes 10 arranged in each parking space have reference numerals S1-1, S1-2, ..S12-5, S12-6, and each moving vehicle monitoring node 11 has a reference numeral. Reference numerals D1, D2, .. D12 are denoted, and reference numerals I1, I2, .. I5 are assigned to the respective instruction nodes 20, respectively.

Figure 2a is a block diagram schematically showing the configuration of the sensor node shown in Figure 1, in a preferred embodiment according to the present invention.

As described above, the sensor node collectively refers to the parking monitoring node 10 and the moving vehicle monitoring node 11. Both nodes are somewhat different in the installation location and sensing method (ie, whether the vehicle is present or not), but the internal configuration of both nodes is substantially the same.

Referring to FIG. 2A, the sensor nodes 10 and 11 may include a vehicle detection sensor 12 for detecting the presence or absence of a vehicle, and A for converting an analog signal transmitted from the vehicle detection sensor into a digital signal. / D converter 13, a wireless transceiver 14 for performing wireless data communication with an adjacent sensor node, an instruction node or a control node, a microcomputer 15 for controlling all operations of the sensor node, and storing data Memory 16 and a state display unit 17 for displaying the operation state of the sensor node.

Referring to the operation of the sensor nodes 10 and 11 having such a configuration, the analog data signal detected by the vehicle sensor 12 is converted into a digital signal through the A / D converter 13 and then the microcomputer 15. If input to, the microcomputer 15 generates a predetermined data packet for transmitting the detected data. The data packet is transmitted through the radio transceiver 14 to the next adjacent sensor node or indication node according to a predetermined routing algorithm.

In addition, the microcomputer 15 also performs a routing path setting algorithm to be described later.

FIG. 2B is a block diagram schematically showing the configuration of the indicating node shown in FIG. 1 in the preferred embodiment according to the present invention.

The instruction node 20 includes a wireless transceiver 22 that performs wireless communication with a sensor node or a control node, a microcomputer 24 that controls the overall operation of the instruction node, a traveling direction of an entrance vehicle, and an accessible parking space. It consists of an indicator light 26 for guiding numbers and the like and a memory 28 for storing data. Here, the indicator may be implemented in an arrow shape or a number.

In this configuration, the microcomputer 24 determines the direction in which the vehicle should pass, based on the data packet information received from the sensor node, to proceed through the location where it is currently installed. Displays the logarithm, etc.

In addition, the microcomputer 24 has a function of relaying data packets transmitted from adjacent sensor nodes or other indicating nodes to other sensor nodes or indicating nodes according to a routing algorithm, and also performs a routing path setting algorithm to be described later.

In addition, on the computer screen provided in the control node 30, installations including a parking space, each node, etc. are displayed in a one-to-one correspondence, and the current parking state is updated in real time based on data transmitted from the sensor node or the indication node. do.

As a result, the data sensed by the sensor node in the parking management system 100 is converted into a packet form, and then transmitted to the final destination (for example, the indicating node or the controlling node) via an adjacent sensor node or indicating node according to a routing algorithm. do.

As such, in order for each node to perform a routing algorithm, a routing path of data packets detected at each sensor node must be set.

Hereinafter, a method of setting a routing path of a data packet generated at each node will be described.

First, establish an association between each node. Here, establishing an association means defining an indication node to which a data packet generated at each sensor node should be finally transmitted. Referring to FIG. 1, in order for the indicating node 20 to guide a moving vehicle in a parking lot, the indication node 20 needs to receive information about the parking and moving vehicle from sensor nodes, but does not necessarily receive data from all sensor nodes. For example, only a space for parking a vehicle passing through a sensor node of D6, that is, a vehicle monitoring node, is S1, and a parking space for reaching a vehicle passing through a sensor node of D7 is S8, S9, S7, and S1. . In addition, by calculating the number of vehicles passing through the sensor nodes of D6, D7, and D12, the number of vehicles moving between the nodes can be known. Therefore, the indication node of I3 is the number of parking spaces that can be entered when the vehicle passing through the branch point proceeds in each direction only with data transmitted from the sensor nodes of D6, D7, D12, S1, S7, S8, and S9, and It is possible to determine how many vehicles are moving in the zone, and based on this, it is possible to estimate the number of parking spaces remaining when a subsequent vehicle reaches the zone.

In the same way, the indication node of I4 can guide the direction of travel of the vehicle and the number of parking spaces to pass through the point only with data transmitted from nodes I3, D8, D9, S10, and S11. In addition, the indicating node of I5 is from the I4, D11, D10, and S12 nodes, and the I2 indicating node is from the I4, I5, D4, D5, S4, S5, S6 nodes, and I1 is I2, I3, D2, D3, S2, S3. It is enough to receive only the data transmitted from the node. In addition, by calculating the number of vehicles passing through D1 and D12, the total number of vehicles currently parked or moving in the parking lot can be known, and based on this, it is determined whether additional vehicles can enter the parking lot and the breaker 50. Can control the operation of. In addition, more densely arranged sensor nodes, especially mobile vehicle monitoring nodes 11, enable more sophisticated parking guidance.

In this way, it is determined by the installer based on the drawing of the parking lot, which builder can receive data from which sensor node, and can be set manually for each node using a setter (not shown). Therefore, the position of the node and the moving line of the vehicle can be decoded and automatically designated through wireless communication between the nodes.

Each association information set as above should be delivered to and stored in each node. Next, the routing path from each sensor node to the associated indicator node must be established.

Prior to the detailed description, each node applied to the present invention has a unique ID and forwards the packet to neighboring nodes through radio waves, where the radio wave reach distance is determined according to the performance and power of the radio transceiver. The range in which a packet can be delivered from one node to the next at a time is called the 1 hop range. Therefore, the range in which a packet is delivered via one node becomes a 2 hop range.

Routing path establishment of each node is initiated by generating a path setup start (PSS) packet, which is a packet informing the control node 30 of the routing path establishment start, and flooding it around. Here, flooding is one of methods for delivering a packet generated at one node to all nodes on a network, and is widely used in the field of network technology.

The indication node receiving the PSS packet through flooding recognizes that the routing path setup has been started, and generates a PS (Path Setup) packet as shown in FIG. 3 to start a new flooding. Therefore, when there are N indicating nodes, at most N + 1 flooding can be performed simultaneously. Detailed description thereof will be described later.

Meanwhile, the sensor node (ie, the parking monitoring node and the mobile vehicle monitoring node) that has received the PSS packet simply floods the packet to the neighboring node and retransmits it. That is, sensor nodes only participate in flooding, i.e. transmitting, PSS packets.

3 is a diagram showing the configuration of a PS packet according to a preferred embodiment of the present invention.

Referring to FIG. 3, the PS packet 70 includes CODE, DST, TX, and LEVEL fields. Here, the type of the packet, that is, a code value indicating that the packet is a PS packet, is recorded in the CODE field, and the ID of the indicating node where the packet is generated is recorded in the DST (destination) field, and the ID value does not change during flooding. . In addition, in the TX (transmission) field, the node ID which transmits this packet is recorded, and this value is updated with a new value at each node via the flooding process. Next, in the LEVEL (level) field, a value indicating how many hops from the DST the node currently transmitting this packet (i.e., TX) is recorded.

4 is a flowchart illustrating a routing path establishment algorithm performed at each node in a preferred embodiment according to the present invention.

First, the indicating node 20 which has received the PSS packet generated at the control node generates a PS packet as shown in FIG. 3 and starts flooding. The sensor node or indication node then receives the PS packet via flooding (step 10). The sensor node checks whether the packet is first received or duplicately received (step 12). First reception is determined by comparing the DST value of the received PS packet with the transport packet list. The transport packet list stores the DST values of the PS packet received and retransmitted at the current node. Since one indicating node transmits the PS packet only once, it is possible to know whether the PS packet is first received only by determining whether the DST value is the same.

If the PS packet is the first received packet (YES in step 12), the DST of the PS packet is additionally recorded in the transport packet list (step 14).

Next, calculate the level of the current node (step 16). At this time, the level calculation of the current node is obtained through Equation 1 below.

NL = PL + 1

Here, NL indicates the level of the current node, i.e., how many hops the current node is from the indicating node (i.e., DST) in which the PS packet was generated. PL is a value recorded in the LEVEL field of the PS packet, which is the level of the node immediately before transmitting the PS packet. For example, when the LEVEL field value of the received packet is 4, the level of the node immediately before transmitting the packet is 4 and the level of the current node is 5.

Next, the level of the received PS packet is adjusted by changing the level value in the packet to the level value of the current node (step 18). This is for retransmitting the received PS packet, which is performed through Equation 2 below.

 NL = PL

Next, if the final destination of a data packet containing vehicle sensing data received from another sensor node or an indication node later matches the node stored in the DST field of the PS packet, the next neighbor node ID to which the data packet is to be transmitted is determined. Save (step 20). This is achieved through Equation 3 below to generate the routing table shown in FIG. 5 to be described later.

NEXT (DST) = TX

Here, NEXT (DST) is the next neighbor node ID, and TX is the ID of the node which retransmits the packet. NEXT (DST) becomes the node ID recorded in the TX field of the received PS packet. For example, referring to FIG. 5 to be described later, when the current node receives a PS packet in which DST is node 1 from node 8, a data packet in which a final destination is node 1 must be transmitted to node 8 later. .

The PS packet is then flooded back to the neighbor node (step 22). By repeating this process, a routing path setting algorithm is performed on all nodes installed in the parking lot.

On the other hand, if it is determined in step 12 that the received PS packet is not the first received packet, it is determined whether the level of the current node calculated through the received PS packet is appropriate (step 24). It is determined whether the current node level is appropriate through Equation 4 below. If Equation 4 below is established, it is determined that the level of the current node is abnormal.

NL> PL + 1

According to the flooding protocol, all nodes within 1 hop range from the current node will send a PS packet to the current node once. In this case, a PS packet having a level higher than the actual level of the current node will be received first. This can be done in case. For example, if the actual level of the current node is 5, it is normal that the PS packet of level 4 is transmitted. However, if the PS packet of level 5 is transmitted first, the level of the current node is calculated to be 6 instead of 5.

As a result of the determination of step 24, when NL> PL + 1, the level of the current node is abnormally calculated, and thus the steps 16 to 22 are performed. That is, after adjusting the level of the current node and the next transmitting node ID (NEXT) and the level of the received PS packet based on the newly received PS packet, the packet is transmitted again according to the flooding protocol.

On the other hand, as a result of the determination in step 24, if NL ≤ PL + 1, the received PS packet is discarded (step 26), and the procedure is terminated.

When the above routing path setting algorithm is performed at each sensor node and indication node, a routing table as shown in the diagram shown in FIG. 5 is completed at each node.

Referring to FIG. 5, the routing table is composed of DST and NEXT values. For example, when a data packet including vehicle sensing data is received from neighboring nodes, when the final destination (ie, DST) of the packet is node 1, the packet is transmitted to the neighboring node 8 and received. When the packet's DST is node 3, the packet is transmitted to the adjacent node 17. Through this routing table, each node relays data packets transmitted from neighbor nodes to the next neighbor node.

When a routing table as shown in FIG. 5 is generated at each node, the routing path setting process is completed. Next, the parking management system can operate normally.

When each sensor node initiates operation, such as when a vehicle enters or exits a parking space, or when a vehicle passes through a location where a moving vehicle detection sensor is installed, the sensor node generates a data packet containing this information to indicate an associated indication. You must inform the node. As described above, each sensor node knows which indication node to transmit the information it has sensed, and includes the ID of the indication node in the data packet and then moves to the next neighbor node recorded in its routing table. Send the data packet. The data packet is transmitted to the indicating node which is the final destination via a plurality of sensor nodes or indicating nodes.

Therefore, each indicating node can guide the moving direction of the entry vehicle by grasping the number of extra parking spaces in the corresponding area based on the data packets generated and received from the sensor nodes.

Meanwhile, the data of each indication node is transmitted to the control node. In this case, the transmission method may be transmitted according to the above-described transmission method from each sensor node to the indication node, that is, a routing algorithm. In addition, since the number of the indicating nodes is relatively small, the indicating node and the controlling node may perform 1: 1 wireless communication to directly transmit and receive data.

According to the present invention, since the data generated in the sensor node installed in the parking space or aisle is not directly transmitted to the directing node or the control node, but is transmitted through the adjacent node through a routing algorithm, the wireless node is provided in each sensor node. The transceiver can also be implemented as a low power, low cost product. Therefore, the installation cost of a parking management system can be reduced significantly.

In addition, since data transmission is performed through a routing algorithm, power consumption can be significantly reduced to reduce maintenance costs.                     

In addition, since the routing algorithm applied to the present invention employs a simple algorithm as compared with the conventional routing algorithm of wired and wireless networks, it is possible to minimize the memory capacity of each sensor node. Thereby, the installation cost of this parking management system can be considerably reduced.

While the present invention has been described with reference to the preferred embodiments, those skilled in the art will understand that changes may be made without departing from the spirit and scope of the invention. In other words, the present invention may be modified within the scope of the appended claims and should not be considered as being limited to the above-described exemplary embodiments.

Claims (11)

delete delete A plurality of sensor nodes disposed at predetermined positions of each parking space or aisle in the parking lot and detecting whether a vehicle is present or whether the vehicle passes; At least one indicator node which is installed at a branch point of the vehicle moving line and guides the direction of movement of the entry vehicle or the number of extra parking spaces; And a control node wirelessly communicating with the sensor node and the indication node to manage the parking management system integrally. The vehicle sensing data generated at each sensor node is wirelessly transmitted to the associated indicating node via the sensor node or the indicating node according to a predetermined routing path. The associated indication node is an indication node to which vehicle detection data generated at each sensor node is to be finally transmitted, and the vehicle detection data includes address information of the associated indication node, Wherein each sensor node and indicator node comprises a routing table for transmitting vehicle sensing data received from the adjacent sensor node or the indicator node to the next adjacent sensor node or the indicator node. The method of claim 3, And the routing table includes address information of the next neighboring sensor node or the indicating node corresponding to the address information of the associated indicating node included in the received vehicle sensing data. The method according to claim 3 or 4, The sensor node is A vehicle detection sensor detecting whether a vehicle is present or whether the vehicle passes; A wireless transceiver for performing wireless data communication with an adjacent sensor node or indication node; The data input from the vehicle detection sensor is converted into a predetermined vehicle detection data format and transmitted to the adjacent sensor node or the indication node through the wireless transceiver, and the vehicle detection data received from the adjacent sensor node or the indication node is next adjacent. Micom relaying to sensor nodes or indicator nodes Parking management system comprising a. The method according to claim 3 or 4, The indicating node is An adjacent sensor node or indication node, a radio transceiver for performing radio communication with the control node; The driving direction of the entering vehicle or the number of extra parking spaces is determined based on the received vehicle sensing data generated at the associated sensor node or the instructing node, and the vehicle sensing data generated and received at the unrelated sensor node or instructing node is Micom relaying to the next adjacent sensor node or indication node, Indicator light for displaying the direction of travel or the number of extra parking spaces in response to a predetermined control signal input from the micom Parking management system comprising a. In the method for setting the routing path of the sensor node and the indication node installed in the parking lot, (a) wirelessly receiving a PS (Path Setup) packet from an adjacent sensor node or indication node, (b) calculating a level of a current node based on the level information included in the PS packet; (c) adjusting the level of the received PS packet; (d) recording an address of a node where the PS packet is generated and an address of an adjacent node receiving the PS packet; (e) wirelessly transmitting the PS packet to an adjacent sensor node or indication node Routing path setting method of the node installed in the parking lot characterized in that it comprises a. The method of claim 7, wherein Before step (b) (i) checking whether the PS packet was first received; (Ii) if the PS packet was first received, recording it in the transport packet list The routing path setting method of the node installed in the parking lot further comprising a. The method of claim 8, As a result of the determination in step (ii), if the PS packet is not initially received, First checking whether or not the level of the current node calculated through the received PS packets is appropriate; Discarding the PS packet if the level of the current node is appropriate; If the current level of the node is not appropriate, performing the steps (b) to (e), the routing path setting method of the node installed in the parking lot. The method of claim 7, wherein the PS packet is A destination (DST) field in which address information of an indication node that is created is recorded; A transmission (TX) field in which address information of a node currently transmitting the PS packet is recorded; A level (LEVEL) field indicating how many hops the node currently transmitting the PS packet is from an indication node recorded in the destination field. Routing path setting method of the node installed in the parking lot characterized in that it comprises a. The method of claim 7, wherein And transmitting the PS packet between the nodes according to a flooding protocol.

Images