Publish/subscribe scheme for mobile networks
- 30 October 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
The information dissemination in mobile networks is an important but complex and challenging problem. Designing suitable communication primitives for these systems is critical. One of these primitives is the publish/subscribe paradigm. The publish/subscribe is a strategy to establish communication between the information providers (publishers) and information consumers (subscribers) in a distributed system. Our work focuses on an appropriate distributed infrastructure suitable for a scalable implementation of a publish/subscribe system. We present a formal model which is adapted for the peer-based particular subscription criteria of publish/subscribe systems. Moreover, we propose a general deterministic information diffusion scheme for mobile systems. The three main features of our communication scheme are the following: First, our scheme is well-adapted to scalable systems without compromising any subscription criteria or network reorganization. Second, we maintain the anonymity of the distributed system --- in order to maintain the network structure, we need only local information. Third, our solution is fully decentralized and modular, thus making it appropriate for practical implementations.Keywords
This publication has 18 references indexed in Scilit:
- Deterministic resource discovery in distributed networksPublished by Association for Computing Machinery (ACM) ,2001
- Publish/Subscribe in a mobile enviromentPublished by Association for Computing Machinery (ACM) ,2001
- Leader election algorithms for mobile ad hoc networksPublished by Association for Computing Machinery (ACM) ,2000
- Location-aided routing (LAR) in mobile ad hoc networksPublished by Association for Computing Machinery (ACM) ,1998
- Multicluster, mobile, multimedia radio networkWireless Networks, 1995
- A distributed routing algorithm for mobile wireless networksWireless Networks, 1995
- Scheduling broadcasts in multihop radio networksIEEE Transactions on Communications, 1990
- Concurrency in heavily loaded neighborhood-constrained systemsACM Transactions on Programming Languages and Systems, 1989
- The drinking philosophers problemACM Transactions on Programming Languages and Systems, 1984
- Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing TopologyIEEE Transactions on Communications, 1981