Abstract
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.
Chapter PDF
Similar content being viewed by others
References
European Telecommunications Standards Institute (ETSI), Reconfigurable Radio Systems (RRS), “Summary of feasibility studies and potential standardization topics”, TR 102.838, V.1.1.1 (October 2009)
Vishnumurthy, V., Francis, P.: On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks. In: INFOCOM 2006, 25th IEEE International Conference on Computer Communications (2006)
Rong, B., Hafid, A.: A Distributed Relay Selection Algorithm for Cooperative Multicast in Wireless Mesh Networks. In: 5th International Conference on Mobile Ad-hoc and Sensor Networks, Fujian (2009)
Bouabdallah, F., Bouabdallah, N.: The tradeoff between maximizing the sensor network lifetime and the fastest way to report reliably an event using reporting nodes’ selection. Computer Communications 31, 1763–1776 (2008)
Verma, A., Sawant, H., Tan, J.: Selection and navigation of mobile sensor nodes using a sensor network. Pervasive and Mobile Computing 2, 65–84 (2006)
Chen, H., Wu, H., Tzeng, N.: Grid-based Approach for Working Node Selection in Wireless Sensor Networks. In: IEEE International Conference on Communication (2004)
Han, S., Xia, Y.: Optimal node-selection algorithm for parallel download in overlay content-distribution networks. Computer Networks 53, 1480–1496 (2009)
Akyildiz, I., Wang, X., Wang, W.: Wireless mesh networks: a survey. Computer Networks 47, 445–487 (2005)
Akyildiz, I., Lee, W., Chowdhury, K.: CRAHNs: Cognitive radio ad hoc networks. Ad Hoc Networks 7, 810–836 (2009)
Lim, L.K., Gao, J., Eugene, T.S., Chandra, P., Steenkiste, P., Zhang, H.: Customizable virtual private network service with QoS. Computer Networks 36, 137–151 (2009)
Rossberg, M., Schaefer, G.: A survey on automatic configuration of virtual private networks. Computer Networks (2011)
Houidi, I., Louati, W., Ameur, W., Zeghlache, D.: Virtual network provisioning across multiple substrate networks. Computer Networks 55, 1011–1023 (2011)
Saaty, T.L.: The Analytic Hierarchy Process. McGraw-Hill, New York (1980)
Keranen, A., Ott, J., Karkkainen, T.: The ONE Simulator for DTN Protocol Evaluation. In: SIMUTools ’09 2nd International Conference on Simulation Tools and Techniques, Rome (2009)
Keranen, A., Ott, J.: Increasing reality for dtn protocol simulations. Tech. Rep., Helsinki University of Technology, Networking Laboratory (2007), http://www.netlab.tkk.fi/tutkimus/dtn/theone/
IEEE 802.15 WPAN Task Group 1 (TG1), http://www.ieee802.org/15/pub/TG1.html
IEEE 802.11 Wireless Local Area Networks, http://ieee802.org/11/
Spyropoulos, T., Psounis, K., Raghavendra, C.: Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In: ACM SIGCOMM Workshop on Delay-Tolerant Networking, WDTN (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as 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.
The images or other third party material in this chapter are included in the chapter’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2011 The Author(s)
About this paper
Cite this paper
Georgakopoulos, A., Tsagkaris, K., Stavroulaki, V., Demestichas, P. (2011). Efficient Opportunistic Network Creation in the Context of Future Internet. In: Domingue, J., et al. The Future Internet. FIA 2011. Lecture Notes in Computer Science, vol 6656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20898-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-20898-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20897-3
Online ISBN: 978-3-642-20898-0
eBook Packages: Computer ScienceComputer Science (R0)