Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belding-Royer, E.M.: Multi-level hierarchies for scalable ad hoc routing. Wireless Networks 9(5), 461–478 (2003)
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. wireless networks 7(6), 609–616 (2001)
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)
Chen, B., Morris, R.: L+: Scalable landmark routing and address lookup for multi-hop wireless networks (March 2002)
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)
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)
Fung, W.F., Sun, D., Gehrke, J.: COUGAR: The network is the database. In: SIGMOD Conferegnce (2002)
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)
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)
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)
Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proc. IEEE Symposium on Foundations of Computer Science (2003)
Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 324–338. Springer, Heidelberg (2005)
Huang, Y., Garcia-Molina, H.: Publish/subscribe in a mobile enviroment. In: MobiDe 2001: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access, pp. 27–34. ACM Press, New York (2001)
Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Trans. Netw. 11(1), 2–16 (2003)
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)
Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: PODC 2003: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 63–72. ACM Press, New York (2003)
Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: Proc. Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M), pp. 24–33. ACM Press, New York (2002)
Kulik, J., Heinzelman, W., Balakrishnan, H.: Adaptive Protocols for Information Dissemination in Wireless Sensor Networks. In: 5th ACM MOBICOM, Seattle, WA (August 1999)
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)
Li, X., Kim, Y.J., Govindan, R., Hong, W.: Multi-dimensional range queries in sensor networks. In: SenSys 2003: Proceedings of the 1st international conference on Embedded networked sensor systems, pp. 63–75. ACM Press, New York (2003)
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)
Ramanathan, R., Steenstrup, M.: Hierarhically-organized, multihop mibile wireless networks for quality-of-service support. Mobile Networks and Applications 3(1), 101–119 (1998)
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)
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)
Sadagopan, N., Krishnamachari, B., Helmy, A.: Active query forwarding in sensor networks. Ad Hoc Networks 3(1), 91–113 (2005)
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)
Shenker, S., Ratnasamy, S., Karp, B., Govindan, R., Estrin, D.: Data-centric storage in sensornets. ACM SIGCOMM Computer Communication Review 33(1), 137–142 (2003)
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)
Zhao, F., Guibas, L.: Wireless Sensor Networks: An Information processing approach. Elsevier/Morgan-Kaufmann, San Francisco (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Funke, S., Guibas, L.J., Nguyen, A., Wang, Y. (2006). Distance-Sensitive Information Brokerage in Sensor Networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds) Distributed Computing in Sensor Systems. DCOSS 2006. Lecture Notes in Computer Science, vol 4026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776178_15
Download citation
DOI: https://doi.org/10.1007/11776178_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35227-3
Online ISBN: 978-3-540-35228-0
eBook Packages: Computer ScienceComputer Science (R0)