TY - GEN
T1 - SMSR
T2 - 6th International Conference on Ubiquitous Intelligence and Computing, UIC 2009
AU - Oh, Sutaek
AU - Kim, Dongkyun
AU - Kang, Hyunwoo
AU - Jeong, Hong Jong
PY - 2009
Y1 - 2009
N2 - In wireless sensor networks (WSNs), providing resilience (fault tolerance) is a challenging issue. A lot of multipath routing protocols, therefore, have been proposed to achieve the goal; however, they usually suffer from control message overhead or a lack of scalability. Although some protocols utilize partially disjoint paths or longer alternate paths in order to reduce such overhead, they cannot guarantee resilience, because a single failure on a shared node breaks all the paths. In this paper, we therefore propose a scalable multipath source routing (SMSR) protocol. In SMSR, a sink node collects each sensor node's one-hop upstream neighbor information during an initialization phase which the sink node then uses in order to construct several shortest node-disjoint downstream (sink-to-sensor) paths. When transmitting downstream packets, the source routing technique is exploited. On the other hand, each sensor node forwards upstream (sensor-to-sink) packets to one of its upstream neighbors, through the concept of gradient-based routing. The initialization phase depends on only one-time flooding and n (network size) times unicasting, and each sensor node manages only one-hop upstream neighbor information. In this sense, SMSR is scalable in terms of the overhead and the size of routing tables in sensor nodes. Particularly, since SMSR provides several node-disjoint paths with low overhead, it can guarantee resilience efficiently. Through experiments using both ns-2 simulation and our real world test-bed, we verify that SMSR achieves the goal better than other existing routing protocols.
AB - In wireless sensor networks (WSNs), providing resilience (fault tolerance) is a challenging issue. A lot of multipath routing protocols, therefore, have been proposed to achieve the goal; however, they usually suffer from control message overhead or a lack of scalability. Although some protocols utilize partially disjoint paths or longer alternate paths in order to reduce such overhead, they cannot guarantee resilience, because a single failure on a shared node breaks all the paths. In this paper, we therefore propose a scalable multipath source routing (SMSR) protocol. In SMSR, a sink node collects each sensor node's one-hop upstream neighbor information during an initialization phase which the sink node then uses in order to construct several shortest node-disjoint downstream (sink-to-sensor) paths. When transmitting downstream packets, the source routing technique is exploited. On the other hand, each sensor node forwards upstream (sensor-to-sink) packets to one of its upstream neighbors, through the concept of gradient-based routing. The initialization phase depends on only one-time flooding and n (network size) times unicasting, and each sensor node manages only one-hop upstream neighbor information. In this sense, SMSR is scalable in terms of the overhead and the size of routing tables in sensor nodes. Particularly, since SMSR provides several node-disjoint paths with low overhead, it can guarantee resilience efficiently. Through experiments using both ns-2 simulation and our real world test-bed, we verify that SMSR achieves the goal better than other existing routing protocols.
UR - http://www.scopus.com/inward/record.url?scp=71049189668&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02830-4_11
DO - 10.1007/978-3-642-02830-4_11
M3 - Conference contribution
AN - SCOPUS:71049189668
SN - 3642028292
SN - 9783642028298
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 121
EP - 135
BT - Ubiquitous Intelligence and Computing - 6th International Conference, UIC 2009, Proceedings
Y2 - 7 July 2009 through 9 July 2009
ER -