JPH1155313A - Path designation method for radio base station - Google Patents

Path designation method for radio base station

Info

Publication number
JPH1155313A
JPH1155313A JP22121497A JP22121497A JPH1155313A JP H1155313 A JPH1155313 A JP H1155313A JP 22121497 A JP22121497 A JP 22121497A JP 22121497 A JP22121497 A JP 22121497A JP H1155313 A JPH1155313 A JP H1155313A
Authority
JP
Japan
Prior art keywords
base station
delay time
wireless
wireless base
route
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
JP22121497A
Other languages
Japanese (ja)
Inventor
Takayuki Ishiguro
隆之 石黒
Tomoyoshi Ono
友義 大野
Hitoshi Takanashi
斉 高梨
Toshinori Tanaka
利憲 田中
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nippon Telegraph and Telephone Corp
Original Assignee
Nippon Telegraph and Telephone Corp
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 Nippon Telegraph and Telephone Corp filed Critical Nippon Telegraph and Telephone Corp
Priority to JP22121497A priority Critical patent/JPH1155313A/en
Publication of JPH1155313A publication Critical patent/JPH1155313A/en
Withdrawn legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

PROBLEM TO BE SOLVED: To fast and flexibly change a path against the variance of traffic and radio quality and also to significantly improve the delay time and throughtput by measuring the inter-radio link delay time and changing the path according to the sum of the measured delay time and the delay time caused at an adjacent radio station and covering up to a wired base station. SOLUTION: Every radio base station WR measures the delay time to its adjacent station for each transmission of a radio packet. A station WR 25 measures the delay time Δ (25, 26) to its host station WR 26 every time a radio packet is sent to a wired base station WJ. Then the station WR 25 adds delay time Dwj (26) described in an adjacent base station list to the time Δ (25, 26) and then notifies its adjacent base station of Δ (25, 26) + Dwj (26) when the above addition value of delay times is larger or smaller than the prescribed upper or lower limit threshold respectively. Thus, every station WR updates its path to another where the delay time is minimized to the station WJ.

Description

【発明の詳細な説明】DETAILED DESCRIPTION OF THE INVENTION

【0001】[0001]

【発明の属する技術分野】本発明は図1に示すようなそ
れぞれの無線基地局間において双方向通信を行う無線ネ
ットワークにおいて、無線基地局が無線品質、トラヒッ
クの変動に対して通信目的の無線基地局に対してダイナ
ミック、自律分散的、かつ、効率的に経路を設定するこ
とを可能にする方法に関するものである。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a radio network for performing two-way communication between radio base stations as shown in FIG. The present invention relates to a method for dynamically, autonomously dispersing, and efficiently setting a route for a station.

【0002】[0002]

【従来の技術】複数の無線基地局が存在する無線ネット
ワークにおいてその無線基地局間で無線パケットの経路
を決定する方法として二つの方法がある。一つは各無線
基地局が送信相手の無線基地局への経路を経路情報表と
して記録し、その経路情報表に従って無線パケットを送
信する方法(“The DARPA Packet R
adio Network Protocols,”J
OHN JUBIN etc)である。個々の無線基地
局が持つ経路情報表を独立に同報的に送信することによ
って常に最適の経路を決定している。経路情報表には目
的の無線基地局へ無線パケットを送信するために次に送
信すべき無線基地局と中継数(ホップ数)が記されてお
り、ホップ数ができるだけ少なくなるように経路が決定
される。
2. Description of the Related Art In a wireless network having a plurality of wireless base stations, there are two methods for determining a route of a wireless packet between the wireless base stations. One is a method in which each wireless base station records a route to a wireless base station of a transmission partner as a route information table and transmits a wireless packet according to the route information table (“The DARPA Packet R”).
adio Network Protocols, "J
OHN JUBIN etc). The optimum route is always determined by independently and simultaneously transmitting the route information table of each wireless base station. The routing information table describes the wireless base station to be transmitted next and the number of relays (the number of hops) in order to transmit a wireless packet to the target wireless base station, and the route is determined so that the number of hops is minimized. Is done.

