(IJCNS) International Journal of Computer and Network Security, 23

Vol. 1, No. 2, November 2009

Hybrid Content Location Failure Tolerant

Protocol for Wireless Ad Hoc Networks
Maher BEN JEMAA
Research unit on Development and Control of Distributed Applications “ReDCAD”

Department of Computer Science and Applied Mathematics, National School of Engineers of Sfax, Tunisia

maher.benjemaa@enis.rnu.tn

Abstract: The current network evolution has permitted the and dynamic deployment of services to provide the
emergence of new providers of services which offer services of flexibility of communication to the user [1].
different types and qualities including not only simple services
like printers but also complex services like real time encoding.
However, to benefit from a network service, the user needs to be
provided with the address of this service. With this evolution
perspective, the static configuration will not be practical
anymore in the case of a high number of diversified services.
Service location protocols try to overcome this drawback by
providing the user with an efficient and flexible access to
services. The location changes and the exhibition of services
have a particular importance in mobile environments like ad
hoc networks. Indeed, ad hoc networks are wireless self-
organizing networks of mobile nodes and require non fixed
Figure 1. Example of an ad hoc network routing
infrastructure. This paper has for purpose the implementation
of a new protocol of location of services HCLFTP (Hybrid
Content location Failure Tolerant Protocol) for ad hoc networks
within the “Network Simulator” environment.

Keywords: services advertisement, service location, mobile ad

hoc networks, hash table.

1. Introduction

For the deployment of an ad hoc network without

