G. Oikonomou, I. Phillips, L. Guan, A. Grigg

Final Draft:
© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Abstract:
Over the past years, Mobile ad-hoc networks (MANETs) have attracted a considerable degree of research attention, with service discovery, selection and invocation being among the topics of interest of previous efforts. In this paper we introduce ADDER, a probabilistic, hybrid, directory-less service discovery mechanism. It has been designed for military IPv6-based MANETs but will work in any hybrid wired-wireless deployment. It achieves very low service acquisition time through the exchange of a very small number of short messages. Propagation of service descriptions is based on a distance vector algorithm, achieving loop and starvation freedom through a feasibility condition, which has been adopted from established and well-tested routing protocols. This paper also presents evaluation results, obtained by actual execution of the ADDER daemon on two different test beds. The experiments aim to demonstrate that the mechanism achieves good scalability with increasing number of services and network size.
Reference:
G. Oikonomou, I. Phillips, L. Guan, A. Grigg, "ADDER: Probabilistic, Application Layer Service Discovery for MANETs and Hybrid Wired-Wireless Networks", in Proc. 9th Annual Communication Networks and Services Research Conference (CNSR 2011), Ottawa, Canada, pp. 33-40, 2011
Bibtex Entry:
@INPROCEEDINGS{Oikonomou-2011-1-cnsr,
	author = {George Oikonomou and Iain Phillips and Lin Guan and Alan Grigg},
	title = {{ADDER: Probabilistic, Application Layer Service Discovery for MANETs and Hybrid Wired-Wireless Networks}},
	year = {2011},
	month = May,
	publisher = {ieee},
	pages = {33--40},
	address = {Ottawa, Canada},
	doi = {10.1109/CNSR.2011.14},
	url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5771189},
	booktitle = {{Proc. 9th Annual Communication Networks and Services Research Conference (CNSR 2011)}},
	gsid = {14993301371977503898},
	abstract = {Over the past years, Mobile ad-hoc networks (MANETs) have attracted a considerable degree of research attention, with service discovery, selection and invocation being among the topics of interest of previous efforts. In this paper we introduce ADDER, a probabilistic, hybrid, directory-less service discovery mechanism. It has been designed for military IPv6-based MANETs but will work in any hybrid wired-wireless deployment. It achieves very low service acquisition time through the exchange of a very small number of short messages. Propagation of service descriptions is based on a distance vector algorithm, achieving loop and starvation freedom through a feasibility condition, which has been adopted from established and well-tested routing protocols. This paper also presents evaluation results, obtained by actual execution of the ADDER daemon on two different test beds. The experiments aim to demonstrate that the mechanism achieves good scalability with increasing number of services and network size.}
}
Powered by bibtexbrowser

ADDER: Probabilistic, Application Layer Service Discovery for MANETs and Hybrid Wired-Wireless Networks