【0003】図2はその方法を説明する図である。11
〜15は無線基地局、10は無線リンクを示す。無線基
地局11が無線基地局15に送信する時、ホップ数が最
も少なくなるように経路が決定されることから、経路と
して11−13−15が選ばれる。各無線基地局は全て
の無線基地局への経路を決定するための経路情報表を持
っており、経路情報表に基づいて無線パケットを送信す
る。無線基地局11の経路情報表は表1に示される。
FIG. 2 is a diagram for explaining the method. 11
Reference numerals 15 to 15 indicate wireless base stations, and 10 indicates a wireless link. When the radio base station 11 transmits to the radio base station 15, the route is determined so as to minimize the number of hops, so that 11-13-15 is selected as the route. Each wireless base station has a route information table for determining routes to all the wireless base stations, and transmits wireless packets based on the route information table. The route information table of the wireless base station 11 is shown in Table 1.

【0004】[0004]

【表1】 [Table 1]

【0005】経路情報表は先に決められた時間ごとに無
線パケットによって隣接した基地局に同報送信される。
経路情報表の同報送信によって各無線基地局の経路情報
表が更新され、最適な経路が決定される。
[0005] The routing information table is broadcast to adjacent base stations by radio packets at predetermined time intervals.
By the broadcast transmission of the route information table, the route information table of each wireless base station is updated, and the optimum route is determined.

【0006】最適経路を決定するためのもう一つの方法
として、それぞれの無線基地局に他の無線基地局の地理
的情報を記録し、その地理的情報によって経路を決定す
る方法(米国特許4939726号)がある。この方法
では目的の無線基地局の緯度、経度といった地理的情報
によって経路を決定する。無線パケットを受信した無線
基地局は目的の無線基地局へ更に近くなるように無線パ
ケットを送信する。
As another method for determining an optimum route, a method of recording geographical information of another radio base station in each radio base station and determining a route based on the geographical information (US Pat. No. 4,939,726). ). In this method, a route is determined based on geographical information such as the latitude and longitude of a target wireless base station. The wireless base station that has received the wireless packet transmits the wireless packet so as to be closer to the target wireless base station.

【0007】図2の無線基地局の地理的情報は例えば座
標を用いて表2で表わすことができる。
The geographic information of the radio base station shown in FIG. 2 can be represented in Table 2 using, for example, coordinates.

【0008】[0008]

【表2】 [Table 2]

【0009】無線基地局11が無線基地局15に無線パ
ケットを送信する場合、無線基地局11は無線基地局1
5の地理的情報を調べ、更に他の無線基地局の地理的情
報から次に無線基地局13へ無線パケットを送信すれば
よいことを判断する。
When the wireless base station 11 transmits a wireless packet to the wireless base station 15, the wireless base station 11
Then, based on the geographical information of other wireless base stations, it is determined that the wireless packet should be transmitted to the wireless base station 13 next.

【0010】[0010]

【発明が解決しようとする課題】従来の方法による経路
決定方法のうち、経路情報表に基づいて経路を決定する
前者の方法では無線基地局の数が大きくなるにしたがっ
て経路情報表の大きさも大きくなってしまい、更に、経
路情報の変更のために経路情報表が各無線基地局から同
報的に送信されてしまう。無線空間に経路の決定を行う
ための情報が無線パケットとして多く送信されることは
無線区間の利用効率の低下をまねき、トラヒック、遅延
時間特性の劣化となる。
Among the conventional route determination methods, the former method of determining a route based on a route information table increases the size of the route information table as the number of wireless base stations increases. In addition, a route information table is broadcast from each wireless base station to change the route information. The fact that a large amount of information for determining a route in a wireless space is transmitted as a wireless packet leads to a reduction in the use efficiency of a wireless section, resulting in deterioration of traffic and delay time characteristics.

【0011】また後者の無線基地局に地理的情報を記録
させる方法においては、新規に無線基地局を設営する場
合、撤去する場合、移動する場合等、無線基地局の位置
が変更されるごとに地理的情報の更新が必要であり、更
に目的の基地局の地理的情報を何らかの方法で知る必要
がある。
In the latter method of recording geographical information in a radio base station, a new radio base station is installed, removed, moved, etc. every time the position of the radio base station is changed. The geographic information needs to be updated, and the geographic information of the target base station needs to be known in some way.

【0012】またどちらの方法もトラヒック、無線品質
の変動に対する柔軟性が小さく、トラヒック、無線品質
の変動に対して、遅延時間、スループットの劣化が大き
い。
[0012] Both methods have little flexibility with respect to fluctuations in traffic and radio quality, and have large delay time and throughput degradation with respect to fluctuations in traffic and radio quality.

