Fiche de lecture

Key-words :
Service discovery, Architecture, Pervasive Computing, MANET, OWL, Semantic Description, Peer-to-Peer,
Advertisements.

Lector : Pierre-Yves DAVID

Diffusion : Département INFORMATIQUE

INSTITUT NATIONAL DES SCIENCES APPLIQUEES DE LYON

Document :
• Type : <revue> paper.
• Title : “Network Layer Support for Service Discovery in Mobile Ad Hoc Networks
• Authors : Ulas¸ C. Kozat and Leandros Tassiulas
• Published by: IEEE Conference on Computer Communications 2003. InfoCom 2003
• Source: IEEE

Summary :
This paper describe and experiment distributed service discovery based on super node forming a backbone to

Introduction

Flexibility and minimum user intervention are essential for future communication networks which are to
be easily deployed and reconfigured automatically

Heterogeneity makes it attractive to establish an ad hoc network.

The dynamic nature implies that

1. Nodes are free to move,
2. The adverse conditions of the wireless medium,
3. Node failures may occur,
4. Nodes may frequently join or leave the network.

Except for Bluetooth’s SDP, none of the proposals for service discovery directly targets an all wireless
network.

Two paradigms for service discovery:

1. Client — Server
2. Client — Directory — Server

The directory-less architecture is more suited to a MANET scenario [6], because there is no need for any
infrastructure. But valid infrastructure can be raised from MaNet assigning dynamically broker role to a
subset of node.
There are two very important motivation points that support the use of a directory system.

1.Directory efficiency :
• Scalability
• Response time
• Prevent server flood
• Load balancing
2. Efficient network usage without redundancy.

2. Over View

In salutation Directory Agents are specialized node and therefor need a specific infrastructure.

But any capable enough node could be a DA.

When no direct link is available between DA, a specific routing mechanism is required to
prevent broadcasting.

All index must be available to any client.

The proposed algorithms satisfy both lack of infrastructure and efficient dissemination of
service discovery message.

3. Network Model

All the nodes in the network have an omni-directional antenna and have the same transmission power. All
links are bi-directional. Nodes share the same commucation channel.

Color convention is used for determining the roles of each node in the network.
Black : SBNs
Green : Virtual backbone
White : Normal nodes

4. Solution

Back Bone Management

The goal of the BBM algorithm is to obtain a small size and relatively stable backbone.

All the components rely on periodically broadcasted hello beacons to create a neighborhood
information table (NIT). Stable enough, higher degrees nodes are then promoted to black
node. Black node vinicity are promoted to green to create a cluster. cluster communicate to each
other via those green node to build routing information. As node move, cluster may merge or split.
 White node are alway at least one hop away from a black node and one hop away of a green one. White
node have alway an entry point to the Back Bone.

Request Distribution

Server register they service to they nextest black node(directory agent) using they entry point.
The lease must be periodicly renewed. Registration might be transmitted to othe black node to improve
reachability. Service request are broadcasted to all black node.

To prevent too much bandwidth usage, multicast tree algorithm is used. This tree is dynamically update
from message following an algorythms guarantees a multicast tree after a convergence time given that
topology changes slower than the convergence time. The multicast tree ensure a message are sent only
once to a single black node but limit load balancing of the bandwidth (which stay for each node under the
broadcast load).

4. Simulation

There is 3 performance metric:

• Control message overhead
• Hit Ratio
• Average time delay

Four different service discovery mechanisme is simulated The article proposal (DSDP) and three other
directory less algorythms :
• On demande multicast routing protocol ODMRP
• Anycast DSR
• Anycast AODV

DSDP overhead high but not as sensitive as other protocols against mobility, number of servers or number
of clients.

Delay performance of DSDP isc onsistently better than other choices.

5. Conclusion

Since no cost of selecting and maintaining DAs are involved, a directory-less architecture would be the
least expensive and easiest to implement in a mobile ad hoc network. This view does not take into
account the operational costs of the lower layer support required for such an implementation.

Results also reveal that directory architecture supported by a virtual backbone structure can perform quite
well under various mobility conditions in addition to its inherent advantages, e.g. resource allocation, load
balancing, localization,etc.
This paper do not investigated the effects of several load balancing and resource allocation techniques on
the loads of the servers and on the system performance, e.g. delay and throughput, when a directory
architecture is utilized.

Interest of this document for the study :

This document describe yet another service discovery architecture based on service index.
Interesting point is the auto-promoted nature of this index to improve communication efficiency between
index.