Ryukoku University
Faculty of Science and Technology
Department of Electronics and Informatics
Wataru UEMURA
Sitemap

Main Menu
矢印メインメニュー
矢印ログイン
ユーザ名:

パスワード:


パスワード紛失

新規登録
Links




メイン : 無線通信 : 


ソート順:  タイトル ()日付 ()評価 ()人気 ()
現在のソート順サイト: タイトル (A to Z)


カテゴリ: 無線通信
訪問Ad hoc On-Demand Distance Vector (AODV) Routing 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

The Ad hoc On-Demand Distance Vector (AODV) routing protocol
is intended for use by mobile nodes in an ad hoc network. It
offers quick adaptation to dynamic link conditions, low processing
and memory overhead, low network utilization, and determines
unicast routes to destinations within the ad hoc network. It uses
destination sequence numbers to ensure loop freedom at all times
(even in the face of anomalous delivery of routing control messages),
avoiding problems (such as ``counting to infinity'') associated with
classical distance vector protocols.

ヒット数: 1171   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (1)

カテゴリ: 無線通信
訪問Dynamic MANET On-demand (DYMO) Routing 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

The Dynamic MANET On-demand (DYMO) routing protocol is intended for
use by mobile nodes in wireless multihop networks. It offers
adaptation to changing network topology and determines unicast routes
between nodes within the network on-demand.

ヒット数: 692   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問Generalized MANET Packet/Message Format 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

This document specifies a multi-message packet format that may be
used by mobile ad hoc network routing and other protocols.

ヒット数: 662   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問Global connectivity for IPv6 Mobile Ad Hoc Networks 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

This document describes how to provide Internet connectivity with
mobile ad-hoc networks. It describes how to obtain a globally
routable address and internet gateway operation. Once a manet node
obtains a global address from an internet gateway, it may exchange
data with nodes on the Internet. This Internet access method is not
dependent on a particular manet protocol. Further, use of global
connectivity with Mobile IPv6 is specified.

ヒット数: 551   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問MANET Neighborhood Discovery Protocol (NHDP) 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

This document describes a neighborhood discovery protocol (NHDP) for
a mobile ad hoc network (MANET). The protocol provides each MANET
node with local topology up to two hops distant, describing a node's
1-hop neighbors and symmetric 2-hop neighbors. This is achieved
through periodic message exchange. This neighborhood discovery
protocol may be used by any MANET protocols which need neighborhood
information.

The protocol imposes minimum requirements to the network by not
requiring sequenced or reliable transmission of control traffic.

ヒット数: 644   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問Optimized Link State Routing Protocol 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

This document describes the Optimized Link State Routing (OLSR)
protocol for mobile ad hoc networks. The protocol is an optimization
of the classical link state algorithm tailored to the requirements of
a mobile wireless LAN. The key concept used in the protocol is that
of multipoint relays (MPRs). MPRs are selected nodes which forward
broadcast messages during the flooding process. This technique
substantially reduces the message overhead as compared to a classical
flooding mechanism, where every node retransmits each message when it
receives the first copy of the message. In OLSR, link state
information is generated only by nodes elected as MPRs. Thus, a
second optimization is achieved by minimizing the number of control
messages flooded in the network. As a third optimization, an MPR
node may chose to report only links between itself and its MPR
selectors. Hence, as contrary to the classic link state algorithm,
partial link state information is distributed in the network. This
information is then used by for route calculation. OLSR provides
optimal routes (in terms of number of hops). The protocol is
particularly suitable for large and dense networks as the technique
of MPRs works well in this context.

ヒット数: 671   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

The Dynamic Source Routing protocol (DSR) is a simple and efficient
routing protocol designed specifically for use in multi-hop wireless
ad hoc networks of mobile nodes. DSR allows the network to be
completely self-organizing and self-configuring, without the need for
any existing network infrastructure or administration. The protocol
is composed of the two main mechanisms of "Route Discovery" and
"Route Maintenance", which work together to allow nodes to discover
and maintain routes to arbitrary destinations in the ad hoc network.
All aspects of the protocol operate entirely on-demand, allowing
the routing packet overhead of DSR to scale automatically to only
that needed to react to changes in the routes currently in use. The
protocol allows multiple routes to any destination and allows each
sender to select and control the routes used in routing its packets,
for example for use in load balancing or for increased robustness.
Other advantages of the DSR protocol include easily guaranteed
loop-free routing, operation in networks containing unidirectional
links, use of only "soft state" in routing, and very rapid recovery
when routes in the network change. The DSR protocol is designed
mainly for mobile ad hoc networks of up to about two hundred nodes,
and is designed to work well with even very high rates of mobility.
This document specifies the operation of the DSR protocol for routing
unicast IPv4 packets.

ヒット数: 569   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問The Optimized Link-State Routing Protocol version 2 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

This document describes version 2 of the Optimized Link State Routing
(OLSRv2) protocol for mobile ad hoc networks. The protocol embodies
an optimization of the classical link state algorithm tailored to the
requirements of a mobile wireless LAN.

The key optimization of OLSRv2 is that of multipoint relays,
providing an efficient mechanism for network-wide broadcast of link-
state information (i.e. reducing the cost of performing a network-
wide link-state broadcast). A secondary optimization is that OLSRv2
employs partial link-state information: each node maintains
information about all destinations, but only a subset of links. This
allows that only select nodes diffuse link-state advertisements (i.e.
reduces the number of network-wide link-state broadcasts) and that
these advertisements contain only a subset of links (i.e. reduces the
size of each network-wide link-state broadcast). The partial link-
state information thus obtained still allows each OLSRv2 node to at
all times maintain optimal (in terms of number of hops) routes to all
destinations in the network.

OLSRv2 imposes minimum requirements to the network by not requiring
sequenced or reliable transmission of control traffic. Furthermore,
the only interaction between OLSRv2 and the IP stack is routing table
management.

OLSRv2 is particularly suitable for large and dense networks as the
technique of MPRs works well in this context.

ヒット数: 690   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) 人気 最終更新日: 2006-9-25 15:26
説明:
Abstract

TBRPF is a proactive, link-state routing protocol designed for mobile
ad-hoc networks, which provides hop-by-hop routing along shortest
paths to each destination. Each node running TBRPF computes a source
tree (providing paths to all reachable nodes) based on partial
topology information stored in its topology table, using a
modification of Dijkstra's algorithm. To minimize overhead, each node
reports only *part* of its source tree to neighbors. TBRPF uses a
combination of periodic and differential updates to keep all
neighbors informed of the reported part of its source tree. Each node
also has the option to report additional topology information (up to
the full topology), to provide improved robustness in highly mobile
networks. TBRPF performs neighbor discovery using "differential"
HELLO messages which report only *changes* in the status of
neighbors. This results in HELLO messages that are much smaller than
those of other link-state routing protocols such as OSPF.

ヒット数: 675   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)

カテゴリ: 無線通信
訪問近畿総合通信局 各種申請書 人気 最終更新日: 2006-9-11 14:10
説明:
アマチュア無線局各種申請様式ダウンロード が用意されています.

書店/無線ショップで購入することもできますが,有料です.

ヒット数: 761   評価0.00 (投票数 0 )
このサイトを評価する | 修正 |リンク切れ報告 | 友達に紹介 | コメント (0)







Powered by XOOPS Cube 2.0 © 2005-2006 The XOOPS Project