TY - GEN
T1 - Service discovery mechanism over OLSR for mobile ad-hoc networks
AU - Jodra, Jose Luis
AU - Vara, Maribel
AU - Cabero, Jose Ma
AU - Bagazgoitia, Josu
PY - 2006
Y1 - 2006
N2 - This paper considers the subject of provisioning services in ad-hoc networks. Service discovery in these networks is challenging due to the lack of central infrastructure, limited resources and high mobility. We propose integrating this mechanism on the proactive OLSR (Optimized Link State Routing) protocol. A new message type, called Service Discovery Message (SDM), is added. This message will announce (servers) and request (clients) for services. Available local services will only be advertised once, with a specific lifetime, in order to avoid increasing the network overhead. These services will be stored in a local service cache that is maintained on each node. When a node wants to make use of a service, it will look on the cache. If it is not yet stored, it will send a query message. Simulation results are presented to demonstrate that the introduced packet overhead is insignificant compared with the standard OLSR protocol. These mechanisms must be efficient: every node should know the maximum number of services as possible. In networks with few nodes, the percentage of discovered services is around 90%. On the other hand, in bigger networks, was higher than the 80%. We believe that due to the obtained results, the following step consists on proving the protocol here presented in real scenarios using prototypes.
AB - This paper considers the subject of provisioning services in ad-hoc networks. Service discovery in these networks is challenging due to the lack of central infrastructure, limited resources and high mobility. We propose integrating this mechanism on the proactive OLSR (Optimized Link State Routing) protocol. A new message type, called Service Discovery Message (SDM), is added. This message will announce (servers) and request (clients) for services. Available local services will only be advertised once, with a specific lifetime, in order to avoid increasing the network overhead. These services will be stored in a local service cache that is maintained on each node. When a node wants to make use of a service, it will look on the cache. If it is not yet stored, it will send a query message. Simulation results are presented to demonstrate that the introduced packet overhead is insignificant compared with the standard OLSR protocol. These mechanisms must be efficient: every node should know the maximum number of services as possible. In networks with few nodes, the percentage of discovered services is around 90%. On the other hand, in bigger networks, was higher than the 80%. We believe that due to the obtained results, the following step consists on proving the protocol here presented in real scenarios using prototypes.
KW - Ad-hoc networks
KW - Efficiency
KW - Network overhead
KW - OLSR protocol
KW - Service cache
KW - Service discovery
UR - http://www.scopus.com/inward/record.url?scp=33751084622&partnerID=8YFLogxK
U2 - 10.1109/AINA.2006.305
DO - 10.1109/AINA.2006.305
M3 - Conference contribution
AN - SCOPUS:33751084622
SN - 0769524664
SN - 9780769524665
T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA
SP - 534
EP - 539
BT - Proceedings - 20th International Conference on Advanced Information Networking and Applications
T2 - 20th International Conference on Advanced Information Networking and Applications
Y2 - 18 April 2006 through 20 April 2006
ER -