【0013】本発明は以上の問題に鑑み、無線ネットワ
ークにおける無線パケットの送受信において、経路を決
定するために用いる無線パケットの数が増加することな
く、トラヒック、無線品質の変動に対して最適な経路の
決定を行うことを目的とする。
The present invention has been made in view of the above-described problems, and in transmitting and receiving wireless packets in a wireless network, an optimal path for traffic and wireless quality fluctuations does not increase without increasing the number of wireless packets used for determining a path. The purpose is to make a decision.

【0014】[0014]

【課題を解決するための手段】本発明によれば上記の課
題は前記特許請求の範囲に記載した手段により解決され
る。
According to the invention, the above-mentioned object is solved by the means described in the claims.

【0015】すなわち請求項1の発明は、各無線基地局
がデータを無線パケットによって次の無線基地局へ送信
する時に、無線パケットを受信してから次の無線基地局
が無線パケットを正確に受信できた時までの遅延時間を
測定し、遅延時間が予め決めた上限閾値を超えた場合、
及び予め決めた下限閾値を下回った場合に無線基地局か
ら通信目的の無線基地局までの全遅延時間を計算し、隣
接した無線基地局に全遅延時間を通知し、全遅延時間を
受信した無線基地局が、前に周辺の無線基地局から得た
通信目的の無線基地局への全遅延時間から最も全遅延時
間の小さい経路を選び、通信目的の無線基地局への経路
として決定し、経路が変更された時には通信目的の無線
基地局までの全遅延時間を隣接した無線基地局へ通知す
る経路決定方法である。
That is, according to the first aspect of the present invention, when each wireless base station transmits data to the next wireless base station in the form of a wireless packet, the next wireless base station receives the wireless packet accurately after receiving the wireless packet. Measure the delay time until the time when it is completed, and if the delay time exceeds the predetermined upper threshold,
And calculating the total delay time from the wireless base station to the wireless base station for communication when the value falls below a predetermined lower threshold, notifying the adjacent wireless base station of the total delay time, and receiving the total delay time. The base station selects a route with the smallest total delay time from the total delay time to the communication target wireless base station obtained from the surrounding wireless base station before, determines the route to the communication target wireless base station, and determines the route. Is a route determination method of notifying an adjacent wireless base station of the total delay time to a wireless base station for communication when the is changed.

【0016】この発明は、無線リンク間の遅延時間を計
測し、計測した遅延時間及び隣接した無線基地局から得
られた通信目的の無線基地局までの遅延時間の和によっ
て経路を更新することが従来の方法とは異なる。
According to the present invention, a delay time between wireless links is measured, and a route is updated based on a sum of the measured delay time and a delay time obtained from an adjacent wireless base station to a wireless base station for communication. It is different from the conventional method.

【0017】この差異によりトラヒック、無線品質の変
動に対して高速、かつ柔軟に経路の変更を行うことがで
き、無線ネットワーク全体の無線パケット伝送を効率よ
く行うことができる。
Due to this difference, the route can be changed at high speed and flexibly with respect to the fluctuation of the traffic and the radio quality, and the radio packet transmission of the entire radio network can be performed efficiently.

【0018】[0018]

【発明の実施の形態】図3の実施例、図4のフローチャ
ートを参照して、発明の実施の形態を説明する。無線通
信ネットワークとしては図1のシステムとする。ユーザ
の無線パケットは無線基地局を中継されて有線網に接続
された無線基地局に到達し、そこから有線ネットワーク
に送られる。
Embodiments of the present invention will be described with reference to the embodiment of FIG. 3 and a flowchart of FIG. The system of FIG. 1 is used as a wireless communication network. The user's wireless packet is relayed through the wireless base station, reaches the wireless base station connected to the wired network, and is sent from there to the wired network.

【0019】無線基地局から有線網に接続された無線基
地局(有線基地局と呼ぶ)までの経路決定方法を説明す
る。図3において21、22は有線基地局(WJ:Wi
reless Junction)、23〜27は無線
基地局(WR:Wireless Router)、3
0は無線リンク、31は有線網である。
A method for determining a route from a wireless base station to a wireless base station (called a wired base station) connected to a wired network will be described. In FIG. 3, reference numerals 21 and 22 denote wired base stations (WJ: Wi).
release Junction, 23 to 27 are wireless base stations (WR: Wireless Router), 3
0 is a wireless link, and 31 is a wired network.