infrastructure, we can consider a distributed solution to
enable users to extend their communications beyond the
scope of their radio interface. Each user can relay messages
to ensure that all users can join, regardless of distance,
provided there are enough users on the path. The network is
self-provided and supported by the collaboration of all
participants. Figure 1 shows an example. Here, the
computer A wants to communicate with the computer C. As
they are not in direct communication range, A will send its
message to B (a phone) which will in turn transmit the same
message to C.
While it is easy to understand the mechanism of routers
when there are few objects, how to do when they are
proliferating? How to do, for example in the case presented
in Figure 2 to identify the router to be used in order to
transmit a message from one point to another network?
Moreover, the changing needs of mobile users have led to
the emergence of new challenges. Despite the ad hoc
networks constraints, the evolution of services no longer
allows to have static configurations of services to mobile
devices. Hence, it is needed to design a protocol for locating
Figure 2. A large scale ad hoc network
Mobile ad hoc networks are self organized networks, with
no central control entity and having a dynamic topology
governed by the connection and disconnection of the nodes.
This evolution of networks towards dynamic architectures
and non-centralized, and the development of new types of
services in addition to data exchange have led to several
problems concerning the detection of contents and services
(see Figure 3). Furthermore, in order to access a service, the
user must at least know the network address of the host that
provides this service [5].
With wired communication, the solution is simple to find.
Just have servers that identify the services available. As
these servers are still available, just ask them to get the
address of the host providing the service desired. To provide
a service, it is also easy to publish with one of these servers
to make available to the rest of the network [10]. We show
in Figure 4 the principle of location service with a central
server.
In ad hoc networks, such centralization of data is
inadequate. Indeed, the servers that identify the services
may be inaccessible because of mobility. If we consider that
24
the network is only composed of mobile entities, so small
size, it is unlikely that there is in the network a node with
physical capabilities in terms of memory, energy and
bandwidth for allow it to store all the services available and
meet the requirements of each other network members. It is
therefore suitable to propose methods to distribute
information in the network [2].
Figure 3. Discovery of a printer
Figure 4. Central search
Once the service has been found, it will be used. A new
problem arises when we transit from wired networks to ad
hoc networks. In wired communication, once the connection
is established, it remained valid throughout the phase of
service use. If this is not the case, the network is considered
down. For against, in ad hoc networks, this reliability
situation is no more verified. Indeed, it is not uncommon
that the mobility of nodes leads to the separation of the
network into several disjoint components. While most
routing protocols propose to change the paths when they
become disabled, once two nodes cannot physically join, it is
sometimes too late to try anything. It then becomes
interesting to analyze the state of the network to try to
predict when the nodes will be physically disconnected. If
the event is planned well in advance, it is not later to
respond. This reaction may be of different nature, research
to duplicate the service, look for another node providing an
equivalent service or strengthen the connection. Mobile ad
hoc networks are characterized by the following [3].
- Dynamic topology: The mobile units of the network,
moving free and arbitrary. Hence the network topology may
change at unpredictable moments, with a fast and random.
The links of the topology can be unidirectional or
bidirectional.
- Limited bandwidth: One of the primary features of
wireless communication networks is the use of a shared
communication medium. Such sharing is that the bandwidth
reserved for a host is low.
- Energy constraints: The mobile hosts are powered by
independent power sources such as batteries. The energy
parameter must be taken into account in any control by the
system.
(IJCNS) International Journal of Computer and Network Security,
Vol. 1, No. 2, November 2009
- Limited physical security: The mobile ad hoc networks
are more affected by the security setting, than the
conventional tethered networks. Indeed, the physical
constraints and limitations require reducing the control of
the transferred data.
- Lack of infrastructure: The ad hoc networks differ from
other mobile networks by the lack feature of existing
infrastructure and any kind of centralized administration.
The mobile hosts are responsible for establishing and
maintaining the network connectivity on an ongoing basis.
In an ad hoc network, meet the requirements and demands
of applications or users of many services and contents arises
many challenges, brought about by the distributed aspect
and use of wireless communication interfaces. Get in a
dynamic and decentralized environment, a working
environment with a quality equivalent to that provided by a
wired network is very difficult but not impossible [11]. We
refer in this paper the basic principles of HCLFTP (Hybrid
Content Location Failure Tolerant Protocol) to meet the
following objectives: (i) ensure fault tolerance and improve
the load distribution, (ii ) solving the problem of locating
and routing of data is improved by using a system based on
hash functions for nodes and data, (iii) the data structures
required are small in size and can therefore ensure the
location of a data fast enough, (iv) and finally the system
implements both technical replication to ensure data
persistence as well as mechanisms of caches to improve data
availability [8]. This paper is organized as follows. In
section 2, we present the main methods of locating content.
Section 3 describes the protocol HCLFTP dedicated to
service discovery in ad hoc networks. In section 4, we
present the simulation results of this approach in the
simulation environment "Network simulator” (NS). Finally,
we summarize our contributions and future prospects of our
research work.
2. A survey of content localization protocols
The previous solutions of locating nodes and routing data
are not applicable to a large scale. Indeed, changes in such
systems are numerous and fast: a node may be present in a
system for a period of ten minutes and then disappears. New
solutions are required and necessary to develop new
mechanisms for tracking and routing [4]. Systems-based
content can be classified based on the different techniques of
localization and routing of data.
Figure 5. Search Content
 (IJCNS) International Journal of Computer and Network Security, 25
