The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Publish/Subscribe in a mobile enviroment
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
COUGAR: the network is the database
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Multi-level hierarchies for scalable ad hoc routing
Wireless Networks
Bounded Geometries, Fractals, and Low-Distortion Embeddings
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Proceedings of the 1st international conference on Embedded networked sensor systems
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Fractionally cascaded information in a sensor network
Proceedings of the 3rd international symposium on Information processing in sensor networks
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed transactional memory for metric-space networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Glance: A lightweight querying service for wireless sensor networks
Theoretical Computer Science
Trail: A distance-sensitive sensor network service for distributed object tracking
ACM Transactions on Sensor Networks (TOSN)
Distributed resource management and matching in sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Predictive QoS routing to mobile sinks in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Double rulings for information brokerage in sensor networks
IEEE/ACM Transactions on Networking (TON)
Trail: a distance sensitive WSN service for distributed object tracking
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
SDIP3: structured and dynamic information push and pull protocols for distributed sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Information brokerage via location-free double rulings
ADHOC-NOW'07 Proceedings of the 6th international conference on Ad-hoc, mobile and wireless networks
GLANCE: a lightweight querying service for wireless sensor networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
A case for hierarchical routing in low-power wireless embedded networks
ACM Transactions on Sensor Networks (TOSN)
Distributed distance sensitive imesh based service discovery in dense WSAN
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Hi-index | 0.00 |
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.