GloMoSim: a library for parallel simulation of large-scale wireless networks
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
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
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Publish/Subscribe in a mobile enviroment
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS
IEEE Transactions on Software Engineering
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Publish/subscribe scheme for mobile networks
Proceedings of the second ACM international workshop on Principles of mobile computing
STEAM: Event-Based Middleware for Wireless Ad Hoc Network
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Publish/Subscribe Tree Construction in Wireless Ad-Hoc Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Looking into the past: enhancing mobile publish/subscribe middleware
Proceedings of the 2nd international workshop on Distributed event-based systems
Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks
WMCSA '04 Proceedings of the Sixth IEEE Workshop on Mobile Computing Systems and Applications
Semi-Probabilistic Content-Based Publish-Subscribe
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
iFlow: Middleware-assisted Rendezvous-based Information Access for Mobile Ad Hoc Applications
Proceedings of the 1st international conference on Mobile systems, applications and services
Design and Evaluation of a Support Service for Mobile, Wireless Publish/Subscribe Applications
IEEE Transactions on Software Engineering
Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network
IEEE Transactions on Computers
Publish/subscribe architecture for mobile ad hoc networks
Proceedings of the 2008 ACM symposium on Applied computing
Epcast: Controlled Dissemination in Human-Based Wireless Networks Using Epidemic Spreading Models
Bio-Inspired Computing and Communication
An innovative architecture for context foraging
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Mobile online gaming via resource sharing
Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe interaction abstraction in mobile ad-hoc networks (MANETs). Our algorithm is frugal in two senses. First, it reduces the total number of duplicates and parasite events received by the subscribers. Second, both the mobility of the publishers and the subscribers, as well as the validity periods of the events, are exploited to achieve a high level of dissemination reliability with a thrifty usage of the memory and bandwidth. Besides, our algorithm is inherently portable and does not assume any underlying routing protocol. We give simulation results of our algorithms in the two most popular mobility models: city section and random waypoint. We highlight interesting empirical lower bounds on the minimal validity period of any given event to ensure its reliable dissemination.