Scalable Resource Discovery Architecture for Large Scale MANETs

The study conducted a primary investigation into using the Gray cube structure, clustering and Distributed Hash Tables (DHTs) to build an efficient virtual network backbone for Resource Discovery (RD) tasks in large scale Mobile Ad hoc NET works (MANETs). MANET is an autonomous system of mobile nodes characterized by wireless links. One of the major challenges in MANET is RD protocols responsible for advertising and searching network services. We propose an efficient and scalable RD architecture to meet the challenging requirements of reliable, scalable and power-efficient RD protocol suitable for MANETs with potentially thousands of wireless mobile devices. Our RD is based on virtual network backbone created by dividing the network into several non overlapping localities using multi-hop clustering. In every locality we build a Gray cube with locally adapted dimension. All the Gray cubes are connected through gateways and access points to form virtual backbone used as substrate for DHT operations to distribute, register and locate network resources efficiently. The Gray cube is characterized by low network diameter, low average distance and strong connectivity. We evaluated the proposed RD performance and compared it to some of the well known RD schemes in the literature based on modeling and simulation. The results show the superiority of the proposed RD in terms of delay, load balancing, overloading avoidance, scalability and fault-tolerance.

[1]  Liang Cheng,et al.  Service Advertisement and Discovery in Mobile Ad hoc Networks , 2002 .

[2]  Stephan Olariu,et al.  A unifying look at clustering in mobile ad hoc networks , 2004, Wirel. Commun. Mob. Comput..

[3]  Michalis Faloutsos,et al.  Scalable ad hoc routing: the case for dynamic addressing , 2004, IEEE INFOCOM 2004.

[4]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[5]  Erik Guttman,et al.  Service Location Protocol: Automatic Discovery of IP Network Services , 1999, IEEE Internet Comput..

[6]  Bo-Yi Li,et al.  Hypercube-based Data Gathering in Wireless Sensor Networks , 2007, J. Inf. Sci. Eng..

[7]  Stefan Schmid,et al.  eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[8]  Hamamache Kheddouci,et al.  A Resource Discovery Scheme for Large Scale Ad Hoc Networks Using a Hypercube-Based Backbone , 2009, 2009 International Conference on Advanced Information Networking and Applications.

[9]  Françoise Sailhan,et al.  Scalable Service Discovery for MANET , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[10]  Wei Peng,et al.  On the reduction of broadcast redundancy in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[11]  Tracy Camp,et al.  Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.

[12]  R. Manoharan,et al.  Hypercube based Team Multicast Routing Protocol for Mobile Ad hoc Networks , 2006, 9th International Conference on Information Technology (ICIT'06).

[13]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[14]  Jim Waldo,et al.  The Jini Specification , 1999 .

[15]  Abdullah Al-Dhelaan,et al.  An adaptive clustering-based resource discovery scheme for large scale MANETs , 2012 .

[16]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  Janne Riihijärvi,et al.  A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks , 2008, Comput. Networks.

[18]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[19]  Christian Bettstetter,et al.  A COMPARISON OF SERVICE DISCOVERY PROTOCOLS AND IMPLEMENTATION OF THE SERVICE LOCATION PROTOCOL , 2000 .

[20]  Abdullah Al-Dhelaan,et al.  New data gathering scheme for large scale wireless sensor networks , 2011 .

[21]  MADPastry : A DHT Substrate for Practicably Sized MANETs , 2010 .

[22]  Timothy W. Finin,et al.  Toward Distributed service discovery in pervasive computing environments , 2006, IEEE Transactions on Mobile Computing.

[23]  Peter G. Kropf,et al.  HyPeer: Structured overlay with flexible-choice routing , 2011, Comput. Networks.

[24]  Wolfgang Nejdl,et al.  HyperCuP - Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks , 2002, AP2PC.

[25]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[26]  Leandros Tassiulas,et al.  Network layer support for service discovery in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[27]  Artur Olszak,et al.  HyCube: A DHT Routing System Based on a Hierarchical Hypercube Geometry , 2009, PPAM.

[28]  Marcelo Dias de Amorim,et al.  DHT-based functionalities using hypercubes , 2006 .