Abstract

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.

Keywords:

Distributed hash table, gray cube, mobile ad hoc networks, multi-hop clustering, resource discovery,

References

1. Al-Ahmadi, S., A. Al-Dhelaan and N. Al-Hosini, 2011. New data gathering scheme for large scale wireless sensor networks. Proceeding of the 15th WSEAS International Conference on Computers. Corfu, Greece, pp: 111-117.
   
2. Al-Ahmadi, S. and A. Al-Dhelaan, 2012. An adaptive clustering-based resource discovery scheme for large scale MANETs. Proceeding of the 11th WSEAS International Conference on Telecom and Informatics. Saint Malo, France, pp: 88-95.
   
3. Alvarez-Hamelin, J., A. Viana and M. de Amorim, 2006. DHT-based Functionalities using Hypercubes. Ad-Hoc Networking, Springer, US, pp: 157-176.
   
4. Amis, A.D., R. Prakash, T.H.P. Vuong and D.T. Huynh, 2000. Max-mind-cluster formation in wireless ad hoc networks. Proceeding of the 19th Annual Joint Conference of the IEEE Computer and Comm. Societies (INFOCOM 2000), 1: 32-41.
   
5. Arnold, K., R. Scheifler, J. Waldo, B. O'Sullivan and A. Wollrath, 1999. Jini Specification. Addison-Wesley Longman Publishing Co., Inc. Boston, MA, USA.
   
6. Bettstetter, C. and C. Renner, 2000. A comparison of service discovery protocols and implementation of the service location protocol. Proceeding of the 6th EUNICE Open European Summer School: Innovative Internet Applications.
   
7. Chakraborty, D., A. Joshi, Y. Yesha and T. Finin, 2006. Toward distributed service discovery in pervasive computing environments. IEEE T. Mobile Comput., 5(2): 97-112.
   CrossRef    
8. Chuang, P.J., B.Y. Li and T.H. Chao, 2007. Hypercube-based data gathering in wireless sensor networks. J. Inform. Sci. Eng., 23(4): 1155.
   
9. Dekar, L. and H. Kheddouci, 2009. A resource discovery scheme for large scale ad hoc networks using a hypercube-based backbone. Proceeding of the IEEE 23rd International Conference on Advanced Information Networking and Applications. Bradford, UK, pp: 293-300.
   CrossRef    
10. Eriksson, J., M. Faloutsos and S. Krishnamurthy, 2004. Scalable ad hoc routing: The case for dynamic addressing. Proceeding of the 23rd Annual Joint Conference of the IEEE Computer and Comm. Societies (INFOCOM 2004), pp: 1108-1119.
    
11. Guttman, E., 1999. Service location protocol: Automatic discovery of IP network services. IEEE Internet Comput., 3(4): 71-80.
    CrossRef    
12. Kozat, U.C. and L. Tassiulas, 2003. Network layer support for service discovery in mobile ad hoc networks. Proceeding of the 22nd Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies, 3: 1965-1975.
    CrossRef    
13. Locher, T., S. Schmid and R. Wattenhofer, 2006. Equus: A provably robust and locality-aware peer-to-peer system. Proceeding of the 6th IEEE International Conference on Peer-to-Peer Computing, pp: 3-11.
    CrossRef    
14. Manoharan, R. and P. Thambidurai, 2006. Hypercube based team multicast routing protocol for mobile ad hoc networks. Proceeding of the 9th International Conference on Information Technology (ICIT'06), pp: 60-63.
    CrossRef    
15. Meshkova, E., J. Riihijarvi, M. Petrova and P. Mahonen, 2008. A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks. Comput. Netw., 52(11): 2097-2128.
    CrossRef    
16. Oliveira, R., L. Bernardo and P. Pinto, 2005. Flooding techniques for resource discovery on high mobility MANETs. Proceeding of the Workshop on Wireless Ad-hoc Networks.
    
17. Olszak, A., 2010. HyCube: A DHT routing system based on a hierarchical hypercube geometry. Proceeding of the 8th International Conference on Parallel Processing and Applied Mathematics (PPAM'09). Springer-Verlag, Berlin, Heidelberg, pp: 260-269.
    CrossRef    
18. Peng, W. and X.C. Lu, 2000. On the reduction of broadcast redundancy in mobile ad hoc networks. Proceeding of the 1st ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp: 129-130.
    PMid:11051106    
19. Richard III, G.G., 2000. Service advertisement and discovery. IEEE Internet Comput., 4(5): 18-26.
    CrossRef    
20. Rowstron, A. and P. Druschel, 2001. Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (Ed.), Middleware 2001. LNCS Vol. 2218, Springer, Berlin, Heidelberg, pp: 329-350.
    CrossRef    
21. Sailhan, F. and V. Issarny, 2005. Scalable service discovery for MANET. Proceeding of the 3rd IEEE International Conference on Pervasive Computing and Comm. (PerCom 2005), pp: 235-244.
    CrossRef    
22. Salutation Consortium, 1999. Salutation architecture specification. The Salutation Consortium Inc.
    Direct Link
23. Schlosser, M., M. Sintek, S. Decker and W. Nejdl, 2003. Hypercup: Hypercubes, Ontologies and Efficient Search on Peer-to-Peer Networks. Lect. Notes Comput. Sc., Vol. 2530, Springer, Berlin, Heidelberg, pp: 112-124.
    
24. Serbu, S., P. Felber and P. Kropf, 2011. HyPeer: Structured overlay with flexible-choice routing. Comput. Netw., 55(1): 300-313.
    CrossRef    
25. Stoica, I., R. Morris, D. Karger, M.F. Kaashoek and H. Balakrishnan, 2001. Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Comput. Commun. Rev., 31(4): 149-160.
    CrossRef    
26. Wang, L. and S. Olariu, 2004. A unifying look at clustering in mobile ad hoc networks. Wirel. Commun. Mob. Comp., 4(6): 623-637.
    CrossRef    
27. Williams, B. and T. Camp, 2002. Comparison of broadcasting techniques for mobile ad hoc networks. Proceeding of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp: 194-205.
    CrossRef    
28. Zahn, T. and J. Schiller, 2005. MADPastry: A DHT substrate for practicably sized MANETs. Proceedingof the 5th Workshop on Applications and Services in Wireless Networks (ASWN).
    
29. Zhao, B.Y., L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph and J.D. Kubiatowicz, 2004. Tapestry: A resilient global-scale overlay for service deployment. IEEE J. Sel. Area. Comm., 22(1): 41-53.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.