【0020】無線リンクには各方向に対して遅延時間が
決定される。遅延時間には無線基地局内の処理時間、無
線パケットの再送時間、伝搬時間が含まれる。各無線リ
ンクの遅延時間はWRが無線パケットを受信してから次
のWR、WJが無線パケットを正しく受信したことが確
認されるまでとする(図5)。ここで無線基地局または
有線基地局(基地局と呼ぶ)n1 から基地局n2 へ無線
パケットが到達するまでの遅延時間をΔ(n1 ,n2
とする。
In the radio link, a delay time is determined for each direction. The delay time includes a processing time in the wireless base station, a retransmission time of a wireless packet, and a propagation time. The delay time of each wireless link is from when the WR receives a wireless packet to when it is confirmed that the next WR and WJ have correctly received the wireless packet (FIG. 5). Where the wireless base station or a wired base station (referred to as base station) from n 1 to the base station n 2 delay time until the radio packet reaches delta (n 1, n 2)
And

【0021】まず各WRは初期条件としてその時点のト
ラヒック、無線品質等に対する、WJまでの遅延時間の
最も小さい経路を知っており、隣の基地局(隣接基地局
と呼ぶ)からWJまでの遅延時間[DWJ(n)とする、
nは隣接基地局]を得ているものとする。各WRは隣接
基地局表(NRT)を持っており、そこに遅延時間DWJ
(n)が記される。例えば各無線リンクの遅延時間が表
3で記されるものとする。
First, each WR knows, as an initial condition, a route with the shortest delay time to the WJ with respect to traffic, radio quality, and the like at that point in time. Time [D WJ (n)]
n is an adjacent base station]. Each WR has an adjacent base station table (NRT) in which the delay time D WJ is stored.
(N) is noted. For example, it is assumed that the delay time of each wireless link is described in Table 3.

【0022】[0022]

【表3】 [Table 3]

【0023】初期条件よりWR25のNRTは表4とな
る。
Table 4 shows the NRT of the WR25 from the initial conditions.

【0024】[0024]

【表4】 [Table 4]

【0025】WR25はNRTよりDWJ(n)が最も小
さい経路を決定する。NRTよりWR25はWJに無線
パケットを送信するためにWR26へパケットを送出す
る。このときWR26をWR25の上位基地局(WRn
up)と名付ける。他のWRについても同様に考えると、
WJまでの遅延時間が最も小さくなるような経路として
24−25−26−22、27−22、23−21の3
つの経路上で無線パケットの送受信が行われる。
The WR 25 determines a route having the smallest D WJ (n) than the NRT. The WR 25 sends a packet to the WR 26 from the NRT in order to transmit a wireless packet to the WJ. At this time, WR26 is set to an upper base station (WRn) of WR25.
up ). Considering other WRs in the same way,
24-25-26-22, 27-22, and 23-21 are the three routes that minimize the delay time to the WJ.
Transmission and reception of wireless packets are performed on two routes.

【0026】ところで各WRは無線パケットを送信する
度に隣接基地局との遅延時間を測定する(S1−1)。
WR25はWJへ無線パケットを送信する度に上位基地
局であるWR26との遅延時間Δ(25、26)を測定
する。WR25は測定したΔ(25、26)にNRTに
記してあるDWJ(26)を加え、その値が先に決めた値
を上限閾値(δup(25))を超えた場合、または先に
決めた下限閾値(δdo wn(25))を下回った場合に隣
接基地局に対してΔ(25、26)+DWJ(26)を通
知する(S1−2)。ここでWR25の持つ上限閾値δ
up(25)が3であるとし、トラヒックの増加、無線品
質の劣化等によってΔ(25、26)が表3の1から3
に上昇したとする。このとき測定したΔ(25、26)
とNRTに記されているDWJ(26)の和Δ(25、2
6)+DWJ(26)が2から4になり、δup(25)=
3を超えたことからΔ(25、26)+DWJ(26)を
上位基地局であるWR26を除いたWR24、WR27
に通知する(S1−3)。
Each WR measures a delay time with an adjacent base station every time a wireless packet is transmitted (S1-1).
Each time the WR 25 transmits a wireless packet to the WJ, the WR 25 measures a delay time Δ (25, 26) with the WR 26 as an upper base station. The WR 25 adds D WJ (26) written on the NRT to the measured Δ (25, 26), and when the value exceeds the upper limit threshold (δ up (25)), or -determined lower threshold (δ do wn (25)) Δ to the adjacent base station when it falls below the (25,26) + D notifies the WJ (26) (S1-2). Here, the upper limit threshold δ of the WR 25
Assuming that up (25) is 3, Δ (25, 26) becomes 1 to 3 in Table 3 due to an increase in traffic, deterioration of radio quality, and the like.
And rise to Δ (25, 26) measured at this time
And the sum Δ (25, 2) of D WJ (26) written in the NRT
6) + D WJ (26) changes from 2 to 4, and δ up (25) =
Since Δ3 has exceeded 3, Δ (25, 26) + D WJ (26) is subtracted from WR24 and WR27 excluding WR26 which is an upper-level base station.
(S1-3).

