TY - GEN
T1 - GLOBAL
T2 - 15th IEEE Symposium on Computers and Communications, ISCC 2010
AU - Yoo, Hongseok
AU - Shim, Moonjoo
AU - Kim, Dongkyun
AU - Kim, Kyu Hyung
PY - 2010
Y1 - 2010
N2 - Recently, multi-sink wireless sensor networks (WSNs) are envisioned to solve the hot spot problem caused by traditional single-sink WSNs. Routing protocols should be able to distribute network traffic evenly to multiple sinks to prolong network lifetime and they should be scalable. Gradient-based routing protocols are known to be suitable for the networks, where each node maintains its gradient representing the direction toward a neighbor node to reach a sink. In particular, existing protocols allow a sensor node to construct its gradient using the cumulative traffic load of a path for load-balancing. However, they have a critical drawback that a sensor node cannot efficiently avoid using the path with the most overloaded node. Hence, this paper introduces a new gradient-based routing protocol for loadbalancing (GLOBAL) with a new gradient model to maximize network lifetime. In GLOBAL, the least-loaded path which also avoids the most overloaded sensor node is selected for forwarding. Through ns-2 simulation, we verify that GLOBAL achieves better performance than the shortest path routing protocol and load-aware gradient-based routing one.
AB - Recently, multi-sink wireless sensor networks (WSNs) are envisioned to solve the hot spot problem caused by traditional single-sink WSNs. Routing protocols should be able to distribute network traffic evenly to multiple sinks to prolong network lifetime and they should be scalable. Gradient-based routing protocols are known to be suitable for the networks, where each node maintains its gradient representing the direction toward a neighbor node to reach a sink. In particular, existing protocols allow a sensor node to construct its gradient using the cumulative traffic load of a path for load-balancing. However, they have a critical drawback that a sensor node cannot efficiently avoid using the path with the most overloaded node. Hence, this paper introduces a new gradient-based routing protocol for loadbalancing (GLOBAL) with a new gradient model to maximize network lifetime. In GLOBAL, the least-loaded path which also avoids the most overloaded sensor node is selected for forwarding. Through ns-2 simulation, we verify that GLOBAL achieves better performance than the shortest path routing protocol and load-aware gradient-based routing one.
UR - http://www.scopus.com/inward/record.url?scp=77956543078&partnerID=8YFLogxK
U2 - 10.1109/ISCC.2010.5546784
DO - 10.1109/ISCC.2010.5546784
M3 - Conference contribution
AN - SCOPUS:77956543078
SN - 9781424477555
T3 - Proceedings - IEEE Symposium on Computers and Communications
SP - 556
EP - 562
BT - IEEE Symposium on Computers and Communications, ISCC 2010
Y2 - 22 June 2010 through 25 June 2010
ER -