A performance study of a service covering protocol in ad hoc networks

With the rising number of Internet services, extensive research on service location protocols is a very important feature for future networks. We discuss the performance of a service covering protocol designed for ad hoc networks. Our on-demand protocol is based on a distributed approach which contributes to traffic overhead optimization.

[1]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Shay Kutten,et al.  Fast distributed construction of k-dominating sets and applications , 1995, PODC '95.

[3]  Ben Y. Zhao,et al.  An architecture for a secure service discovery service , 1999, MobiCom.

[4]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[5]  Imrich Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1994, TNET.