WO2003061310A1 - Procede de selection d'un noeud - Google Patents
Procede de selection d'un noeud Download PDFInfo
- Publication number
- WO2003061310A1 WO2003061310A1 PCT/JP2001/011648 JP0111648W WO03061310A1 WO 2003061310 A1 WO2003061310 A1 WO 2003061310A1 JP 0111648 W JP0111648 W JP 0111648W WO 03061310 A1 WO03061310 A1 WO 03061310A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- selection method
- nodes
- mobile
- mobile node
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 6
- 238000010187 selection method Methods 0.000 claims description 27
- 230000000694 effects Effects 0.000 description 5
- 238000007476 Maximum Likelihood Methods 0.000 description 3
- 230000001413 cellular effect Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000009826 distribution Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/24—Reselection being triggered by specific parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/0005—Control or signalling for completing the hand-off
- H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
- H04W36/00837—Determination of triggering parameters for hand-off
- H04W36/008375—Determination of triggering parameters for hand-off based on historical data
Definitions
- the present invention relates to a node selection method, and more particularly to a method in which a mobile node that moves between nodes that are almost uniformly distributed is preferably used in selecting a next node to communicate with from a node that is currently communicating. On how to select nodes.
- R SSI received signal strength indicator
- a mobile unit hereinafter, referred to as a mobile node
- base stations hereinafter, simply referred to as nodes
- the mobile node measures the received signal strength from each node at a predetermined timing, and if the received signal strength from the currently connected and communicating node becomes weak, the mobile node will switch to the node with the higher received signal strength. Perform a handover to change the connection destination. An algorithm for this handover is required.
- Ping-pong effect (ping-pong) eff ec t) must be taken into account.
- the received signal strength from the two nodes may be stronger from one and stronger from the other. Therefore, the mobile node switches connection unnecessarily with both of the two nodes because it changes frequently. This is called the ping-pong effect.
- This ping-pong effect causes problems such as poor communication and increased power consumption.
- the present invention has been made to solve the problems of the background art described above, and relates to a node selection method.
- the present invention provides an algorithm that enables node selection without using R SSI.
- a node selection method is a node selection method in which a mobile node that moves between a plurality of nodes that are distributed substantially uniformly selects a candidate node to communicate next.
- a first step of identifying a node located in the communication zone of the mobile node, and counting, for each identified node, the number of overlaps between communication zones with other identified nodes A second step and a third step of selecting, as the candidate node to be communicated, the specific node with the largest number counted are executed.
- a node selection method is a node selection method in which a mobile node that moves between a plurality of nodes that are distributed almost uniformly selects a candidate node to be communicated next.
- the selection is not performed.
- the body node executes the first to third steps in a predetermined cycle.
- the predetermined period is changed according to a moving speed of the mobile node.
- the predetermined period is changed according to an arrangement density of the plurality of nodes.
- Fig. 1 is a diagram illustrating the overlap between the communication zone of mobile node N and the communication zone of node X8, which move between a plurality of nodes distributed almost uniformly, and Fig. 2 shows the overlap between the communication zones.
- FIG. 1 is a diagram illustrating the overlap between the communication zone of mobile node N and the communication zone of node X8, which move between a plurality of nodes distributed almost uniformly
- Fig. 2 shows the overlap between the communication zones.
- a mobile node N is in its communication zone without using RSSI, and is closest to itself. It is possible to select a node that is highly likely to
- the maximum likelihood optimization algorithm of the present invention can be suitably used for a low-cost, low-power, short-range network such as Bluetooth, but is not limited to this. It can also be used for a system-based network.
- nodes may be fixedly installed, or may be arranged so as to be mutually movable.
- the algorithm of the present invention is generally applicable to an access point network provided with mobile nodes and an ad-hoc network (MANET) in which all nodes can move.
- MANET ad-hoc network
- the nodes will be described as being fixedly installed for the sake of convenience, but it goes without saying that the present invention is also applicable when the nodes are moving with each other.
- FIG. 1 shows a state in which the mobile node N is moving while nodes XI, X2,..., XI4, XI5 are distributed almost uniformly.
- the communication zone where the mobile node N can communicate is indicated by a solid line, and the communication zone of the node X8 is indicated by a broken line.
- each node has a communication zone of the same radius and has a function of detecting a list of nodes located in its own communication zone.
- a node located in its own communication zone is referred to as a neighbor node list (NNL).
- the NNL includes its own (a list of nodes located in its own communication zone is called NNL).
- the NNL of the mobile node N is N, X4, X6, X8, X9, X12, and the NNL of the node X8 is X8, N, X3, X6, X7, XII, X12 and X14.
- each NNL of the nodes X4, X6, X8, X9, and X12 belonging to the NNL of the mobile node N is called a next adjacent node list (nextNNL: NNNL).
- Each node is preferably arranged uniformly, but some uneven distribution is relaxed. How much eccentricity is relaxed depends on other network conditions. Therefore, it is necessary to strictly determine the node arrangement in consideration of the network parameters of the network arrangement.
- the present invention can be applied to existing access point networks and mobile ad hoc networks (MANET) without any problem. I can do it.
- the present invention can be applied to these networks without any problem if the mobile node or each node has a function of inquiring and collecting the NNL or NNNL.
- NNL of mobile node N and the mobile node Let NNNL of a single N be represented as follows:
- the node closest to the mobile node N is selected as the candidate node to communicate with after the mobile node N.
- the mobile node creates an NNL.
- the mobile node obtains the NNNL from each of the nodes included in the NNL (hereinafter referred to as adjacent nodes).
- the mobile node counts the number of appearances (hereinafter referred to as the number of appearances) in the NNL and all NNNLs for the nodes included in the NNL.
- the number of appearances of each adjacent node matches the number of overlapping communication zones of all nodes included in the NNL (see Fig. 2).
- FIG. 2 is a diagram for explaining the overlap between communication zones in the arrangement relationship of the nodes shown in FIG.
- FIG. 2 shows the number of overlapping communication zones and communication zones for each of the specified nodes N, X4, X6, X8, X9, and XI2.
- the number of communication zones in which each of the specified nodes X4, X6, X8, X9, and XI2 overlap each other except for the mobile node N is four for node X4, five for node X6, and five for node X. 8 is 4, node X9 is 4, and node X12 is 4.
- Node N is always the node in the area with the largest number of overlaps, and outward from there, the number of overlaps tends to decrease. Therefore, it is generally assumed that the node in the region where the number of overlapping nodes is the largest among nodes other than the node N is the shortest distance.
- the node with the largest number is selected as the candidate node to be communicated next.
- the mobile node N X 6 is selected.
- the selection of a candidate node by the mobile node N is performed at a fixed period, and this period can be changed as appropriate according to the moving speed of the mobile node N and the arrangement density of the nodes. If the moving speed is high or the node density is high, shorten the cycle.
- each node is moving, in order to maintain communication connection by handover, each node is useful in information on the arrangement state of other nodes and its own moving speed.
- the movement of the node changes NNL, and the change in NNL is obtained as movement information.
- placement information cannot be obtained directly from NNNL, a node can obtain rough placement information by a two-step procedure using NNNL.
- each node can obtain approximate distance information (arrangement information) between the nodes from the number of appearances of the nodes appearing in NNL.
- the algorithm adopted in the present invention for handover.
- the switching for the handover is performed under a single boundary condition.
- the ping-pong effect described above occurs.
- the ping-pong effect can be avoided because two boundary conditions are used.
- the first boundary condition is whether the node belongs to NNL or not.
- the matter is whether the node belongs to the maximum likelihood group.
- the algorithm of the present invention may be slightly changed.
- the number of handovers increases, so it is better to delay the handover decision even if the node with the largest number is detected. That is, the mobile node N does not select the node with the largest number of counts as a candidate node, but keeps the connection even if the second or third counted node is selected as a candidate node. This is because communication is possible.
- the present invention can be applied to an access point network in which nodes are fixedly arranged and an ad hoc network in which nodes move mutually.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2003561266A JP3916606B2 (ja) | 2001-12-28 | 2001-12-28 | ノード選択方法 |
US10/500,404 US20050063337A1 (en) | 2001-12-28 | 2001-12-28 | Node selecting method |
EP01995041A EP1467577A4 (en) | 2001-12-28 | 2001-12-28 | NODE SELECTION PROCESS |
PCT/JP2001/011648 WO2003061310A1 (fr) | 2001-12-28 | 2001-12-28 | Procede de selection d'un noeud |
AU2002225377A AU2002225377A1 (en) | 2001-12-28 | 2001-12-28 | Node selecting method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/JP2001/011648 WO2003061310A1 (fr) | 2001-12-28 | 2001-12-28 | Procede de selection d'un noeud |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2003061310A1 true WO2003061310A1 (fr) | 2003-07-24 |
Family
ID=11738099
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2001/011648 WO2003061310A1 (fr) | 2001-12-28 | 2001-12-28 | Procede de selection d'un noeud |
Country Status (5)
Country | Link |
---|---|
US (1) | US20050063337A1 (ja) |
EP (1) | EP1467577A4 (ja) |
JP (1) | JP3916606B2 (ja) |
AU (1) | AU2002225377A1 (ja) |
WO (1) | WO2003061310A1 (ja) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4834102B2 (ja) * | 2005-10-12 | 2011-12-14 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 無線ネットワークにおけるルーティングに対するリンクコスト判定方法及び装置 |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11762850B2 (en) * | 2020-11-09 | 2023-09-19 | International Business Machines Corporation | Content-aware node selection for container creation |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH09252480A (ja) * | 1996-03-15 | 1997-09-22 | Toshiba Corp | 網制御装置 |
JPH11187450A (ja) * | 1997-12-18 | 1999-07-09 | Matsushita Electric Ind Co Ltd | セルサーチ方法及び移動局装置 |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6002918A (en) * | 1989-06-29 | 1999-12-14 | Symbol Technologies, Inc. | Power-saving arrangement and method for mobile units in communications network |
FR2687520B1 (fr) * | 1992-02-14 | 1994-05-06 | France Telecom | Procede d'implantation de l'infrastructure d'un reseau cellulaire de communication. |
US5946621A (en) * | 1996-10-28 | 1999-08-31 | Northern Telecom Limited | Method of optimizing neighbor set during soft handoff of a mobile unit in a CDMA cellular environment |
US6195342B1 (en) * | 1997-11-25 | 2001-02-27 | Motorola, Inc. | Method for determining hand-off candidates in a neighbor set in a CDMA communication system |
US6148198A (en) * | 1998-08-05 | 2000-11-14 | Ericsson Inc. | Method and apparatus for selecting a service provider |
US6304556B1 (en) * | 1998-08-24 | 2001-10-16 | Cornell Research Foundation, Inc. | Routing and mobility management protocols for ad-hoc networks |
SE514264C2 (sv) * | 1999-05-07 | 2001-01-29 | Ericsson Telefon Ab L M | Ett kommunikationssystem |
US6564055B1 (en) * | 2000-01-21 | 2003-05-13 | Telecommunication Systems, Inc. | Intelligent roaming database (IRDB) updating |
US6856803B1 (en) * | 2000-06-26 | 2005-02-15 | Motorola, Inc. | Method for maintaining candidate handoff list for airborne cellular system |
WO2002015614A1 (en) * | 2000-08-15 | 2002-02-21 | University Of Maryland, College Park | Method, system, and computer program product for positioning and synchronizing wireless communications nodes |
US7035240B1 (en) * | 2000-12-27 | 2006-04-25 | Massachusetts Institute Of Technology | Method for low-energy adaptive clustering hierarchy |
US20030153338A1 (en) * | 2001-07-24 | 2003-08-14 | Herz Frederick S. M. | Autoband |
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 |
-
2001
- 2001-12-28 AU AU2002225377A patent/AU2002225377A1/en not_active Abandoned
- 2001-12-28 US US10/500,404 patent/US20050063337A1/en not_active Abandoned
- 2001-12-28 EP EP01995041A patent/EP1467577A4/en not_active Withdrawn
- 2001-12-28 WO PCT/JP2001/011648 patent/WO2003061310A1/ja active Application Filing
- 2001-12-28 JP JP2003561266A patent/JP3916606B2/ja not_active Expired - Fee Related
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH09252480A (ja) * | 1996-03-15 | 1997-09-22 | Toshiba Corp | 網制御装置 |
JPH11187450A (ja) * | 1997-12-18 | 1999-07-09 | Matsushita Electric Ind Co Ltd | セルサーチ方法及び移動局装置 |
Non-Patent Citations (1)
Title |
---|
See also references of EP1467577A4 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4834102B2 (ja) * | 2005-10-12 | 2011-12-14 | テレフオンアクチーボラゲット エル エム エリクソン(パブル) | 無線ネットワークにおけるルーティングに対するリンクコスト判定方法及び装置 |
US8159955B2 (en) | 2005-10-12 | 2012-04-17 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and arrangement for link cost determination for routing in wireless networks |
Also Published As
Publication number | Publication date |
---|---|
AU2002225377A1 (en) | 2003-07-30 |
EP1467577A1 (en) | 2004-10-13 |
JPWO2003061310A1 (ja) | 2005-05-19 |
US20050063337A1 (en) | 2005-03-24 |
JP3916606B2 (ja) | 2007-05-16 |
EP1467577A4 (en) | 2005-12-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP5412624B2 (ja) | 移動通信におけるハンドオーバー測定方法及びその装置 | |
JP5669936B2 (ja) | 移動体無線装置における拡張セルサーチ及び選択 | |
JP4150239B2 (ja) | 移動通信システム、基地局、移動局、及びセル制御方法 | |
EP2553977B1 (en) | User equipment, radio base station and methods therein for determining mobility trigger | |
JP2671789B2 (ja) | 移動体通信システムにおけるハンドオーバ方式 | |
EP1922842B1 (en) | Radio communication terminal and network side communication apparatus | |
JP5579319B2 (ja) | ネットワーク・ノード制御 | |
JP2006246428A (ja) | Umts標準に従う移動体ネットワークでのセルの再選択動作の最適化方法 | |
KR20100052456A (ko) | 이동통신시스템에 있어서의 유저장치 및 방법 | |
Zhang et al. | Mobility enhancement and performance evaluation for 5G ultra dense networks | |
Yang et al. | Energy‐efficient network selection with mobility pattern awareness in an integrated WiMAX and WiFi network | |
Danratchadakorn et al. | Coverage maximization with sleep scheduling for wireless sensor networks | |
KR101403308B1 (ko) | 단말의 핸드오버를 위한 방법, 네트워크 요소, 기지국, 및 통신 시스템 | |
EP1467578A1 (en) | Node selecting method | |
CN100502589C (zh) | 移动通信系统的越区切换的方法和装置 | |
JP3916606B2 (ja) | ノード選択方法 | |
KR101347537B1 (ko) | 무선 네트워크에서 이동 단말의 속도에 따른 탐색 주기 관리 기법 | |
Yang et al. | An energy-efficient handover scheme with geographic mobility awareness in WiMAX-WiFi integrated networks | |
JP2009542069A (ja) | 通信方法、発信及び受信局並びに関連するコンピュータプログラム | |
Rebai et al. | An enhanced heuristic technique for AP selection in 802.11 handoff procedure | |
KR20110066744A (ko) | 다중 무선 접속 기술이 적용된 펨토 기지국에 있어서의 무선 접속방식 선택방법 및 장치 | |
CN100361559C (zh) | 一种盲切换目标小区选择方法 | |
Mai et al. | Connectivity-based clustering scheme for mobile ad hoc networks | |
CN102695219B (zh) | 一种3G与Ad hoc异构网络的切换方法 | |
Yan et al. | Speed-based probability-driven seamless handover scheme between WLAN and UMTS |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2003561266 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2001995041 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 2001995041 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10500404 Country of ref document: US |