한국해양대학교

Detailed Information

Metadata Downloads

이동 Ad-hoc 무선망에서 효율적인 라우팅 알고리즘에 관한 연구

Title
이동 Ad-hoc 무선망에서 효율적인 라우팅 알고리즘에 관한 연구
Alternative Title
A Study on the Effective Routing Algorithm for Mobile Ad-hoc Wireless Network
Author(s)
이동철
Publication Year
2004
Publisher
한국해양대학교 대학원
URI
http://kmou.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002175665
http://repository.kmou.ac.kr/handle/2014.oak/9929
Abstract
The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc. The two main nodes, source and destination node of a fixed network, consist of Ad-hoc network since they have some special features. The condition of nodes is changeable (for source or destination), all nodes can route. Every node has its routing ability. It means that nodes can communicate in cooperation with each other.

Though there are many ways for nodes to establish routes, the forward data packet has to be transmitted to the near node. This would be needed while setting routes up choosing unicast, multicast or broadcast for forms of transmission determines the degree of the networks traffic load and increased traffic load results from frequent overlapping information in nods. When broadcasting, it saves more time but increases far more traffic data. On the contrary, unicast and multicast need more time but reduces far more traffic. To make a node into the gateway and analyze the manners of transmission through clustering, it will improve its transfer efficiency in Ad-hoc network eliminating the phenomena, in this thesis.
Appears in Collections:
전자통신공학과 > Thesis
Files in This Item:
000002175665.pdf Download

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse