CARD : contact-history assisted route discovery in MANET contact-history assisted route discovery in MANET

Route discovery in mobile ad hoc networks is challenging since frequent change in network topology causes a large amount of network overhead. In this thesis, we propose a route discovery algorithm, called Contact-history Assisted Route Discovery (CARD), for mobile ad hoc networks. Most existing routing protocols in ad hoc networks use a flooding technique to route the request packets. In CARD, nodes keep the most recent contact history about all other nodes in the network. When a source wants to establish a route to a destination, it floods the routing packet attaching the most recent contact history with the destination. Upon receiving the packet, an intermediate node forwards it further if the node has contacted with the destination more recently than the sending node. Since only the nodes which have contacted with the destination more recently than the sending node can continue flooding the control packet, CARD can considerably decrease the route discovery overhead comparing to existing techniques.
Advisors
Kim, Myung-Chulresearcher김명철researcher
Publisher
한국정보통신대학교
Issue Date
2008
Identifier
393052/225023 / 020064699
Language
eng
Description

학위논문(석사) - 한국정보통신대학교 : 공학부, 2008.8, [ vii, 29 p. ]

Keywords

Algorithm; CARD; Mobile Ad-hoc Network

URI
http://hdl.handle.net/10203/55041
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=393052&flag=t
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.
  • Hit : 107
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0