【0027】WR25からΔ(25、26)+DWJ(2
6)を通知されたWR24はΔ(25、26)+D
WJ(26)=DWJ(25)をWR24のNRTに記す
(S1−5)。このときのWR24のNRTを表5に示
す。
From WR25, Δ (25, 26) + D WJ (2
WR 24 notified of 6) is Δ (25, 26) + D
WJ (26) = D WJ (25) is written in the NRT of WR24 (S1-5). Table 5 shows the NRT of the WR 24 at this time.

【0028】[0028]

【表5】 [Table 5]

【0029】次にNRTから最もDWJの小さい隣接基地
局を新しい上位基地局(n’up)とする(S1−6)。
表5より上位基地局はn’up=23となる。WR24の
上位基地局は表3よりもともとWR25であり、この更
新によってWR23に変更されたことから(S1−
7)、WR24はΔ(24、23)を測定し、新しい上
位基地局であるWR23以外の隣接基地局であるWR2
5へΔ(24、23)+DWJ(23)を通知する(S1
−8)。
The next most D WJ small neighbor base station a new upper base station and (n 'up) from NRT (S1-6).
From Table 5, the upper base station has n ' up = 23. The upper base station of WR24 is originally WR25 from Table 3, and has been changed to WR23 by this update (S1-
7), WR 24 measures Δ (24, 23), and WR2 which is an adjacent base station other than WR23 which is a new higher-order base station.
5 is notified of Δ (24, 23) + D WJ (23) (S1
-8).

【0030】WR27もWR24と同様にWR25から
の通知より経路の更新を行う。
Similarly to the WR 24, the WR 27 updates the route based on the notification from the WR 25.

【0031】以上の方法により各WRはWJまでの遅延
時間が最も小さい経路に更新することができる。
According to the above-described method, each WR can be updated to the route having the shortest delay time to the WJ.

【0032】図6はサービスエリア内の均一なトラヒッ
クが不均一なトラヒックに変化した場合の遅延時間−ス
ループット特性である。システムモデル及びトラヒック
モデルを図7に、シミュレーションの諸条件を表6に示
す。
FIG. 6 shows a delay time-throughput characteristic when uniform traffic in a service area changes to non-uniform traffic. FIG. 7 shows the system model and the traffic model, and Table 6 shows various simulation conditions.

【0033】[0033]

【表6】 [Table 6]

【0034】従来方法では中継基地局の数、地理的距離
によって最短経路が決定される。本計算機シミュレーシ
ョンで評価したシステムモデルは格子状になっているた
め、従来方法によって決定される経路はトラヒックの分
布、無線品質の変動にかかわらず、一意に固定され、最
も中継数が少ない経路である。この図に見られるが如
く、本発明によってトラヒックが不均一な状態において
無線パケットのスロット長さで規格化された平均遅延時
間600を満たすスループットを0.1改善することが
できる。
In the conventional method, the shortest route is determined based on the number of relay base stations and the geographical distance. Since the system model evaluated in this computer simulation is grid-like, the route determined by the conventional method is uniquely fixed and has the least number of relays irrespective of traffic distribution and fluctuations in radio quality. . As can be seen from the figure, the present invention can improve the throughput that satisfies the average delay time 600 standardized by the slot length of the radio packet by 0.1 in a state where the traffic is uneven, by 0.1.

