Abstract
In this paper, we proposed an efficient service discovery protocol; reply info caching enhanced flexible forward probability service discovery protocol (RICFFP). RICFFP is based on the concept of flexible forward probability (FFP) and reply info caching (RIC). According to FFP scheme, if a node that receives a service request does not have a matched service, it will forward the request with a variable probability less than 100%. Moreover, the forward probability decreases linearly as the service request forwarded further. By selecting a proper forward probability, the overhead of RICFFP can be greatly decreased at the expense of slight degradation in its performance. To improve RICFFP's performance further, RIC is introduced. According to RIC, each node can cache the service information in a received reply packet. With the help of RIC, packets sent by all the nodes will be decreased further. The simulation using OPNET proves the efficiency of RICFFP. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Gao, Z. G., Yang, X. Z., Ma, T. Y., & Cai, S. B. (2004). RICFFP: An efficient service discovery protocol for MANETs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3207, 786–795. https://doi.org/10.1007/978-3-540-30121-9_75
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
