KR20170100220A - Packet data transferring method using mobile equipment and stationary node and determining method for routing path including mobile equipment and stationary node - Google Patents

Packet data transferring method using mobile equipment and stationary node and determining method for routing path including mobile equipment and stationary node Download PDF

Info

Publication number
KR20170100220A
KR20170100220A KR1020160022499A KR20160022499A KR20170100220A KR 20170100220 A KR20170100220 A KR 20170100220A KR 1020160022499 A KR1020160022499 A KR 1020160022499A KR 20160022499 A KR20160022499 A KR 20160022499A KR 20170100220 A KR20170100220 A KR 20170100220A
Authority
KR
South Korea
Prior art keywords
node
mobile terminal
packet data
fixed
mobile
Prior art date
Application number
KR1020160022499A
Other languages
Korean (ko)
Other versions
KR101779700B1 (en
Inventor
이형준
김현애
Original Assignee
이화여자대학교 산학협력단
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 이화여자대학교 산학협력단 filed Critical 이화여자대학교 산학협력단
Priority to KR1020160022499A priority Critical patent/KR101779700B1/en
Publication of KR20170100220A publication Critical patent/KR20170100220A/en
Application granted granted Critical
Publication of KR101779700B1 publication Critical patent/KR101779700B1/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/18Communication route or path selection, e.g. power-based or shortest path routing based on predicted events
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A method for determining a routing path including a mobile terminal and a stationary node includes a step of allowing a computer device to determine a routing path for transmitting pack data from a source node to a target node. The routing path includes a first stationary node for receiving the packet data from a first mobile node and cashing it, and a second mobile terminal which moves to a region communicable with the first stationary node to receive the packet data. The computer device transmits the packet data from the source node to the target node at a reference packet delivery rate or higher, transmits the packet data from the source node to the target node within a time limit, and selects the first mobile terminal, the first stationary node, and the second mobile terminal constituting a path which requires the smallest amount of routing costs. It is possible to provide a more efficient routing scheme than the conventional DTN routing scheme.

Description

BACKGROUND OF THE INVENTION 1. Field of the Invention [0001] The present invention relates to a packet data delivery method using a mobile node and a fixed node, and a routing path determination method including a mobile node and a fixed node. 2. Description of the Related Art [0002]
The techniques described below relate to techniques for determining a routing path comprising a mobile terminal and a fixed node.
In addition to ubiquitous computing environments, various types of network technologies have emerged. For example, various networks such as a wireless LAN (WiFi), an ad hoc network, a sensor network, and the like have been developed as well as a wired Internet composed of a core network. Smart devices support various communication technologies such as WiFi, Bluetooth, NFC, etc. in addition to mobile communication. In other words, the present market environment is a state where various heterogeneous networks coexist.
The DTN (disruption tolerant network) is based on the concept of interworking heterogeneous networks with different delay times. Currently, DTN is extended to solve the problems of end-to-end path loss due to frequent connectivity changes such as sensor networks and vehicle networks, network configuration changes due to energy exhaustion, and high latency. DTN can basically deliver messages in a store and forward manner.
Various routing schemes have been studied to transmit data in DTN. On the other hand, there is a technique of performing routing using the moving pattern of the moving user.
E. M. Daly and M. Haahr. "Social network analysis for routing in disconnected delay-tolerant manets." In Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, pages 32-40. ACM, 2007. W. Gao, Q. Li, B. Zhao, and G. Cao. "Multicasting in delay tolerant networks: a social network perspective." In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, pages 299-308. ACM, 2009.
The conventional DTN routing method using the moving user's pattern transmits data to the destination based on a specific event that may occur. Therefore, there is a possibility that the data is not transmitted to the destination.
The technique described below is intended to provide a routing technique using a fixed network device caching data and a mobile terminal relaying data while moving.
A method for transmitting packet data using a mobile station and a fixed node includes receiving packet data from a source node by a first mobile station, moving the first mobile station to a first area communicable with at least one first stationary node, Transmitting the packet data to the first fixed node, receiving the packet data stored in the first fixed node by the second mobile terminal moving to the first region, Moving to a second area capable of communicating with a second fixed node of the second fixed node and transferring the packet data to the second fixed node and moving the target node to the second area, And a receiving step.
A routing path determination method including a mobile node and a fixed node determines a routing path through which a computer device transfers packet data from a source node to a destination node, wherein the routing path receives the packet data from a first mobile node And a second mobile terminal for moving to an area communicable with the first fixed node and receiving the packet data. Wherein the computer device transmits the packet data from the source node to the destination node at a reference packet rate or higher and transmits the packet data from the source node to the destination node within a time limit, And selects the first mobile terminal, the first fixed node, and the second mobile terminal.
The techniques described below are routing schemes that take into consideration the packet delivery rate and the deadline for data to be delivered to the destination. Thus, the techniques described below provide a more efficient routing scheme than the conventional DTN routing scheme.
1 shows an example of a configuration of a network system to which packet data is transmitted.
2 is an example of a flowchart of a packet data transmission method using a mobile node and a fixed node.
3 is an example of a beacon service system using routing including a mobile node and a fixed node.
The following description is intended to illustrate and describe specific embodiments in the drawings, since various changes may be made and the embodiments may have various embodiments. However, it should be understood that the following description does not limit the specific embodiments, but includes all changes, equivalents, and alternatives falling within the spirit and scope of the following description.
The terms first, second, A, B, etc., may be used to describe various components, but the components are not limited by the terms, but may be used to distinguish one component from another . For example, without departing from the scope of the following description, the first component may be referred to as a second component, and similarly, the second component may also be referred to as a first component. And / or < / RTI > includes any combination of a plurality of related listed items or any of a plurality of related listed items.
As used herein, the singular " include "should be understood to include a plurality of representations unless the context clearly dictates otherwise, and the terms" comprises & , Parts or combinations thereof, and does not preclude the presence or addition of one or more other features, integers, steps, components, components, or combinations thereof.
Before describing the drawings in detail, it is to be clarified that the division of constituent parts in this specification is merely a division by main functions of each constituent part. That is, two or more constituent parts to be described below may be combined into one constituent part, or one constituent part may be divided into two or more functions according to functions that are more subdivided. In addition, each of the constituent units described below may additionally perform some or all of the functions of other constituent units in addition to the main functions of the constituent units themselves, and that some of the main functions, And may be carried out in a dedicated manner.
Also, in performing a method or an operation method, each of the processes constituting the above method may occur in a different order than that described in the context without explicitly specifying a specific order in the context. That is, each process may occur in the same order as described, may be performed substantially concurrently, or may be performed in the opposite order.
The techniques described below correspond to routing techniques applicable to networks such as DTN. DTN is a delay / abort network. The proposed routing scheme uses a fixed network device (hereinafter referred to as a fixed node) and a moving mobile terminal. The fixed nodes include conventional network devices such as base stations for mobile communications, various other access points (APs), road side units (RSUs) of vehicle networks, Bluetooth beacons, NFC tags, and the like. Further, the fixed node may be a dedicated device for caching data for routing. Unlike a mobile terminal, a fixed node is located at a fixed point. The mobile terminal includes a smart phone, a tablet PC, a notebook, and a wearable device possessed by a user. In the following description, an object to be routed is called packet data.
In the following routing scheme, a mobile node transfers packet data to a fixed node, a fixed node caches packet data, and another mobile node receives packet data cached in a fixed node and delivers the packet data to another fixed node or a mobile terminal .
The proposed routing scheme is a routing scheme based on the movement pattern of mobile terminals. The proposed routing scheme performs routing based on the probability that each mobile terminal will visit a specific point (hereinafter referred to as visitability) and the time in which the mobile node is able to communicate with the fixed node. The proposed routing scheme uses a mixed-integer linear programming (MILP) to select the devices (fixed nodes and mobile terminals) to relay packet data. As described above, the following routing scheme uses a packet rate and a deadline as conditions. The timeout means the time that packet data should be delivered to the destination.
Hereinafter, a routing technique for transferring packet data to a mobile node (hereinafter referred to as a destination node) corresponding to a destination in a mobile node (hereinafter referred to as a source node) that provides packet data for the first time will be described. While the source node may be a fixed device such as a Bluetooth beacon device. A fixed node is located on the path where the mobile terminal moves. The routing technique described below provides a technique for selecting a mobile terminal (a set of mobile terminals) constituting a path likely to transmit packet data within a time limit from a source node to a destination node. Hereinafter, a mobile node constituting a routing path from a source node to a destination node is referred to as a relay node.
1 shows an example of a configuration of a network system 100 to which packet data is transmitted. The network system 100 to which packet data is transmitted includes mobile terminals 110A, 110B, 110C and 110D and fixed nodes 120A, 120B, 120C, 120D and 120E. The mobile terminals 110A, 110B, 110C, and 110D are devices such as a smart phone or the like possessed by the user as described above. The fixed nodes 120A, 120B, 120C, 120D, and 120E are APs of various communication methods as described above. The network system 100 to which the packet data is delivered may include a separate control server 150 for determining the routing path from the source node to the destination node.
The control server 150 can determine the routing path based on the information about the movement pattern of the mobile node, the location of the fixed node, and the possibility that the mobile node approaches the fixed node, which are necessary for routing path determination. A detailed description of routing path determination will be given later. 1, the source node is a mobile terminal 110A, and the destination node is a mobile terminal 110D. A plurality of fixed nodes 120A, 120B, 120C, 120D and 120E exist in a path from the mobile terminal 110A to the mobile terminal 110D. The control server 150 determines a routing path satisfying a predetermined condition among a plurality of paths. The routing path determined by the control server 150 in FIG. 1 is indicated by a solid line arrow. The mobile terminal 110A corresponds to the fixed node 120A, the mobile terminal 110B, the fixed node 120C, and the mobile terminal 110D. In FIG. 1, another path from the mobile terminal 110A to the mobile terminal 110D is shown by a dotted line.
The mobile terminal can deliver packet data to a plurality of fixed nodes (for example, the mobile terminal 110A can transmit packet data to the fixed node 120A and the fixed node 120B). The fixed nodes need not be connected to each other. The optimal routing path from the source node to the destination node must be determined as described above. The routing path consists of a fixed node and a mobile terminal. Therefore, it is a problem to select a fixed node and a relay node that have the lowest routing cost on the condition of packet transmission rate and time limit.
The mobile terminal and the fixed node can use various communication methods. For example, IEEE 802.11 (WiFi), Bluetooth, IEEE 802.15.4 (Zigbee), NFC, mobile communication, etc. can be used. At the same time, the mobile terminal stores the packet data in a storage device (memory) and delivers it to a fixed node or another mobile terminal while performing its own communication function.
It is difficult to transfer packet data between mobile terminals having different movement patterns. For example, if two mobile terminals visit the same specific point but they visit each other at different times, packet data can not be delivered. 1 uses the fixed node as a caching device for packet data, packet data can be delivered only when different mobile terminals visit the same place (shopping mall, mart, restaurant, cafe, etc.). In this case, the criterion and configuration for selecting a fixed node for caching packet data may be important.
Furthermore, even if two mobile terminals do not visit the same specific point, the use of a plurality of mobile terminals and a plurality of fixed nodes increases the likelihood of transmitting packet data also between mobile terminals having different movement patterns. In this case, criteria and configuration for selecting one or more relay nodes and one or more fixed nodes that form the routing path may be important.
Routing path determination requires information on the movement patterns of all the mobile terminals constituting the network and information on the location of the fixed nodes. The routing path determination may be performed by a separate computing device. For example, as shown in FIG. 1, the control server 150 may acquire necessary information in advance and analyze information to determine a routing path (mobile terminal and fixed node selection) for specific packet data. The control server determines a relay node and a fixed node to be used for delivering packet data transmitted from a specific source node to a specific destination node and transmits information about packet data to be transmitted to the relay node and the fixed node, . For example, the control server 150 can inform the relay node which packet data should be received from which fixed node. In FIG. 1, the control server 150 transmits certain information to the fixed node 120A and the relay node 110B through the network. The control server 150 can also inform the mobile terminal 110A which is the source node of the information about the fixed node 120A to which the mobile terminal 110A transmits the packet data and also transmit the packet data to the mobile terminal 110D, And can inform the received fixed node 120C.
The control server 150 can transmit to the fixed node the packet data to be relayed to the relay node 110B. The control server 150 can inform the fixed nodes 120A and 120C to which relay node 110B or the destination node 110D the packet data should be transmitted. The relay node and / or the fixed node that has obtained such information can confirm whether or not the relay node and / or the fixed node itself is an object to receive or transmit the packet data, and can forward the packet data. Or the relay node and / or the fixed node may carry packet data including a receiver having a specific identifier. Various methods can be used depending on the communication method. For example, if a multicast scheme for specifying a particular recipient is used, the recipient (relay node, destination node, or fixed node) can receive only the packet data including the identifier of the recipient .
Hereinafter, a method for determining a routing path from a source node to a destination node will be described. The routing path determination is a process of selecting a mobile node (relay node) and a fixed node constituting a path.
The routing path may need information on mobility for the mobile terminal (information on the movement pattern), information on the location of the fixed node, and communication method between the mobile terminal and the fixed node. 1, the control server 150 determines the entire routing path. As shown in FIG. 1, a server 150 connected to a network can determine a routing path. Or a separate computing device may determine the routing path regardless of whether the network is connected or not. Further, at least one mobile terminal or at least one fixed node connected to the network may determine the routing path.
In the following description, it is assumed that the computer device determines the routing path. Here, the computer device includes a server, a PC, a mobile terminal, a fixed node, etc. connected to a network. It is sufficient for the computer apparatus to perform an operation for determining the path based on the necessary information.
The possibility that the packet data is transmitted from the mobile terminal M i to the mobile terminal M j via the fixed node S k
Figure pat00001
.
Figure pat00002
Is a high value, it means that S k is an effective relay device for transmitting packet data from the mobile terminal M i to the mobile terminal M j . The average visit time interval for S k of mobile terminal M i is
Figure pat00003
. If the mobile terminal M i frequently visits S k
Figure pat00004
Becomes smaller. In order for a specific mobile node to exchange packet data with a specific fixed node, a specific mobile node must be located within the coverage of a specific fixed node. Hereinafter, an operation positioned within the coverage of a specific fixed node of a particular mobile terminal is referred to as a mobile terminal 'approaching' a fixed node.
The mobile terminal M i is close to the time the potential and the mobile terminal M i is S k which can deliver the packet data to the mobile terminal M j through a specific fixed node S k can be determined by analyzing information about the movement pattern of the mobile station . The content related to the movement pattern can utilize the techniques disclosed in the prior art. For example, D. Kotz, T. Henderson, I. Abyzov, and J. Yeo. "Crawdad trace dartmouth campus syslog." CRAWDAD wireless network data archive, Dec 2004, etc., can analyze the information on the movement pattern of the mobile terminal.
The computer device selects a relay node and a fixed node for use in delivering packet data (selects a routing path). At this time, the packet transmission rate and the time limit can be used as a criterion for QoS as described above.
In the following description, it is assumed that the packet transmission rate between the mobile terminal M i and the mobile terminal M j must satisfy a threshold value δ or more. Here, (M i , M j ) denotes all possible mobile terminal pairs present in the network. The computer device may select a plurality of fixed nodes to satisfy a constant packet transmission rate. With many fixed nodes, the routing cost itself can be large.
It is also assumed in the following description that the packet data should arrive within the time limit T max from the source node to the destination node. In this condition, even if the fixed node S k is close (close proximity) to the mobile terminal M i and the mobile terminal M j ,
Figure pat00005
) Is requested, the computer device may not select the corresponding fixed node S k . Conversely, even if a certain fixed node has a low proximity probability, the computer device can select the corresponding fixed node if the mobile terminal comes close at a frequent interval.
The longest propagation time required from all mobile nodes M i to mobile nodes M j via all possible fixed nodes S k
Figure pat00006
. In other words,
Figure pat00007
Is the longest total transmission time of the path from the mobile terminal M i to the mobile terminal M j .
Figure pat00008
May include one fixed node or may include a plurality of fixed nodes.
If a plurality of terminals from the source node to the destination node participate in the delivery of packet data,
Figure pat00009
Should be within T max .
The MILP is used to select the routing path satisfying the two conditions of packet transmission rate and time limit described above. The computer device determines the optimal path with the lowest routing cost from the source node to the destination node while satisfying the packet transmission rate 隆 and time limit T max .
In the following description
Figure pat00010
Denotes a mobile station M i fixed node S k indicating function (indicator function) the route to the mobile terminal M j indicates whether the entire route path selected as part of the via in.
Figure pat00011
Indicates an indicating function indicating whether a path from the mobile terminal M i to the mobile terminal M j is selected as a part of the entire routing path. Here, the entire routing path means the final path through which the packet data is transmitted from the source node to the destination node.
In the following description, it is assumed that a mobile node delivers packet data in a multicast manner to a fixed node, and a fixed node transmits packet data in a unicast manner to a mobile node.
The computer device can select a route that minimizes the routing cost represented by Equation (1) below.
Figure pat00012
In Equation (1)
Figure pat00013
Denotes a routing cost occurring in a path from a mobile node to a fixed node in consideration of multicast of a mobile node,
Figure pat00014
Refers to a routing cost occurring in a path from a fixed node to a mobile node in consideration of unicast for one mobile node in a fixed node.
Equation 1 is a binary integer variable < RTI ID = 0.0 >
Figure pat00015
Wow
Figure pat00016
, A variable that is both positive and non-integer
Figure pat00017
. Equation (1) must satisfy the following equations (2) to (12).
Figure pat00018
Equation (2) implies that packet data must be transmitted from the source node M s to another mobile node M j .
Figure pat00019
Equation (3) implies that the destination node M D must receive the packet data. Equation (3) represents a situation where packet data is transmitted from the mobile terminal M i to the destination node M D.
Figure pat00020
Equation (4) means that there should be no path through which packet data is transmitted from the mobile terminal M i to the source node M s .
Figure pat00021
Equation (5) implies that there is no path for transmitting packet data again to the mobile node M j constituting the path in the destination node M D. Equations (4) and (5) correspond to a condition for blocking a path in the form of a loop.
Figure pat00022
Equation (6) means that the path from the source node M D to the other mobile node M j must pass through at least one fixed node S k in the path through which the packet data is transmitted. That is, the source node M D transmits packet data to the fixed node S k , and the mobile node M j receives the cached data at the fixed node S k .
Figure pat00023
Equation (7) means that the destination node M D must receive packet data from at least one fixed node S k from another mobile terminal M i . That is, the mobile node M i transmits packet data to the fixed node S k and the destination node M D receives cached data at the fixed node S k .
Figure pat00024
Equation (8) means that the packet data transmitted by the mobile terminal should be preserved without being lost. Equation (8) means that when packet data is transmitted from at least one mobile terminal M i to one mobile terminal M j , packet data is transmitted from one mobile terminal M j to at least one mobile terminal M k . Or if the packet data is not transmitted to one mobile terminal M j , the mobile terminal M j also does not transmit the packet data.
Figure pat00025
Equation (9)
Figure pat00026
Wow
Figure pat00027
Lt; / RTI > For example, if a path from M i to M j is not selected
Figure pat00028
= 0), the fixed node S k via M i and M j is also not selected
Figure pat00029
= 0). Conversely, if the path from M i to M j is selected as the path through which the packet data is transmitted (
Figure pat00030
= 1), at least one fixed node S k is located between M i and M j (1?
Figure pat00031
).
Figure pat00032
Equation (10) means that the sum of the accessibility for all the fixed nodes in the path (from the path from M i to M j ) through which the packet data is transmitted should be equal to or greater than the limiting condition of the packet transmission rate δ.
Figure pat00033
Denotes a value for the probability of a fixed node S k existing on a path from M i to M j . When the path from M i to M j is selected as the path through which the packet data is transmitted (
Figure pat00034
= 1), the constraint condition δ or more should be satisfied.
Figure pat00035
Equation (11) is a sum of the time that each mobile station M i and M j S k access to the fixed nodes existing in paths from the M j M i from above
Figure pat00036
Or less.
Figure pat00037
Means the longest access time to stay at a fixed node in the path from M i to M j .
Figure pat00038
Equation (12)
Figure pat00039
Is less than or equal to the time limit T max .
2 is an example of a flowchart of a packet data transmission method 200 using a mobile node and a fixed node. The computer device first selects a routing path 210 from the source node to the destination node on the basis of the packet transmission rate and time limit. The computer device can transmit information for transferring packet data to the mobile node and the fixed node constituting the routing path. For example, the mobile terminal can indicate to which fixed node the packet data should be delivered or from which fixed node the packet data should be received. In addition, the fixed node may inform the mobile node of information on which packet data is to be received or which packet data should be transmitted to which mobile node. The packet data delivery is based on the assumption that the routing path is determined as described above, and that the mobile terminal and the fixed node constituting the routing path know information for routing.
The source node moves to the near region of at least one first fixed node. The proximity area means a certain area where the source node (mobile terminal) can communicate with the fixed node. The source node transmits the packet data to the at least one first fixed node by multicast (220). The first fixed node caches the received packet data.
Thereafter, the first fixed node transmits the packet data in unicast to the relay node (mobile terminal) moved to the neighboring region of the first fixed node (230). When the relay node moves to an adjacent region of the second fixed node, the relay node transmits the packet data to the at least one second fixed node through multicast (240). The second fixed node transmits the packet data in unicast to the destination node moved to the neighboring region of the second fixed node (250).
FIG. 2 shows an example where the routing path is a source node -> first fixed node -> relay node -> second fixed node -> destination node. Of course, the routing path may include more relay nodes and fixed nodes, unlike FIG.
3 is an example of a beacon service system 300 using routing including a mobile node and a fixed node. The beacon service system 300 utilizes the routing technique described above. The beacon service system 300 includes a beacon transmitter 310, mobile terminals 320A, 320B and 320C, fixed nodes 330A, 330B and 330C and a service server 350. [
In Figure 3, the source node is a beacon transmitter 310 that broadcasts a beacon message to Bluetooth. The source node may be a fixed device without mobility. 3, the destination node is the mobile terminal 320C. 3, the routing path is the beacon transmitter 310, the mobile terminal 320A, the fixed nodes 330A and 330B, the mobile terminal 320B, the fixed node 330C, and the mobile terminal 320C. In FIG. 3, the mobile terminal 320A transmits a beacon which is a packet message to two fixed nodes 330A and 330B. If the two paths from the mobile terminal 320A to the fixed nodes 330A and 330B satisfy a certain restriction condition and the routing costs are the same, the mobile terminal 320A transmits to the two fixed nodes 330A and 330B a beacon Lt; / RTI >
The mobile terminal 320C having received the beacon message finally requests the service server 350 to use the information included in the beacon message. The service server 350 provides the requested content to the mobile terminal 320C. The service server 350 can provide various kinds of contents to the mobile terminal 320C according to the type of the beacon service. Meanwhile, the service server 350 may perform a function of determining a routing path in advance like the control server 150 of FIG.
It should be noted that the present embodiment and the drawings attached hereto are only a part of the technical idea included in the above-described technology, and those skilled in the art will readily understand the technical ideas included in the above- It is to be understood that both variations and specific embodiments which can be deduced are included in the scope of the above-mentioned technical scope.
100: Network system to which packet data is transmitted
110A, 110B, 110C, and 110D:
120A, 120B, 120C, 120D, 120E: fixed nodes
150: control server
300: Beacon service system
310: Beacon transmitter
320A, 320B, and 320C:
330A, 330B, and 330C: fixed nodes
350: service server

Claims (12)

  1. The first mobile terminal receiving packet data from a source node;
    Moving the first mobile terminal to a first area capable of communicating with at least one first fixed node and delivering the packet data to the first fixed node;
    Receiving the packet data stored in the first fixed node by a second mobile terminal moving to the first region;
    The second mobile terminal moves to a second area communicable with at least one second fixed node and delivers the packet data to the second fixed node; And
    And moving the target node to the second area and receiving the packet data from the second fixed node.
  2. The method according to claim 1,
    Wherein the source node uses a mobile node that has the packet data or a mobile node that is a fixed node that holds the packet data and a fixed node.
  3. The method according to claim 1,
    Wherein the source node is a beacon transmitter that broadcasts the packet data.
  4. The method according to claim 1,
    The computer device selects the first mobile terminal and the second mobile terminal among a plurality of candidate terminals and selects the first fixed node among the fixed nodes existing on the path from the first mobile terminal to the second mobile terminal And selecting the second fixed node among the fixed nodes existing in the path from the second mobile terminal to the target node,
    Wherein the computer device transmits the packet data from the source node to the destination node at a reference packet rate or higher and transmits the packet data from the source node to the destination node within a time limit, And a fixed node, the mobile node selecting the first mobile node, the second mobile node, the first fixed node, and the second fixed node.
  5. A computer system comprising: a first fixed node for determining a routing path for transmitting packet data from a source node to a destination node, the routing path including a first fixed node receiving and receiving the packet data from a moving first mobile terminal; And a second mobile terminal for moving to a communicable area and receiving the packet data,
    Wherein the computer device transmits the packet data from the source node to the destination node at a reference packet rate or higher and transmits the packet data from the source node to the destination node within a time limit, The mobile node selecting the first mobile node, the first fixed node, and the second mobile node, and a fixed node.
  6. 6. The method of claim 5,
    Wherein the routing path further includes a second fixed node that is present in a path to the destination node and receives and caches the packet data from the second mobile terminal, And a fixed node that moves and receives the packet data from the second fixed node.
  7. 6. The method of claim 5,
    Wherein the computer device controls the first mobile terminal and the second mobile terminal based on the information about the movement pattern of the first mobile terminal, the information about the movement pattern of the second mobile terminal, and the position of the first fixed node, Selecting a second mobile terminal and selecting a first fixed node among a plurality of fixed nodes that exist on a path where the first mobile terminal and the second mobile terminal are moving and a fixed node, Way.
  8. 6. The method of claim 5,
    Wherein the first fixed node comprises: a first fixed node, which is connected to the second mobile terminal, from the first mobile terminal to the second mobile terminal, among at least one fixed node located in a superposed area of a path through which the first mobile terminal moves, And the fixed node includes at least one fixed node having a time at which the packet data is transmitted is equal to or less than a threshold value.
  9. 6. The method of claim 5,
    Wherein the computer device has a first mobile terminal and a second mobile terminal with a possibility that the first mobile terminal can access the first fixed node and transmit the packet data to the second mobile terminal among a plurality of mobile terminals, A method for determining a routing path comprising a mobile terminal and a fixed node for selecting a terminal.
  10. 6. The method of claim 5,
    Wherein the fixed node comprises at least one of a base station of a mobile communication, an AP of a WiFi, an AP of a Zigbee, a Bluetooth beacon and an NFC tag, and a fixed node.
  11. 6. The method of claim 5,
    Wherein the computer device comprises a mobile node and a fixed node for selecting the routing path to minimize the value of the following equation:
    Figure pat00040

    (
    Figure pat00041
    Is the first indication that represents the routing cost function to the mobile terminal 2 passes the packet data to at least one of the first fixed node S k present in the path from the j M in the first mobile terminal M i,
    Figure pat00042
    Indicates a routing cost for transferring the packet data from the first fixed node to the second mobile terminal M j )
  12. 12. The method of claim 11,
    Wherein the equation includes a mobile node satisfying a condition expressed by the following equation and a fixed node.
    Figure pat00043
    ,
    Figure pat00044

    (
    Figure pat00045
    Indicates the possibility that the first mobile terminal M i and the second mobile terminal M j are located in the region and the first packet data is transferred from the first mobile terminal M i to the second mobile terminal M j ,隆 is a reference transmission rate for the packet data,
    Figure pat00046
    Indicates a time at which the first packet data is transmitted from the first mobile node M i to the second mobile node M j via the first fixed node S k ,
    Figure pat00047
    Is a time limit for the packet data to be transmitted from the first mobile terminal M i to the second mobile terminal M j )
KR1020160022499A 2016-02-25 2016-02-25 Packet data transferring method using mobile equipment and stationary node and determining method for routing path including mobile equipment and stationary node KR101779700B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020160022499A KR101779700B1 (en) 2016-02-25 2016-02-25 Packet data transferring method using mobile equipment and stationary node and determining method for routing path including mobile equipment and stationary node

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020160022499A KR101779700B1 (en) 2016-02-25 2016-02-25 Packet data transferring method using mobile equipment and stationary node and determining method for routing path including mobile equipment and stationary node

Publications (2)

Publication Number Publication Date
KR20170100220A true KR20170100220A (en) 2017-09-04
KR101779700B1 KR101779700B1 (en) 2017-09-18

Family

ID=59924422

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020160022499A KR101779700B1 (en) 2016-02-25 2016-02-25 Packet data transferring method using mobile equipment and stationary node and determining method for routing path including mobile equipment and stationary node

Country Status (1)

Country Link
KR (1) KR101779700B1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102237459B1 (en) * 2020-01-28 2021-04-06 이화여자대학교 산학협력단 Determining method for relay nodes in vanet and control apparatus

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR102237459B1 (en) * 2020-01-28 2021-04-06 이화여자대학교 산학협력단 Determining method for relay nodes in vanet and control apparatus

Also Published As

Publication number Publication date
KR101779700B1 (en) 2017-09-18

Similar Documents

Publication Publication Date Title
Bazzi et al. IEEE 802.11 p for cellular offloading in vehicular sensor networks
EP1655902B1 (en) Mobile terminal, control device and mobile communication method
US7103023B2 (en) Radio communication control station, radio communication terminal, home agent, and radio communication method
Faheem et al. MQRP: Mobile sinks-based QoS-aware data gathering protocol for wireless sensor networks-based smart grid applications in the context of industry 4.0-based on internet of things
EP2740317B1 (en) Link sharing within a communication system
US8576800B2 (en) Method and apparatus for distributing data to a mobile device using plural access points
JP5316966B2 (en) Content download system, agent, and content download method
TW200840389A (en) Configuring a base station to act as a regional mobility agent
Singh et al. A review on VANET routing protocols and wireless standards
KR20060121118A (en) Method for the transmission of information in a communication system using a path
FR2883440A1 (en) Method and equipment for data transmission by ad hoc network
KR101779700B1 (en) Packet data transferring method using mobile equipment and stationary node and determining method for routing path including mobile equipment and stationary node
EP1909465B1 (en) Method and system for data communication in a wireless infrastructure based communication network
JP4284325B2 (en) Routing method for Adhoc network
Kim et al. Enabling location-aware quality-controlled access in wireless networks
JP2006191519A (en) Communication system and communicating method
Shah et al. A diverse band-aware dynamic spectrum access network architecture for delay-tolerant smart city applications
US20160309392A1 (en) Operating a user equipment in a wireless mesh radio network
Bazzi et al. Virtual road side units for geo-routing in VANETs
Alawi et al. Vehicular Wi-Fi offloading in heterogeneous vehicular networks: Techniques and challenges
KR20080025925A (en) Method and apparatus for deciding of routing path in wireless communication system using relay scheme
US10826851B2 (en) Method and system for routing delay-tolerant communication messages to a destination device
Karthikeyini et al. Cross Layer Aware Optimization of TCP Using Hybrid Omni and Directional Antenna Reliable for VANET
Fraire et al. DTN of Things
Muralidhar et al. A novel ferry-initiated message ferrying approach for data delivery in disconnected mobile ad hoc networks through native ferries

Legal Events

Date Code Title Description
E701 Decision to grant or registration of patent right
GRNT Written decision to grant