Next Issue
Volume 10, May
Previous Issue
Volume 10, March
 
 

Future Internet, Volume 10, Issue 4 (April 2018) – 5 articles

Cover Story (view full-size image): The web was initially conceived as a mean for humans to share information and resources through linked pages. Now, it is moving to a web of data constituted by interoperable and semantically enriched linked data that can be directly consumed and produced by machines. Detecting and communicating changes in such a wide web of data is a challenging research topic and is also fundamental for the development of dynamic, interoperable, distributed and context-aware services and applications. The SPARQL Event Processing Architecture is an attempt to provide a solution in this context. View this paper.
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
33 pages, 1973 KiB  
Article
Dynamic Linked Data: A SPARQL Event Processing Architecture
by Luca Roffia, Paolo Azzoni, Cristiano Aguzzi, Fabio Viola, Francesco Antoniazzi and Tullio Salmon Cinotti
Future Internet 2018, 10(4), 36; https://doi.org/10.3390/fi10040036 - 20 Apr 2018
Cited by 37 | Viewed by 8267
Abstract
This paper presents a decentralized Web-based architecture designed to support the development of distributed, dynamic, context-aware and interoperable services and applications. The architecture enables the detection and notification of changes over the Web of Data by means of a content-based publish-subscribe mechanism where [...] Read more.
This paper presents a decentralized Web-based architecture designed to support the development of distributed, dynamic, context-aware and interoperable services and applications. The architecture enables the detection and notification of changes over the Web of Data by means of a content-based publish-subscribe mechanism where the W3C SPARQL 1.1 Update and Query languages are fully supported and used respectively by publishers and subscribers. The architecture is built on top of the W3C SPARQL 1.1 Protocol and introduces the SPARQL 1.1 Secure Event protocol and the SPARQL 1.1 Subscribe Language as a means for conveying and expressing subscription requests and notifications. The reference implementation of the architecture offers to developers a design pattern for a modular, scalable and effective application development. Full article
(This article belongs to the Section Big Data and Augmented Intelligence)
Show Figures

Graphical abstract

16 pages, 854 KiB  
Article
Enhanced Matching Game for Decoupled Uplink Downlink Context-Aware Handover
by Asmae Ait Mansour, Nourddine Enneya and Mohamed Ouadou
Future Internet 2018, 10(4), 35; https://doi.org/10.3390/fi10040035 - 15 Apr 2018
Cited by 2 | Viewed by 4511
Abstract
In this paper, we address the problem of cell association during a handover performed in a dense heterogeneous network, where the preference of a mobile user’s equipment in terms of uplink traffic is not the same as for the downlink traffic. Therefore, since [...] Read more.
In this paper, we address the problem of cell association during a handover performed in a dense heterogeneous network, where the preference of a mobile user’s equipment in terms of uplink traffic is not the same as for the downlink traffic. Therefore, since mobility is an intrinsic element of cellular networks, designing a handover from the perspective of the uplink and downlink is mandatory in the context of 5G cellular networks. Based on this arena, we propose a decoupled uplink-downlink handover scheme while making use of femtocells in order to maximize the overall network entity utilities and avoid overloading macrocells. However, the fact that the handover process is performed in a dense heterogeneous network makes the issue NP-hard. Therefore, taking into account the need for self-organizing solutions, we modeled the handover process as a matching game with externalities. Thus, we will provide an aspect of intelligence for the execution of the handover process to mobile user’s equipment (UE). To make the proposition more efficient, we integrate an assignment step to assist the matching game. Hence, the base stations will be investigated and filtered, keeping only the helpful base stations as the players in terms of the quality of service for the uplink and downlink. The numerical results verify the superiority of the proposed context-aware algorithm over traditional downlink handover and traditional decoupled uplink and downlink handover schemes, by improving the load balancing, increasing rates and reducing delays. Full article
Show Figures

Figure 1