2.1 Location with centralized directory
In a centralized architecture, a server is limited to direct all
users. Note that there appears hierarchies since several
computers do not have the same role than the others. Each
time a user submits a query, the central server creates a list
of resources matching the query by checking in its database
the resources belonging to users connected to the network.
One of the main advantages of this model is the central
index to locate resources quickly and efficiently [7].
Figure 6. Centralized network
1: the node sends its query to the server.
2: If the server knows the node that can respond to the
query, it sends the address otherwise it requests the nodes
connected.
3: download direct connection between two nodes.
The advantage of this technique lies in the centralized index
of all directories, files or resources shared by the nodes in
the network. In general, the updating of this database is
done in real time, as soon as a new user connects. All users
are required to be connected to the network of the server: the
request reaches therefore all users, making the search more
relevant. The main problem however is that this type of
system allows a single point of entry into the network, and is
not immune from failure server that may block the whole
application.
2.2 Hybrid Location
The hybrid model involves super-nodes. A super-node in
these networks is node that meets several criteria. These
criteria relate to most often: the available bandwidth, CPU
power, availability on the network. With this model, we use
the advantages of both types of networks (centralized and
decentralized). Indeed, its structure reduces the number of
connections on each server, and thus avoids the bandwidth
problems [6].
Figure 7. Hybrid Network
Vol. 1, No. 2, November 2009
The operation of this model is similar to the centralization
model. The user sends a query on the server. The search of
nodes is through all the super-nodes containing all the
users’ data. This solution requires an identification of each
node. It gives a list of nodes hosting service for the query’s
response. Just to connect directly to the corresponding node
and start the resources access. The ring structure of super-
nodes allows for load balancing and dilutes the risk of local
failure and interruption of service. Indeed, if a super-node is
not available, other servers carry out its tasks and this will
be transparent to the user (automatic reconnection to
another server). In connecting the whole nodes to these
rings, we get the simplicity of a centralized system with the
robustness of a decentralized system.
2.3 Location by flooding
As a first step, each node looks for other nodes on the
network to announce its presence. Once integrated into the
network, nodes question each other. These requests will
remain active until the entire network has been covered.
The operating principle is as follows (Figure 8): a node "A",
with a specific software (which shall act as the client and
server at a time), connects to a node "B" also equipped with
this software. Thus "A" announces to “B” that it is "alive".
"B" relays this information to all neighbor nodes: "C", "D",
"E" and "F". The latter relay the information to turn to
connected nodes, and so on with all the nodes on the
network. Once "A" is recognized as "living" with other
members of the network, it can search the content of interest
in the directories or shared resources of other members’
network. The request will be sent to all members of the
network, starting with "B", then all other members. If one
node has the resource, it forwards the information to "A".
The latter can then open a direct connection to that node
and enable the service.
Figure 8. Decentralized network
2.4 Location with distributed hash table
If we exclude the possibility to use services based on
centralized directories or on messages flooding, we must
26 (IJCNS) International Journal of Computer and Network Security,
consider that information about the resources location is
distributed so that each node has to maintain a small
amount of routing information. The search for a resource
runs so incrementally through the transfer hop by hop of the
corresponding request to the nodes which are better
"informed" to respond. The nodes of such a system must
continually adapt to changes in their environment. The
following five ideas describe a set of mechanisms for
locating with distributed hash table [9].
- Identification of nodes and resources: each host is assigned
a numerical identifier calculated based on a hash function
applied to its IP address. Each document or shared resource
is also assigned a numerical identifier (based on a hash
function applied to its content or its name).
- Distribution of nodes responsibilities: when a node is
present in the system, it is assigned the responsibility of
several resources.
- Organization of routing information: for reasons of
scalability, each node must maintain a partial view of the
network topology in which it participates. Thus, each node
knows a subset of nodes in the system.
- Lookup solving: a host must be able to request access to a
document or a shared resource in the system. To do this, it
must know the value of the key corresponding to this
resource. This query is called lookup. The result of a lookup
in the system, for a key k, is a reference to the node
responsible for key k. To resolve a lookup, a host starts by
searching among the hosts it knows, that which has the
most feature to verify the relationship with the key
corresponding to the searched resource. It forwards the
request to this node, which performs the same operation.
The search spread from node to node and ends when it
reaches the host that is actually responsible for the key. The
node issuing the request is then informed of the identity of
the node responsible for the key.
- Management of arrivals and departures of nodes: during
the arrivals and departures of nodes, the system adapts and
reassigns responsibilities of the nodes to remain in a
coherence state. To enter the system, a node only needs to
have access to a node already present.
3. Proposed protocol: HCLFTP
In this section, we present HCLFTP designed specifically for
ad hoc networks. Before describing the basic concepts and
architecture of HCLFTP, we present the assumptions made
about the ad hoc environment considered in the design of
this protocol. The target environment of HCLFTP is a
mobile ad hoc network, dense and scale. Indeed, the nodes
can connect, disconnect, or move in the network at any time.
All nodes know their own location information using GPS
or by using relative coordinate. The objective of HCLFTP is
to provide an effective mechanism for localization of content
for dense large and scale ad hoc networks. To achieve this
objective, several components have been implemented: a
hash function to connect the content identifier to the
corresponding area, a recursive function for the split and
fusion of the network, and a function for dissemination and
localization of content based on geographical properties.
Vol. 1, No. 2, November 2009
3.1 The hash function
The technique of hash table is used both for dissemination
and for the localization of content. When a server wants to
announce data content, it must first use a hash function.
This function will allow the server to determine the set of
nodes where to publish the content. In HCLFTP, the content
is published by a set of nodes which is located in a particular
geographic area of the network. It is assumed that the entire
ad hoc network is divided into n zones, the hash function
will therefore contained a numeric identifier between 0 and
n-1.The content where the hash value is equal to i will be
hosted by nodes located in zone zi. The hash function also
allows the localization of content. Indeed, the request of a
user who is looking for a content, whose hash value is equal
to i will be redirected to the area zi where it will be resolved.
The reason for the dissemination of content in an area, not a
single node, is mainly due to the fact that maintaining a
rigid, predefined structure, between the nodes in a mobile
radio environment, is quite costly in terms of energy and
bandwidth. In addition, routing packets in ad hoc networks
is far less efficient and less robust than in fixed networks,
making adjustments to take into account mobility is more
expensive. This results in degradation of system
performance and limitation of its scalability.
3.2 Function split of the network
The main objective of splitting the network is the
distribution of its load while maintaining the topology of
zones. Indeed, if the number of nodes and contents in an
unstructured area with no central entity to control exceeds a
certain threshold, the localization/publishing costs of
content become too high. Therefore, a zone could be divided
recursively into sub areas to ensure better performance and
achieve a uniform distribution of the load. In HCLFTP, to
measure the load in an area, we rely on the following test.
nh*nch < Th (1)
Where nh is the number of nodes located in the zone h, nch
is the number of content hosted in the same area and Th
means the threshold below which a uniform distribution of
the load is ensured. Indeed, nh*nch represents the cost of
dissemination of nh contents to nch nodes, this distribution is
based on a simple method of flooding. The decomposition of
the network into zones is applied whenever nh*nch exceeds
Th. This recursive decomposition stops once nh* nch
becomes below the threshold Th. The advantage of using a
recursive contents’ dissemination is the uniform distribution
of load in dense and non-uniform networks. Indeed,
choosing an area of a network, which is potentially broken
down into different areas, requires knowledge of local
information concerning the density and the number of
contents to host. Our goal is to use a protocol for content
localization in which the decision is recursively delegated to
appropriate nodes. In the following, we present the
mechanism of the network decomposition in the simplest
case where the topology of the network is uniform and the
hash result is evenly distributed between 0 and n-1. In a first
step, if the inequality nc1 * n1> Th is checked (n1and nc1
mean respectively the number of contents and the number of

nodes in the network), the network is then splitted into n
equal areas. Each zone contains n 1 nodes that should host
n hierarchy of the area. Several approaches use the hash
nc 1 contents. If in a second step, if nc 1*n 1 > Th then
n 2
n will be forwarded. Suppose that the hash value is equal to k,
each area will be divided into n equal area. Another
decomposition is applied in the case where nc 1 * n 1 > Th
4
n be resolved or will be directly forwarded to the next level
and so on. The number of times necessary to distribute the
network load can be easily found by calculating the
minimum number i that satisfies the following relationship.
nc * n 1 1 <Th
2i
n mechanisms of localization and deployment of content are
this means that i satisfies the following relationship.
 
 log nc 1 n 1
