Worst-Case Routing Performance Evaluation of Sensor Networks
- Creators
- Soedarmadji, Edwin
Abstract
Successful sensor network applications depends heavily on the ability of these networks to reliably and reasonably perform under the worst-case scenarios, extreme and unusual events for which many such networks are designed to detect. One of the key performance measures is the network's ability to route measurement data from the sensor nodes to the destination node(s). This paper introduces a general framework with which worst-case routing performance of different sensor networks can be evaluated and compared. Our method can either be used as a design optimization tool, or a decision making tool to select and price contending sensor network designs and applications.
Additional Information
© 2007 IEEE. Issue Date: 6-8 Feb. 2007; Date of Current Version: 25 June 2007. The author would like to convey his appreciation to Prof. Robert J. McEliece for valuable discussions and guidance, as well as useful suggestions that have improved this manuscript. Financial support from the Caltech Lee Center for Advanced Networking and NSF Grant No. CCF- 0514881 are gratefully acknowledged.Attached Files
Published - Soedarmadji2007p89262007_Ieee_Sensors_Applications_Symposium.pdf
Files
Name | Size | Download all |
---|---|---|
md5:85aceb9e3c69c5578fc936b2fc29a607
|
1.4 MB | Preview Download |
Additional details
- Eprint ID
- 20688
- Resolver ID
- CaltechAUTHORS:20101105-105913586
- CCF-0514881
- Caltech Lee Center for Advanced Networking
- NSF
- Created
-
2010-11-05Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9702764