000085817 001__ 85817
000085817 005__ 20190812204928.0
000085817 037__ $$aCONF
000085817 245__ $$aFrugal Event Dissemination in a Mobile Environment
000085817 269__ $$a2005
000085817 260__ $$c2005
000085817 336__ $$aConference Papers
000085817 520__ $$aThis 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.
000085817 6531_ $$aNCCR-MICS
000085817 6531_ $$aNCCR-MICS/CL4
000085817 700__ $$aBaehni, Sébastien
000085817 700__ $$aChhabra, Chirdeep Singh
000085817 700__ $$g105326$$aGuerraoui, Rachid$$0240335
000085817 7112_ $$d November 28 - December 2$$cGrenoble$$aMiddleware
000085817 773__ $$tACM/IFIP/USENIX 6th International Middleware Conference$$q205-224
000085817 8564_ $$zn/a$$uhttps://infoscience.epfl.ch/record/85817/files/middleware2005.pdf$$s165352
000085817 909C0 $$xU10407$$pDCL$$0252114
000085817 909CO $$ooai:infoscience.tind.io:85817$$qGLOBAL_SET$$pconf$$pIC
000085817 937__ $$aLPD-CONF-2006-034
000085817 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000085817 980__ $$aCONF