14 pages, 6136 KiB  
Article
Replicas Strategy and Cache Optimization of Video Surveillance Systems Based on Cloud Storage
by Rongheng Li, Jian Zhang and Wenfeng Shen
Future Internet 2018, 10(4), 34; https://doi.org/10.3390/fi10040034 - 10 Apr 2018
Cited by 3 | Viewed by 6801
Abstract
With the rapid development of video surveillance technology, especially the popularity of cloud-based video surveillance applications, video data begins to grow explosively. However, in the cloud-based video surveillance system, replicas occupy an amount of storage space. Also, the slow response to video playback [...] Read more.
With the rapid development of video surveillance technology, especially the popularity of cloud-based video surveillance applications, video data begins to grow explosively. However, in the cloud-based video surveillance system, replicas occupy an amount of storage space. Also, the slow response to video playback constrains the performance of the system. In this paper, considering the characteristics of video data comprehensively, we propose a dynamic redundant replicas mechanism based on security levels that can dynamically adjust the number of replicas. Based on the location correlation between cameras, this paper also proposes a data cache strategy to improve the response speed of data reading. Experiments illustrate that: (1) our dynamic redundant replicas mechanism can save storage space while ensuring data security; (2) the cache mechanism can predict the playback behaviors of the users in advance and improve the response speed of data reading according to the location and time correlation of the front-end cameras; and (3) in terms of cloud-based video surveillance, our proposed approaches significantly outperform existing methods. Full article
Show Figures

Figure 1

15 pages, 3877 KiB  
Article
An Intelligent Content Prefix Classification Approach for Quality of Service Optimization in Information-Centric Networking
by Cutifa Safitri, Yoshihide Yamada, Sabariah Baharun, Shidrokh Goudarzi, Quang Ngoc Nguyen, Keping Yu and Takuro Sato
Future Internet 2018, 10(4), 33; https://doi.org/10.3390/fi10040033 - 9 Apr 2018
Cited by 9 | Viewed by 5687
Abstract
This research proposes an intelligent classification framework for quality of service (QoS) performance improvement in information-centric networking (ICN). The proposal works towards keyword classification techniques to obtain the most valuable information via suitable content prefixes in ICN. In this study, we have achieved [...] Read more.
This research proposes an intelligent classification framework for quality of service (QoS) performance improvement in information-centric networking (ICN). The proposal works towards keyword classification techniques to obtain the most valuable information via suitable content prefixes in ICN. In this study, we have achieved the intelligent function using Artificial Intelligence (AI) implementation. Particularly, to find the most suitable and promising intelligent approach for maintaining QoS matrices, we have evaluated various AI algorithms, including evolutionary algorithms (EA), swarm intelligence (SI), and machine learning (ML) by using the cost function to assess their classification performances. With the goal of enabling a complete ICN prefix classification solution, we also propose a hybrid implementation to optimize classification performances by integration of relevant AI algorithms. This hybrid mechanism searches for a final minimum structure to prevent the local optima from happening. By simulation, the evaluation results show that the proposal outperforms EA and ML in terms of network resource utilization and response delay for QoS performance optimization. Full article
Show Figures

Figure 1

20 pages, 4989 KiB  
Article
Development of a Social DTN for Message Communication between SNS Group Members
by Hidenori Takasuka, Koichi Hirai and Kazumasa Takami
Future Internet 2018, 10(4), 32; https://doi.org/10.3390/fi10040032 - 4 Apr 2018
Cited by 1 | Viewed by 4712
Abstract
Smartphones have the ability to communicate with other terminals through ad hoc connections. A variety of applications have been developed to exploit this ability. The authors have developed an Android OS (operating system) application (called “social DTN manager”) that builds a DTN (delay, [...] Read more.
Smartphones have the ability to communicate with other terminals through ad hoc connections. A variety of applications have been developed to exploit this ability. The authors have developed an Android OS (operating system) application (called “social DTN manager”) that builds a DTN (delay, disruption, disconnection tolerant networking) among members of a social networking service (SNS) community using a community token. The members can exchange messages over this network. Control messages for building a DTN are forwarded to only those nodes that use the same community token in order to reduce flooding of message copies. When a source node sends a communication request to its destination node, they exchange control messages to establish a communication route. Relay nodes use these messages to create and hold routing information for these nodes in their routing tables. Thereafter, relay nodes can forward data messages based on their routing tables. This again reduces flooding of message copies. The social DTN manager incorporates these functions, Facebook Graph API and Google Nearby Connections API. The authors have installed it in Android terminals and confirmed that a social DTN can successfully be built using this application and that data messages can be exchanged between terminals via reactive routes. Full article
Show Figures

Figure 1

Previous Issue
Next Issue
Back to TopTop