TY - GEN
T1 - Group-based discovery in low-duty-cycle mobile sensor networks
AU - Chen, Liangyin
AU - Gu, Yu
AU - Guo, Shuo
AU - He, Tian
AU - Shu, Yuanchao
AU - Zhang, Fan
AU - Chen, Jiming
PY - 2012
Y1 - 2012
N2 - Wireless Sensor Networks have been used in many mobile applications such as wildlife tracking and participatory urban sensing. Because of the combination of high mobility and low-duty-cycle operations, it is a challenging issue to reduce discovery delay among mobile nodes, so that mobile nodes can establish connection quickly once they are within each other's vicinity. Existing discovery designs are essentially pair-wise based, in which discovery is passively achieved when two nodes are pre-scheduled to wake-up at the same time. In contrast, for the first time, this work reduces discovery delay significantly by proactively referring wake-up schedules among a group of nodes. Because proactive references incur additional overhead, we introduce a novel selective reference mechanism based on spatiotemporal properties of neighborhood and the mobility of the nodes. Our quantitative analysis indicates that the discovery delay of our group-based mechanism is significantly smaller than that of the pair-wise one. Our testbed experiments using 40 sensor nodes confirm our theoretical analysis, showing one order of magnitude reduction in discovery delay compared with traditional pair-wise methods with only 0.5%∼8.8% increase in energy consumption.
AB - Wireless Sensor Networks have been used in many mobile applications such as wildlife tracking and participatory urban sensing. Because of the combination of high mobility and low-duty-cycle operations, it is a challenging issue to reduce discovery delay among mobile nodes, so that mobile nodes can establish connection quickly once they are within each other's vicinity. Existing discovery designs are essentially pair-wise based, in which discovery is passively achieved when two nodes are pre-scheduled to wake-up at the same time. In contrast, for the first time, this work reduces discovery delay significantly by proactively referring wake-up schedules among a group of nodes. Because proactive references incur additional overhead, we introduce a novel selective reference mechanism based on spatiotemporal properties of neighborhood and the mobility of the nodes. Our quantitative analysis indicates that the discovery delay of our group-based mechanism is significantly smaller than that of the pair-wise one. Our testbed experiments using 40 sensor nodes confirm our theoretical analysis, showing one order of magnitude reduction in discovery delay compared with traditional pair-wise methods with only 0.5%∼8.8% increase in energy consumption.
UR - http://www.scopus.com/inward/record.url?scp=84867928668&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867928668&partnerID=8YFLogxK
U2 - 10.1109/SECON.2012.6275824
DO - 10.1109/SECON.2012.6275824
M3 - Conference contribution
AN - SCOPUS:84867928668
SN - 9781467319058
T3 - Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks workshops
SP - 542
EP - 550
BT - 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012
T2 - 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2012
Y2 - 18 June 2012 through 21 June 2012
ER -