Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
JP3780920B2 - Mobile communication terminal and computer program - Google Patents
[go: Go Back, main page]

JP3780920B2 - Mobile communication terminal and computer program - Google Patents

Mobile communication terminal and computer program Download PDF

Info

Publication number
JP3780920B2
JP3780920B2 JP2001364542A JP2001364542A JP3780920B2 JP 3780920 B2 JP3780920 B2 JP 3780920B2 JP 2001364542 A JP2001364542 A JP 2001364542A JP 2001364542 A JP2001364542 A JP 2001364542A JP 3780920 B2 JP3780920 B2 JP 3780920B2
Authority
JP
Japan
Prior art keywords
base station
location registration
candidate
succeeded
recently
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.)
Expired - Fee Related
Application number
JP2001364542A
Other languages
Japanese (ja)
Other versions
JP2003169361A (en
Inventor
浩司 篠田
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.)
Denso Corp
Original Assignee
Denso 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 Denso Corp filed Critical Denso Corp
Priority to JP2001364542A priority Critical patent/JP3780920B2/en
Priority to US10/299,507 priority patent/US7457624B2/en
Publication of JP2003169361A publication Critical patent/JP2003169361A/en
Application granted granted Critical
Publication of JP3780920B2 publication Critical patent/JP3780920B2/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Mobile Radio Communication Systems (AREA)

Description

