TY - GEN
T1 - Virtual sink rotation
T2 - EUC 2005 Workshops: UISW, NCUS, SecUbiq, USN, and TAUES
AU - Choi, Lynn
AU - Choi, Kwangseok
AU - Kim, Jungsun
AU - Park, Byung Joon
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2005
Y1 - 2005
N2 - In this paper we propose a new routing protocol called virtual sink rotation (VSR) routing for large-scale sensor networks. VSR can efficiently handle a large number of sources as well as a large number of sinks with potential mobility. Each sensor node is not required to know the global network topology nor the location awareness. The main ideas underlying the VSR are two folds. First, to alleviate the frequent location updates associated with multiple mobile sinks, the algorithm introduces a virtual sink, which acts as a data collection and dissemination center to collect the data from all the sources and forward them to the actual sinks. This virtual sink can easily support multiple sinks as well as the mobility of the sinks. Second, to address the excessive energy consumption among the sensor nodes around a sink, VSR employs virtual sink rotation, which distributes the role of the virtual sink over all the participating sensor nodes, thus achieving a uniform energy distribution across the entire sensor field and prolonging the lifetime of the network. Experimentation results confirm that the VSR routing can significantly save energy while it can also reduce both the message delay and the message delivery failures compared to previous schemes.
AB - In this paper we propose a new routing protocol called virtual sink rotation (VSR) routing for large-scale sensor networks. VSR can efficiently handle a large number of sources as well as a large number of sinks with potential mobility. Each sensor node is not required to know the global network topology nor the location awareness. The main ideas underlying the VSR are two folds. First, to alleviate the frequent location updates associated with multiple mobile sinks, the algorithm introduces a virtual sink, which acts as a data collection and dissemination center to collect the data from all the sources and forward them to the actual sinks. This virtual sink can easily support multiple sinks as well as the mobility of the sinks. Second, to address the excessive energy consumption among the sensor nodes around a sink, VSR employs virtual sink rotation, which distributes the role of the virtual sink over all the participating sensor nodes, thus achieving a uniform energy distribution across the entire sensor field and prolonging the lifetime of the network. Experimentation results confirm that the VSR routing can significantly save energy while it can also reduce both the message delay and the message delivery failures compared to previous schemes.
UR - http://www.scopus.com/inward/record.url?scp=33744923193&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33744923193&partnerID=8YFLogxK
U2 - 10.1007/11596042_115
DO - 10.1007/11596042_115
M3 - Conference contribution
AN - SCOPUS:33744923193
SN - 3540308032
SN - 9783540308034
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1128
EP - 1137
BT - Embedded and Ubiquitous Computing - EUC 2005 Workshops
Y2 - 6 December 2005 through 9 December 2005
ER -