【0035】[0035]

【発明の効果】以上説明したように、本発明によれば、
従来の方法に比して、無線リンク間の遅延時間を計測
し、計測した遅延時間及び隣接した無線基地局から得ら
れた有線基地局までの遅延時間の和によって経路を更新
することによりトラヒック、無線品質の変動に対して高
速、かつ柔軟に経路の変更を行うことができ、遅延時
間、スループットを大幅に改善ができる利点がある。
As described above, according to the present invention,
Compared with the conventional method, the traffic is measured by measuring the delay time between the wireless links and updating the route by the sum of the measured delay time and the delay time from the adjacent wireless base station to the wired base station. There is an advantage that the route can be changed quickly and flexibly with respect to the fluctuation of the radio quality, and the delay time and the throughput can be greatly improved.

【0036】また隣接基地局から得られた有線基地局ま
での遅延時間のみで決定することから経路決定のための
計算量を少なくすることができ、更に経路情報の同報送
信を行わないことから経路制御のために無線空間の利用
効率が劣化しないといった利点がある。
Further, since the determination is made only by the delay time from the adjacent base station to the wired base station, the amount of calculation for determining the route can be reduced, and the broadcast transmission of the route information is not performed. There is an advantage that the use efficiency of the wireless space does not deteriorate due to the route control.

【図面の簡単な説明】[Brief description of the drawings]

【図1】本発明の利用形態を示す図である。FIG. 1 is a diagram showing a use form of the present invention.

【図2】従来方法を説明するための図である。FIG. 2 is a diagram for explaining a conventional method.

【図3】実施例を説明するための図である。FIG. 3 is a diagram illustrating an example.

【図4】無線基地局の経路決定フローを示す図である。FIG. 4 is a diagram illustrating a route determination flow of a wireless base station.

【図5】遅延時間の定義を説明するための図である。FIG. 5 is a diagram for explaining the definition of a delay time.

【図6】遅延時間−スループット特性のシミュレーショ
ン結果を示す図である。
FIG. 6 is a diagram illustrating simulation results of delay time-throughput characteristics.

【図7】シミュレーションの評価システムを示す図であ
る。
FIG. 7 is a diagram showing a simulation evaluation system.

フロントページの続き (72)発明者 田中 利憲 東京都新宿区西新宿三丁目19番2号 日本 電信電話株式会社内Continuation of front page (72) Inventor Toshinori Tanaka 3-19-2 Nishishinjuku, Shinjuku-ku, Tokyo Nippon Telegraph and Telephone Corporation

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】 複数の無線基地局を有し、無線基地局間
で無線パケットによってデータの送受信が行われる無線
ネットワークで、無線基地局間で送受信される無線パケ
ットを中継するための経路を決定する方法において、 各無線基地局がデータを無線パケットによって次の無線
基地局へ送信する時に、無線パケットを受信してから次
の無線基地局が無線パケットを正確に受信できた時まで
の遅延時間を測定し、 該遅延時間が予め決めた上限閾値を超えた場合、及び予
め決めた下限閾値を下回った場合に無線基地局から通信
目的の無線基地局までの全遅延時間を計算して隣接した
無線基地局に通知し、 全遅延時間を受信した無線基地局は、前に周辺の無線基
地局から得た周辺の無線基地局から通信目的の無線基地
局への全遅延時間の中から最も全遅延時間の小さい経路
を選び、通信目的の無線基地局への経路として決定し、 経路が変更されたときには通信目的の無線基地局までの
全遅延時間を隣接した無線基地局へ通知し、 通知を受けた無線基地局は通知の内容を記憶しておくこ
とを特徴とする、無線基地局の経路指定方法。
In a wireless network having a plurality of wireless base stations and transmitting and receiving data by wireless packets between wireless base stations, a route for relaying wireless packets transmitted and received between wireless base stations is determined. In the method, when each wireless base station transmits data to the next wireless base station in a wireless packet, the delay time from when the wireless packet is received to when the next wireless base station can correctly receive the wireless packet. When the delay time exceeds a predetermined upper threshold, and when the delay falls below a predetermined lower threshold, the total delay time from the wireless base station to the wireless base station for communication is calculated and the adjacent The wireless base station that has notified the wireless base station and received the total delay time determines the most among the total delay times from the surrounding wireless base station to the wireless base station for communication obtained from the surrounding wireless base station before. A route with a small total delay time is selected and determined as a route to the wireless base station for communication. When the route is changed, the total delay time to the wireless base station for communication is notified to an adjacent wireless base station, and the notification is made. A radio base station routing method, wherein the received radio base station stores the contents of the notification.
JP22121497A 1997-08-04 1997-08-04 Path designation method for radio base station Withdrawn JPH1155313A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP22121497A JPH1155313A (en) 1997-08-04 1997-08-04 Path designation method for radio base station

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP22121497A JPH1155313A (en) 1997-08-04 1997-08-04 Path designation method for radio base station

