Building Efficient Wireless Sensor Networks with Low-Level Naming Presented by Ke Liu CS552, Fall 2002 Binghamton University J. Heidemann, F. Silva, C. Intanagonwiwat R. Govindan, D. Estrin, D. Ganesan

Wireless Sensor Network Features –Related low bandwidth –Limited power supply –Communication is much more expensive than Computation –May mobile sensor nodes Problems –Existing network model assumes high power and high bandwidth –Layered naming

New Approach To build distributed systems around attribute- named data & in-network processing –Using attributes with external to the network topology and relevant to the application Example: The geographic information The type of sensor nodes (e.g. computation capability) –Low-level communication is based on these attributes

Architecture Directed Diffusion –To disseminate information Matching Rules –To determinate when to process data Filter –To process data based on specific application (especially about data aggregation)

Directed Diffusion Goal : –to establish efficient n-way communication between one or more sources and sinks An example

Step 1

Step 2

Step 3

Directed Diffusion Features Data-Centric Hop-by-Hop Communication (not End-to-End) No need for global unique address Coordinated Sensing close to the sensed phenomena It is a general approach

Attribute Tuples Diffusion message and Application Interests are composed of Attribute-value-operation tuples Attribute-value-operation Tuples –Unique Keys from the Central Authority –In some data format Compare the diffusion message and interests –Binary comparison operation for every field of the tuples

Matching Rules Only each field of the Diffusion message tuple equals to that of the interests == Matching Easy implementation Example: detection of an animal in a particular region specified by a rectangle Application may use only a subset of these method: –Omitting geographic constraints –Using a single attribute

Filter Mechanism for allowing application-specific code to run in the network and assist diffusion and processing Typically used for in-network aggregation In-network data aggregation –Energy efficiency –No layered naming binding –Network auto-organization –Not resolved yet

Conclusion Avoid multiple levels of name binding Enable in-network processing May enable in-network data aggregation Others

Most important references W. Adjie-Winoto, E. Schwartz, H. Balakrishnan, and J. Lilley. The design and implementation of an intentional naming system. In Proceedings of the 17th Symposium on Operating Systems Principles, pages 186–201, Kiawah Island, SC, USA, Dec ACM W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy- efficient communication protocols for wireless microsensor networks. In Proceedings of the Hawaii International Conference on Systems Sciences, Jan Y. Yu, D. Estrin, and R. Govindan. Geographical and energy-aware routing for wireless sensor networks: A recursive data dissemination protocol. Work in Progress, Mar

Thank You ! Any Questions