Special Issue "Applications in Opportunistic Networking"

A special issue of Information (ISSN 2078-2489). This special issue belongs to the section "Information and Communications Technology".

Deadline for manuscript submissions: closed (30 November 2019).

Special Issue Editors

Dr. Carlos Borrego
E-Mail Website
Guest Editor
Department of Information and Communications Engineering, Autonomous University of Barcelona, Spain
Interests: opportunistic networking; delay and disruption tolerant networks; mobile-code based application-defined routing; applied optimal stopping; applied cryptography
Dr. Sergi Robles
E-Mail Website
Guest Editor
Department of Information and Communications Engineering, Autonomous University of Barcelona, Spain
Interests: opportunistic networking; delay and disruption tolerant networks; dynamic routing and delivery; network security

Special Issue Information

Dear Colleagues,

We are organizing a Special Issue entitled "Applications in Opportunistic Networking" in the journal Information (ISSN 2078-2489, https://www.mdpi.com/journal/information). We think you could make an excellent contribution and we would like to invite you to contribute a paper.

In opportunistic networking, messages are sent to nodes using a direct communication range, which store and carry these messages until there is a new opportunity to forward the messages to other nodes. In the last decade, the scientific community has proven that this paradigm is an excellent alternative to infrastructure-based networks for a different number of scenarios, including sensor networks, the Internet of things, interplanetary networks, submarine networks, or networks where nodes need to maintain the privacy of their whereabouts or the anonymity of their users.

The objective of this Special Issue is to capture the latest advances in this research field. Topics of interest for publication in this Special Issue include, but are not limited to, the following:

  • New applications and scenarios for opportunistic networking
  • Performance evaluation of opportunistic networking
  • Intelligent routing and delivery protocols for opportunistic routing
  • Privacy-preserving opportunistic networking routing mechanisms
  • Efficient broadcasting
  • New delivery mechanisms in opportunistic networking
  • New applications in opportunistic mobile social networks
  • Security, privacy and trust in opportunistic networking

If this topic is of interest, you may send your manuscript now or up until the deadline (30 November 2019). Submitted papers should not be under consideration for publication elsewhere.

Dr. Carlos Borrego
Dr. Sergi Robles
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Information is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1000 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • opportunistic networking
  • challenged-networks
  • partitioned networks
  • delay and disruption tolerant networking

Published Papers (3 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

Open AccessArticle
Opportunistic Multi-Technology Cooperative Scheme and UAV Relaying for Network Disaster Recovery
Information 2020, 11(1), 37; https://doi.org/10.3390/info11010037 - 10 Jan 2020
Abstract
Disaster scenarios are particularly catastrophic in urban environments, which are very densely populated in many cases. Disasters not only endanger the life of people, but also affect the existing communication infrastructures. In fact, such an infrastructure could be completely destroyed or damaged; even [...] Read more.
Disaster scenarios are particularly catastrophic in urban environments, which are very densely populated in many cases. Disasters not only endanger the life of people, but also affect the existing communication infrastructures. In fact, such an infrastructure could be completely destroyed or damaged; even when it continues working, it suffers from high access demand to its limited resources within a short period of time. This work evaluates the performances of smartphones and leverages the ubiquitous presence of mobile devices in urban scenarios to assist search and rescue activities following a disaster. Specifically, it proposes a collaborative protocol that opportunistically organizes mobile devices in multiple tiers by targeting a fair energy consumption in the whole network. Moreover, it introduces a data collection scheme that employs drones to scan the disaster area and to visit mobile devices and collect their data in a short time. Simulation results in realistic settings show that the proposed solution balances the energy consumption in the network by means of efficient drone routes and smart self-organization, thereby effectively assisting search and rescue operations. Full article
(This article belongs to the Special Issue Applications in Opportunistic Networking)
Show Figures

Figure 1

Open AccessArticle
NPLP: An Improved Routing-Forwarding Strategy Utilizing Node Profile and Location Prediction for Opportunistic Networks
Information 2019, 10(10), 306; https://doi.org/10.3390/info10100306 - 29 Sep 2019
Abstract
Opportunistic networks are considered as the promising network structures to implement traditional and typical infrastructure-based communication by enabling smart mobile devices in the networks to contact with each other within a fixed communication area. Because of the intermittent and unstable connections between sources [...] Read more.
Opportunistic networks are considered as the promising network structures to implement traditional and typical infrastructure-based communication by enabling smart mobile devices in the networks to contact with each other within a fixed communication area. Because of the intermittent and unstable connections between sources and destinations, message routing and forwarding in opportunistic networks have become challenging and troublesome problems recently. In this paper, to improve the data dissemination environment, we propose an improved routing-forwarding strategy utilizing node profile and location prediction for opportunistic networks, which mainly includes three continuous phases: the collecting and updating of routing state information, community detection and optimization and node location prediction. Each mobile node in the networks is able to establish a network routing matrix after the entire process of information collecting and updating. Due to the concentrated population in urban areas and relatively few people in remote areas, the distribution of location prediction roughly presents a type of symmetry in opportunistic networks. Afterwards, the community optimization and location prediction mechanisms could be regarded as an significant foundation for data dissemination in the networks. Ultimately, experimental results demonstrate that the proposed algorithm could slightly enhance the delivery ratio and substantially degrade the network overhead and end-to-end delay as compared with the other four routing strategies. Full article
(This article belongs to the Special Issue Applications in Opportunistic Networking)
Show Figures

Figure 1

Open AccessArticle
MSSN: An Attribute-Aware Transmission Algorithm Exploiting Node Similarity for Opportunistic Social Networks
by Mei Guo and Min Xiao
Information 2019, 10(10), 299; https://doi.org/10.3390/info10100299 - 26 Sep 2019
Abstract
Recently, with the development of big data and 5G networks, the number of intelligent mobile devices has increased dramatically, therefore the data that needs to be transmitted and processed in the networks has grown exponentially. It is difficult for the end-to-end communication mechanism [...] Read more.
Recently, with the development of big data and 5G networks, the number of intelligent mobile devices has increased dramatically, therefore the data that needs to be transmitted and processed in the networks has grown exponentially. It is difficult for the end-to-end communication mechanism proposed by traditional routing algorithms to implement the massive data transmission between mobile devices. Consequently, opportunistic social networks propose that the effective data transmission process could be implemented by selecting appropriate relay nodes. At present, most existing routing algorithms find suitable next-hop nodes by comparing the similarity degree between nodes. However, when evaluating the similarity between two mobile nodes, these routing algorithms either consider the mobility similarity between nodes, or only consider the social similarity between nodes. To improve the data dissemination environment, this paper proposes an effective data transmission strategy (MSSN) utilizing mobile and social similarities in opportunistic social networks. In our proposed strategy, we first calculate the mobile similarity between neighbor nodes and destination, set a mobile similarity threshold, and compute the social similarity between the nodes whose mobile similarity is greater than the threshold. The nodes with high mobile similarity degree to the destination node are the reliable relay nodes. After simulation experiments and comparison with other existing opportunistic social networks algorithms, the results show that the delivery ratio in the proposed algorithm is 0.80 on average, the average end-to-end delay is 23.1% lower than the FCNS algorithm (A fuzzy routing-forwarding algorithm exploiting comprehensive node similarity in opportunistic social networks), and the overhead on average is 14.9% lower than the Effective Information Transmission Based on Socialization Nodes (EIMST) algorithm. Full article
(This article belongs to the Special Issue Applications in Opportunistic Networking)
Show Figures

Figure 1

Back to TopTop