Show simple item record

dc.contributor.authorHari, Pradip
dc.contributor.authorMcCabe, John B. P.
dc.contributor.authorBanafato, Jonathan
dc.contributor.authorHenry, Marcus
dc.contributor.authorKo, Kevin
dc.contributor.authorKoukoumidis, Emmanouil
dc.contributor.authorKremer, Ulrich
dc.contributor.authorMartonosi, Margaret
dc.contributor.authorPeh, Li-Shiuan
dc.date.accessioned2011-06-30T20:26:13Z
dc.date.available2011-06-30T20:26:13Z
dc.date.issued2010-09
dc.identifier.isbn9781450301787
dc.identifier.urihttp://hdl.handle.net/1721.1/64736
dc.description.abstractDynamic 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.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (CNS-EHS #0615175)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (#0614949)en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/1854273.1854304en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleAdaptive Spatiotemporal Node Selection in Dynamic Networksen_US
dc.typeArticleen_US
dc.identifier.citationHari, Pradip et al. “Adaptive Spatiotemporal Node Selection in Dynamic Networks.” Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, September 11-15, Vienna, Austria: ACM, 2010. 227-236.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverPeh, Li-Shiuan
dc.contributor.mitauthorPeh, Li-Shiuan
dc.relation.journalProceedings of the Nineteenth International Conference on Parallel Architectures and Compilation Techniques, PACT '10en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsHari, Pradip; McCabe, John B.P.; Banafato, Jonathan; Henry, Marcus; Ko, Kevin; Koukoumidis, Emmanouil; Kremer, Ulrich; Martonosi, Margaret; Peh, Li-Shiuanen
dc.identifier.orcidhttps://orcid.org/0000-0001-9010-6519
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record