Bayesian resource discovery in infrastructure-less networks

Resource discovery is one of the most important infrastructure-level facilities enabling the success of modern ad-hoc mobile communication networks, integrating services and capabilities provided by heterogeneous objects into the Future Internet environment. However, the highly dynamic and infrastructure-less nature of these organizations, where nodes continuously join and leave the network or change their attachment connections by moving between different coverage areas, makes resource discovery an extremely challenging tasks. In lack of specific knowledge about the availability of resources and their location over the network, flooding-based or pure probabilistic exploration approaches are the only feasible options to support search/discovery operations. By considering the high communication cost and the incomplete coverage problems respectively characterizing the aforementioned approaches we propose a novel adaptive random-walk search strategy, for resource discovery in ad-hoc networks, structured according to a selective stochastic query/response scheme where the exploration process is driven by posterior probability, using Bayesian inference and relying on the history of past discovery operations. This strategy, by also taking advantage of the scale-free properties characterizing the aforementioned ad-hoc organizations, is able to significantly contain the broadcast traffic without compromising the overall success of search operations by seamlessly accommodating to dynamic changes in resource location and network topology.

[1]  David Ndzi,et al.  A new RREQ message forwarding technique based on Bayesian probability theory , 2012, EURASIP J. Wirel. Commun. Netw..

[2]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[3]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[4]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[5]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[6]  Bo Yang,et al.  Content-aware search of multimedia data in ad hoc networks , 2005, MSWiM '05.

[7]  Salil S. Kanhere,et al.  A Bayesian Routing Framework for Delay Tolerant Networks , 2010, 2010 IEEE Wireless Communication and Networking Conference.

[8]  Anne-Marie Kermarrec,et al.  SOLIST or How to Look for a Needle in a Haystack? A Lightweight Multi-overlay Structure for Wireless Sensor Networks , 2008, 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications.

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

[10]  Geoff Coulson,et al.  Free Riding on Gnutella Revisited: The Bell Tolls? , 2005, IEEE Distributed Syst. Online.

[11]  Chittaranjan Hota,et al.  An efficient on-demand routing protocol for MANETs using Bayesian approach , 2011, 2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011).

[12]  Vwani P. Roychowdhury,et al.  Percolation search in power law networks: making unstructured peer-to-peer networks scalable , 2004 .

[13]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[14]  John S. Heidemann,et al.  BARD: Bayesian-assisted resource discovery in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

[16]  Peter B. Danzig,et al.  Scalable Internet resource discovery: research problems and approaches , 1994, CACM.

[17]  Farnoush Banaei Kashani,et al.  Criticality-based analysis and design of unstructured peer-to-peer networks as "Complex systems" , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[18]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[19]  Roberto Beraldi,et al.  A Survey of Service Discovery Protocols in Multihop Mobile Ad Hoc Networks , 2009, IEEE Pervasive Computing.

[20]  Per Bak,et al.  How Nature Works: The Science of Self‐Organized Criticality , 1997 .

[21]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[22]  D. Sornette,et al.  Stretched exponential distributions in nature and economy: “fat tails” with characteristic scales , 1998, cond-mat/9801293.

[23]  Lionel M. Ni,et al.  Service discovery in pervasive computing environments , 2005, IEEE Pervasive Computing.

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

[25]  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).

[26]  Mor Harchol-Balter,et al.  Resource discovery in distributed networks , 1999, PODC '99.

[27]  Francesco Palmieri,et al.  Scalable service discovery in ubiquitous and pervasive computing architectures: A percolation-driven approach , 2013, Future Gener. Comput. Syst..

[28]  Athanasios V. Vasilakos,et al.  PIVOT: An adaptive information discovery framework for computational grids , 2010, Inf. Sci..

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

[30]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[31]  P. Oscar Boykin,et al.  Scalable percolation search on complex networks , 2006, Theor. Comput. Sci..

[32]  Ahmed Helmy Efficient Resource Discovery in Wireless AdHoc Networks: Contacts Do Help , 2005 .

[33]  Naixue Xiong,et al.  Location-aware private service discovery in pervasive computing environment , 2013, Inf. Sci..

[34]  Aura Ganz,et al.  On resource discovery in distributed systems with mobile hosts , 1996, MobiCom '96.

[35]  Neelakantan Pattathil Chandrasekharamenon,et al.  Connectivity analysis of one-dimensional vehicular ad hoc networks in fading channels , 2012 .