No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
An Adaptive and Scalable Resource Advertisement and Discovery Strategy for Mobile Ad Hoc Networks
Abstract
Effective resource advertisement and discovery (Ad/D) are particularly important in mobile ad hoc networks (MANETs), due to network dynamics and resource constraints of wireless nodes. In this paper, we propose an adaptive and scalable
resource Ad/D technique for MANETs. Based on a variable zone size, it combines push-based Ad/D with a pull-based Ad/D that uses a modified bordercasting resolution protocol. The scheme avoids redundant flooding and reduces system overhead
by piggybacking resource information on the routing-layer packet, and adapts locally to changing conditions, such as mobility
and popularity levels, in a MANET. Simulation results verify that our scheme can track a changing network environment while reducing the resource Ad/D network overheads, thereby saving resources, decreasing latency and being scalable to large MANETs.
... A MANET has high mobility and its topology changes very frequently, making it too expensive to maintain resource brokers, and a directory-less scheme is more suitable. We use RADIZ [15] as the RLP-M in URECA. RADIZ is an adaptive hybrid resource Ad/D protocol integrated with the IZR routing protocol [41] and is specifically aimed at the MANET environment. ...
... The CAA component operates similarly as shown in Fig.7. Further details of RLP-M are provided elsewhere [15] . The reduced overheads of RLP-M can cover lower power consumption, less congestion, and reduced memory and processing requirements. ...
... URECA includes a resource discovery protocol which is integrated with routing protocol. The effectiveness of integrating discovery and routing protocol is already proved in [15]. Therefore it is meaningless to compare URECA to other resource discovery protocol which is not integrated with routing layer. ...
We describe an effective resource location framework for ubiquitous computing environments populated by a diverse set of networks,
devices, services and computational entities. Our framework provides context adaptation with the aid of a middleware service
to improve the quality of resource location. A resource location protocol suitable to each type of network locates resource
effectively by means of dynamic reconfiguration to the current context. Our framework is also refined by support for interoperability
between different types of resource location protocols occurring across a hybrid ubiquitous network. These characteristics
also reduce the control overhead for resource location, saving resource, decreasing latency and permitting a considerable
degree of scalability.
... In summary, the shortcomings of existing directoryless Ad/D protocols include a poor ability to adapt to dynamic network changes (e.g., mobility and call rate level in the network , popularity level of the services), low efficiency of service discovery algorithms, and dubious scalability. We addressed these problems in earlier work [11]. ...
The characteristics of mobile ad hoc networks (MANETs) require special care in the handling of service advertisement and discovery (Ad/D). In this paper, we propose a noble service Ad/D technique for MANETs. Our scheme avoids redundant flooding and reduces the system overhead by integrating Ad/D with routing layer. It also tracks changing conditions, such as traffic and service popularity levels. Based on a variable zone radius, we have combined push-based Ad/D with a pull-based Ad/D strategy.
The implementation of mobile ad hoc networks (MANETs) is steadily increasing. MANETs are especially popular in locations that lack a fixed communication infrastructure. To achieve zero-configuration MANETs, as well as quick and easy access to network resources, resources must be well managed by the network. This paper proposes a hierarchical service discovery and advertisement protocol (HSDAP) implemented in the routing layer. HSDAP queries services by piggybacking service REQuest (SREQ) packets on routing packets to reduce overhead and energy consumption. We extend the cluster-based routing protocol (CBRP) to improve service management hierarchy. Simulation results show that adding service discovery and advertisement (SDA) functions to CBRP does not significantly affect overhead. SDA overhead, routing overhead, energy consumption, and SDA delay are significantly less than the extended zone routing protocol. Furthermore, SDA hit ratio of the proposed protocol is greater than 86% for various levels of mobility. The proposed HSDAP is robust and scalable.
This document describes the Optimized Link State Routing (OLSR)
protocol for mobile ad hoc networks. The protocol is an optimization
of the classical link state algorithm tailored to the requirements of
a mobile wireless LAN. The key concept used in the protocol is that
of multipoint relays (MPRs). MPRs are selected nodes which forward
broadcast messages during the flooding process. This technique
substantially reduces the message overhead as compared to a classical
flooding mechanism, where every node retransmits each message when it
receives the first copy of the message. In OLSR, link state
information is generated only by nodes elected as MPRs. Thus, a
second optimization is achieved by minimizing the number of control
messages flooded in the network. As a third optimization, an MPR
node may chose to report only links between itself and its MPR
selectors. Hence, as contrary to the classic link state algorithm,
partial link state information is distributed in the network. This
information is then used for route calculation. OLSR provides
optimal routes (in terms of number of hops). The protocol is
particularly suitable for large and dense networks as the technique
of MPRs works well in this context.
This document describes the Optimized Link State Routing (OLSR)
protocol for mobile ad hoc networks. The protocol is an optimization
of the classical link state algorithm tailored to the requirements of
a mobile wireless LAN. The key concept used in the protocol is that
of multipoint relays (MPRs). MPRs are selected nodes which forward
broadcast messages during the flooding process. This technique
substantially reduces the message overhead as compared to a classical
flooding mechanism, where every node retransmits each message when it
receives the first copy of the message. In OLSR, link state
information is generated only by nodes elected as MPRs. Thus, a
second optimization is achieved by minimizing the number of control
messages flooded in the network. As a third optimization, an MPR
node may chose to report only links between itself and its MPR
selectors. Hence, as contrary to the classic link state algorithm,
partial link state information is distributed in the network. This
information is then used for route calculation. OLSR provides
optimal routes (in terms of number of hops). The protocol is
particularly suitable for large and dense networks as the technique
of MPRs works well in this context.
Mobile Ad hoc NETworks (MANETs) conveniently complement infrastructure-based networks, allowing mobile nodes to spontaneously form a network and share their services, including bridging with other networks, either infrastructure-based or ad hoc. However, distributed service provisioning over MANETs requires adequate support for service discovery and invocation, due to the network's dynamics and resource constraints of wireless nodes. While a number of existing service discovery protocols have shown to be effective for the wireless environment, these are mainly aimed at infrastructure-based and/or 1-hop ad hoc wireless networks. Some discovery protocols for MANETs have been proposed over the last couple of years but they induce significant traffic overhead, and are thus primarily suited for small-scale MANETs with few nodes. Building upon the evaluation of existing protocols, we introduce a scalable service discovery protocol for MANETs, which is based on the homogeneous and dynamic deployment of cooperating directories within the network. Scalability of our protocol comes from the minimization of the generated traffic, and the use of compact directory summaries that enable to efficiently locate the directory that most likely caches the description of a given service
Service discovery is an integral part of the ad hoc networking to achieve stand-alone and self-configurable communication networks. In this paper, we discuss possible service discovery architectures along with the required network support for their implementation, and we propose a distributed service discovery architecture which relies on a virtual backbone for locating and registering available services within a dynamic network topology. Our proposal consists of two independent components: (i) formation of a virtual backbone and (ii) distribution of service registrations, requests, and replies. The first component creates a mesh structure from a subset of a given network graph that includes the nodes acting as service brokers and a subset of paths (which we refer as virtual links) connecting them. Service broker nodes (SBNs) constitute a dominating set, i.e. all the nodes in the network are either in this set or only one-hop away from at least one member of the set. The second component establishes subtrees rooted at service requesting nodes and registering servers for efficient dissemination of the service discovery probing messages. Extensive simulation results are provided for comparison of performance measures. i.e. latency, success rate, and control message overhead, when different architectures and network support mechanisms are utilized in service discovery.
The zone routing protocol (ZRP) is a hybrid routing protocol that
proactively maintains routes within a local region of the network (which
we refer to as the routing zone). Knowledge of this routing zone
topology is leveraged by the ZRP to improve the efficiency of a reactive
route query/reply mechanism. The ZRP can be configured for a particular
network through adjustment of a single parameter, the routing zone
radius. We address the issue of configuring the ZRP to provide the best
performance for a particular network at any time. Previous work has
demonstrated that an optimally configured ZRP operates at least as
efficiently as traditional reactive flood-search or proactive distance
vector/link state routing protocols (and in many cases, much more
efficiently). Adaptation of the ZIP to changing network conditions
requires both an understanding of how the ZRP reacts to changes in
network behavior and a mechanism to allow individual nodes to identify
these changes given only limited knowledge of the network behavior. We
demonstrate the effects of relative node velocity, node density, network
span, and user data activity on the performance of the ZRP. We then
introduce two different schemes (“min searching” and
“traffic adaptive”) that allow individual nodes to identify
and appropriately react to changes in network configuration, based only
on information derived from the amount of received ZRP traffic. Through
test-bed simulation, we demonstrate that these radius estimation
techniques can allow the ZRP to operate within 2% of the control traffic
resulting from perfect radius estimation
The rapid spreading of mobile computerized devices marks the beginning of a new computing paradigm characterized by ad hoc networking and spontaneous interaction, taking place transparently to the human user. The DEAPspace project described in this paper aims at providing a framework for interconnecting pervasive devices over a wireless medium. It supports the development of new proximity-based collective distributed applications. In this paper we discuss the motivation of the project and describe possible new application scenarios from which requirements for both the supporting framework and the underlying wireless medium are derived. Central research issues such as a new push-model-based approach to fast and resource efficient service discovery, and encoding and match-making of compact service descriptions, are elaborated in more detail. The paper also describes some related work and concludes with a critical review of existing wireless communication technologies, followed by a description of the current state of our project and an outlook on future research directions.
The terms pervasive and ubiquitous computing are used to describe a smart space populated by hundreds of intelligent devices that are embedded in their surroundings. Characteristically, ubiquitous computing devices must blend into the background, unobtrusively collaborating to provide value-added services for users. Services are thus essential to the success of this technology and, as a result, both service discovery and service management will play a vital role in generating the revenue stream that is a prerequisite for sustainable ubiquitous deployment. On the one hand, the services provided should be evident by their richness and variety and on the other, the complexity inherent in the environment must be hidden from users. In this paper, we describe RUBI, a resource discovery framework for ubiquitous computing. RUBI represents a novel approach to resource discovery, because the primacy of the need for adaptive autonomic behaviour is established within its design.
Service discovery is indispensable to ad hoc networking where establishing a stand-alone and self-configurable communication environment is the main objective. In this paper, we first discuss possible service discovery architectures along with the required network support for their implementation in mobile ad hoc networks. We then propose a distributed service discovery architecture that relies on a virtual backbone for locating and registering available services within a dynamic network topology. Our proposal consists of two independent components: (i) formation of a virtual backbone and (ii) distribution of service registrations, requests, and replies. The first component creates a mesh structure from a subset of a given network graph that includes the nodes acting as service brokers and also a subset of paths (which we refer to as virtual links) connecting them. Service broker nodes (SBNs) constitute a dominating set, i.e. all the nodes in the network are either in this set or only one-hop away from at least one member of the set. The second component establishes sub-trees rooted at service requesting nodes and registering servers for efficient dissemination of the service discovery control messages. Extensive simulation results are provided for comparison of performance measures, i.e. latency, success rate, and control message overhead, when different architectures and network support mechanisms are utilized in service discovery.
Service discovery is an important problem in a self-configurable ad hoc network, where each mobile node is required to automatically discover and provide the available network services among themselves. Several protocols have been presented, with a goal of achieving efficient service discovery in mobile ad hoc networks. Basically, we have the same objective of developing an efficient protocol, but with an integrated approach. Our work is motivated by the observation that the current protocols mostly assume the existence of some routing protocols underneath, separated or loosely coupled from the service discovery protocol. We argue that, however, such an assumption clearly causes the problem of "inefficiency" because both protocols are based on a network-wide flooding mechanism, resulting in unnecessarily large number of redundant packet floods. In this paper, we propose a novel approach of integrating these two different but similar discovery protocols for services and routes. Our simulation results show that the proposed integrated scheme, named as HAID (hybrid adaptive protocol for integrated discovery), can reduce network overhead as well as end-to-end delay in mobile ad hoc networking environments.
Service advertisement and discovery are important components for computing in mobile ad hoc network (MANET). In this paper, a lightweight protocol of service advertisement and discovery has been implemented, which is based on a MANET multicast protocol ODMRP (On-Demand Multicast Routing Protocol). In this protocol, service advertisement and discovery information is piggybacked in ODMRP routing control packets. Simulation results of the implementation prove that the implementation workload and resource consumption of the protocol are lightweight.
The proliferation of mobile devices and the pervasiveness of wireless technology have provided a major impetus to replicate the network-based service discovery technologies in wireless and mobile networks. However, existing service discovery protocols and delivery mechanisms fall short of accommodating the complexities of the ad-hoc environment. They also place emphasis on device capabilities as services rather than device independent software services, making them unsuitable for m-commerce oriented scenarios. Konark is a service discovery and delivery protocol designed specifically for ad-hoc, peer-to-peer networks, and targeted towards device independent services in particular. It has two major aspects - service discovery and service delivery. For discovery, Konark uses a completely distributed, peer-to-peer mechanism that provides each device the ability to advertise and discover services in the network. The approach towards service description is XML based. It includes a description template that allows services to be described in a human and software understandable forms. A micro-HTTP server present on each device handles service delivery, which is based on SOAP. Konark provides a framework for connecting isolated services offered by proximal pervasive devices over a wireless medium.
component for ad hoc communications and collaboration in ubiquitous computing environments. In this paper, a lightweight service advertisement and discovery protocol for MANET (Mobile Ad hoc NETworks) based on ODMRP (On-Demand Multicast Routing Protocol) is presented. Its service advertisement and discovery information is piggybacked in ODMRP routing control packets. Thus the implementation workload and resource consumption are lightweight as long as mobile devices in MANET support multicast routing functionality. The protocol avoids excessive traffic overhead of periodic advertisements since only updated service advertisements are distributed and the service query/reply mechanism in the pull model is used. Moreover, the pull model deals with mobility in MANET because the advertised and registered service can be obsolete after a certain period of time due to the mobility of either the server or client devices.
Service discovery in mobile ad hoc networks: An overall perspective on architectural choices and network layer support issues
- U Kozar
- L Tassiulas
The zone routing protocol (ZRP) for ad hoc networks
- Z J Haas
- M R Pearlman
- P Samar
Adaptive resource discovery for ubiquitous computing
- R Harbird
- S Halies
- C Mascolo
The bordercast resolution protocol (BRP) for ad hoc networks
- Z J Haas
- M R Pearlman
- P Samar