* of nodes are involved in the routing and resolution of

 T  announcement messages and requests for localization. Since
i = int  h
+ 1 (3 )
 2 * log n  all nodes are not required to maintain routing information
 
 
In HCLFTP, the decomposition of the network nodes is
delegated to the central region of each zone. We call the
whole central region of nodes that are located a short
distance (d) from the center of gravity of the area. Each
node of the central region maintains an estimate of the
number of nodes and contents within this zone. Thus, it can
assess whether the threshold decomposition of the network
is reached or not. To ensure a recursive decomposition of
the network, the hash function above is extended to the use
of two parameters: the content c and the decomposition level
h. If the network is divided into equal areas, the content c is
hashed with the parameters (c, h = 0) resulting in an ID
number k between 0 and n-1. Thus, the content will be
deployed in the area zk. In order to evenly distribute the load
in the area zk, we divide it into n equivalent areas zk,0 …
zk,n-1. The content C will then be chopped with the
parameters (c, h = 1) to a number j between 0 and n-1, and
must therefore be deployed in the area zk,j. This process
continues until the decision to deploy content in the area zk,j
is taken. The reason for the introduction of a hierarchy level
h in the hash function is to efficiently distribute content in
the case of decomposition of the network. In addition, the
hash of the content just does not allow distribution of
content within the area to a level of decomposition h ≥ 1. In
general, to a level of decomposition h, the content c1 ... ci
combined with h will be chopped at the same identifier zx.
At decomposition h+1, the contents c1 ... ci combined with
h+1 will not necessarily be chopped to the same identifier
zx,y. We can perform so a good distribution of content within
the zone zx.
3.3 Location and dissemination of content
To locate content in a network that is based on HCLFTP, the
user U1 sends its first request under one of the four
geographical directions (north, south, east or west) based on
geographical routing. In a dense network, the request will be
routed by a node which knows the central region of the
network hosting the content. The first node in the central
region, which receives the request, has the responsibility to
(IJCNS) International Journal of Computer and Network Security, 27
Vol. 1, No. 2, November 2009
decide whether the query will be resolved directly in the
current area or if it will be forwarded to the next level of the
functions with parameters like content and the current level
of the hierarchy to determine to which sub-area the query
so the query will be routed to the area zk where the same
methodology will be used. In other words, the request will
and so on, until the content is located. To announce content,
the provider sends a notification message to the network in
the same manner as for localization of content. When the
announcement message finally reached the target area, the
mechanisms of replication of content can be applied within
(2)
this area to improve the availability of content. The
completely decentralized. Moreover, only a limited number
and a comprehensive understanding of the whole network is
not required, HCLFTP can be regarded as scalable for large
ad hoc networks.
3.4 Function merge of the network
The problem that arises during the decomposition of the
network to a uniform distribution of the load is: when and
how to deploy a merge? We note that the main motivation
for the decomposition of the network is to maintain a
reasonable cost for content distribution within an
unstructured area. However, this is possible only in a
hierarchical structure in each zone (recursive division of the
areas), which generates an additional cost of the delivery of
messages to the next sub area. For this reason, we propose to
deploy a merging protocol if the query can be resolved
directly in the zone itself.
Since each node in the central region knows the number of
nodes n and the number of contents nc within the zone, it
can trigger the decomposition of the area only if nc*n> Th.
We also propose that the merging process is triggered only
if nc*n> Th-H (H> 0) to maintain the stability of the
splitting/merging of the network. In addition, each node in
the central region maintains information regarding the cost
of dissemination of content within the zone. Thus, the
merging is to deliver content to the next broken areas and
disseminate the content in the current area. This intrinsic
feature allows the passage from splitting to merging, locally,
and vice versa without any additional cost.
3.5 Designation of an area
Each message of announcement/location must be redirected,
finally, towards the central region of the current area and
must be solved by one of the nodes located in this region.
For this reason, we need a mechanism that allows the
designation of the central area of each zone with a fairly
reasonable cost.
- Election of “corner nodes" for a rectangular network: if
the prior knowledge of the positions of all nodes was
possible, the delimitation of the area could be made simply
by identifying all nodes that are on the perimeter of
28 (IJCNS) International Journal of Computer and Network Security,
Vol. 1, No. 2, November 2009

