JP2006506843A - 動的ネットワークにおける発信ノードから宛て先ノードまでメッセージをルーティングする方法 - Google Patents
動的ネットワークにおける発信ノードから宛て先ノードまでメッセージをルーティングする方法 Download PDFInfo
- Publication number
- JP2006506843A JP2006506843A JP2004551303A JP2004551303A JP2006506843A JP 2006506843 A JP2006506843 A JP 2006506843A JP 2004551303 A JP2004551303 A JP 2004551303A JP 2004551303 A JP2004551303 A JP 2004551303A JP 2006506843 A JP2006506843 A JP 2006506843A
- Authority
- JP
- Japan
- Prior art keywords
- node
- routing
- probability value
- row
- new
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 71
- 238000013441 quality evaluation Methods 0.000 claims description 4
- 235000008694 Humulus lupulus Nutrition 0.000 claims description 2
- 230000001934 delay Effects 0.000 claims description 2
- 238000005259 measurement Methods 0.000 claims 4
- 238000001303 quality assessment method Methods 0.000 claims 2
- 238000004891 communication Methods 0.000 description 5
- 239000000203 mixture Substances 0.000 description 5
- 230000003068 static effect Effects 0.000 description 5
- 238000011160 research Methods 0.000 description 4
- 238000013459 approach Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000000875 corresponding effect Effects 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 241000257303 Hymenoptera Species 0.000 description 1
- 241001429418 Polemonium eximium Species 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 244000144992 flock Species 0.000 description 1
- 238000007429 general method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000011176 pooling Methods 0.000 description 1
- 238000012552 review Methods 0.000 description 1
- 238000010561 standard procedure Methods 0.000 description 1
- 230000036962 time dependent Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
- Telephonic Communication Services (AREA)
- External Artificial Organs (AREA)
- Pharmaceuticals Containing Other Organic And Inorganic Compounds (AREA)
- Materials For Medical Uses (AREA)
Abstract
Description
S. Ramanathan 及び M. Steensrup, "A survey of routing techniques for mobile communications networks", Mobile networks and Applications, vol. 1 no. 2, p. 89, 1996 J. Broch, D.A. Maltz, D.B. Johnson, Y.-C. Hu, 及び J. Jetcheva, "A performance comparison of multi-hop wireless ad hoc network routing protocols", Proc. MobiCom ’98, Dallas, TX, USA, 1998 E.M. Royer 及び C.-K. Toh, "A review of current routing protocols for ad hoc mobile wireless networks", IEEE Personal Communications, April 1999, p. 46 P. Gupta 及び P. R. Kumar, "A system and traffic dependent adaptive routing algorithm for ad hoc networks", Proceedings of the 36th IEEE Conference on Decision and Control, pp. 2375-2380, San Diego, Dec. 1997 C.E. Perkins, E.M. Royer, S.R. Das, 及び M.K. Marina, "Performance comparison of two on-demand routing protocols for ad-hoc networks", IEEE Personal Communications, February 2001, p.16
RQR(D,j)=p(max,D)−p(min,D);
となり、p(max,D)は、宛て先Dについてのjの現行リストにおける最大の重みであり、p(min,D)は最小のものである。このように算出すれば、何れかのRQRはゼロの最小値を有する(Dまでのルーティングに関しては何も分からない)一方、1の最大値を有する(この場合、Dまでの1つの、最善のルートのみが何れかの重みを有する。)。ノードjは更に、RQR(D,W)に宛て先D毎にノードwから要求する。
以下の表1は、発信元Sと呼ぶノードについてのルーティング・テーブル(RT)の例を表す。
(ii) 喪失ノードが新たな宛て先になるので、新たな行をテーブルに追加する。この喪失した隣接ノードを探索する方法に関する情報が何らないので、ノードSは新たな行を、(例RTにおける宛て先4について図示したように)等しい重みで充填する。しかし、本発明の方法は、喪失した隣接ノードを探索するダミー・メッセージをSが送出することを必要とする。
Claims (10)
- 動的ネットワークにおける発信ノード(S)から宛て先ノードまでメッセージをルーティングする方法であって:
該発信ノードはルーティング・テーブルを含み;
該ルーティング・テーブルにおける各行は、該発信ノード(S)から送信されるデータ・メッセージについての考えられる宛て先ノード(D)を表し;
該ルーティング・テーブルにおける各行は、該発信ノード(S)の隣接ノード(k)毎に1つの確率値p(k,D)を含み;
メッセージが該発信ノード(S)から宛て先ノード(D)に送出される都度とられる品質測定によって前記確率値を更新する工程;
を含み;
該行における最も高い確率値を備えている該隣接ノードを該ルーティング・テーブルにおける宛て先ノード(D)について選択することによって所定の割合の該メッセージをルーティングし;
別のメッセージを、該ルーティング・テーブルにおける該行と同じ行において示される前記確率値によって該隣接ノードの間で該メッセージを配信することによってルーティングすることを特徴とする方法。 - 請求項1又は2記載の方法であって:
品質尺度が、ホップ及び/又は時間遅延によって表されることを特徴とする方法。 - 請求項1記載の方法であって:
隣接ノードとの、喪失された接続を検出すると、当該ノードについてのルーティング・テーブルの各行について、該喪失された隣接ノードと関連する確率値を取り除き、残りの隣接ノードの確率値を調節して和が1になるようにし、該喪失された隣接ノードについての該ルーティング・テーブルにおいて新たな行を、該新たなルーティング・テーブル行におけるめいめいの残りの隣接ノード毎に同等な確率値を当初割り当てることによって作成し、更に、当該ノードから該喪失された隣接ノードに向けて出されるデータ・メッセージによって行われる品質測定によって該確率値を調節することを特徴とする方法。 - 請求項4記載の方法であって:
確率値が、該残りの隣接ノードのうちでの、該隣接ノードの該喪失前の相対的な関係を再確立するよう更に調節されることを特徴とする方法。 - 請求項4又は5記載の方法であって:
該喪失が検出されてから、既存のルーティング行テーブルの調節と、該新たなルーティング・テーブル行の生成とが実行されるまで所定の期間、待つことを特徴とする方法。 - 請求項6記載の方法であって:
ルート品質測定を行い、該ルーティング・テーブルを更新する該メッセージ自体が、単に該データ・メッセージであり、ダミー・メッセージが、所定の時間間隔後に、かつ該所定の時間間隔を過ぎた後は等間隔で、単に、喪失された隣接ノードを探索する目的で特に出されることを特徴とする方法。 - 請求項1記載の方法であって:
新たな隣接ノード(j)の利得を検出すると、該新たな隣接ノード(j)と該発信ノード(S)との両方について、考えられる宛て先ノード(D)毎に1つのルート品質評価(RQR(D,j)及びRQR(D,S))を、宛て先ノード(D)毎の最大確率値と最小確率値とに基づいて算出し;かつ
考えられる宛て先ノード(D)全てについて、該新たな隣接ノードについての新たな確率値を、該隣接ノード(j)と該発信ノード(S)についての該ルート品質評価と、当該関連する隣接ノードの数とに基づいて算出することを特徴とする方法。 - 請求項8記載の方法であって:
該ルート品質評価が、最大確率値から最小確率値を引いた値であることを特徴とする方法。
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
NO20025428A NO318843B1 (no) | 2002-11-13 | 2002-11-13 | AHN-nettverk |
PCT/NO2003/000385 WO2004045166A1 (en) | 2002-11-13 | 2003-11-13 | A method for routing messages from a source node to a destination node in a dynamic network |
Publications (2)
Publication Number | Publication Date |
---|---|
JP2006506843A true JP2006506843A (ja) | 2006-02-23 |
JP4420825B2 JP4420825B2 (ja) | 2010-02-24 |
Family
ID=19914170
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP2004551303A Expired - Fee Related JP4420825B2 (ja) | 2002-11-13 | 2003-11-13 | 動的ネットワークにおける発信ノードから宛て先ノードまでメッセージをルーティングする方法 |
Country Status (8)
Country | Link |
---|---|
US (1) | US7496680B2 (ja) |
EP (1) | EP1579639A1 (ja) |
JP (1) | JP4420825B2 (ja) |
CN (1) | CN100544308C (ja) |
AU (1) | AU2003282637A1 (ja) |
NO (1) | NO318843B1 (ja) |
RU (1) | RU2331159C2 (ja) |
WO (1) | WO2004045166A1 (ja) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2007251545A (ja) * | 2006-03-15 | 2007-09-27 | Fuji Electric Holdings Co Ltd | 無線端末装置、及びプログラム |
WO2011114627A1 (ja) * | 2010-03-17 | 2011-09-22 | 日本電気株式会社 | 経路選択方法、情報処理装置、ネットワークシステムおよび経路選択プログラム |
US8392607B2 (en) | 2009-01-26 | 2013-03-05 | Panasonic Corporation | Relay device, control method, and program |
Families Citing this family (41)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7382731B1 (en) * | 2003-03-05 | 2008-06-03 | Cisco Technology, Inc. | Method and apparatus for updating probabilistic network routing information |
US8018953B1 (en) | 2003-08-20 | 2011-09-13 | Cisco Technology, Inc. | Adaptive, deterministic ant routing approach for updating network routing information |
US9240868B2 (en) * | 2004-11-05 | 2016-01-19 | Ruckus Wireless, Inc. | Increasing reliable data throughput in a wireless network |
US7505447B2 (en) | 2004-11-05 | 2009-03-17 | Ruckus Wireless, Inc. | Systems and methods for improved data throughput in communications networks |
US8619662B2 (en) * | 2004-11-05 | 2013-12-31 | Ruckus Wireless, Inc. | Unicast to multicast conversion |
US8638708B2 (en) * | 2004-11-05 | 2014-01-28 | Ruckus Wireless, Inc. | MAC based mapping in IP based communications |
US7649899B2 (en) * | 2004-11-29 | 2010-01-19 | Microsoft Corporation | System and method for dynamic egress routing through a single default gateway in a mesh network |
US8149696B2 (en) * | 2004-12-31 | 2012-04-03 | Samsung Electronics Co., Ltd. | Methods and system for admission control and scheduling in ad hoc wireless networks |
US7957277B2 (en) * | 2005-02-25 | 2011-06-07 | Interdigital Technology Corporation | Wireless communication method and system for routing packets via intra-mesh and extra-mesh routes |
US8068507B2 (en) | 2005-06-14 | 2011-11-29 | Interdigital Technology Corporation | Method and system for conveying backhaul link information for intelligent selection of a mesh access point |
US20060291482A1 (en) * | 2005-06-23 | 2006-12-28 | Cisco Technology, Inc. | Method and apparatus for providing a metropolitan mesh network |
US20070064612A1 (en) * | 2005-09-19 | 2007-03-22 | Sbc Knowledge Ventures L.P. | Method and apparatus for selecting an optimal path from a path-starting node of a network to a path-ending node of the network |
EP1883184A1 (en) * | 2006-07-28 | 2008-01-30 | NTT DoCoMo, Inc. | Method and apparatus for routing a message |
US8547899B2 (en) * | 2007-07-28 | 2013-10-01 | Ruckus Wireless, Inc. | Wireless network throughput enhancement through channel aware scheduling |
US8355343B2 (en) | 2008-01-11 | 2013-01-15 | Ruckus Wireless, Inc. | Determining associations in a mesh network |
CN101291295B (zh) * | 2008-06-10 | 2010-11-24 | 北京科技大学 | 一种基于间断连通自组织网络延时有限的概率路由方法 |
US9166906B2 (en) * | 2008-12-15 | 2015-10-20 | Intergraph Corporation | Routing method in asymmetric networks |
US8285900B2 (en) * | 2009-02-17 | 2012-10-09 | The Board Of Regents Of The University Of Texas System | Method and apparatus for congestion-aware routing in a computer interconnection network |
US8582502B2 (en) * | 2009-06-04 | 2013-11-12 | Empire Technology Development Llc | Robust multipath routing |
EP2350863B1 (en) | 2009-11-16 | 2015-08-26 | Ruckus Wireless, Inc. | Establishing a mesh network with wired and wireless links |
US9979626B2 (en) * | 2009-11-16 | 2018-05-22 | Ruckus Wireless, Inc. | Establishing a mesh network with wired and wireless links |
KR101438982B1 (ko) | 2009-12-18 | 2014-09-11 | 인텔 코오퍼레이션 | 무리 지능을 사용하는 대규모 분산 시스템에서 정보 라우팅을 위해 프레임워크를 이용하는 시스템 및 방법 |
US9203652B2 (en) * | 2009-12-21 | 2015-12-01 | 8X8, Inc. | Systems, methods, devices and arrangements for cost-effective routing |
CN102696205B (zh) * | 2010-01-06 | 2015-03-04 | 日本电气株式会社 | 通信控制系统和通信控制方法 |
US8411567B2 (en) * | 2010-06-30 | 2013-04-02 | Intel Corporation | Swarm intelligence based methods to enable cooperative communication in a mesh network |
ES2639638T3 (es) * | 2010-09-08 | 2017-10-27 | Nec Corporation | Sistema de conmutación, procedimiento de control de conmutación y medio de memoria |
RU2530279C1 (ru) * | 2013-04-09 | 2014-10-10 | федеральное государственное автономное образовательное учреждение высшего образования "Санкт-Петербургский государственный политехнический университет" (ФГАОУ ВО "СПбПУ") | Способ автоматического адаптивного управления сетевыми потоками в программно-конфигурируемых сетях |
US20150263985A1 (en) * | 2014-03-13 | 2015-09-17 | Jpmorgan Chase Bank, N.A. | Systems and methods for intelligent workload routing |
CN104363626B (zh) * | 2014-11-07 | 2017-09-19 | 中国人民武装警察部队工程大学 | 一种基于贝叶斯理论的vanet可信路由方法 |
US10419310B1 (en) | 2015-12-17 | 2019-09-17 | 8×8, Inc. | Monitor device for use with endpoint devices |
US10541900B2 (en) * | 2016-02-01 | 2020-01-21 | Arista Networks, Inc. | Hierarchical time stamping |
US10530934B1 (en) | 2016-05-04 | 2020-01-07 | 8X8, Inc. | Endpoint location determination for call routing decisions |
US10542150B1 (en) | 2016-05-04 | 2020-01-21 | 8X8, Inc. | Server generated timing of location updates for call routing decisions |
US11076051B1 (en) | 2016-05-04 | 2021-07-27 | 8X8, Inc. | Endpoint location update control for call routing decisions |
US10326888B1 (en) | 2016-05-04 | 2019-06-18 | 8X8, Inc. | Location updates for call routing decisions |
RU2636665C1 (ru) * | 2017-02-20 | 2017-11-27 | Федеральное государственное казенное военное образовательное учреждение высшего образования "Академия Федеральной службы охраны Российской Федерации" (Академия ФСО России) | Способ многопутевой маршрутизации с использованием расщепления потока трафика данных |
EP3831021A1 (en) | 2018-07-27 | 2021-06-09 | Gotenna Inc. | VINEtm ZERO-CONTROL ROUTING USING DATA PACKET INSPECTION FOR WIRELESS MESH NETWORKS |
CN110417572B (zh) * | 2019-05-14 | 2021-05-11 | 中南大学 | 一种基于目标节点相遇概率预测消息传递节点的方法 |
CN110826786A (zh) * | 2019-10-28 | 2020-02-21 | 广州杰赛科技股份有限公司 | 目的地点人口数量的预测方法、装置及存储介质 |
US11271933B1 (en) * | 2020-01-15 | 2022-03-08 | Worldpay Limited | Systems and methods for hosted authentication service |
CN111711974B (zh) * | 2020-07-10 | 2023-03-17 | 河南科技大学 | 基于轨迹预测的飞行自组织网络能量有效型机会路由方法 |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5987011A (en) * | 1996-08-30 | 1999-11-16 | Chai-Keong Toh | Routing method for Ad-Hoc mobile networks |
US6502135B1 (en) * | 1998-10-30 | 2002-12-31 | Science Applications International Corporation | Agile network protocol for secure communications with assured system availability |
US6278723B1 (en) * | 2000-03-08 | 2001-08-21 | Motorola, Inc. | Method and apparatus for minimizing a probability of self-interference among neighboring wireless networks |
US6721800B1 (en) * | 2000-04-10 | 2004-04-13 | International Business Machines Corporation | System using weighted next hop option in routing table to include probability of routing a packet for providing equal cost multipath forwarding packets |
WO2002084956A1 (en) * | 2001-04-16 | 2002-10-24 | Kent Ridge Digital Labs | A routing protocol for general mobile ad hoc networks |
US20020161917A1 (en) * | 2001-04-30 | 2002-10-31 | Shapiro Aaron M. | Methods and systems for dynamic routing of data in a network |
-
2002
- 2002-11-13 NO NO20025428A patent/NO318843B1/no not_active IP Right Cessation
-
2003
- 2003-11-13 WO PCT/NO2003/000385 patent/WO2004045166A1/en active Application Filing
- 2003-11-13 RU RU2005117777/09A patent/RU2331159C2/ru not_active IP Right Cessation
- 2003-11-13 AU AU2003282637A patent/AU2003282637A1/en not_active Abandoned
- 2003-11-13 EP EP03774399A patent/EP1579639A1/en not_active Withdrawn
- 2003-11-13 US US10/534,929 patent/US7496680B2/en not_active Expired - Fee Related
- 2003-11-13 JP JP2004551303A patent/JP4420825B2/ja not_active Expired - Fee Related
- 2003-11-13 CN CN200380108474.8A patent/CN100544308C/zh not_active Expired - Fee Related
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2007251545A (ja) * | 2006-03-15 | 2007-09-27 | Fuji Electric Holdings Co Ltd | 無線端末装置、及びプログラム |
US8392607B2 (en) | 2009-01-26 | 2013-03-05 | Panasonic Corporation | Relay device, control method, and program |
WO2011114627A1 (ja) * | 2010-03-17 | 2011-09-22 | 日本電気株式会社 | 経路選択方法、情報処理装置、ネットワークシステムおよび経路選択プログラム |
US8792503B2 (en) | 2010-03-17 | 2014-07-29 | Nec Corporation | Path selection method, information processor, network system, and path selection program |
JP5682620B2 (ja) * | 2010-03-17 | 2015-03-11 | 日本電気株式会社 | 経路選択方法、情報処理装置、ネットワークシステムおよび経路選択プログラム |
Also Published As
Publication number | Publication date |
---|---|
NO20025428D0 (no) | 2002-11-13 |
JP4420825B2 (ja) | 2010-02-24 |
RU2331159C2 (ru) | 2008-08-10 |
AU2003282637A1 (en) | 2004-06-03 |
WO2004045166A1 (en) | 2004-05-27 |
RU2005117777A (ru) | 2006-02-10 |
EP1579639A1 (en) | 2005-09-28 |
NO318843B1 (no) | 2005-05-09 |
US20060031576A1 (en) | 2006-02-09 |
US7496680B2 (en) | 2009-02-24 |
CN100544308C (zh) | 2009-09-23 |
CN1736065A (zh) | 2006-02-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4420825B2 (ja) | 動的ネットワークにおける発信ノードから宛て先ノードまでメッセージをルーティングする方法 | |
Boppana et al. | An adaptive distance vector routing algorithm for mobile, ad hoc networks | |
Jayakumar et al. | Performance comparison of mobile ad-hoc network routing protocol | |
Mbarushimana et al. | Comparative study of reactive and proactive routing protocols performance in mobile ad hoc networks | |
JP2007506337A (ja) | ルーティング方法および当該方法を無線通信システムで実行する携帯端末 | |
Naseem et al. | Queue‐based multiple path load balancing routing protocol for MANETs | |
Ahmad et al. | Efficient AODV routing based on traffic load and mobility of node in MANET | |
Tickoo et al. | Route fragility: a novel metric for route selection in mobile ad hoc networks. | |
Jane et al. | Performance of efficient CBRP in mobile ad hoc networks (MANETS) | |
Asokan et al. | Performance evaluation of energy and delay aware Quality of Service (QoS) routing protocols in mobile adhoc networks | |
Khosroabadi et al. | An overview of some of the QoS routing protocols in wireless sensor networks | |
Boukerche et al. | A route discovery optimization scheme using GPS system | |
Boukerche | Simulation-based performance comparisons of routing protocols for mobile ad hoc networks | |
Wang et al. | The research of a multiple disjoint paths routing protocol for ad hoc sensor networks | |
Doshi et al. | SAFAR: An adaptive bandwidth-efficient routing protocol for mobile ad hoc networks | |
Liu et al. | A location based QoS routing protocol for ad hoc networks | |
Siddiqui et al. | Modeling, performance measurement, and control of clustering mechanisms for multi-cluster mobile ad hoc networks | |
Nagaraju et al. | Performance Evaluation of ADV with AODV for Mobile Ad-hoc Networks | |
Patel et al. | MAC Layer aware Stable Link Routing (MACSLR) in Mobile Adhoc Networks | |
Gupta et al. | An Analytical Study of Various Ad-hoc Network Routing Protocols Under Certain Parameters using Qualnet-7.1 | |
Ghazali et al. | ANT-AODV HYBRID ROUTING PROTOCOL in MANET | |
Dearham et al. | A Comparative Assessment of Ad-Hoc Routing Protocols | |
Chandrasekhar et al. | A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks | |
Safarpour | Analyzing the service quality in mobile ad hoc networks | |
He et al. | Fast Route Repair for Continuous Video Transmission over Mobile Ad Hoc Networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20060822 |
|
A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20090317 |
|
A601 | Written request for extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A601 Effective date: 20090610 |
|
A602 | Written permission of extension of time |
Free format text: JAPANESE INTERMEDIATE CODE: A602 Effective date: 20090617 |
|
A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20090825 |
|
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: 20091104 |
|
A01 | Written decision to grant a patent or to grant a registration (utility model) |
Free format text: JAPANESE INTERMEDIATE CODE: A01 |
|
A61 | First payment of annual fees (during grant procedure) |
Free format text: JAPANESE INTERMEDIATE CODE: A61 Effective date: 20091201 |
|
FPAY | Renewal fee payment (event date is renewal date of database) |
Free format text: PAYMENT UNTIL: 20121211 Year of fee payment: 3 |
|
R150 | Certificate of patent or registration of utility model |
Free format text: JAPANESE INTERMEDIATE CODE: R150 |
|
LAPS | Cancellation because of no payment of annual fees |