WO2015092989A1 - サーバ及びその通信方法 - Google Patents
サーバ及びその通信方法 Download PDFInfo
- Publication number
- WO2015092989A1 WO2015092989A1 PCT/JP2014/005992 JP2014005992W WO2015092989A1 WO 2015092989 A1 WO2015092989 A1 WO 2015092989A1 JP 2014005992 W JP2014005992 W JP 2014005992W WO 2015092989 A1 WO2015092989 A1 WO 2015092989A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- gateway
- message
- mobile node
- server
- movement history
- Prior art date
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/12—Messaging; Mailboxes; Announcements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/10—Small scale networks; Flat hierarchical networks
- H04W84/12—WLAN [Wireless Local Area Networks]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
- H04W84/22—Self-organising networks, e.g. ad-hoc networks or sensor networks with access to wired networks
Definitions
- This application relates to wireless ad hoc networks, and more particularly to relaying messages between remote wireless ad hoc networks.
- Disruption Tolerant Network is a wireless multi-hop network that includes multiple communication nodes.
- Disruption Tolerant Network can also be called Delay Tolerant Network or DisconnectDisTolerant Network.
- DTN Disruption / Delay / Disconnect Tolerant Network
- DTN nodes a plurality of communication nodes
- One or both of the source node and the destination node may be a node belonging to the DTN (DTN node), or belong to another network (for example, the Internet, a public cellular network, or a wireless local area network (LAN)). It may be a node.
- DTN node DTN node
- another network for example, the Internet, a public cellular network, or a wireless local area network (LAN)
- LAN wireless local area network
- DTN is premised on temporary or intermittent communication interruptions due to movement of DTN nodes and shielding of radio signals by obstacles.
- the DTN assumes that there is no stable communication path between the source node and the destination node at least at a certain point in time.
- Each DTN node performs a store-and-forward operation to deal with temporary or intermittent communication interruptions. Therefore, DTN can also be called a store-and-forward wireless multi-hop network.
- some or all of the plurality of DTN nodes constituting the DTN may be mobile nodes having mobility. In this sense, the DTN can also be called a store-and-forward wireless ad hoc network.
- the DTN is assumed to be applied to, for example, emergency communication at the time of disaster, and vehicle-to-vehicle communication and road-to-vehicle communication in an intelligent transportation system (ITS).
- ITS intelligent transportation system
- Patent Document 1 discloses an improvement in message delivery between DTN nodes.
- Patent Document 2 discloses improvement of routing in DTN.
- the inventors of the present invention use a message relay server to relay a message between physically separated wireless ad hoc networks, or to relay a message between an external network such as the Internet and the wireless ad hoc network.
- the wireless ad hoc network includes a DTN.
- DTN can be thought of as a form of wireless ad hoc network that performs store-and-forward operations to deal with temporary or intermittent communication disruptions.
- a message relay server (hereinafter simply referred to as a server) must select a message transfer destination or transfer path in order to deliver a message to a mobile node in a wireless ad hoc network.
- a server since the mobile node in the wireless ad hoc network has mobility, it is difficult to keep track of the current position of the mobile node.
- continuous communication is not guaranteed, and it is assumed that temporary or intermittent communication interruption occurs. That is, it is not guaranteed that there is a continuous communication path that can reach the destination mobile node at the time the server sends a message.
- the server must attempt to send a message to a mobile node that does not have a continuous communication path. Therefore, the server cannot grasp the current position of the mobile node prior to sending the message.
- cellular networks such as Universal Mobile Telecommunications System (UMTS) and Evolved Packet System (EPS) use paging. That is, a mobility management node (Serving GPRS Support Node (SGSN), MobilityMoManagement Entity (MME), etc.) in the core network always manages the position of the mobile node in units of location registration areas called routing areas or tracking areas.
- a mobility management node Serving GPRS Support Node (SGSN), MobilityMoManagement Entity (MME), etc.
- MME MobilityMoManagement Entity
- the mobility management node transmits a location registration area update message (for example, Tracking Area Update) to the mobility management node periodically or aperiodically.
- the mobility management node transmits a paging signal from all base stations in the location registration area to which the mobile node belongs. Then, the mobility management node receives the response from the mobile node that has received the paging signal, thereby accurately grasping the current position of the mobile node for each base station, and then transmit
- the cellular network is based on the premise that continuous location management of mobile nodes is performed, and mobile nodes that have been location-managed, for example, mobile nodes whose EPS Mobility Management (EMM) state is EMM-Registered, A message is sent after paging is performed.
- EMM EPS Mobility Management
- the cellular network does not provide a mechanism for transmitting a message to a mobile node whose location is not managed, for example, a mobile node whose EPS Mobility Management (EMM) state is EMM-DEREGISTERED. That is, transmission of a message addressed to a mobile node in a wireless ad hoc network including a DTN is transmission of a message to a mobile node that is not managed for location.
- the present invention has been made based on the above-described investigation by the inventors.
- One of the objects of the present invention is to provide a server, a communication method, and a program that can contribute to an improvement in the arrival probability of a message addressed to a mobile node in a wireless ad hoc network.
- the server includes a relay processing unit and a communication interface.
- the relay processing unit is configured to relay a message addressed to a mobile node in a wireless ad hoc network.
- the communication interface is configured to be able to communicate with a plurality of gateways via a network infrastructure. Each of the plurality of gateways provides connectivity to the network infrastructure for any of the wireless ad hoc networks included in the plurality of wireless ad hoc networks.
- the relay processing unit receives (a) a first message indicating that the final destination is the first mobile node, and (b) based on the movement history of the first mobile node, Determining a first gateway to which the first message is to be forwarded from among the plurality of gateways; and (c) the first message to the first mobile node via the first gateway. It is configured to attempt to send.
- a communication method performed by a server that relays a message addressed to a mobile node in a wireless ad hoc network includes: (a) a first message indicating that a final destination is a first mobile node. Receiving (b) the first message from a plurality of gateways providing connectivity to a network infrastructure for a plurality of wireless ad hoc networks based on a movement history of the first mobile node. Determining a first gateway to be transferred, and (c) attempting to send the first message to the first mobile node via the first gateway.
- the program includes a group of instructions for causing a computer to perform a method performed by a server that relays a message addressed to a mobile node in a wireless ad hoc network.
- the method includes: (a) identifying a first mobile node designated as a final destination of a first message; and (b) to a network infrastructure for a plurality of wireless ad hoc networks. Determining a first gateway to which the first message should be forwarded based on a movement history of the first mobile node among a plurality of gateways providing connectivity.
- FIG. 1 shows a configuration example of a network according to the present embodiment.
- the server 1 relays a message addressed to any mobile node belonging to any of the plurality of wireless ad hoc networks 41 to 46.
- the message relayed by the server 1 may be a message originating from a mobile node (transmitted by the mobile node) or a message originating from another network (not shown) (for example, the Internet).
- the server 1 can communicate with the gateways 21 to 24 via the network infrastructure 5.
- the network infrastructure 5 provides continuous communication compared to the wireless ad hoc networks 41-46.
- the network infrastructure 5 includes the Internet, a public cellular network, a public wireless LAN network, and the like.
- the gateways 21 to 24 provide connectivity to the network infrastructure 5 for the wireless ad hoc networks 41 to 46.
- the gateways 21 to 24 are, for example, (a) a wireless LAN access point, (b) a mobile node having both a wireless ad hoc function and a wireless LAN connection function and operating as a mobile router, or (c) a wireless ad hoc function and a public cellular A mobile node that has a function of connecting to a network and operates as a mobile router.
- the gateways 21 to 24 are wireless LAN access points. Therefore, the gateways 21 to 24 form a wireless LAN (WLAN) coverage.
- WLAN wireless LAN
- Each of the wireless ad hoc networks 41 to 46 includes one or a plurality of mobile nodes.
- the wireless ad hoc network 41 includes three mobile nodes 411 to 413.
- the wireless ad hoc network 42 includes one mobile node 421.
- the wireless ad hoc network 43 includes three mobile nodes 431 to 433.
- the wireless ad hoc network 44 includes two mobile nodes 441 and 442.
- the wireless ad hoc network 45 includes two mobile nodes 451 and 452.
- the wireless ad hoc network 46 includes two mobile nodes 461 and 462. These mobile nodes autonomously relay messages (data bundles or data packets) to realize message distribution between the transmission source node and the destination node.
- One or both of the transmission source node and the destination node may be mobile nodes belonging to the wireless ad hoc networks 41 to 46, or may be nodes belonging to other networks (not shown).
- Other networks include, for example, at least one of the Internet, a public cellular network, and a wireless LAN.
- FIG. 1 is only a snapshot showing the instantaneous state of the wireless ad hoc networks 41-46.
- the number of mobile nodes in each wireless ad hoc network varies with time. As the mobile node moves, the wireless ad hoc network may break up and disappear. Multiple wireless ad hoc networks may be combined. Also, a new wireless ad hoc network not shown in FIG. 1 may be formed by encountering a plurality of mobile nodes and starting a new communication.
- At least one of the wireless ad hoc networks 41 to 46 may be a DTN.
- mobile nodes belonging to the wireless ad hoc networks 41, 44, 45, and 46 behave as DTN nodes and perform store-and-forward operations.
- the mobile node 413 accumulates the message received from the mobile node 411 or 412 in the wireless ad hoc network 41 in the data buffer, and when communication with the mobile node 451 or 452 in the wireless ad hoc network 45 becomes possible.
- the message stored in the data buffer is transmitted according to a routing protocol (for example, the Epidemic method or the Spray and Wait method).
- each mobile node shown in FIG. 1 communicates with the server 1 for message delivery between wireless ad hoc networks. Specifically, a message originating from any one of the mobile nodes is transferred to the server 1 via the mobile nodes 411, 421, 431, or 441 having connections with the gateways 21 to 24. Similarly, a message addressed to any one of the mobile nodes is transferred from the server 1 via the mobile nodes 411, 421, 431, or 441 having connections with the gateways 21 to 24.
- the network configuration shown in FIG. 1 is merely an example.
- the number of gateways may be plural, and is not limited to four shown in FIG.
- the number of mobile nodes and the number of wireless ad hoc networks are not limited to those in FIG.
- the gateway selection operation performed by the server 1 will be described below with reference to FIGS.
- the server 1 In response to receiving a message indicating that the final destination is the node B (for example, the mobile node 452), the server 1 transfers the message based on the movement history of the node B (the node 452).
- the gateway to be executed is determined from among the plurality of gateways 21 to 24. Then, the server 1 tries to send a message to the node B via the determined gateway.
- the movement history of the destination node B may indicate a route through which a message originating from the node B (node 452) has passed when reaching the server 1.
- a route through which a message from the node B has passed in the past may be represented by, for example, any Internet protocol (IP) address of the gateway 21 to 24 or any network address of the wireless LAN coverage 31 to 34. Good.
- IP Internet protocol
- the server 1 may select a gateway included in a route through which a message from the node B has passed in the past.
- Server 1 is a gateway to which a message to Node B should be forwarded based on the relationship between the time zone, day of the week, or date when the message from Node B has passed through the gateway in the past and the current time zone, day of the week, or date. May be determined. For example, it is inferred from the movement history that Node B is using a specific gateway at a specific time zone or a specific day of the week (that is, a message originating from Node B is passing through a specific gateway). If so, the server 1 may select that particular gateway for transmission to the Node B at that particular time zone or on a particular day of the week.
- the server 1 may determine a gateway to which a message to the node B should be transferred based on the behavior pattern of the node B estimated from the movement history of the node B. For example, when it is inferred from the movement history that the node B frequently moves between a plurality of gateways, the server 1 may preferentially select the plurality of gateways.
- the movement history of the destination node B may indicate the past geographical position of the node B (node 452).
- the geographical position of the node B may be represented by position information acquired using, for example, a Global Positioning System (GPS) receiver arranged in the node B (node 452).
- GPS Global Positioning System
- the node B (node 452) may report its position information to the server 1 periodically or aperiodically via the wireless ad hoc networks 41 to 46.
- the server 1 compares the geographical position of the node B (node 452) with the geographical arrangement of the plurality of gateways 21 to 24, thereby identifying the appropriate gateway (for example, the node B (node 452) and the geographical location). The closest gateway) may be selected.
- FIG. 2 is a conceptual diagram showing a specific example of the gateway selection operation by the server 1.
- the server 1 receives a message originating from the node A (here, the mobile node 442).
- the server 1 confirms the message header to identify that the final destination of the message is the node B (here, the mobile node 452).
- the server 1 accesses the movement history database 10 and acquires the movement history of the node B (mobile node 452).
- the server 1 determines a gateway (here, the gateway 21) based on the movement history of the node B (mobile node 452).
- the server 1 tries to send a message to the node B (mobile node 452) via the determined gateway (gateway 21).
- FIG. 2 shows an example of message transmission between mobile nodes. However, the message transmitted to the node B (node 452) may arrive at the server 1 from another network (for example, the Internet).
- FIG. 3 is a flowchart showing an example of the gateway selection operation by the server 1.
- the server 1 receives a message.
- the transfer destination gateway of the message is determined.
- the server 1 tries to transmit a message via the transfer destination gateway determined in step S12.
- FIG. 4 is a block diagram illustrating a configuration example of the server 1.
- the relay processing unit 11 is configured to relay a message addressed to a mobile node in the wireless ad hoc network. Further, the relay processing unit 11 performs the above-described gateway selection operation.
- the communication interface 12 can communicate with a plurality of gateways 21 to 24 via the network infrastructure 5.
- the server 1 receives a message addressed to a mobile node (here, referred to as Node B) in the wireless ad hoc network, and based on the movement history of the Node B.
- the gateway operates to determine the gateway to which the message is to be transferred from among the plurality of gateways 21 to 24. Then, the server 1 operates to try to send a message to the Node B via the determined gateway.
- the server 1 can efficiently determine the gateway to which the message is to be transferred, and thus can contribute to the improvement of the actual arrival probability of the message addressed to the mobile node in the wireless ad hoc network.
- the server 1 performs the gateway selection operation described in the first embodiment, and tries to transmit a message via the selected gateway.
- the mobile node may move, or the wireless ad hoc network may disappear or break down, and the state of the network changes. Therefore, the message transmission attempt is not always successful.
- the movement history of the mobile node known by the server may be quite past information. This is because it takes time for a message or location information originating from a mobile node to reach the server 1 in a DTN that allows delay. In this case, the probability of successful message transmission attempts may be further reduced.
- the server 1 selects the next gateway when attempting to send a message fails, and tries to send a new message.
- the server 1 may try to send messages in order from the gateway with the highest reachability based on the movement history of the destination node.
- the server 1 accesses the movement history database 10 to refer to the movement history of the mobile node B, and determines reachability to the node B when passing through each gateway based on the movement history. . Then, the server 1 tries to transmit a message addressed to the mobile node B in the order of the gateways 21, 22, and 23.
- the reachability to the mobile node B via each gateway may be determined based on the movement history of the mobile node B.
- a movement history indicates a route that has passed when a message derived from the mobile node B reaches the server 1.
- the server 1 may determine that a gateway having a longer or larger time or number of times of providing connectivity to the network infrastructure 5 to the mobile node B has a higher reachability to the mobile node B.
- the server 1 is connected to the mobile node B as the gateway in which the mobile node B is located geographically is longer. What is necessary is just to judge that reachability is high.
- FIG. 6 is a flowchart showing an example of the gateway selection operation by the server 1 according to the present embodiment.
- step S ⁇ b> 21 the server 1 tries to send a message via a gateway having the highest reachability to the final destination node B.
- step S22 the server 1 determines whether or not the attempt in step S21 has failed. When the trial in step S21 fails (YES in step S22), the server 1 determines whether there is another candidate gateway (step S23). If one or more other candidate gateways exist (YES in step S23), message transmission via the gateway with the next highest reachability is attempted (step S24). The server 1 repeats the operations in steps S22 to S24 until the message transmission is successful or there are no candidate gateways.
- the server 1 attempts message transmission in order from the gateway with the highest reachability based on the movement history of the destination node of the message. Therefore, the reachability of the message can be further increased.
- the server 1 may adjust the ratio of the number of message transmission attempts among a plurality of gateways based on the movement history of the message destination node. Specifically, the server 1 compares the number of transmission attempts with respect to a gateway that is determined to have high message reachability based on the movement history as compared with the number of transmission attempts with respect to another gateway that has relatively low reachability. You may enlarge it. Considering the mobility of mobile nodes in wireless ad hoc networks and DTNs, a one-time message transmission attempt may not yield favorable results. This is because the trial timing may overlap when the mobile node does not exist away from the vicinity of the gateway, and the trial timing may overlap when the communication path is temporarily interrupted.
- the reachability to the destination node is increased by repeating transmission attempts to the same gateway.
- the reachability to the destination node is increased by repeating transmission attempts to the same gateway.
- the server 1 adjusts the maximum retention period (referred to as cache valid time) in which the message is held in the memory of the server 1 based on the movement history of the message destination node. May be. Specifically, the server 1 sets a long store and forward cache valid time by the server 1 for a destination node that frequently goes between a plurality of gateways (for example, the gateways 21 to 24). Good. By increasing the cache valid time, the actual arrival probability of the message can be efficiently increased.
- cache valid time the maximum retention period in which the message is held in the memory of the server 1 based on the movement history of the message destination node. May be. Specifically, the server 1 sets a long store and forward cache valid time by the server 1 for a destination node that frequently goes between a plurality of gateways (for example, the gateways 21 to 24). Good. By increasing the cache valid time, the actual arrival probability of the message can be efficiently increased.
- the server 1 may exchange a node movement history with another server.
- the server 1 may transmit the movement history of the node grasped by itself to another server and receive the movement history of the node grasped by the other node from the other server.
- the server 1 may determine a gateway to which a message to the node B should be transferred from among a plurality of gateways in consideration of the movement history of the node B received from another server.
- the operation of exchanging the node movement history with another server may be performed periodically, or may be performed aperiodically when it is assumed that the probability of reaching the node B is low.
- the gateway determination processing in the server 1 described in the plurality of embodiments described above may be realized by causing a computer system to execute a program. Specifically, one or a plurality of programs including a group of instructions for causing a computer system to execute the algorithm described using a flowchart or the like in this specification may be created, and the programs may be supplied to the computer system.
- Non-transitory computer readable media include various types of tangible storage media (tangible storage medium). Examples of non-transitory computer-readable media are magnetic recording media (eg flexible disks, magnetic tapes, hard disk drives), magneto-optical recording media (eg magneto-optical discs), CompactComp Disc Read Only Memory (CD-ROM), CD-ROM Includes R, CD-R / W, semiconductor memory (eg mask ROM, Programmable ROM (PROM), Erasable PROM (EPROM), flash ROM, Random Access Memory (RAM)).
- the program may also be supplied to the computer by various types of temporary computer-readable media. Examples of transitory computer readable media include electrical signals, optical signals, and electromagnetic waves.
- the temporary computer-readable medium can supply the program to the computer via a wired communication path such as an electric wire and an optical fiber, or a wireless communication path.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
図1は、本実施形態に係るネットワークの構成例を示している。サーバ1は、複数の無線アドホックネットワーク41~46のいずれかに属する任意のモバイルノード宛てのメッセージを中継する。サーバ1によって中継されるメッセージは、モバイルノードに由来する(モバイルノードによって送信された)メッセージであってもよいし、図示しない他のネットワーク(例えば、インターネット)に由来するメッセージであってもよい。
本実施形態では、上述した第1の実施形態の変形例を説明する。本実施形態に係るネットワークの全体構成は、図1に示された構成例と同様である。本実施形態に係るサーバ1の構成例は、図4に示された構成例と同様である。
上述した第1又は第2の実施形態において、サーバ1(中継処理部11)は、ノードの移動履歴を他のサーバとの間で交換してもよい。言い換えると、サーバ1は、自身が把握しているノードの移動履歴を他のサーバに送信し、他のノードが把握しているノードの移動履歴を他のサーバから受信してもよい。そして、サーバ1は、他のサーバから受け取ったノードBの移動履歴を考慮して、ノードBへのメッセージが転送されるべきゲートウェイを複数のゲートウェイの中から決定してもよい。ノードの移動履歴を他のサーバと交換する動作は、周期的に行われてもよいし、ノードBへの到達確率が低いと想定される場合等に非周期的に行われてもよい。他のサーバによって把握されているノードの移動履歴を考慮することで、メッセージの到達確率の向上、及び送信試行回数の低減を図ることができる。
10 移動履歴データベース
11 中継処理部
12 通信インタフェース
5 ネットワークインフラストラクチャ
21~24 ゲートウェイ
31~34 Wireless Local Area Network(WLAN)カバレッジ
41~44 無線アドホックネットワーク
411~413、421、431~433、441~442、451~452、461~462 モバイルノード
Claims (33)
- 無線アドホックネットワーク内のモバイルノード宛てのメッセージを中継する中継処理手段と、
ネットワークインフラストラクチャを介して複数のゲートウェイと通信可能な通信インタフェースと、
を備え、
前記複数のゲートウェイの各々は、複数の無線アドホックネットワークのうちの少なくとも1つの無線アドホックネットワークに対して前記ネットワークインフラストラクチャへの接続性を提供し、
前記中継処理手段は、
最終的な宛先が第1のモバイルノードであることを示す第1のメッセージを受信し、
前記第1のモバイルノードの移動履歴に基づいて、前記第1のメッセージが転送されるべき第1のゲートウェイを前記複数のゲートウェイの中から決定し、
前記第1のゲートウェイを経由する前記第1のモバイルノードへの前記第1のメッセージの送信を試行するよう構成されている、
サーバ。 - 前記移動履歴は、前記第1のモバイルノードに由来するメッセージが前記サーバに到達する際に通過した経路を示し、
前記サーバは、前記経路に含まれているゲートウェイを前記第1のゲートウェイとして決定する、
請求項1に記載のサーバ。 - 前記サーバは、前記第1のモバイルノードに由来するメッセージが過去にゲートウェイを通過した時間帯、曜日、又は日付と現在の時間帯、曜日、又は日付の関係に基づいて前記第1のゲートウェイを決定する、請求項2に記載のサーバ。
- 前記サーバは、前記移動履歴から推測される前記第1のモバイルノードの行動パターンに基づいて前記第1のゲートウェイを決定する、請求項2又は3に記載のサーバ。
- 前記移動履歴は、前記第1のモバイルノードの過去の地理的な位置を示し、
前記サーバは、前記地理的な位置を前記複数のゲートウェイの地理的な配置と照らし合わせることによって、前記第1のゲートウェイを決定する、
請求項1に記載のサーバ。 - 前記中継処理手段は、前記第1のゲートウェイを経由する前記第1のメッセージの送信が失敗したことに応答して、前記第1のメッセージが転送されるべき第2のゲートウェイを前記複数のゲートウェイの中から決定する、請求項1~5のいずれか1項に記載のサーバ。
- 前記中継処理手段は、前記移動履歴に基づいて、前記第1のゲートウェイを経由する前記第1のメッセージの送信試行回数と前記第2のゲートウェイを経由する前記第1のメッセージの送信試行回数の割合を調整する、請求項6に記載のサーバ。
- 前記中継処理手段は、前記第1のモバイルノードが前記第1のゲートウェイから接続性を提供されている時間又は回数が前記第2のゲートウェイから接続性を提供されている時間又は回数よりも長い又は大きいほど、前記第1のゲートウェイを経由する送信試行回数を前記第2のゲートウェイを経由する送信試行回数に比べて大きくする、請求項7に記載のサーバ。
- 前記中継処理手段は、さらに、前記移動履歴から推測される前記第1のモバイルノードの移動頻度に基づいて、前記サーバにおいて前記第1のメッセージが保持される最大保存期間を調整する、請求項1~8のいずれか1項に記載のサーバ。
- 前記中継処理手段は、前記第1のモバイルノードの移動履歴を他のサーバとの間で交換する、請求項1~9のいずれか1項に記載のサーバ。
- 前記中継処理手段は、他のサーバから受け取った前記第1のモバイルノードの移動履歴を考慮して前記第1のゲートウェイを決定する、請求項10に記載のサーバ。
- 前記複数のゲートウェイの少なくとも1つは、無線Local Area Network(LAN)アクセスポイントである、請求項1~11のいずれか1項に記載のサーバ。
- 前記ネットワークインフラストラクチャは、前記複数の無線アドホックネットワークに比べて継続的な通信を提供する、請求項1~12のいずれか1項に記載のサーバ。
- 無線アドホックネットワーク内のモバイルノード宛てのメッセージを中継するサーバによって行われる通信方法であって、
最終的な宛先が第1のモバイルノードであることを示す第1のメッセージを受信すること、
複数の無線アドホックネットワークに対してネットワークインフラストラクチャへの接続性を提供する複数のゲートウェイの中から、前記第1のモバイルノードの移動履歴に基づいて、前記第1のメッセージが転送されるべき第1のゲートウェイを決定すること、及び
前記第1のゲートウェイを経由する前記第1のモバイルノードへの前記第1のメッセージの送信を試行すること、
を備える、
通信方法。 - 前記移動履歴は、前記第1のモバイルノードに由来するメッセージが前記サーバに到達する際に通過した経路を示し、
前記決定することは、前記経路に含まれているゲートウェイを前記第1のゲートウェイとして決定することを含む、
請求項14に記載の通信方法。 - 前記決定することは、前記第1のモバイルノードに由来するメッセージが過去にゲートウェイを通過した時間帯、曜日、又は日付と現在の時間帯、曜日、又は日付の関係に基づいて前記第1のゲートウェイを決定することを含む、請求項15に記載の通信方法。
- 前記決定することは、前記移動履歴から推測される前記第1のモバイルノードの行動パターンに基づいて前記第1のゲートウェイを決定することを含む、請求項15又は16に記載の通信方法。
- 前記移動履歴は、前記第1のモバイルノードの過去の地理的な位置を示し、
前記決定することは、前記地理的な位置を前記複数のゲートウェイの地理的な配置と照らし合わせることによって、前記第1のゲートウェイを決定することを含む、
請求項14に記載の通信方法。 - 前記第1のゲートウェイを経由する前記第1のメッセージの送信が失敗したことに応答して、前記第1のメッセージが転送されるべき第2のゲートウェイを前記複数のゲートウェイの中から決定することをさらに備える、請求項14~18のいずれか1項に記載の通信方法。
- 前記移動履歴に基づいて、前記第1のゲートウェイを経由する前記第1のメッセージの送信試行回数と前記第2のゲートウェイを経由する前記第1のメッセージの送信試行回数の割合を調整することをさらに備える、請求項19に記載の通信方法。
- 前記調整することは、前記第1のモバイルノードが前記第1のゲートウェイから接続性を提供されている時間又は回数が前記第2のゲートウェイから接続性を提供されている時間又は回数よりも長い又は大きいほど、前記第1のゲートウェイを経由する送信試行回数を前記第2のゲートウェイを経由する送信試行回数に比べて大きくすることを含む、請求項20に記載の通信方法。
- 前記第1のモバイルノードの移動履歴を他のサーバとの間で交換することをさらに備える、請求項14~21のいずれか1項に記載の通信方法。
- 前記決定することは、他のサーバから受け取った前記第1のモバイルノードの移動履歴を考慮して前記第1のゲートウェイを決定することを含む、請求項22に記載の通信方法。
- 無線アドホックネットワーク内のモバイルノード宛てのメッセージを中継するサーバによって行われる方法をコンピュータに行わせるためのプログラムを格納した非一時的なコンピュータ可読媒体であって、
前記方法は、
第1のメッセージの最終的な宛先に指定された第1のモバイルノードを特定すること、及び
複数の無線アドホックネットワークに対してネットワークインフラストラクチャへの接続性を提供する複数のゲートウェイの中から、前記第1のモバイルノードの移動履歴に基づいて、前記第1のメッセージが転送されるべき第1のゲートウェイを決定すること、
を備える、
非一時的なコンピュータ可読媒体。 - 前記移動履歴は、前記第1のモバイルノードに由来するメッセージが前記サーバに到達する際に通過した経路を示し、
前記決定することは、前記経路に含まれているゲートウェイを前記第1のゲートウェイとして決定することを含む、
請求項24に記載の非一時的なコンピュータ可読媒体。 - 前記決定することは、前記第1のモバイルノードに由来するメッセージが過去にゲートウェイを通過した時間帯、曜日、又は日付と現在の時間帯、曜日、又は日付の関係に基づいて前記第1のゲートウェイを決定することを含む、請求項25に記載の非一時的なコンピュータ可読媒体。
- 前記決定することは、前記移動履歴から推測される前記第1のモバイルノードの行動パターンに基づいて前記第1のゲートウェイを決定することを含む、請求項25又は26に記載の非一時的なコンピュータ可読媒体。
- 前記移動履歴は、前記第1のモバイルノードの過去の地理的な位置を示し、
前記決定することは、前記地理的な位置を前記複数のゲートウェイの地理的な配置と照らし合わせることによって、前記第1のゲートウェイを決定することを含む、
請求項24に記載の非一時的なコンピュータ可読媒体。 - 前記方法は、前記第1のゲートウェイを経由する前記第1のメッセージの送信が失敗したことに応答して、前記第1のメッセージが転送されるべき第2のゲートウェイを前記複数のゲートウェイの中から決定することをさらに備える、請求項24~28のいずれか1項に記載の非一時的なコンピュータ可読媒体。
- 前記方法は、前記移動履歴に基づいて、前記第1のゲートウェイを経由する前記第1のメッセージの送信試行回数と前記第2のゲートウェイを経由する前記第1のメッセージの送信試行回数の割合を調整することをさらに備える、請求項29に記載の非一時的なコンピュータ可読媒体。
- 前記調整することは、前記第1のモバイルノードが前記第1のゲートウェイから接続性を提供されている時間又は回数が前記第2のゲートウェイから接続性を提供されている時間又は回数よりも長い又は大きいほど、前記第1のゲートウェイを経由する送信試行回数を前記第2のゲートウェイを経由する送信試行回数に比べて大きくすることを含む、請求項30に記載の非一時的なコンピュータ可読媒体。
- 前記方法は、前記第1のモバイルノードの移動履歴を他のサーバとの間で交換することをさらに備える、請求項24~31のいずれか1項に記載の非一時的なコンピュータ可読媒体。
- 前記決定することは、他のサーバから受け取った前記第1のモバイルノードの移動履歴を考慮して前記第1のゲートウェイを決定することを含む、請求項32に記載の非一時的なコンピュータ可読媒体。
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP14870986.8A EP3086601B1 (en) | 2013-12-16 | 2014-12-01 | Server and communication method thereof |
US15/023,450 US10111056B2 (en) | 2013-12-16 | 2014-12-01 | Server and communication method thereof |
JP2015553355A JP6311722B2 (ja) | 2013-12-16 | 2014-12-01 | サーバ及びその通信方法 |
CN201480060639.7A CN105706495B (zh) | 2013-12-16 | 2014-12-01 | 服务器及其通信方法 |
KR1020167008113A KR101815047B1 (ko) | 2013-12-16 | 2014-12-01 | 서버 및 그 통신 방법 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2013-259212 | 2013-12-16 | ||
JP2013259212 | 2013-12-16 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2015092989A1 true WO2015092989A1 (ja) | 2015-06-25 |
Family
ID=53402368
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2014/005992 WO2015092989A1 (ja) | 2013-12-16 | 2014-12-01 | サーバ及びその通信方法 |
Country Status (8)
Country | Link |
---|---|
US (1) | US10111056B2 (ja) |
EP (1) | EP3086601B1 (ja) |
JP (1) | JP6311722B2 (ja) |
KR (1) | KR101815047B1 (ja) |
CN (1) | CN105706495B (ja) |
AR (1) | AR098768A1 (ja) |
TW (1) | TWI622310B (ja) |
WO (1) | WO2015092989A1 (ja) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2017141807A1 (ja) * | 2016-02-18 | 2017-08-24 | 日本電気株式会社 | 通信システム、エッジサーバ、第1ブローカ、第2ブローカ、方法および記憶媒体 |
JP2020535759A (ja) * | 2017-09-29 | 2020-12-03 | ソニー株式会社 | セルラーネットワークにおける効率的なue装置位置通報 |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2548798A (en) * | 2016-03-17 | 2017-10-04 | Virtuosys Ltd | Wireless communication unit and method for sharing delay tolerant content |
FR3057726B1 (fr) * | 2016-10-13 | 2018-12-07 | Sagemcom Energy & Telecom Sas | Relais dans un systeme de communication de type lpwan |
US10536211B2 (en) * | 2016-10-14 | 2020-01-14 | Huawei Technologies Co., Ltd. | Mobile device relay service for reliable internet of things |
US20180124592A1 (en) * | 2016-10-27 | 2018-05-03 | Futurewei Technologies, Inc. | Distributed data store-equipped evolved packet core apparatus and method |
US10616772B2 (en) * | 2017-03-15 | 2020-04-07 | At&T Mobility Ii Llc | Systems and methods for using femtocell functionality in user devices |
JP6801543B2 (ja) * | 2017-03-22 | 2020-12-16 | 富士通株式会社 | 情報処理装置、情報処理システム及び情報処理方法 |
CN108650639A (zh) * | 2018-04-13 | 2018-10-12 | 深圳络绎星和科技有限公司 | 自组网联网方法及系统 |
JP7215717B2 (ja) * | 2019-01-09 | 2023-01-31 | 国立研究開発法人情報通信研究機構 | 無線通信システム |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004180024A (ja) * | 2002-11-27 | 2004-06-24 | Nec Commun Syst Ltd | 在圏位置予測システム、情報管理装置および情報管理方法 |
WO2004114703A1 (ja) * | 2003-06-20 | 2004-12-29 | Ntt Docomo, Inc. | 制御装置及び移動端末 |
WO2009078427A1 (ja) * | 2007-12-17 | 2009-06-25 | Nec Corporation | 経路制御方法およびノード |
WO2011071045A1 (ja) | 2009-12-09 | 2011-06-16 | 日本電気株式会社 | 情報共有システム、通信装置、制御方法、及びプログラム |
JP2012095235A (ja) * | 2010-10-28 | 2012-05-17 | Mitsubishi Electric Corp | ノード局および冗長経路制御方法 |
JP2012253450A (ja) * | 2011-05-31 | 2012-12-20 | Fujitsu Ltd | 断続的通信環境におけるデータ転送装置、その方法及びそのためのプログラム |
WO2013076912A1 (ja) | 2011-11-21 | 2013-05-30 | 日本電気株式会社 | 経路情報交換方法、通信端末および経路情報交換プログラムを格納した非一時的なコンピュータ可読媒体 |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6807158B2 (en) * | 2001-08-07 | 2004-10-19 | Hrl Laboratories, Llc | Method and apparatus for determining position and trajectory of gateways to optimize performance in hybrid non-terrestrial-terrestrial multi-hop mobile networks |
US7433691B1 (en) | 2002-03-25 | 2008-10-07 | Meshnetworks, Inc. | System and method for enabling an access point in an ad-hoc wireless network with fixed wireless routers and wide area network (WAN) access points to identify the location of subscriber device |
US7545782B2 (en) * | 2004-02-19 | 2009-06-09 | Belair Networks, Inc. | Mobile station traffic routing |
JP2005236767A (ja) | 2004-02-20 | 2005-09-02 | Ntt Docomo Inc | 通信装置、中継装置及び通信システム並びに通信方法 |
US7948931B2 (en) * | 2004-03-01 | 2011-05-24 | The Charles Stark Draper Laboratory, Inc. | MANET routing based on best estimate of expected position |
US8660526B1 (en) * | 2005-06-24 | 2014-02-25 | Rockwell Collins, Inc. | Location-based intrusion detection system |
US8520673B2 (en) * | 2006-10-23 | 2013-08-27 | Telcordia Technologies, Inc. | Method and communication device for routing unicast and multicast messages in an ad-hoc wireless network |
US8139504B2 (en) * | 2009-04-07 | 2012-03-20 | Raytheon Bbn Technologies Corp. | System, device, and method for unifying differently-routed networks using virtual topology representations |
US8977267B2 (en) | 2009-05-21 | 2015-03-10 | Mitsubishi Electric Corporation | Communication control method and radio base station |
US8542636B2 (en) * | 2010-01-04 | 2013-09-24 | Lili Qiu | Vehicular content distribution |
CN103023729A (zh) | 2011-09-22 | 2013-04-03 | 中兴通讯股份有限公司 | 中继节点选择方法及装置 |
CN104081831B (zh) * | 2012-08-21 | 2018-08-14 | 统一有限责任两合公司 | 选择接入点的方法和通信系统 |
US9081643B2 (en) * | 2012-09-21 | 2015-07-14 | Silver Sring Networks, Inc. | System and method for efficiently updating firmware for nodes in a mesh network |
-
2014
- 2014-12-01 EP EP14870986.8A patent/EP3086601B1/en active Active
- 2014-12-01 JP JP2015553355A patent/JP6311722B2/ja active Active
- 2014-12-01 CN CN201480060639.7A patent/CN105706495B/zh active Active
- 2014-12-01 WO PCT/JP2014/005992 patent/WO2015092989A1/ja active Application Filing
- 2014-12-01 US US15/023,450 patent/US10111056B2/en active Active
- 2014-12-01 KR KR1020167008113A patent/KR101815047B1/ko active IP Right Grant
- 2014-12-11 TW TW103143190A patent/TWI622310B/zh active
- 2014-12-16 AR ARP140104678A patent/AR098768A1/es unknown
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2004180024A (ja) * | 2002-11-27 | 2004-06-24 | Nec Commun Syst Ltd | 在圏位置予測システム、情報管理装置および情報管理方法 |
WO2004114703A1 (ja) * | 2003-06-20 | 2004-12-29 | Ntt Docomo, Inc. | 制御装置及び移動端末 |
WO2009078427A1 (ja) * | 2007-12-17 | 2009-06-25 | Nec Corporation | 経路制御方法およびノード |
WO2011071045A1 (ja) | 2009-12-09 | 2011-06-16 | 日本電気株式会社 | 情報共有システム、通信装置、制御方法、及びプログラム |
JP2012095235A (ja) * | 2010-10-28 | 2012-05-17 | Mitsubishi Electric Corp | ノード局および冗長経路制御方法 |
JP2012253450A (ja) * | 2011-05-31 | 2012-12-20 | Fujitsu Ltd | 断続的通信環境におけるデータ転送装置、その方法及びそのためのプログラム |
WO2013076912A1 (ja) | 2011-11-21 | 2013-05-30 | 日本電気株式会社 | 経路情報交換方法、通信端末および経路情報交換プログラムを格納した非一時的なコンピュータ可読媒体 |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2017141807A1 (ja) * | 2016-02-18 | 2017-08-24 | 日本電気株式会社 | 通信システム、エッジサーバ、第1ブローカ、第2ブローカ、方法および記憶媒体 |
JPWO2017141807A1 (ja) * | 2016-02-18 | 2018-11-22 | 日本電気株式会社 | 通信システム、エッジサーバ、方法およびプログラム |
JP2020535759A (ja) * | 2017-09-29 | 2020-12-03 | ソニー株式会社 | セルラーネットワークにおける効率的なue装置位置通報 |
Also Published As
Publication number | Publication date |
---|---|
KR20160058116A (ko) | 2016-05-24 |
CN105706495B (zh) | 2019-07-26 |
TWI622310B (zh) | 2018-04-21 |
CN105706495A (zh) | 2016-06-22 |
US20160212599A1 (en) | 2016-07-21 |
JPWO2015092989A1 (ja) | 2017-03-16 |
AR098768A1 (es) | 2016-06-15 |
US10111056B2 (en) | 2018-10-23 |
EP3086601B1 (en) | 2019-07-24 |
EP3086601A1 (en) | 2016-10-26 |
EP3086601A4 (en) | 2017-08-09 |
KR101815047B1 (ko) | 2018-01-05 |
TW201540101A (zh) | 2015-10-16 |
JP6311722B2 (ja) | 2018-04-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP6311722B2 (ja) | サーバ及びその通信方法 | |
US20120127994A1 (en) | Multicast communication method, apparatus and system for intermittently connected network | |
JP4807701B2 (ja) | 移動端末装置、制御方法及び移動通信システム | |
JP6183536B2 (ja) | Disruption/Delay/Disconnect Tolerant Networkで利用されるノード装置及び通信方法 | |
JP5287622B2 (ja) | 通信システム、ノード、通信制御方法、およびプログラム | |
JP5036602B2 (ja) | 無線アドホック端末およびアドホック・ネットワーク・システム | |
JP4767329B2 (ja) | ネットワークシステムおよび通信方法 | |
KR20120072060A (ko) | 연속된 연결성이 결여된 네트워크 환경 기반 노드 장치, 노드 관리 장치, 통신 시스템 및 노드 관리 방법 | |
TWI594588B (zh) | 無線終端機裝置及其控制方法 | |
WO2020160767A1 (en) | Selecting a next hop for a data packet | |
KR20120069439A (ko) | 이동무선네트워크 시스템에서의 라우팅 방법 및 이동노드 | |
Basarkod et al. | On-demand QoS and stability based multicast routing in mobile ad hoc networks | |
US11012914B2 (en) | Method and apparatus for configuring path in communication system including Xhaul network | |
KR101616278B1 (ko) | 모바일 애드혹 네트워크에서 그리드 기반 혼합형 라우팅 시스템 및 방법 | |
Zhu et al. | SAIL: A scalable approach for wide-area IP mobility | |
JP2015053581A (ja) | 送信装置、受信装置、管理装置及びプログラム | |
JP2004120234A (ja) | パケット転送経路探索方法とこれを用いた無線端末 | |
JP2017163327A (ja) | 通信装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 14870986 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 15023450 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: 20167008113 Country of ref document: KR Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 2015553355 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
REEP | Request for entry into the european phase |
Ref document number: 2014870986 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2014870986 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: IDP00201604574 Country of ref document: ID |