【0001】
【発明の属する技術分野】
本発明は、基地局に対して位置登録の要求を行うように構成された例えば携帯電話機などの移動通信端末および前記移動通信端末にて実行されるコンピュータプログラムに関する。
【0002】
【発明が解決しようとする課題】
近年、移動通信端末の一つとして、符号分割多元接続(CDMA:Code Division Multiple Access )方式を採用した携帯電話機が供されている。ところで、この種のCDMA方式を採用した携帯電話機では、端末自体の位置や周囲環境 (例えば地形や建造物の有無など)による影響を受けて、図4に示すように、携帯電話機1が基地局2を捕捉したときに、携帯電話機1が基地局2から送信された信号(下り信号)を適切に受信することができるものの、基地局2が携帯電話機1から送信された信号(上り信号)を適切に受信することができない場合がある。そして、このような場合に、携帯電話機1が基地局2に対して位置登録の要求を行うと、上記したように基地局2が携帯電話機1から送信された上り信号を適切に受信することができないので、基地局2に対する位置登録に失敗することになるが、携帯電話機1が基地局2から送信された下り信号を適切に受信することができるので、基地局2に対する位置登録の要求を継続して行うことになる。
【0003】
しかしながら、このように携帯電話機1が基地局2に対する位置登録の要求を長い時間にわたって継続して行ってしまうと、その分、他の携帯電話機の発信や着信を妨げることになり、システム全体としての発信や着信の成功率を低下させる要因になるという問題がある。
【0004】
本発明は、上記した事情に鑑みてなされたものであり、その目的は、基地局に対する位置登録の要求を長い時間にわたって継続して行うことを未然に回避することができ、それによって、システム全体としての発信や着信の成功率を高めることができる移動通信端末およびコンピュータプログラムを提供することにある。
【0005】
【課題を解決するための手段】
請求項1に記載した移動通信端末によれば、基地局を検索して捕捉し、その捕捉された基地局から取得された近隣基地局リストに基づいて次に捕捉し得る基地局の群を表す候補基地局を決定すると共に、その捕捉された基地局に対して位置登録の要求を行う。ここで、制御手段は、候補基地局に最近に位置登録に成功した基地局が存在しているか否かを判定し、候補基地局に最近に位置登録に成功した基地局が存在していなければ、最近に位置登録に成功した基地局を候補基地局に加え、その最近に位置登録に成功した基地局が加えられた候補基地局のうちからいずれかの基地局を捕捉し、その捕捉された基地局に対して位置登録の要求を行う。
【0006】
このように、移動通信端末は、候補基地局に最近に位置登録に成功した基地局が存在しているか否かを判定し、候補基地局に最近に位置登録に成功した基地局が存在していなければ、最近に位置登録に成功した基地局を候補基地局に加え、その最近に位置登録に成功した基地局が加えられた候補基地局のうちからいずれかの基地局を捕捉するようにしたので、最近に位置登録に成功した基地局を候補基地局に加えることによって、その最近に位置登録に成功した基地局を捕捉することにもなり、基地局に対する位置登録に成功する可能性を高めることができる。これによって、基地局に対する位置登録に成功することにより、基地局に対する位置登録の要求を長い時間にわたって継続して行うことを未然に回避することができ、システム全体としての発信や着信の成功率を高めることができる。
【0007】
請求項2に記載した移動通信端末によれば、制御手段は、互いに異なる周波数毎に、基地局を検索して捕捉するようにしたので、基地局を一の周波数を用いて検索したのにも拘らず、基地局を捕捉することができなかったとしても、基地局を検索するのに用いる周波数を一の周波数から他の周波数に変更し、基地局を他の周波数を用いて検索することによって、基地局を捕捉することができる可能性を高めることができる。
【0009】
請求項3に記載したコンピュータプログラムによれば、当該コンピュータプログラムを移動通信端末にインストールして実行させると、基地局を検索させて捕捉させる手順と、その捕捉された基地局から取得された近隣基地局リストに基づいて次に捕捉し得る基地局の群を表す候補基地局を決定させる手順と、候補基地局に最近に位置登録に成功した基地局が存在しているか否かを判定させ、候補基地局に最近に位置登録に成功した基地局が存在していなければ、最近に基地局に対する位置登録に成功した基地局を候補基地局に加えさせる手順と、その最近に位置登録に成功した基地局が加えられた候補基地局のうちからいずれかの基地局を捕捉させる手順と、その捕捉された基地局に対して位置登録の要求を行わせる手順とを実行するようになるので、上記した請求項に記載したものと同様の作用効果を得ることができる。すなわち、最近に位置登録に成功した基地局を候補基地局に加えることによって、その最近に位置登録に成功した基地局を捕捉することにもなり、上記した請求項1に記載したものと同様にして、基地局に対する位置登録に成功する可能性を高めることができる。
【0010】
請求項4に記載したコンピュータプログラムによれば、当該コンピュータプログラムを移動通信端末にインストールして実行させると、互いに異なる周波数毎に、基地局を検索させていずれかの基地局を捕捉させる手順を実行するようになるので、上記した請求項2に記載したものと同様の作用効果を得ることができる。すなわち、基地局を一の周波数を用いて検索したのにも拘らず、基地局を捕捉することができなかったとしても、基地局を検索するのに用いる周波数を一の周波数から他の周波数に変更し、基地局を他の周波数を用いて検索することによって、基地局を捕捉することができる可能性を高めることができる。
【0013】
【発明の実施の形態】
以下、本発明の移動通信端末を携帯電話機に適用した一実施例について、図面を参照して説明する。
図2は、携帯電話機の機能ブロックおよび周辺を概略的に示している。携帯電話機11は、マイクロコンピュータを主体としてなるCPU(Central Processing Unit )12(本発明でいう制御手段)に、符号分割多元接続(CDMA:Code Division Multiple Access )方式に準拠した無線処理を行うCDMA無線部13と、マイクロホン14が入力した音声およびスピーカ15が出力する音声を音声処理する音声処理部16と、「通話開始」キー、「通話終了」キー、「0」〜「9」の「数字」キーなどの多数のキーを配列してなるキーパッドからなる操作部17と、日付・時刻や電話番号などを表示する液晶ディスプレイからなる表示部18と、RAM(Random Access Memory)やROM(Read Only Memory)からなる記憶部19とが接続された構成となっている。
【0014】
この場合、CPU12は、基地局からCDMA無線部13により近隣基地局リストが受信されて取得されると、その取得された近隣基地局リストに基づいて次に捕捉し得る基地局の群を表す候補基地局を決定し、その決定された候補基地局を記憶部19に保持させるようになっている。そして、CPU12は、位置登録の要求を行うべきタイミングになると、記憶部19に保持させている候補基地局からパイロット信号の受信電界強度(パイロット強度)が最も強い基地局を捕捉し、その捕捉された基地局に対して位置登録の要求を行うようになっている。
【0015】
具体的には、図2に示すように、携帯電話機1の周辺に基地局A〜基地局Eが位置し、基地局A〜基地局Dを候補基地局として決定しており、これら基地局A〜基地局Dのうちの基地局Bのパイロット信号の受信電界強度が最も強い場合であれば、そのパイロット信号の受信電界強度が最も強い基地局Bを捕捉し、その捕捉された基地局Bに対して位置登録の要求を行うようになっている。尚、基地局A〜基地局Eは、PN(Pseudo Noise)オフセットによって、他と識別されるものである。
【0016】
次に、上記した構成の作用について、図1および図3も参照して説明する。ここで、図1は、CPU12が記憶部19から読出して実行するコンピュータプログラム(実行プログラム)の手順を概略的に示している。
【0017】
CPU12は、例えば携帯電話機11の電源がオンされたときなどの基地局を補足すべきタイミングになると、最初に、基地局を周波数を変更して(切替えて)検索する回数を表すカウンタ値mを初期化し(mの値を「0」に設定し)(ステップS1)、基地局を検索するのに用いる周波数を選択する(ステップS2)。そして、CPU12は、基地局に対する位置登録に失敗したときの同一周波数でのリトライ回数を表すカウンタ値nを初期化する(nの値を「0」に設定する)(ステップS3)。
【0018】
次いで、CPU12は、基地局を検索してパイロット信号の受信電界強度が最も強い(本発明でいう所定条件を満たす)基地局を捕捉し(ステップS4)、その捕捉された基地局から近隣基地局リストを受信して取得する(ステップS5)。そして、CPU12は、その取得された近隣基地局リストに基づいて次に捕捉し得る基地局の群を表す候補基地局を決定する(ステップS6)。
【0019】
ここで、CPU12は、その決定された候補基地局に最近に位置登録に成功した基地局が存在しているか否かを判定する(ステップS7)。そして、CPU12は、その決定された候補基地局に最近に位置登録に成功した基地局が存在していなければ(ステップS7にて「NO」)、その最近に位置登録に成功した基地局を候補基地局に加える(ステップS8)。具体的に説明すると、CPU12は、図3(a)に示すように、基地局A〜基地局Dが候補基地局であって、最近に位置登録に成功した基地局が基地局A〜基地局Dとは別の基地局Eである場合であれば、最近に位置登録に成功した基地局が候補基地局に存在していないので、図3(b)に示すように、その最近に位置登録に成功した基地局である基地局Eを候補基地局に加える。
【0020】
次いで、CPU12は、待受状態に移行し(ステップS9)、位置登録の要求を開始すべき条件が成立したか否かを判定する(ステップS10)。そして、CPU12は、位置登録の要求を開始すべき条件が成立すると(ステップS10にて「YES」)、先に捕捉された基地局に対して位置登録の要求を行う(ステップS11)。そして、CPU12は、基地局に対する位置登録に成功したか失敗したかを判定する(ステップS12)。
【0021】
ここで、CPU12は、位置登録に成功すれば(ステップS12にて「YES」)、先に説明したカウンタ値mを初期化し(ステップS13)、先に説明したカウンタ値nを初期化し(ステップS14)、上記したステップS9に戻り、ステップS9以降を実行する。
【0022】
これに対して、CPU12は、位置登録に失敗すれば(ステップS12にて 「NO」)、先に説明したカウンタ値nをインクリメントし(ステップS15)、インクリメントされたカウンタ値nと所定値Nとを比較する(ステップS16)。尚、このとき、所定値Nは、システムの運用形態に合わせて最適な値が自動的に設定されるものであっても良く、また、ユーザにより任意に設定されるものであっても良い。
【0023】
CPU12は、カウンタ値nが所定値N以下であれば(ステップS16にて 「YES」)、位置登録に失敗した基地局を候補基地局から外し(ステップS17)、その位置登録に失敗した基地局が外された候補基地局のうちからパイロット信号の受信電界強度が最も強い基地局を捕捉する(ステップS18)。そして、CPU12は、ステップS5に戻り、ステップS5以降を実行する。
【0024】
具体的に説明すると、CPU12は、位置登録に失敗した基地局が基地局Bである場合であれば、図3(c)に示すように、位置登録に失敗した基地局Bを候補基地局から外す。そして、CPU12は、その位置登録に失敗した基地局Bが外された候補基地局のうちからパイロット信号の受信電界強度が最も強い基地局である基地局Eを捕捉し、その捕捉された基地局Eに対して位置登録の要求を行う。
【0025】
一方、CPU12は、カウンタ値nが所定値N以下でなければ(ステップS16にて「NO」)、先に説明したカウンタ値mをインクリメントし(ステップS19)、インクリメントされたカウンタ値mと所定値Mとを比較する(ステップS20)。尚、このとき、所定値Mは、システムの運用形態に合わせて自動的に設定されるものである。
【0026】
CPU12は、カウンタ値mが所定値M以下であれば(ステップS20にて 「YES」)、基地局を検索するのに用いる周波数を変更し(切替え)(ステップS21)、上記したステップS3に戻り、ステップS3以降を実行する。一方、CPU12は、カウンタ値mが所定値M以下でなければ(ステップS20にて「NO」)、位置登録の要求を禁止し(ステップS22)、アイドルハンドオフ、発信および着信を可能な待受状態を維持し(ステップS23)、所定時間Tの計時を開始する(ステップS24)。尚、このとき、所定時間Tは、システムの運用形態に合わせて最適な値が自動的に設定されるものであっても良く、また、ユーザにより任意に設定されるものであっても良い。
【0027】
CPU12は、所定時間Tの計時を開始した以降では、アイドルハンドオフに成功したか否かを監視し(ステップS25)、基地局からのパイロット信号の受信電界強度が所定レベルを越えたか否かを監視し(ステップS26)、所定時間Tの計時を終了したか否かを監視する(ステップS27)。そして、CPU12は、アイドルハンドオフに成功すると(ステップS25にて「YES」)、または、基地局からのパイロット信号の受信電界強度が所定レベルを越えると(ステップS26にて「YES」)、または、所定時間Tの計時を終了すると(ステップS27にて「YES」)、位置登録の要求の禁止を解除し(ステップS28)、先に説明したカウンタ値mを初期化し(ステップS29)、先に説明したカウンタ値nを初期化し(ステップS30)、上記したステップS5に戻り、ステップS5以降を実行する。
【0028】
ところで、以上は、最近に位置登録に成功した基地局を候補基地局に加える処理(ステップS8の処理)と、位置登録に失敗した基地局を候補基地局から外す処理(ステップS17の処理)との双方を行う場合を説明したものであるが、必ずしも、これらの処理の双方を行う必要はなく、いずれか一方のみを行っても良い。
【0029】
以上に説明したように本実施例によれば、携帯電話機11において、基地局に対する位置登録の要求を行い、基地局に対する位置登録に失敗すると、これ以降、位置登録に失敗した基地局を候補基地局から外し、その位置登録に失敗した基地局が外された候補基地局のうちからパイロット信号の受信電界強度が最も強い基地局を捕捉するようにしたので、位置登録に失敗した基地局を候補基地局から外すことによって、先に位置登録に失敗した基地局に対して位置登録の要求を再度行うことがなく、つまり、他の基地局に対して位置登録の要求を行うことになり、基地局に対する位置登録に成功する可能性を高めることができる。これによって、基地局に対する位置登録の要求を長い時間にわたって継続して行うことを未然に回避することができ、システム全体としての発信や着信の成功率を高めることができる。
【0030】
また、携帯電話機11において、最近に位置登録に成功した基地局を候補基地局に加え、その最近に位置登録に成功した基地局が加えられた候補基地局のうちからパイロット信号の受信電界強度が最も強い基地局を捕捉するようにしたので、最近に位置登録に成功した基地局を候補基地局に加えることによって、その最近に位置登録に成功した基地局を捕捉することにもなり、基地局に対する位置登録に成功する可能性をより高めることができる。
【0031】
さらに、携帯電話機11において、互いに異なる周波数毎に、基地局を検索してパイロット信号の受信電界強度が最も強い基地局を捕捉するようにしたので、基地局を一の周波数を用いて検索したのにも拘らず、基地局を捕捉することができなかったとしても、基地局を検索するのに用いる周波数を一の周波数から他の周波数に変更し、基地局を他の周波数を用いて検索することによって、基地局を捕捉することができる可能性を高めることができる。
【0032】
本発明は、上記した実施例にのみ限定されるものでなく、次のように変形または拡張することができる。
移動通信端末は、CDMA方式を採用した携帯電話機に限らず、CDMA方式を採用した通信機能を有する携帯情報端末などの他の端末であって良い。
【0033】
CPUが実行するコンピュータプログラムは、携帯電話機に最初から搭載されていることに限らず、サーバやメモリカードなどの外部から必要に応じてダウンロードされてインストールされるものであっても良い。
【図面の簡単な説明】
【図1】本発明の一実施例を示すフローチャート
【図2】携帯電話機の機能ブロックおよび周辺を概略的に示す図
【図3】候補基地局の遷移を示す図
【図4】基地局と携帯電話機との間で送受信される信号を概略的に示す図
【符号の説明】
図面中、11は携帯電話機(移動通信端末)、12はCPU(制御手段)である。
[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a mobile communication terminal such as a mobile phone configured to make a location registration request to a base station and a computer program executed by the mobile communication terminal.
[0002]
[Problems to be solved by the invention]
2. Description of the Related Art In recent years, mobile phones using a code division multiple access (CDMA) system have been provided as one of mobile communication terminals. By the way, in a mobile phone adopting this type of CDMA system, the mobile phone 1 is not connected to the base station as shown in FIG. 4 due to the influence of the position of the terminal itself and the surrounding environment (for example, the topography and the presence of buildings). 2, the mobile phone 1 can properly receive the signal (downlink signal) transmitted from the base station 2, but the base station 2 can receive the signal (uplink signal) transmitted from the mobile phone 1. It may not be able to receive properly. In such a case, when the mobile phone 1 makes a location registration request to the base station 2, the base station 2 can appropriately receive the uplink signal transmitted from the mobile phone 1 as described above. However, location registration with respect to the base station 2 fails, but the mobile phone 1 can properly receive the downlink signal transmitted from the base station 2, and therefore continues to request location registration with respect to the base station 2. Will be done.
[0003]
However, if the mobile phone 1 continues to make a location registration request to the base station 2 for a long time in this way, the transmission and reception of other mobile phones will be prevented accordingly, and the entire system will There is a problem that it becomes a factor that reduces the success rate of outgoing and incoming calls.
[0004]
The present invention has been made in view of the above-described circumstances, and the object of the present invention is to avoid making a location registration request for a base station continuously for a long time, and thereby the entire system. It is an object to provide a mobile communication terminal and a computer program that can increase the success rate of outgoing and incoming calls.
[0005]
[Means for Solving the Problems]
According to the mobile communication terminal described in claim 1, a base station is searched and acquired, and a group of base stations that can be acquired next is represented based on a neighboring base station list acquired from the acquired base station. A candidate base station is determined and a location registration request is made to the captured base station. Here, the control means determines whether or not there is a base station that has recently succeeded in location registration in the candidate base station, and if there is no base station that has recently succeeded in location registration in the candidate base station. The base station that has succeeded in location registration is added to the candidate base station, and one of the candidate base stations to which the base station that has recently succeeded in location registration has been added is captured. Request location registration to the base station.
[0006]
In this way, the mobile communication terminal determines whether or not a candidate base station has a base station that has recently succeeded in location registration, and the candidate base station has a base station that has recently succeeded in location registration. Otherwise, the base station that succeeded in location registration was added to the candidate base station, and one of the candidate base stations to which the base station that succeeded in location registration was added recently was captured. Therefore, adding a base station that has succeeded in location registration recently to a candidate base station also captures the base station that has recently succeeded in location registration, increasing the possibility of successful location registration for the base station. be able to. As a result, by succeeding in location registration for the base station, it is possible to avoid making a location registration request for the base station continuously over a long period of time. Can be increased.
[0007]
According to the mobile communication terminal described in claim 2, since the control means searches for and captures the base station for each different frequency, the base station is searched using one frequency. Regardless, even if the base station could not be acquired, by changing the frequency used to search for the base station from one frequency to another and searching for the base station using the other frequency The possibility that the base station can be acquired can be increased.
[0009]
According to the computer program according to claim 3, when the computer program is installed in the mobile communication terminal and executed, a procedure for searching for and capturing a base station, and a neighboring base acquired from the captured base station A procedure for determining a candidate base station representing a group of base stations that can be captured next based on the station list, and determining whether or not there is a base station that has recently succeeded in location registration, If there is no base station that has recently succeeded in location registration in the base station, a procedure for causing the candidate base station to add a base station that has recently succeeded in location registration to the base station, and a base that has succeeded in location registration recently. A procedure for acquiring any one of the candidate base stations added by the station and a procedure for requesting location registration for the acquired base station are executed. Since, it is possible to obtain the same effects as those described in the claims above. That is, by adding a base station that has recently succeeded in location registration to the candidate base station, it is possible to capture the base station that has recently succeeded in location registration, in the same manner as described in claim 1 above. Thus, the possibility of successful location registration for the base station can be increased.
[0010]
According to the computer program described in claim 4, when the computer program is installed in the mobile communication terminal and executed, a procedure for searching for a base station and capturing one of the base stations is executed for each different frequency. Therefore, the same effect as that described in claim 2 can be obtained. That is, even if the base station is not acquired even though the base station is searched using one frequency, the frequency used for searching the base station is changed from one frequency to another frequency. By changing and searching for the base station using other frequencies, the possibility of acquiring the base station can be increased.
[0013]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, an embodiment in which a mobile communication terminal of the present invention is applied to a mobile phone will be described with reference to the drawings.
FIG. 2 schematically shows a functional block and a periphery of the mobile phone. A cellular phone 11 is a CDMA radio that performs wireless processing in accordance with a code division multiple access (CDMA) system on a CPU (Central Processing Unit) 12 (control means in the present invention) mainly composed of a microcomputer. Unit 13, voice processing unit 16 that performs voice processing on the voice input by microphone 14 and the voice output by speaker 15, “call start” key, “call end” key, and “numbers” “0” to “9”. An operation unit 17 including a keypad in which a large number of keys such as keys are arranged, a display unit 18 including a liquid crystal display for displaying date / time, telephone number, and the like, a RAM (Random Access Memory), and a ROM (Read Only) Memory) 19 is connected.
[0014]
In this case, when the neighboring base station list is received and acquired by the CDMA radio unit 13 from the base station, the CPU 12 represents a group of base stations that can be captured next based on the acquired neighboring base station list. A base station is determined, and the determined candidate base station is stored in the storage unit 19. Then, when it is time to request location registration, the CPU 12 captures the base station with the strongest received electric field strength (pilot strength) of the pilot signal from the candidate base stations held in the storage unit 19 and captures the captured base station. A request for location registration is made to the base station.
[0015]
Specifically, as shown in FIG. 2, base station A to base station E are located around mobile phone 1, and base station A to base station D are determined as candidate base stations. If the received signal strength of the pilot signal of the base station B of the base station D is the strongest, the base station B having the strongest received signal strength of the pilot signal is captured, and the captured base station B A location registration request is issued to the user. The base station A to base station E are distinguished from each other by a PN (Pseudo Noise) offset.
[0016]
Next, the operation of the above-described configuration will be described with reference to FIGS. Here, FIG. 1 schematically shows the procedure of a computer program (execution program) that the CPU 12 reads from the storage unit 19 and executes.
[0017]
When it is time to supplement the base station, for example, when the mobile phone 11 is turned on, the CPU 12 first sets a counter value m representing the number of times the base station is changed (switched) and searched. Initialization is performed (the value of m is set to “0”) (step S1), and a frequency used for searching for a base station is selected (step S2). Then, the CPU 12 initializes a counter value n indicating the number of retries at the same frequency when the location registration for the base station fails (sets the value of n to “0”) (step S3).
[0018]
Next, the CPU 12 searches for a base station, acquires a base station having the strongest received electric field strength of the pilot signal (satisfying the predetermined condition referred to in the present invention) (step S4), and selects the neighboring base station from the acquired base station. A list is received and acquired (step S5). Then, the CPU 12 determines a candidate base station representing a group of base stations that can be captured next based on the acquired neighboring base station list (step S6).
[0019]
Here, the CPU 12 determines whether or not there is a base station that has recently succeeded in location registration in the determined candidate base station (step S7). Then, if there is no base station that has succeeded in location registration recently in the determined candidate base station (“NO” in step S7), the CPU 12 candidates the base station that has succeeded in location registration recently. Add to the base station (step S8). Specifically, as shown in FIG. 3A, the CPU 12 determines that the base station A to base station D are candidate base stations, and the base station that has recently succeeded in location registration is the base station A to base station. If it is a base station E different from D, there is no base station that has succeeded in location registration recently in the candidate base station. Therefore, as shown in FIG. The base station E that is a successful base station is added to the candidate base stations.
[0020]
Next, the CPU 12 shifts to a standby state (step S9) and determines whether or not a condition for starting a location registration request is satisfied (step S10). Then, when the condition for starting the location registration request is satisfied (“YES” in step S10), the CPU 12 makes a location registration request to the previously captured base station (step S11). Then, the CPU 12 determines whether the location registration for the base station has succeeded or failed (step S12).
[0021]
Here, if the location registration is successful (“YES” in step S12), the CPU 12 initializes the counter value m described above (step S13), and initializes the counter value n described above (step S14). ), The process returns to the above-described step S9, and steps after step S9 are executed.
[0022]
On the other hand, if the location registration fails (“NO” in step S12), the CPU 12 increments the counter value n described above (step S15), and increments the counter value n and the predetermined value N. Are compared (step S16). At this time, as the predetermined value N, an optimum value may be automatically set according to the system operation form, or may be arbitrarily set by the user.
[0023]
If the counter value n is equal to or smaller than the predetermined value N (“YES” in step S16), the CPU 12 removes the base station that failed in location registration from the candidate base stations (step S17), and the base station that failed in location registration The base station with the strongest received electric field strength of the pilot signal is captured from the candidate base stations from which is removed (step S18). Then, the CPU 12 returns to step S5 and executes step S5 and subsequent steps.
[0024]
Specifically, if the base station that has failed in location registration is the base station B, the CPU 12 determines that the base station B that has failed in location registration from the candidate base station, as shown in FIG. remove. Then, the CPU 12 captures the base station E, which is the base station having the strongest received electric field strength of the pilot signal, from among the candidate base stations from which the base station B that has failed in location registration has been removed, and the captured base station A request for location registration is made to E.
[0025]
On the other hand, if the counter value n is not equal to or smaller than the predetermined value N (“NO” in step S16), the CPU 12 increments the counter value m described above (step S19), and increments the counter value m and the predetermined value. M is compared (step S20). At this time, the predetermined value M is automatically set according to the operation mode of the system.
[0026]
If the counter value m is equal to or less than the predetermined value M (“YES” in step S20), the CPU 12 changes (switches) the frequency used to search for the base station (step S21), and returns to step S3 described above. Step S3 and subsequent steps are executed. On the other hand, if the counter value m is not equal to or smaller than the predetermined value M (“NO” in step S20), the CPU 12 prohibits the location registration request (step S22), and is in a standby state in which idle handoff, outgoing call and incoming call are possible. Is maintained (step S23), and counting of the predetermined time T is started (step S24). At this time, the predetermined time T may be automatically set to an optimum value according to the system operation mode, or may be arbitrarily set by the user.
[0027]
After starting to measure the predetermined time T, the CPU 12 monitors whether the idle handoff is successful (step S25), and monitors whether the received electric field strength of the pilot signal from the base station exceeds a predetermined level. (Step S26), and monitoring whether or not the measurement of the predetermined time T has been completed (Step S27). Then, CPU 12 succeeds in idle handoff (“YES” in step S25), or when the received electric field strength of the pilot signal from the base station exceeds a predetermined level (“YES” in step S26), or When the counting of the predetermined time T is completed (“YES” in step S27), the prohibition of the position registration request is canceled (step S28), the counter value m described above is initialized (step S29), and the description is made first. The counter value n is initialized (step S30), the process returns to step S5, and step S5 and subsequent steps are executed.
[0028]
By the way, as described above, a process of adding a base station that has recently succeeded in location registration to the candidate base station (a process of step S8), a process of removing a base station that has failed in the location registration from the candidate base station (a process of step S17), However, it is not always necessary to perform both of these processes, and only one of them may be performed.
[0029]
As described above, according to the present embodiment, in the mobile phone 11, if the location registration request to the base station is made and the location registration to the base station fails, the base stations that failed to register the location thereafter are selected as candidate base stations. Since the base station with the strongest received electric field strength of the pilot signal is captured from among the candidate base stations that have been removed from the station and the base station that failed in location registration has been removed, the base station that failed in location registration is selected as a candidate. By removing from the base station, the location registration request is not made again for the base station that failed to register the location first, that is, the location registration request is made to another base station. It is possible to increase the possibility of successful location registration for the station. As a result, it is possible to avoid making a location registration request to the base station continuously for a long time, and it is possible to increase the success rate of outgoing and incoming calls as a whole system.
[0030]
In addition, in the mobile phone 11, the base station that has succeeded in location registration recently is added to the candidate base station, and the received electric field strength of the pilot signal from among the candidate base stations to which the base station that has succeeded in location registration recently has been added. Since the strongest base station is acquired, adding the base station that has succeeded in location registration recently to the candidate base station also captures the base station that has succeeded in location registration recently. It is possible to further increase the possibility of successful location registration for.
[0031]
Furthermore, in the mobile phone 11, the base station is searched for each frequency different from each other, and the base station having the strongest received electric field strength of the pilot signal is captured, so the base station is searched using one frequency. Nevertheless, even if the base station cannot be acquired, the frequency used to search for the base station is changed from one frequency to another frequency, and the base station is searched using another frequency. By this, the possibility that the base station can be acquired can be increased.
[0032]
The present invention is not limited to the above-described embodiments, and can be modified or expanded as follows.
The mobile communication terminal is not limited to the mobile phone adopting the CDMA method, but may be another terminal such as a portable information terminal having a communication function adopting the CDMA method.
[0033]
The computer program executed by the CPU is not limited to being installed in the mobile phone from the beginning, but may be downloaded and installed from the outside, such as a server or a memory card, as necessary.
[Brief description of the drawings]
FIG. 1 is a flowchart showing an embodiment of the present invention. FIG. 2 is a diagram schematically showing functional blocks and surroundings of a mobile phone. FIG. 3 is a diagram showing transitions of candidate base stations. Schematic diagram of signals sent to and received from the telephone [Explanation of symbols]
In the drawing, 11 is a mobile phone (mobile communication terminal), and 12 is a CPU (control means).

