The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
Supporting Disconnectedness-Transparent Information Delivery for Mobile and Invisible Computing
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Epidemic Algorithms for Reliable Content-Based Publish-Subscribe: An Evaluation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Subscription Summarization: A New Paradigm for Efficient Publish/Subscribe Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An Adaptive Approach to Content-Based Subscription in Mobile Ad Hoc Networks
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
A context-aware middleware for applications in mobile Ad Hoc environments
MPAC '04 Proceedings of the 2nd workshop on Middleware for pervasive and ad-hoc computing
Publish/subscribe in a mobile environment
Wireless Networks - Special issue: Pervasive computing and communications
Semi-Probabilistic Content-Based Publish-Subscribe
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
A Context and Content-Based Routing Protocol for Mobile Sensor Networks
EWSN '09 Proceedings of the 6th European Conference on Wireless Sensor Networks
Supporting mobility in content-based publish/subscribe middleware
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Robust and self-repairing formation control for swarms of mobile agents
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
On Event-Based Middleware for Location-Aware Mobile Applications
IEEE Transactions on Software Engineering
Evaluating Implementation Strategies for Location-Based Multicast Addressing
IEEE Transactions on Mobile Computing
Hi-index | 0.00 |
Location-based publish/subscribe - LPS for short - is an important building block for context-aware applications in mobile ad hoc networks (MANETs). In LPS, published messages are routed based on their content as well as on the location of publishers and subscribers. Existing LPS algorithms can be coarsely classified as follows: (1) message-centric approaches consist in broadcasting published messages, (2) query-centric approaches broadcast subscriber queries for subsequently routing messages, and (3) hybrid approaches broadcast queries and messages each within restricted scopes. Each approach is clearly superior to others for particular communication patterns, e.g., for certain ratios between the number of queries and the number of messages in the network. This paper presents an adaptive location-based publish/subscribe (ALPS) algorithm for settings with multiple, unknown, or varying communication patterns. ALPS can be viewed as a parameterized hybrid LPS algorithm that can seamlessly move between message- and query-centricity based on estimations of the current communication pattern. We evaluate ALPS on two benchmark applications namely in the context of mobile social networking and robot swarms. Our results indicate that ALPS reduces the message complexity by up to a factor 3x compared to the best respective alternative, while performing comparably to the respective optimal solutions with static communication patterns, making ALPS appealing as a one-size-fits-all solution.