loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8
Communication Models for Algorithm Design in Networked Sensor Systems
Denver, Colorado
April 04-April 08
ISBN: 0-7695-2312-9
Yang Yu, University of Southern California, Los Angeles
Viktor K. Prasanna, University of Southern California, Los Angeles
Bo Hong, University of Southern California, Los Angeles
Towards building a systematic methodology of algorithm design of applications of networked sensor systems, we formally define two link-wise communication models, the Collision Free Model (CFM) and the Collision Aware Model (CAM). While CFM provides ease of programming and analysis for high level application functionality, CAM enables more accurate performance analysis and hence more efficient algorithms through cross-layer optimization, at the cost of increased programming and analysis complexity. We use the example of optimizing a probability based broadcasting scheme under CAM to illustrate algorithm optimization. Our analytical results indicate that the optimal broadcast probability for either maximizing the reachability within a given latency constraint or minimizing the latency for a given reachability constraint decreases rapidly with node density.
Citation:
Yang Yu, Viktor K. Prasanna, Bo Hong, "Communication Models for Algorithm Design in Networked Sensor Systems," ipdps, vol. 9, pp.207b, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8, 2005
Usage of this product signifies your acceptance of the Terms of Use.