network. But, having whole knowledge of the positions of In addition, nodes in the central region are also responsible
all nodes in a mobile ad hoc environment is costly and even splitting the area and updating the current level of
impossible. Therefore, a distributed algorithm for the decomposition h. To achieve this, each node in the central
delimitation of the area based on local geographical region periodically sends a message that contains the
positions is developed in HCLFTP. The main idea is to use number of advertisements of contents received.
specific nodes called "corner nodes" to delimitate the areas. Although the number of contents can be easily found within
We assume that all nodes are distributed in a rectangular a zone, the estimated number of nodes within this zone is
region. For a rectangular network, if a node does not receive not quite simple. We can include in the deployment of the
messages from the angles which the direction makes an decomposition of the network cost estimate for the location
angle belonging to the interval 90°±α then the node self of contents which itself depends on the number of nodes.
proclaimed "corner node". The advantage of this algorithm
for electing the "corner node" is that it is based on the 4. Simulation of HCLFTP
position of its direct neighbor’s nodes. Since the geographic
routing is based on this information, the positions of direct We conducted a series of simulation in Network Simulator
neighbors nodes are already available and thus the cost of “NS” by considering two metrics: the number of perimeter
messages generated for the election of the "corner nodes” is nodes elected and the number of confusions. We designate
very low. Following the election of a "corner node", the by the number of confusions the number of perimeter nodes
latter tends to inform all the other "corner nodes" by sending elected but who are not actually located on the perimeter.
a message of "Corner Announcement" to "corner nodes” of We have assumed in the simulations that each content size
the same area. This message is sent in two geographic is 512 bytes.
directions (east/south, west/south, east/north or west/north) These metrics were measured for different values of the
according to its location. If a node “corner node” receives a angle α. Each result presented is an average of results
message of "Corner Announcement ", it checks if the obtained on three different topologies. Nodes are deployed
message contains a new "corner node". If a new “corner randomly in an area of 1000m*1000m. Each simulation
node” is found, it updates the local list of "corner nodes” lasts 10 s. Table 1 shows the results for different network
and sends to its neighbors “corner nodes” a new message of sizes.
“Corner Announcement" which contains a list of all the We found that the number of nodes elected as perimeter
“corner node" whose it has known as well as their positions. nodes exceeds the number of nodes actually in the
After a stabilization period, all the “corner nodes” will be perimeter. The confusion increases with the angle α. Table
identified and their respective coordinates allow estimating 2 shows the change in the ratio between the actual perimeter
the position of the center of gravity of the area. The election nodes (real PN) and the elected perimeter nodes (elected
of the "corner nodes” is periodic due to the mobility of PN) as a function of the angle α.
nodes. Similarly, messages like "Corner Announcement"
will be periodically sent to the neighbors "corner nodes”'. In Table 1. Number of perimeter nodes according to α
HCLFTP, the central region of a zone is defined by its
center of gravity. Each "corner node" has a local list of all Nodes’ α Nodes’ α Nodes’
the other "corner nodes”. Thus, the position of center of Number (degre Number (degre) Number
gravity PCG can be calculated without any further exchange in the ) in the in the
of messages. This position will be then propagated to all network network network
nodes in the area. The propagation of the position of center 100 40 20 60 25
of gravity is performed as follows. Each "corner node" sends
200 40 25 60 30
a message of "Gravity Announcement" containing the
300 40 30 60 70
coordinates of the center of gravity along the perimeter and
400 40 60 60 90
along the diagonals. At each hop, the neighbor node is the
500 40 70 60 110
only node that is supposed to receive this message, but all
600 40 100 60 125
nodes who hear the same message will also be informed of
the coordinates of the center of gravity. However, the 700 40 110 60 140
neighbor node is solely responsible for the delivery of the 800 40 130 60 160
message announcement. Nodes located within a distance 900 40 155 60 180
d≤dh from the center of gravity are considered as belonging 100 80 25 100 30
to the central region of the area, consequently, they are 200 80 35 100 60
responsible for routing requests and advertisements. We 300 80 85 100 120
recall that the messages advertisement/location will be sent 400 80 95 100 150
by the provider/client in one of four geographic directions 500 80 120 100 180
and will be intercepted by one of the nodes that know the 600 80 140 100 220
coordinates of the center of gravity. The messages will be 700 80 156 100 245
forwarded to the center of gravity and will be resolved by the 800 80 180 100 300
first node on the routing path belonging to the central region 900 80 200 100 380
of the zone. The latter will decide whether to forward the 1000 80 260 100 425
message to another level in the area.
 (IJCNS) International Journal of Computer and Network Security, 29
