Abstract
With the increasing complexity of sensor network applications, nodes in a sensor network system usually have to cooperate with each other to complete a task. Sometimes, a node have to cooperate with another which is not predefined or well known, the only condition of its cooperators is that the nodes match a specific condition. The action to find out where these matching nodes are is called “resource discovery”. Resource can be anything a node would like to share – storage, data, devices, etc. Traditionally, we use exact information of resources to determine whether a node matches the condition, but in a wireless sensor network this is very costly since propagating exact resource information consumes lot of power and storage. Instead, we may summarize the information together. Though summarized information is less deterministic, it costs less bandwidth and storage, too. In this thesis, we would like to design a resource discovery algorithm suitable for wireless sensor network environment using a popular resource summary technique called “Bloom filter”, and prove our proposed scheme to be efficient through simulation.