ACM Home Page
Please provide us with feedback. Feedback
PSFQ: a reliable transport protocol for wireless sensor networks
Full text PdfPdf (492 KB)
Source International Workshop on Wireless Sensor Networks and Applications archive
Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications table of contents
Atlanta, Georgia, USA
SESSION: Transport and Routing Protocols table of contents
Pages: 1 - 11  
Year of Publication: 2002
ISBN:1-58113-589-0
Authors
Chieh-Yih Wan  Columbia University, New York, NY
Andrew T. Campbell  Columbia University, New York, NY
Lakshman Krishnamurthy  Intel Research and Development, Hillsboro, OR
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 33,   Downloads (12 Months): 290,   Citation Count: 63
Additional Information:

abstract   references   cited by   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/570738.570740
What is a DOI?

ABSTRACT

We propose PSFQ (Pump Slowly, Fetch Quickly), a reliable transport protocol suitable for a new class of reliable data applications emerging in wireless sensor networks. For example, currently sensor networks tend to be application specific and are typically hard-wired to perform a specific task efficiently at low cost; however, there is an emerging need to be able to re-task or reprogram groups of sensors in wireless sensor networks on the fly (e.g., during disaster recovery). Due to the application-specific nature of sensor networks, it is difficult to design a single monolithic transport system that can be optimized for every application. PSFQ takes a different approach and supports a simple, robust and scalable transport that is customizable to meet the needs of different reliable data applications. To our knowledge there has been little or no work on the design of an efficient reliable transport protocol for wireless sensor networks, even though some techniques found in IP networks have some relevance to the solution space, such as, the body of work on reliable multicast. We present the design and implementation of PSFQ, and evaluate the protocol using the ns-2 simulator and an experimental wireless sensor testbed based on Berkeley motes. We show through simulation and experimentation that PSFQ can out perform existing related techniques (e.g., an idealized SRM scheme) and is highly responsive to the various error conditions experienced in wireless sensor networks, respectively.


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
 
2
Cots Dust, Large Scale Models for Smart Dust. http://www-bsac.eecs.berkeley.edu/~shollar/macro_motes/macromotes.html.
3
 
4
 
5
 
6
TinyOS Homepage. http://webs.cs.berkeley.edu/tos/
7
 
8
J.J. Garcia-Luna-Aceves, E. L. Madruga, "The core assisted mesh protocol", IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1380--94, Aug. 1999
 
9
S.-J. Lee, M. Gerla, C.-C. Chiang, "On-demand multicast routing protocol", Proc. IEEE Wireless Communications and Networking Conf., pp. 1298--1304, Sept. 21-25, 1999.
10
11
12
 
13
The Network Simulator - ns-2. http://www.isi.edu/nsnam/ns/
 
14

CITED BY  63

Collaborative Colleagues:
Chieh-Yih Wan: colleagues
Andrew T. Campbell: colleagues
Lakshman Krishnamurthy: colleagues