ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper An Energy Efficiency Through Explicit Disjoint Multipath Routing in Wireless Sensor Networks
Cited - time in scopus Share share facebook twitter linkedin kakaostory
Authors
Hyun-Woo Oh, Jonghyun Jang, Kyeong-Deok Moon, Soochang Park, Euisin Lee, Sang-Ha Kim
Issue Date
2010-10
Citation
Conference on Local Computer Networks (LCN) 2010, pp.1-4
Language
English
Type
Conference Paper
Abstract
Multipath routing is frequently used to improve data delivery rate and balance traffic load in Wireless Sensor Networks (WSNs). However, existing multipath routing constructions have been ineffective problems that they flood the route request message to entire network in route discovery process and involve a lot of nodes in route update process. In this paper, we propose an explicit disjoint multipath (EDM) routing algorithm to enhance energy efficiency and extend network lifetime through removing flooding mechanism in route discovery process, minimizing number of nodes participating in route update and balancing traffic load over the network. EDM is a stateless geographic routing that it designates logically multiple anchor points and progresses physically construction of disjoint multipath. EDM decides forwarding node using only localized information in source side, intermediate node side and destination side in order to construct completely disjoint multipath. Simulation results show that EDM constructs completely disjoint multipath and enhances data delivery rate, while it removes flooding overhead to entire network and minimizes the signaling overhead for route update. Also they show that EDM can provide a distribution of traffic load over the network, helping to balance the energy consumption and therefore extending network lifetime.
KSP Keywords
Delivery rate, Discovery process, Disjoint multipath routing, Energy Efficiency, Flooding mechanism, Intermediate Nodes, Network LifeTime, Route Request(RREQ), Route Update, Route discovery, Routing algorithm