Efficient Opportunistic Network Creation in the Context of Future Internet

In the future internet era, mechanisms for extending the coverage of the wireless access infrastructure and service provisioning to locations that cannot be served otherwise or for engineering traffic whenever the infrastructure network is already congested will be required. Opportunistic networks are a promising solution towards this direction. Opportunistic networks are dynamically created, managed and terminated. During the creation phase, nodes that will constitute the opportunistic network needs, are selected and assigned with the proper spectrum and routing patterns. Accordingly, this paper focuses on the opportunistic network creation problem and particularly on the efficient selection of nodes to participate therein. A first step towards the formulation and solution of the opportunistic network creation problem is made, whereas indicative results are also presented in order to obtain some proof of concept for the proposed solution.

[1]  Paul Francis,et al.  On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[3]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[4]  T. Saaty,et al.  The Analytic Hierarchy Process , 1985 .

[5]  Djamal Zeghlache,et al.  Virtual network provisioning across multiple substrate networks , 2011, Comput. Networks.

[6]  Jindong Tan,et al.  Selection and navigation of mobile sensor nodes using a sensor network , 2006, Pervasive Mob. Comput..

[7]  Hongyi Wu,et al.  Grid-based approach for working node selection in wireless sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[8]  Jun Gao,et al.  Customizable virtual private network service with QoS , 2001, Comput. Networks.

[9]  Ian F. Akyildiz,et al.  CRAHNs: Cognitive radio ad hoc networks , 2009, Ad Hoc Networks.

[10]  Abdelhakim Hafid,et al.  A Distributed Relay Selection Algorithm for Cooperative Multicast in Wireless Mesh Networks , 2009, 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks.

[11]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[12]  Günter Schäfer,et al.  A survey on automatic configuration of virtual private networks , 2011, Comput. Networks.

[13]  Fatma Bouabdallah,et al.  The tradeoff between maximizing the sensor network lifetime and the fastest way to report reliably an event using reporting nodes' selection , 2008, Comput. Commun..

[14]  Ye Xia,et al.  Optimal node-selection algorithm for parallel download in overlay content-distribution networks , 2009, Comput. Networks.