[Paper Review] Contact-Based Architecture for Resource Discovery (CARD) in Large Scale MANets

Saurabh Garg, Priyatham Pamu+2 more|ArXiv.org|Aug 16, 2002

Mobile Ad Hoc Networks4 citations

TL;DR

This paper proposes CARD, a contact-based architecture for scalable resource discovery in large-scale mobile ad hoc networks (MANets) with thousands of nodes. By maintaining a proactive neighborhood view and a set of strategic 'contacts' for long-range queries, CARD enables efficient, low-overhead discovery without global flooding or GPS dependency, achieving high reachability with minimal overhead in simulations.

ABSTRACT

In this paper we propose a novel architecture, CARD, for resource discovery in large scale Mobile Ad hoc Networks (MANets) which, may scale up to thousands of nodes and may span wide geographical regions. Unlike previously proposed schemes, our architecture avoids expensive mechanisms such as global flooding as well as complex coordination between nodes to form a hierarchy. CARD is also independent of any external source of information such as GPS. In our architecture nodes within a limited number of hops from each node form the neighborhood of that node. Resources within the neighborhood can be readily accessed with the help of a proactive scheme within the neighborhood. For accessing resources beyond the neighborhood, each node also maintains a few distant nodes called contacts. Contacts help in creating a small world in the network and provide an efficient way to query for resources beyond the neighborhood. As the number of contacts of a node increases, the network view (reachability) of the node increases. Paths to contacts are validated periodically to adapt to mobility. We present mechanisms for contact selection and maintenance that attempt to increase reachability while minimizing overhead. Our simulation results show a clear trade-off between increase in reachability on one hand, and contact selection and maintenance overhead on the other. Our results suggest that CARD can be configured to provide a desirable reachability distribution for different network sizes. Comparisons with other schemes for resource discovery, such as flooding and bordercasting, show our architecture to be much more efficient and scalable.

Motivation & Objective

• To address the scalability limitations of existing resource discovery schemes in large-scale mobile ad hoc networks (MANets).
• To eliminate reliance on global flooding, hierarchical coordination, or external sources like GPS for resource discovery.
• To design a lightweight, decentralized architecture that maintains high network reachability with minimal overhead.
• To enable efficient discovery of resources beyond immediate neighborhood through strategically selected contact nodes.

Proposed method

• Nodes maintain a proactive view of resources within their immediate neighborhood (limited-hop range).
• Each node maintains a set of distant 'contact' nodes to extend reachability beyond the local neighborhood.
• Contacts are selected and maintained to maximize network reachability while minimizing overhead.
• Periodic validation of paths to contacts ensures adaptability to node mobility.
• The architecture uses a small-world-like structure to enable efficient long-range queries.
• Contact selection and maintenance mechanisms are designed to balance reachability and overhead.

Experimental results

Research questions

• RQ1 How can resource discovery in large-scale MANets be made scalable without relying on global flooding or complex coordination?
• RQ2 What is the optimal trade-off between reachability and contact management overhead in mobile networks?
• RQ3 Can a decentralized, GPS-free architecture achieve high reachability with minimal signaling overhead?
• RQ4 How does the number of contacts per node affect network reachability and scalability?
• RQ5 How does CARD compare in efficiency and scalability to traditional schemes like flooding and bordercasting?

Key findings

• CARD achieves significantly higher reachability than flooding and bordercasting with substantially lower overhead.
• The architecture demonstrates a clear trade-off between increased reachability and contact selection/maintenance overhead.
• Simulation results show CARD can be configured to provide a desirable reachability distribution across different network sizes.
• The use of contact nodes enables efficient long-range queries without requiring global knowledge or hierarchical structures.
• Path validation mechanisms ensure adaptability to node mobility while maintaining low signaling overhead.
• CARD outperforms traditional schemes in both efficiency and scalability for large-scale MANets.