ACM Home Page
Please provide us with feedback. Feedback
Dynamic data compression in multi-hop wireless networks
Full text PdfPdf (511 KB)
Source
Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems table of contents
Seattle, WA, USA
SESSION: Power management table of contents
Pages 145-156  
Year of Publication: 2009
ISBN:978-1-60558-511-6
Authors
Abhishek B. Sharma  University of Southern California, Los Angeles, CA, USA
Leana Golubchik  University of Southern California, Los Angeles, CA, USA
Ramesh Govindan  University of Southern California, Los Angeles, CA, USA
Michael J. Neely  University of Southern California, Los Angeles, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGMETRICS: ACM Special Interest Group on Measurement and Evaluation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 39,   Downloads (12 Months): 108,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1555349.1555367
What is a DOI?

ABSTRACT

Data compression can save energy and increase network capacity in wireless sensor networks. However, the decision of whether and when to compress data can depend upon platform hardware, topology, wireless channel conditions, and application data rates. Using Lyapunov optimization theory, we design an algorithm called SEEC that makes joint compression and transmission decisions with the goal of minimizing energy consumption. A practical distributed variant, DSEEC, is able to achieve more than 30% energy savings and adapts seamlessly across a wide range of conditions, without explicitly taking topology, application data rates, and link quality changes into account.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Qualnet. http://www.scalable-networks.com/products.
2
3
 
4
5
 
6
T. Dang, N. Bulusu, and W. chi Feng. RIDA: A Robust Information-Driven Data Compression Architecture for Irregular Wireless Sensor Networks. In Proceedings of the EWSN, 2007.
7
 
8
 
9
M. J. Neely. Energy Optimal Control for time varying wireless networks. IEEE Transactions on Information Theory, 52(7):2915--2934, 2006.
 
10
 
11
M. J. Neely. Dynamic Data Compression for Wireless Transmission over a Fading Channel. In Proceedings of the Conference on Information Sciences and Systems, 2008.
 
12
M. J. Neely, E. Modiano, and C. E. Rohrs. Dynamic Power Allocation and Routing for Time Varying Wireless Networks. In Proceedings of the INFOCOM, 2003.
 
13
J. Paek, O. Gnawali, K.-Y. Jang, D. Nishimura, R. Govindan, J. Caffrey, M. Wahbeh, and S. Masri. A Programmable Wireless Sensing System for Structural Monitoring. In Proceedings of the 4th World Conference on Structural Control and Monitoring(4WCSCM), 2006.
14
15
 
16
A. B. Sharma, L. Golubchik, R. Govindan, and M. J. Neely. Dynamic Data Compression in Multi-hop Wireless Networks. Technical Report 09-905, Computer Science, University of Southern California, April 2009.
 
17
A. Sridharan, S. Moeller, and B. Krishnamachari. Investigating Backpressure based Rate Control Protocols for Wireless Sensor Networks. Technical Report CENG-2008-7, University of Southern California, July 2008.
 
18
K. Srinivasan and P. Levis. RSSI is Under Appreciated. In Proceedings of EmNets Workshop, 2006.
 
19
 
20
A. Umut, M. Andrews, P. Gupta, J. Hobby, I. Sanjee, and A. Stolyar. Joint scheduling and congestion control in mobile ad-hoc networks. In Proceedings of INFOCOM, 2008.
 
21
A. Warrier, L. Le, and I. Rhee. Cross-layer optimization made practical. In Proceedings of Broadnets, Invited paper, 2007.
22

Collaborative Colleagues:
Abhishek B. Sharma: colleagues
Leana Golubchik: colleagues
Ramesh Govindan: colleagues
Michael J. Neely: colleagues