Distance-Sensitive Information Brokerage in Sensor Networks
In a sensor network information from multiple nodes must usually be aggregated in order to accomplish a certain task. A natural way to view this information gathering is in terms of interactions between nodes that are producers of information, e.g., those that have collected data, detected events, etc., and nodes that are consumers of information, i.e., nodes that seek data or events of certain types. Our overall goal in this paper is to construct efficient schemes allowing consumer and producer nodes to discover each other so that the desired information can be delivered quickly to those who seek it. Here, efficiency means both limiting the redundancy of where producer information is stored, as well as bounding the consumer query times. We introduce the notion of distance-sensitive information brokerage and provide schemes for efficiently bringing together information producers and consumers at a cost proportional to the separation between them — even though neither the consumers nor the producers know about each other beforehand.
Our brokerage scheme is generic and can be implemented on top of several hierarchical routing schemes that have been proposed in the past, provided that they are augmented with certain key sideway links. For such augmented hierarchical routing schemes we provide a rigorous theoretical performance analysis, which further allows us to prove worst case query times and storage requirements for our information brokerage scheme. Experimental results demonstrate that the practical performance of the proposed approaches far exceeds their theoretical (worst-case) bounds. The presented algorithms rely purely on the topology of the communication graph of the sensor network and do not require any geographic location information.
KeywordsSensor Network Sensor Node Hash Function Data Item Information Server
Unable to display preview. Download preview PDF.
- 3.Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 762–771 (2005) (Society for Industrial and Applied Mathematics)Google Scholar
- 4.Chen, B., Morris, R.: L+: Scalable landmark routing and address lookup for multi-hop wireless networks (March 2002)Google Scholar
- 5.Fang, Q., Gao, J., Guibas, L.J.: Landmark-based information storage and retrieval in sensor networks. In: Proc. of the 25th Conference of the IEEE Communication Society (INFOCOM 2006) (April 2006)Google Scholar
- 6.Fang, Q., Gao, J., Guibas, L.J., Silva, V.d., Zhang, L.: GLIDER: Gradient landmark-based distributed routing for sensor networks. In: 24th Conference of the IEEE Communication Society (INFOCOM) (2005)Google Scholar
- 7.Fung, W.F., Sun, D., Gehrke, J.: COUGAR: The network is the database. In: SIGMOD Conferegnce (2002)Google Scholar
- 8.Gao, J., Guibas, L.J., Hershberger, J., Zhang, L.: Fractionally cascaded information in a sensor network. In: 3rd Int’l. Sympos. Information Processing in Sensor Networks (IPSN), pp. 311–319 (2004)Google Scholar
- 9.Gao, J., Guibas, L.J., Nguyen, A.: Deformable spanners and applications. In: Proc. of the 20th ACM Symposium on Computational Geometry (SoCG 2004), pp. 179–199 (June 2004)Google Scholar
- 10.Greenstein, B., Estrin, D., Govindan, R., Ratnasamy, S., Shenker, S.: DIFS: A distributed index for features in sensor networks. In: 1st IEEE International Workshop on Sensor Network Protocols and Applications Anchorage (2003)Google Scholar
- 11.Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proc. IEEE Symposium on Foundations of Computer Science (2003)Google Scholar
- 15.Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: 6th ACM Int’l. Conf. Mobile Computing and Networking (MobiCom), pp. 243–254 (2000)Google Scholar
- 18.Kulik, J., Heinzelman, W., Balakrishnan, H.: Adaptive Protocols for Information Dissemination in Wireless Sensor Networks. In: 5th ACM MOBICOM, Seattle, WA (August 1999)Google Scholar
- 19.Li, J., Jannotti, J., Couto, D.S.J.D., Karger, D.R., Morris, R.: A scalable location service for geographic ad hoc routing. In: 6th ACM Int’l. Conf. Mobile Computing and Networking (MobiCom), pp. 120–130 (2000)Google Scholar
- 21.Newsome, J., Song, D.: GEM: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In: 1st Int’l Conf. Embedded networked sensor systems, pp. 76–88 (2003)Google Scholar
- 23.Rao, A., Papadimitriou, C., Shenker, S., Stoica, I.: Geographic routing without location information. In: 9th ACM Int’l. Conf. Mobile Computing and Networking (MobiCom), pp. 96–108 (2003)Google Scholar
- 24.Ratnasamy, S., Karp, B., Yin, L., Yu, F., Estrin, D., Govindan, R., Shenker, S.: GHT: A geographic hash table for data-centric storage in sensornets. In: 1st ACM Workshop on Wireless Sensor Networks and Applications, pp. 78–87 (2002)Google Scholar
- 26.Savvides, A., Han, C.-C., Strivastava, M.B.: Dynamic fine-grained localization in ad-hoc networks of sensors. In: 7th ACM Int’l. Conf. Mobile Computing and Networking (MobiCom), pp. 166–179 (2001)Google Scholar
- 28.Tsuchiya, P.F.: The landmark hierarchy: a new hierarchy for routing in very large networks. In: Proceedings on Communications architectures and protocols, pp. 35–42 (1988)Google Scholar
- 29.Zhao, F., Guibas, L.: Wireless Sensor Networks: An Information processing approach. Elsevier/Morgan-Kaufmann, San Francisco (2004)Google Scholar