Claims (4)

基地局を検索して捕捉し、その捕捉された基地局から取得された近隣基地局リストに基づいて次に捕捉し得る基地局の群を表す候補基地局を決定すると共に、その捕捉された基地局に対して位置登録の要求を行う制御手段を備えた移動通信端末であって、
前記制御手段は、前記候補基地局に最近に位置登録に成功した基地局が存在しているか否かを判定し、前記候補基地局に最近に位置登録に成功した基地局が存在していなければ、最近に位置登録に成功した基地局を候補基地局に加え、その最近に位置登録に成功した基地局が加えられた候補基地局のうちからいずれかの基地局を捕捉し、その捕捉された基地局に対して位置登録の要求を行うことを特徴とする移動通信端末。
Search and capture a base station, determine a candidate base station representing a group of base stations that can be captured next based on a list of neighboring base stations obtained from the captured base station, and acquire the captured base station A mobile communication terminal comprising a control means for requesting location registration to a station,
The control means determines whether or not there is a base station that has recently succeeded in location registration in the candidate base station, and if there is no base station that has recently succeeded in location registration in the candidate base station. The base station that has succeeded in location registration is added to the candidate base station, and one of the candidate base stations to which the base station that has recently succeeded in location registration has been added is captured. A mobile communication terminal, which makes a location registration request to a base station.
請求項1記載の移動通信端末において、The mobile communication terminal according to claim 1, wherein
前記制御手段は、互いに異なる周波数毎に、基地局を検索して捕捉することを特徴とする移動通信端末。The mobile communication terminal characterized in that the control means searches for and acquires a base station for each different frequency.
移動通信端末に、Mobile communication terminal
基地局を検索させて捕捉させる手順と、The procedure to search and acquire the base station,
その捕捉された基地局から取得された近隣基地局リストに基づいて次に捕捉し得る基地局の群を表す候補基地局を決定させる手順と、Determining a candidate base station representing a group of base stations that can be acquired next based on a neighboring base station list obtained from the acquired base station;
前記候補基地局に最近に位置登録に成功した基地局が存在しているか否かを判定させ、前記候補基地局に最近に位置登録に成功した基地局が存在していなければ、最近に基地局に対する位置登録に成功した基地局を候補基地局に加えさせる手順と、It is determined whether or not there is a base station that has succeeded in location registration recently in the candidate base station, and if there is no base station that has succeeded in location registration recently in the candidate base station, A procedure for causing a candidate base station to add a base station that has successfully registered its location to
その最近に位置登録に成功した基地局が加えられた候補基地局のうちからいずれかの基地局を捕捉させる手順と、A procedure for capturing one of the candidate base stations to which a base station that has succeeded in location registration recently has been added,
その捕捉された基地局に対して位置登録の要求を行わせる手順とを実行させるためのコンピュータプログラム。A computer program for executing a procedure for making a request for location registration to the captured base station.
請求項3記載のコンピュータプログラムにおいて、The computer program according to claim 3, wherein
互いに異なる周波数毎に、基地局を検索させて捕捉させる手順を実行させるためのコンピュータプログラム。A computer program for executing a procedure for searching for and acquiring a base station for each different frequency.
JP2001364542A 2001-11-29 2001-11-29 Mobile communication terminal and computer program Expired - Fee Related JP3780920B2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
JP2001364542A JP3780920B2 (en) 2001-11-29 2001-11-29 Mobile communication terminal and computer program
US10/299,507 US7457624B2 (en) 2001-11-29 2002-11-19 Mobile station expediting location registry to base station

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2001364542A JP3780920B2 (en) 2001-11-29 2001-11-29 Mobile communication terminal and computer program

