A loss-tolerant stateless tree routing protocol for IP-based wireless sensor networks = IP 기반 무선 센서 네트워크를 위한 링크 손실에 강한 경량 트리 라우팅 프로토콜

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 278
  • Download : 0
The IP-based Wireless Sensor Network (IP-WSN) is one of the essential elements enabling Internet of Things. However, IP-WSN imposes great challenges due to low processing resources and strict energy constraints of sensor nodes, so that it is important to design the routing protocol considering those challenges. The plain tree routing protocols are proposed considering low-cost communication with resource-constraint and typical traffic patterns like multipoint-to-point (MP2P) or point-to-multipoint (P2MP), but those routing protocols incur triangular detour routes as far as point- to-point (P2P) traffic is concerned. Other tree routing protocols are also proposed to improve the efficiency of P2P route. Although they can improve the efficiency of P2P route compared the plain tree routing protocols, they are yet to define the link recovery mechanism. The link recovery mechanism is indispensable to the tree routing protocols, because the wireless links are repeatedly connected and failed, and they are important for delivering successfully a packet to the destination. To address those issues of the existing tree routing protocols, we propose a Loss-Tolerant Stateless Tree Routing protocol (LTSTR). LTSTR defines a novel link recovery mechanism unlike existing tree routing protocols. If the link loss is detected, this mechanism provides the method to avoid the failed links by using the fault-avoidance routing and the lightweight source routing. LTSTR also provides the reduced hop route in terms of P2P traffic as well as typical traffics through the enhanced shortcut tree routing (ESTR) algorithm and the root oriented directional tree (RODT) topology. ESTR algorithm enables a packet to be forwarded to the node having the smallest remaining hop count among neighbors instead of always forwarding a packet through the predefined tree routes, and LTSTR guarantees the shortest hop route toward the root by RODT topology. Additionally, LTSTR provides a nearly stateless rout...
Advisors
Kim , Dae-Youngresearcher김대영
Description
한국과학기술원 : 전산학과,
Publisher
한국과학기술원
Issue Date
2013
Identifier
515114/325007  / 020113041
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학과, 2013.2, [ vi, 47 p. ]

Keywords

IP 기반 무선 센서 네트워크; MP2P traffic; P2P traffic; Stateless protocol; Loss-tolerant routing; Link recovery; IoT; 6LoWPAN; IP-WSN; 6LoWPAN; 사물 통신; 링크 복구; 링크 손실에 강한 라우팅; 경량 프로토콜; 일대일 트래픽; 다대일 트래픽; 일대다 트래픽; P2MP traffic

URI
http://hdl.handle.net/10203/180455
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=515114&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0