Connection degree-based message delivery scheme for improving service discovery in mobile ad-hoc networks

Service discovery is an essential protocol in mobile ad-hoc networks as it is used to search for available services. It is becoming an important issue because of node mobility and requirements of low number of messages. This paper proposes a service discovery scheme which combines cooperative service information spreading of adjacent nodes and the higher degree-based search protocol in mobile ad-hoc networks. It proposes an algorithm for selecting adaptive nodes from mobile nodes, which enables search and utilization of up-to-date information in MANET. The proposed method is effective, since it does not require a central lookup server and it does not rely on flooding. The simulation results show that the proposed scheme reduced the total network load and power consumption. Compared to other systems, it significantly reduces the number of messages and the average number of response hops, and thus improves the response time and power consumption.