Publications (2)

Publication Number Publication Date
JP2003169361A JP2003169361A (en) 2003-06-13
JP3780920B2 true JP3780920B2 (en) 2006-05-31

Family

ID=19174716

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2001364542A Expired - Fee Related JP3780920B2 (en) 2001-11-29 2001-11-29 Mobile communication terminal and computer program

Country Status (1)

Country Link
JP (1) JP3780920B2 (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7483702B2 (en) * 2004-10-20 2009-01-27 Nokia Corporation Cell reselection for improving network interconnection
JP4706919B2 (en) * 2005-09-20 2011-06-22 日本電気株式会社 Mobile communication terminal and cell switching control method
JP5034530B2 (en) * 2007-02-01 2012-09-26 富士通株式会社 Mobile communication terminal, location registration method thereof, and computer program
WO2009001407A1 (en) * 2007-06-27 2008-12-31 Fujitsu Limited Mobile communication terminal, its location registration method and computer program
JP2011254542A (en) * 2011-09-05 2011-12-15 Fujitsu Ltd Mobile communication terminal, and position registration method and computer program thereof

Also Published As

Publication number Publication date
JP2003169361A (en) 2003-06-13

Similar Documents

Publication Publication Date Title
JPH11136755A (en) Time correction method and mobile phone terminal device used in the method
JP4890319B2 (en) Mobile terminal device
JP2004356684A (en) Cell search method of mobile radio terminal device and mobile radio terminal device
WO2008047577A1 (en) Radio communication terminal, radio communication terminal communication control method, and radio communication system
JP3780920B2 (en) Mobile communication terminal and computer program
JP2009267847A (en) Radio terminal equipment and radio network system
JP2001119452A (en) Wireless communication device
JP2006060671A (en) Device, method and program for searching frequency channel
JP2007116561A (en) Cell search method and mobile communication terminal
WO2008053869A1 (en) Wireless communication terminal, wireless communication terminal communication control method, and wireless communication system
JP3780919B2 (en) Mobile communication terminal and computer program
JP2004356991A (en) Communication terminal out-of-service determination method, wireless communication system switching method, and communication terminal
JP4663536B2 (en) Wireless communication terminal and wireless communication method
US20030100306A1 (en) Mobile station expediting location regis try to base station
KR101075997B1 (en) Apparatus and method for service registration in multi mode portable terminal
JP4951607B2 (en) Wireless terminal and wireless control method
JP6559510B2 (en) Communication terminal, communication terminal control method, and control program
JP4456912B2 (en) Mobile phone selectively connected to one of a plurality of mobile phone systems, control method thereof, and program
JP5008947B2 (en) Wireless communication terminal and wireless communication method
JP4537925B2 (en) Wireless communication terminal and wireless communication method
JP4974142B2 (en) Wireless communication terminal and wireless communication method
US7321764B2 (en) Method for processing call in mobile communication terminal supporting multi-mode telecommunication system
JP2004040368A (en) Mobile communication system, mobile communication terminal, base station control device, and computer program
JP4588616B2 (en) Radio communication terminal and radio base station selection method
CN111164995B (en) Method and terminal for emergency call

Legal Events

Date Code Title Description
A977 Report on retrieval

Free format text: JAPANESE INTERMEDIATE CODE: A971007

Effective date: 20041126

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20050201

A521 Written amendment

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20050331

TRDD Decision of grant or rejection written
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 20060214

A61 First payment of annual fees (during grant procedure)

Free format text: JAPANESE INTERMEDIATE CODE: A61

Effective date: 20060227

R150 Certificate of patent or registration of utility model

Free format text: JAPANESE INTERMEDIATE CODE: R150

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100317

Year of fee payment: 4

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20100317

Year of fee payment: 4

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20110317

Year of fee payment: 5

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120317

Year of fee payment: 6

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20120317

Year of fee payment: 6

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20130317

Year of fee payment: 7

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20140317

Year of fee payment: 8

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

S111 Request for change of ownership or part of ownership

Free format text: JAPANESE INTERMEDIATE CODE: R313113

R350 Written notification of registration of transfer

Free format text: JAPANESE INTERMEDIATE CODE: R350

LAPS Cancellation because of no payment of annual fees