|
Published Articles >> Table of Contents >> Abstract
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 12
p. 221a
TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks
Santashil PalChaudhuri, Rice University
Shu Du, Rice University
Amit K. Saha, Rice University
David B. Johnson, Rice University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303258
Send link to a friend
| Abstract |
|
Recent advances in technology have made low-cost, low-power wireless sensors a reality. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain phenomena. In this paper, we propose an architecture to provide a stateless solution in sensor networks for efficient addressing and routing. We name our architecture TreeCast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. Next, we use this address allocation method for scoped addressing, through which sensor nodes of a particular type or in a particular region can be targeted. Evaluation of our protocol using ns-2 simulations shows how well our addressing and routing schemes perform.
|
 Additional Information
|
Index Terms- Sensor network, System design, Simulation
Citation:
Santashil PalChaudhuri, Shu Du, Amit K. Saha, David B. Johnson,
"TreeCast: A Stateless Addressing and Routing Architecture for Sensor Networks,"
ipdps,
p. 221a,
18th International Parallel and Distributed Processing Symposium (IPDPS'04) - Workshop 12,
2004
|
|