Publications (1)

Publication Number Publication Date
JPH1155313A true JPH1155313A (en) 1999-02-26

Family

ID=16763261

Family Applications (1)

Application Number Title Priority Date Filing Date
JP22121497A Withdrawn JPH1155313A (en) 1997-08-04 1997-08-04 Path designation method for radio base station

Country Status (1)

Country Link
JP (1) JPH1155313A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005015856A1 (en) * 2003-08-08 2005-02-17 Sony Corporation Communication system, communication method, communication terminal device, control method thereof, and program
JP2010063068A (en) * 2008-09-08 2010-03-18 Advanced Telecommunication Research Institute International Radio equipment and radio network equipped with the same

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005015856A1 (en) * 2003-08-08 2005-02-17 Sony Corporation Communication system, communication method, communication terminal device, control method thereof, and program
US8005054B2 (en) 2003-08-08 2011-08-23 Sony Corporation Communication system, communication method, communication terminal device, control method thereof, and program
US8755294B2 (en) 2003-08-08 2014-06-17 Sony Corporation Communication system, communication method, communication terminal device, control method thereof, and program
JP2010063068A (en) * 2008-09-08 2010-03-18 Advanced Telecommunication Research Institute International Radio equipment and radio network equipped with the same

Similar Documents

Publication Publication Date Title
US9131433B2 (en) Minimization of radio resource usage in multi-hop networks with multiple
US8537714B2 (en) Method for determining a route in a wireless mesh network using a metric based on radio and traffic load
JP5037120B2 (en) Optimal routing in ad hoc wireless communication networks
KR100912330B1 (en) A system and method to scout for routes in a wireless network
EP2541989B1 (en) Communications system, slave node, route building method, and program
KR101203461B1 (en) Routing method in multi-hop cellular system and the multi-hop cellular system
EP3355488B1 (en) Method of providing neighbor information and method of generating neighbor location information
US7751332B2 (en) Data routing method and apparatus
US20080298251A1 (en) INTEGRATING LOCAL CONGESTION AND PATH INTERFERENCE INTO QoS ROUTING FOR WIRELESS MOBILE AD HOC NETWORKS
CN104982068A (en) Metric computation for interference-aware routing
KR20040102085A (en) System and method for identifying potential hidden node problems in multi-hop wireless ad-hoc networks
Silva et al. An adaptive GPSR routing protocol for VANETs
JP2005535235A (en) Link quality monitoring in mobile ad hoc networks
US20090109901A1 (en) Wireless device which selects routes excluding loop routes and a mesh network including the same
KR101413856B1 (en) Apparatus for management of topology in mobile ad-hoc network and method thereof
Fussler et al. A novel forwarding paradigm for position-based routing (with implicit addressing)
JPH11239154A (en) Route specifying method for radio base station
Maia et al. A rate control video dissemination solution for extremely dynamic vehicular ad hoc networks
JPH1155313A (en) Path designation method for radio base station
Kasana et al. Multimetric next hop vehicle selection for geocasting in vehicular ad-hoc networks
Tabar et al. Quality of service in vehicular ad hoc networks
Cao Trong et al. RAI: A high throughput routing protocol for multi-hop multi-rate ad hoc networks
KR101409253B1 (en) Method for potential routing, method for potential scheduling and mesh node
KR20200020195A (en) Wireless backhaul routing method and system using equidistant rule in extended WIFI wireless network
KR102287487B1 (en) Information exchanging device and control method thereof

Legal Events

Date Code Title Description
A300 Application deemed to be withdrawn because no request for examination was validly filed

Free format text: JAPANESE INTERMEDIATE CODE: A300

Effective date: 20041005