Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1322263.1322334acmconferencesArticle/Chapter ViewAbstractPublication PagessensysConference Proceedingsconference-collections
Article

Distributed computation in wireless ad hoc grids with bandwidth control

Published: 06 November 2007 Publication History

Abstract

There are many situations in which information from a Wireless Sensor Network (WSN) must be processed to provide a meaningful summary to an external agency in the minimum amount of time, all within the constraints of the processing power and bandwidth available within the network. Our interest is in supporting emergency response for indoors incidents. At present, there are only two choices about where computation might occur within a sensor network: (i) on individual sensor nodes, with the advantage of achieving substantial data reduction, decreasing the cost of transmission, and avoiding congestion; (ii) outside the sensor network, with the sensors simply supplying sinks or more powerful nodes with the data needed for the calculation. The latter approach does not require powerful nodes but necessitates a higher bandwidth network. If applications reach a level of sophistication at which they cannot be executed on a single node, then it would seem that the only option is to have processing performed centrally. The distributed systems community has proposed another solution to limited computing power on a single node: the distribution of complex applications within grids formed by high-end processors. However, since these devices are usually linked through high-speed connections, they do not experience bandwidth restrictions or congestion that are inevitable in any WSN due to the broadcast radio medium. So far, the existing approaches in this direction are hybrid, because they use clusters of nodes that rely on more powerful clusterheads to execute their computation. They tend to focus exclusively on the load availability of nodes during the distribution process, ignoring real communication issues because of the simulated environments in which they are mainly tested. The key contribution of our work is the introduction of a novel approach, which relies on distributing computation among a homogeneous grid of nodes, in an effort to port the Grid Computing paradigm within the WSNs. Moreover, we demonstrate by practical experimentation that there are significant benefits to be gained by considering local network conditions in addition to load information during distribution. We present results from our implementation of two different algorithms on real Tmote Sky sensor testbeds running the Contiki OS [3]. The first is a novel algorithm while the second is an adaptation of an already existing distribution algorithm [2], both modified to take into account real bandwidth requirements.

References

[1]
HEN Sensor Testbed (UCL). http://www.cs.ucl.ac.uk/research/hen/.
[2]
P.-J. Chuang and C.-W. Cheng. On File and Task Placements and Dynamic Load Balancing in Distributed Systems. Tamkang Journal of Science and Software Engineering, 5(4):241--252, 2002.
[3]
A. Dunkels, O. Schmidt, T. Voigt, and M. Ali. Protothreads: Simplifying Event-Driven Programming of Memory-Constrained Embedded Systems. In In SenSys, pages 29--42, November 2006.
[4]
D. Kotz, C. Newport, R. S. Gray, J. Liu, Y. Yuan, and C. Elliott. Experimental Evaluation of Wireless Simulation Assumptions. Technical Report TR2004--507, June 2004.

Cited By

View all
  • (2013)Adaptive scheduling in a mobile ad-hoc grid for time-sensitive computing2013 ACS International Conference on Computer Systems and Applications (AICCSA)10.1109/AICCSA.2013.6616475(1-8)Online publication date: May-2013

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SenSys '07: Proceedings of the 5th international conference on Embedded networked sensor systems
November 2007
455 pages
ISBN:9781595937636
DOI:10.1145/1322263
  • General Chair:
  • Sanjay Jha
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. ad hoc grids
  2. computational and communication issues

Qualifiers

  • Article

Conference

Acceptance Rates

SenSys '07 Paper Acceptance Rate 25 of 149 submissions, 17%;
Overall Acceptance Rate 174 of 867 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2013)Adaptive scheduling in a mobile ad-hoc grid for time-sensitive computing2013 ACS International Conference on Computer Systems and Applications (AICCSA)10.1109/AICCSA.2013.6616475(1-8)Online publication date: May-2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media