Vol. 1, No. 2, November 2009

Table 2. The ratio real PN/elected PN according to α. [3] G. Zussman, A. Segall, “Energy Efficient routing in ad
hoc disaster recovery networks”, in Proceedings of
Nodes’ α real PN/ α real PN/ IEEE INFOCOM, San Francisco, USA, 2003.
Number (degre) elected (degre) elected PN [4] C. Bettstetter, C. Renner, “a comparison of service
in the PN discovery protocols and implementation of the Service
network Location Protocol”, in Proceedings of EUNICE 2000,
100 40 0,90 60 0,80 Twente, Netherlands, September 2000.
200 40 0,85 60 0,60 [5] S. Cheshire, “DNS-based Service Discovery”, internet-
300 40 0,65 60 0,55 draft, December 2002.
100 80 0,71 100 0,60 [6] J. Govea, M. Barbeau, “Results of comparing bandwidth
200 80 0,65 100 0,50 usage and latency: service location protocol and Jini”,
300 80 0,45 100 0,36 Workshop on Ad Hoc communications, Bonn,
Germany, September 2001.
Furthermore, we found that the answer to a query for [7] A. Rao, C. Papadimitriou, S. Shenker, I. Stoica,
extracting the same content is not always provided by the “geography routing without location information”, in
same node but by one of the nodes in the central region. In Proceedings of the 9th annual international conference
addition, mobility or failure of one of the nodes in the on mobile computing and networking, ACM Press, pp
central region does not cause inaccessibility for the content 96-108, 2003.
because there are multiple nodes in the central region, [8] E. Cohen, S. Shenker, “Replication strategies in
which are able to fulfill the request. However, the response unstructured peer-to-peer networks”, in ACM
time is not always the same for the same request but it SIGCOMM Conference, august 2002.
depends on the current traffic in the network and the [9] T. Hara, Y. Loh, S. Nishio, “Data replication methods
location of the node responding to the request. based on the stability of radio links in ad hoc
networks”, in 14th international workshop on database
and expert systems applications (DEXA’03),
5. Conclusion and future work September 2003.
[10] T. Hara, “Effective replica allocation in ad hoc
The sources of information are now spread across networks.
networks for improving data accessibility”, in
However, access to these sources poses challenges for users
Proceedings of IEEE INFOCOM 2001, pp 1568-1576,
and applications that need it. Even if several solutions are
April 2001.
proposed for access to sources, it still lacks the support of
[11] A. Datta, M. Hauswirth, K; Aberer, “Updates in highly
the dynamism that is essential in mobile environments such
unreliable, replicated peer-to-peer systems”, in 23th
as mobile ad hoc networks. The protocols for service
International conference on distributed computing
discovery mechanisms should provide autonomous
systems (ICDCS), May 2003.
management of mobility and quality of service and fault
tolerance. In this paper, we studied the features of some
localization protocols in dynamic environments. The Author Profile
comparison of these protocols aimed to deduce the ideal
Maher Ben Jemaa received the
mechanism for the discovery of data. From these different Engineering degree from National School
approaches, we presented a new solution for the discovery of of Computer Science in Tunisia in 1989,
services deployed on mobile sources. The protocol is DEA degree in Computer Science from
intended to HCLFTP for location services in a central region University of Nice France in 1989 and the
rather than in one node in mobile networks. It is based on Phd in Computer Science from INSA of
dynamic hash table. The prospects of this work are the Rennes France in 1993. Actually, he is an
evaluation of this protocol on a real platform and explore Associate Professor in Computer Science
the various proposals currently available for descriptions of in National School of Engineers of Sfax.
He is carrying his research in the ReCAD
data sources.
research unit (www.redcad.org). His research topics concern
Mobile communication, routing and fault tolerance in wireless
References networks;

[1] A. Oram. Gnutella, “chapter 8 in Peer-to-Peer:

Harnessing the Power of Disruptive Technologies”,
pages 94–122. O’Reilly, May 2001.
[2] I. Clarke, O. Sandberg, B. Wilez, T.W. Hong, “Freenet :
a distributed anonymous information storage and
retrieval system, Designing privacy enhancing
technologies”, International workshop on design issues
in anonymity and unobservability, Lecture Notes in
Computer Science, pp 46-66, Berkeley, USA, Springer,
July 2000.