TY - GEN
T1 - Adaptive spatiotemporal node selection in dynamic networks
AU - Hari, Pradip
AU - McCabe, John B.P.
AU - Banafato, Jonathan
AU - Henry, Marcus
AU - Ko, Kevin
AU - Koukoumidis, Emmanouil
AU - Kremer, Ulrich
AU - Martonosi, Margaret
AU - Peh, Li Shiuan
PY - 2010
Y1 - 2010
N2 - Dynamic networks - spontaneous, self-organizing groups of devices - are a promising new computing platform. Writing applications for such networks is a daunting task, however, due to their extreme variability and unpredictability, with many devices having significant resource limitations. Intelligent, automated distribution of work across network nodes is needed to get the most out of limited resource budgets. We propose a novel framework for distributing computations across a dynamic network, in which applications specify their spatiotemporal properties at a very high level. The underlying system makes node selection decisions to exploit these properties, producing high quality results within a fixed resource budget. A distributed computation is expressed as a semantically parallel loop over a geographic area and time period. Feedback from the application about the quality of node selection decisions is used to guide future decisions, even while the loop is still in progress. This simplifies the process of writing dynamic network applications by allowing programmers to focus on the goals of their applications, rather than on the topology and environment of the network. Our framework implementation consists of extensions to the Java language, a compiler for this extended language, and a run-time system that work together to provide a simple, powerful architecture for dynamic network programming. We evaluate our system using 11 Nokia N810 tablet PC devices and 14 Neo FreeRunner (Openmoko) smartphones, as well as a simulation environment that models the behavior of up to 500 devices. For three representative applications, we obtain significant improvements in the number of useful results obtained when compared with baseline node selection algorithms: up to 745% (measured), 117% (simulated) for an Amber Alert application; 38% (measured), 142% (simulated) for a Bird Tracking application; and 86% (measured), 209% (simulated) for a Crowd Estimation application.
AB - Dynamic networks - spontaneous, self-organizing groups of devices - are a promising new computing platform. Writing applications for such networks is a daunting task, however, due to their extreme variability and unpredictability, with many devices having significant resource limitations. Intelligent, automated distribution of work across network nodes is needed to get the most out of limited resource budgets. We propose a novel framework for distributing computations across a dynamic network, in which applications specify their spatiotemporal properties at a very high level. The underlying system makes node selection decisions to exploit these properties, producing high quality results within a fixed resource budget. A distributed computation is expressed as a semantically parallel loop over a geographic area and time period. Feedback from the application about the quality of node selection decisions is used to guide future decisions, even while the loop is still in progress. This simplifies the process of writing dynamic network applications by allowing programmers to focus on the goals of their applications, rather than on the topology and environment of the network. Our framework implementation consists of extensions to the Java language, a compiler for this extended language, and a run-time system that work together to provide a simple, powerful architecture for dynamic network programming. We evaluate our system using 11 Nokia N810 tablet PC devices and 14 Neo FreeRunner (Openmoko) smartphones, as well as a simulation environment that models the behavior of up to 500 devices. For three representative applications, we obtain significant improvements in the number of useful results obtained when compared with baseline node selection algorithms: up to 745% (measured), 117% (simulated) for an Amber Alert application; 38% (measured), 142% (simulated) for a Bird Tracking application; and 86% (measured), 209% (simulated) for a Crowd Estimation application.
KW - ad hoc networks
KW - adaptive scheduling
KW - dynamic networks
KW - feedback-directed scheduling
KW - location-awareness
KW - node selection
KW - quality of result
KW - resource-awareness
KW - spatial programming
KW - spatiotemporal programming
UR - http://www.scopus.com/inward/record.url?scp=78149264462&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78149264462&partnerID=8YFLogxK
U2 - 10.1145/1854273.1854304
DO - 10.1145/1854273.1854304
M3 - Conference contribution
AN - SCOPUS:78149264462
SN - 9781450301787
T3 - Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT
SP - 227
EP - 236
BT - PACT'10 - Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 19th International Conference on Parallel Architectures and Compilation Techniques, PACT 2010
Y2 - 11 September 2010 through 15 September 2010
ER -