Future Internet

2822 KiB

Open AccessArticle

SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach

by Ahmed Redha Mahlous

Future Internet 2017, 9(4), 95; https://doi.org/10.3390/fi9040095 - 13 Dec 2017

Cited by 2 | Viewed by 5413

Energy-efficient clustering and routing are well known optimization problems in the study of Wireless Sensor Network (WSN) lifetime extension. In this paper, we propose an intelligent hybrid optimization algorithm based on a Set Cover approach to create clusters, and min-cost max-flow for routing [...] Read more.

Energy-efficient clustering and routing are well known optimization problems in the study of Wireless Sensor Network (WSN) lifetime extension. In this paper, we propose an intelligent hybrid optimization algorithm based on a Set Cover approach to create clusters, and min-cost max-flow for routing (SCMC) to increase the lifetime of WSNs. In our method we used linear programming (LP) to model the WSN optimization problem. This model considers minimizing the energy for all nodes in each set cover (cluster), and then minimizing the routing energy between the nodes and the base station through intermediate nodes, namely cluster heads. To evaluate the performance of our scheme, extensive simulations were conducted with different scenarios. The results show that the set cover approach combined with the min-cost max-flow algorithm reduces energy consumption and increases the network’s lifetime and throughput. Full article

► Show Figures

Figure 1

2403 KiB

Open AccessFeature PaperArticle

Approximate Networking for Universal Internet Access

by Junaid Qadir, Arjuna Sathiaseelan, Umar Bin Farooq, Muhammad Usama, Muhammad Ali Imran and Muhammad Shafique

Future Internet 2017, 9(4), 94; https://doi.org/10.3390/fi9040094 - 11 Dec 2017

Cited by 2 | Viewed by 8187

Abstract

Despite the best efforts of networking researchers and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost-efficient ways of provisioning high-performance, global Internet. In this paper, we argue that [...] Read more.

Despite the best efforts of networking researchers and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost-efficient ways of provisioning high-performance, global Internet. In this paper, we argue that instead of an exclusive focus on a utopian goal of universally accessible “ideal networking” (in which we have a high throughput and quality of service as well as low latency and congestion), we should consider providing “approximate networking” through the adoption of context-appropriate trade-offs. In this regard, we propose to leverage the advances in the emerging trend of “approximate computing” that rely on relaxing the bounds of precise/exact computing to provide new opportunities for improving the area, power, and performance efficiency of systems by orders of magnitude by embracing output errors in resilient applications. Furthermore, we propose to extend the dimensions of approximate computing towards various knobs available at network layers. Approximate networking can be used to provision “Global Access to the Internet for All” (GAIA) in a pragmatically tiered fashion, in which different users around the world are provided a different context-appropriate (but still contextually functional) Internet experience. Full article

(This article belongs to the Special Issue Communications and Computing for Sustainable Development Goals)

► Show Figures

Figure 1

1975 KiB

Open AccessFeature PaperArticle

How 5G Wireless (and Concomitant Technologies) Will Revolutionize Healthcare?

by Siddique Latif, Junaid Qadir, Shahzad Farooq and Muhammad Ali Imran

Future Internet 2017, 9(4), 93; https://doi.org/10.3390/fi9040093 - 11 Dec 2017

Cited by 137 | Viewed by 22942

Abstract

The need to have equitable access to quality healthcare is enshrined in the United Nations (UN) Sustainable Development Goals (SDGs), which defines the developmental agenda of the UN for the next 15 years. In particular, the third SDG focuses on the need to [...] Read more.

The need to have equitable access to quality healthcare is enshrined in the United Nations (UN) Sustainable Development Goals (SDGs), which defines the developmental agenda of the UN for the next 15 years. In particular, the third SDG focuses on the need to “ensure healthy lives and promote well-being for all at all ages”. In this paper, we build the case that 5G wireless technology, along with concomitant emerging technologies (such as IoT, big data, artificial intelligence and machine learning), will transform global healthcare systems in the near future. Our optimism around 5G-enabled healthcare stems from a confluence of significant technical pushes that are already at play: apart from the availability of high-throughput low-latency wireless connectivity, other significant factors include the democratization of computing through cloud computing; the democratization of Artificial Intelligence (AI) and cognitive computing (e.g., IBM Watson); and the commoditization of data through crowdsourcing and digital exhaust. These technologies together can finally crack a dysfunctional healthcare system that has largely been impervious to technological innovations. We highlight the persistent deficiencies of the current healthcare system and then demonstrate how the 5G-enabled healthcare revolution can fix these deficiencies. We also highlight open technical research challenges, and potential pitfalls, that may hinder the development of such a 5G-enabled health revolution. Full article

(This article belongs to the Special Issue Communications and Computing for Sustainable Development Goals)

► Show Figures

Figure 1

676 KiB

Open AccessArticle

Social-Aware Relay Selection for Cooperative Multicast Device-to-Device Communications

by Francesco Chiti, Romano Fantacci and Laura Pierucci

Future Internet 2017, 9(4), 92; https://doi.org/10.3390/fi9040092 - 4 Dec 2017

Cited by 12 | Viewed by 6366

Abstract

The increasing use of social networks such as Facebook, Twitter, and Instagram to share photos, video streaming, and music among friends has generated a huge increase in the amount of data traffic over wireless networks. This social behavior has triggered new communication paradigms [...] Read more.

The increasing use of social networks such as Facebook, Twitter, and Instagram to share photos, video streaming, and music among friends has generated a huge increase in the amount of data traffic over wireless networks. This social behavior has triggered new communication paradigms such as device-to-device (D2D) and relaying communication schemes, which are both considered as strong drivers for the next fifth-generation (5G) cellular systems. Recently, the social-aware layer and its relationship to and influence on the physical communications layer have gained great attention as emerging focus points. We focus here on the case of relaying communications to pursue the multicast data dissemination to a group of users forming a social community through a relay node, according to the extension of the D2D mode to the case of device-to-many devices. Moreover, in our case, the source selects the device to act as the relay among different users of the multicast group by taking into account both the propagation link conditions and the relay social-trust level with the constraint of minimizing the end-to-end content delivery delay. An optimization procedure is also proposed in order to achieve the best performance. Finally, numerical results are provided to highlight the advantages of considering the impact of social level on the end-to-end delivery delay in the integrated social–physical network in comparison with the classical relay-assisted multicast communications for which the relay social-trust level is not considered. Full article

(This article belongs to the Special Issue Recent Advances in Cellular D2D Communications)

► Show Figures

Figure 1

3721 KiB

Open AccessArticle

High-Performance Elastic Management for Cloud Containers Based on Predictive Message Scheduling

by Chengxin Yan, Ningjiang Chen and Zhang Shuo

Future Internet 2017, 9(4), 87; https://doi.org/10.3390/fi9040087 - 28 Nov 2017

Cited by 5 | Viewed by 5616

Abstract

Containerized data centers can improve the computational density of IaaS layers. This intensive high-concurrency environment has high requirements for message scheduling and container processing. In the paper, an elastically scalable strategy for cloud containers based on predictive message scheduling is introduced, in order [...] Read more.

Containerized data centers can improve the computational density of IaaS layers. This intensive high-concurrency environment has high requirements for message scheduling and container processing. In the paper, an elastically scalable strategy for cloud containers based on predictive message scheduling is introduced, in order to reduce the delay of messages and improve the response time of services and the utilization of container resources. According to the busy degree of different containers, a management strategy of multiple containers at message-granularity level is developed, which gives the containers better elasticity. The simulation results show that the proposed strategy improves service processing efficiency and reduces response latency compared with existing solutions. Full article

► Show Figures

Figure 1

1116 KiB

Open AccessArticle

High Throughput and Acceptance Ratio Multipath Routing Algorithm in Cognitive Wireless Mesh Network

by Zhufang Kuang, Gongqiang Li, Junshan Tan and Zhigang Chen

Future Internet 2017, 9(4), 91; https://doi.org/10.3390/fi9040091 - 25 Nov 2017

Cited by 1 | Viewed by 4699

Abstract

The link failure due to the secondary users exiting the licensed channels when primary users reoccupy the licensed channels is very important in cognitive wireless mesh networks (CWMNs). A multipath routing and spectrum allocation algorithm based on channel interference and reusability with Quality [...] Read more.

The link failure due to the secondary users exiting the licensed channels when primary users reoccupy the licensed channels is very important in cognitive wireless mesh networks (CWMNs). A multipath routing and spectrum allocation algorithm based on channel interference and reusability with Quality of Service (QoS) constraints in CWMNs (MRIR) was proposed. Maximizing the throughput and the acceptance ratio of the wireless service is the objective of the MRIR. First, a primary path of resource conservation with QoS constraints was constructed, then, a resource conservation backup path based on channel interference and reusability with QoS constraints was constructed. The MRIR algorithm contains the primary path routing and spectrum allocation algorithm, and the backup path routing and spectrum allocation algorithm. The simulation results showed that the MRIR algorithm could achieve the expected goals and could achieve a higher throughput and acceptance ratio. Full article

► Show Figures

Graphical abstract

12982 KiB

Open AccessConference Report

A Fast and Reliable Broadcast Service for LTE-Advanced Exploiting Multihop Device-to-Device Transmissions

by Giovanni Nardini, Giovanni Stea and Antonio Virdis

Future Internet 2017, 9(4), 89; https://doi.org/10.3390/fi9040089 - 25 Nov 2017

Cited by 13 | Viewed by 6406

Abstract

Several applications, from the Internet of Things for smart cities to those for vehicular networks, need fast and reliable proximity-based broadcast communications, i.e., the ability to reach all peers in a geographical neighborhood around the originator of a message, as well as ubiquitous [...] Read more.

Several applications, from the Internet of Things for smart cities to those for vehicular networks, need fast and reliable proximity-based broadcast communications, i.e., the ability to reach all peers in a geographical neighborhood around the originator of a message, as well as ubiquitous connectivity. In this paper, we point out the inherent limitations of the LTE (Long-Term Evolution) cellular network, which make it difficult, if possible at all, to engineer such a service using traditional infrastructure-based communications. We argue, instead, that network-controlled device-to-device (D2D) communications, relayed in a multihop fashion, can efficiently support this service. To substantiate the above claim, we design a proximity-based broadcast service which exploits multihop D2D. We discuss the relevant issues both at the UE (User Equipment), which has to run applications, and within the network (i.e., at the eNodeBs), where suitable resource allocation schemes have to be enforced. We evaluate the performance of a multihop D2D broadcasting using system-level simulations, and demonstrate that it is fast, reliable and economical from a resource consumption standpoint. Full article

(This article belongs to the Special Issue Recent Advances in Cellular D2D Communications)

► Show Figures

Figure 1

8315 KiB

Open AccessFeature PaperArticle

An Ontology-Based Approach to Enable Knowledge Representation and Reasoning in Worker–Cobot Agile Manufacturing

by Ahmed R. Sadik and Bodo Urban

Future Internet 2017, 9(4), 90; https://doi.org/10.3390/fi9040090 - 24 Nov 2017

Cited by 49 | Viewed by 9578

Abstract

There is no doubt that the rapid development in robotics technology has dramatically changed the interaction model between the Industrial Robot (IR) and the worker. As the current robotic technology has afforded very reliable means to guarantee the physical safety of the worker [...] Read more.

There is no doubt that the rapid development in robotics technology has dramatically changed the interaction model between the Industrial Robot (IR) and the worker. As the current robotic technology has afforded very reliable means to guarantee the physical safety of the worker during a close proximity interaction with the IR. Therefore, new forms of cooperation between the robot and the worker can now be achieved. Collaborative/Cooperative robotics is the new branch of industrial robotics which empowers the idea of cooperative manufacturing. Cooperative manufacturing significantly depends on the existence of a collaborative/cooperative robot (cobot). A cobot is usually a Light-Weight Robot (LWR) which is capable of operating safely with the human co-worker in a shared work environment. This is in contrast with the conventional IR which can only operate in isolation from the worker workspace, due to the fact that the conventional IR can manipulate very heavy objects, which makes it so dangerous to operate in direct contact with the worker. There is a slight difference between the definition of collaboration and cooperation in robotics. In cooperative robotics, both the worker and the robot are performing tasks over the same product in the same shared workspace but not simultaneously. Collaborative robotics has a similar definition, except that the worker and the robot are performing a simultaneous task. Gathering the worker and the cobot in the same manufacturing workcell can provide an easy and cheap method to flexibly customize the production. Moreover, to adapt with the production demands in the real time of production, without the need to stop or to modify the production operations. There are many challenges and problems that can be addressed in the cooperative manufacturing field. However, one of the most important challenges in this field is the representation of the cooperative manufacturing environment and components. Thus, in order to accomplish the cooperative manufacturing concept, a proper approach is required to describe the shared environment between the worker and the cobot. The cooperative manufacturing shared environment includes the cobot, the co-worker, and other production components such as the product itself. Furthermore, the whole cooperative manufacturing system components need to communicate and share their knowledge, to reason and process the shared information, which eventually gives the control solution the capability of obtaining collective manufacturing decisions. Putting into consideration that the control solution should also provide a natural language which is human readable and in the same time can be understood by the machine (i.e., the cobot). Accordingly, a distributed control solution which combines an ontology-based Multi-Agent System (MAS) and a Business Rule Management System (BRMS) is proposed, in order to solve the mentioned challenges in the cooperative manufacturing, which are: manufacturing knowledge representation, sharing, and reasoning. Full article

► Show Figures

Figure 1

2354 KiB

Open AccessArticle

Behavioural Verification: Preventing Report Fraud in Decentralized Advert Distribution Systems

by Stylianos S. Mamais and George Theodorakopoulos

Future Internet 2017, 9(4), 88; https://doi.org/10.3390/fi9040088 - 20 Nov 2017

Cited by 7 | Viewed by 6358

Abstract

Service commissions, which are claimed by Ad-Networks and Publishers, are susceptible to forgery as non-human operators are able to artificially create fictitious traffic on digital platforms for the purpose of committing financial fraud. This places a significant strain on Advertisers who have no [...] Read more.

Service commissions, which are claimed by Ad-Networks and Publishers, are susceptible to forgery as non-human operators are able to artificially create fictitious traffic on digital platforms for the purpose of committing financial fraud. This places a significant strain on Advertisers who have no effective means of differentiating fabricated Ad-Reports from those which correspond to real consumer activity. To address this problem, we contribute an advert reporting system which utilizes opportunistic networking and a blockchain-inspired construction in order to identify authentic Ad-Reports by determining whether they were composed by honest or dishonest users. What constitutes a user’s honesty for our system is the manner in which they access adverts on their mobile device. Dishonest users submit multiple reports over a short period of time while honest users behave as consumers who view adverts at a balanced pace while engaging in typical social activities such as purchasing goods online, moving through space and interacting with other users. We argue that it is hard for dishonest users to fake honest behaviour and we exploit the behavioural patterns of users in order to classify Ad-Reports as real or fabricated. By determining the honesty of the user who submitted a particular report, our system offers a more secure reward-claiming model which protects against fraud while still preserving the user’s anonymity. Full article

(This article belongs to the Special Issue Security and Privacy in Wireless and Mobile Networks)

► Show Figures

Figure 1

494 KiB

Open AccessFeature PaperArticle

Study of Mobility Enhancements for RPL in Convergecast Scenarios

by Jinpeng Wang and Gérard Chalhoub

Future Internet 2017, 9(4), 86; https://doi.org/10.3390/fi9040086 - 17 Nov 2017

Cited by 4 | Viewed by 5574

Abstract

In recent years, mobility support has become an important requirement in various wireless sensor network (WSN) applications. However, due to the strict resource constraints of power, memory, and processing resources in WSNs, routing protocols are mainly designed without considering mobility. Low-Power and Lossy [...] Read more.

In recent years, mobility support has become an important requirement in various wireless sensor network (WSN) applications. However, due to the strict resource constraints of power, memory, and processing resources in WSNs, routing protocols are mainly designed without considering mobility. Low-Power and Lossy Networks (LLNs) are a special type of WSNs that tolerate data loss. The Routing Protocol for Low-Power and Lossy Networks (RPL) is a routing protocol for LLNs that adapts IPv6 (Internet Protocol version 6) and runs on top of the IEEE (Institute of Electrical and Electronics Engineers) 802.15.4 standard. RPL supports multipoint-to-point traffic and point-to-multipoint traffic. In this paper we propose a mobility enhancement mechanism in order to improve data collection applications in highly mobile scenarios. The enhancement is based on signal strength monitoring and depth updating in order to improve the routing protocol performance in mobile scenarios. This enhancement helps routing protocols to cope better with topology changes and makes proactive decisions on updating next-hop neighbours. We integrated this mechanism into the RPL and compared it with other existing RPL mobility support enhancements. Results obtained through simulation using Cooja show that our work outperforms other existing RPL mobility supports on different performance metrics. Results also prove the efficiency of our proposal in highly mobile scenarios. Full article

► Show Figures

Graphical abstract

699 KiB

Open AccessFeature PaperArticle

Blockchain-Empowered Fair Computational Resource Sharing System in the D2D Network

by Zhen Hong, Zehua Wang, Wei Cai and Victor C. M. Leung

Future Internet 2017, 9(4), 85; https://doi.org/10.3390/fi9040085 - 17 Nov 2017

Cited by 29 | Viewed by 8907

Abstract

Device-to-device (D2D) communication is becoming an increasingly important technology in future networks with the climbing demand for local services. For instance, resource sharing in the D2D network features ubiquitous availability, flexibility, low latency and low cost. However, these features also bring along challenges [...] Read more.

Device-to-device (D2D) communication is becoming an increasingly important technology in future networks with the climbing demand for local services. For instance, resource sharing in the D2D network features ubiquitous availability, flexibility, low latency and low cost. However, these features also bring along challenges when building a satisfactory resource sharing system in the D2D network. Specifically, user mobility is one of the top concerns for designing a cooperative D2D computational resource sharing system since mutual communication may not be stably available due to user mobility. A previous endeavour has demonstrated and proven how connectivity can be incorporated into cooperative task scheduling among users in the D2D network to effectively lower average task execution time. There are doubts about whether this type of task scheduling scheme, though effective, presents fairness among users. In other words, it can be unfair for users who contribute many computational resources while receiving little when in need. In this paper, we propose a novel blockchain-based credit system that can be incorporated into the connectivity-aware task scheduling scheme to enforce fairness among users in the D2D network. Users’ computational task cooperation will be recorded on the public blockchain ledger in the system as transactions, and each user’s credit balance can be easily accessible from the ledger. A supernode at the base station is responsible for scheduling cooperative computational tasks based on user mobility and user credit balance. We investigated the performance of the credit system, and simulation results showed that with a minor sacrifice of average task execution time, the level of fairness can obtain a major enhancement. Full article

(This article belongs to the Special Issue Recent Advances in Cellular D2D Communications)

► Show Figures

Figure 1

Figure 1
Typical blockchain structure. Full article ">Figure 2
Task scheduling in the D2D network. Full article ">Figure 3
Typical part of the blockchain of our system. Full article ">Figure 4
Continuous-time Markov chain for the connected-disconnected transition between <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>i</mi> </msub> </semantics> </math> and <math display="inline"> <semantics> <msub> <mi>h</mi> <mi>j</mi> </msub> </semantics> </math>. Let 1/0 represent the state in which <math display="inline"> <semantics> <msub> <mi>p</mi> <mi>i</mi> </msub> </semantics> </math> and <math display="inline"> <semantics> <msub> <mi>h</mi> <mi>j</mi> </msub> </semantics> </math> are connect/disconnected. The transition rates from zero to one and from one to zero are given by <math display="inline"> <semantics> <msub> <mi>λ</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </semantics> </math> and <math display="inline"> <semantics> <msub> <mi>μ</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </semantics> </math>, respectively. Full article ">Figure 5
Effect of initial credit. (a) Effect on average task execution time; (b) effect on the level of selfishness. Full article ">Figure 6
Effect of mean maximum wait time. (a) Effect on average task execution time; (b) effect on the level of selfishness. Full article ">Figure 7
Effect of mean task size. (a) Effect on average task execution time; (b) effect on the level of selfishness. Full article ">Figure 8
Effect of ongoing number of periods. (a) Effect on average task execution time; (b) effect on the level of selfishness. Full article ">

1466 KiB

Open AccessArticle

Energy-Efficient Resource and Power Allocation for Underlay Multicast Device-to-Device Transmission

by Fan Jiang, Honglin Wang, Hao Ren and Shuai Xu

Future Internet 2017, 9(4), 84; https://doi.org/10.3390/fi9040084 - 14 Nov 2017

Cited by 8 | Viewed by 6024

Abstract

In this paper, we present an energy-efficient resource allocation and power control scheme for D2D (Device-to-Device) multicasting transmission. The objective is to maximize the overall energy-efficiency of D2D multicast clusters through effective resource allocation and power control schemes, while considering the quality of [...] Read more.

In this paper, we present an energy-efficient resource allocation and power control scheme for D2D (Device-to-Device) multicasting transmission. The objective is to maximize the overall energy-efficiency of D2D multicast clusters through effective resource allocation and power control schemes, while considering the quality of service (QoS) requirements of both cellular users (CUs) and D2D clusters. We first build the optimization model and a heuristic resource and power allocation algorithm is then proposed to solve the energy-efficiency problem with less computational complexity. Numerical results indicate that the proposed algorithm outperforms existing schemes in terms of throughput per energy consumption. Full article

(This article belongs to the Special Issue Recent Advances in Cellular D2D Communications)

► Show Figures

Figure 1

1277 KiB

Open AccessArticle

Request Expectation Index Based Cache Replacement Algorithm for Streaming Content Delivery over ICN

by Haipeng Li, Hidenori Nakazato and Syed Hassan Ahmed

Future Internet 2017, 9(4), 83; https://doi.org/10.3390/fi9040083 - 14 Nov 2017

Cited by 4 | Viewed by 5531

Abstract

Since the content delivery unit over Information-Centric Networking (ICN) has shifted from files to the segments of a file named chunks, solely either file-level or chunk-level request probability is insufficient for ICN cache management. In this paper, a Request Expectation Index (RXI) based [...] Read more.

Since the content delivery unit over Information-Centric Networking (ICN) has shifted from files to the segments of a file named chunks, solely either file-level or chunk-level request probability is insufficient for ICN cache management. In this paper, a Request Expectation Index (RXI) based cache replacement algorithm for streaming content delivery is proposed. In this algorithm, RXI is introduced to serve as a fine-grained and unified estimation criteria of possible future request probability for cached chunks. RXI is customized for streaming content delivery by adopting both file-level and chunk-level request probability and considering the dynamically varied request status at each route as well. Compared to prior work, the proposed algorithm evicts the chunk with the minimum expectation of future request to maintain a high cache utilization. Additionally, simulation results demonstrate that the RXI-based algorithm can remarkably enhance the streaming content delivery performance and can be deployed in complex network scenarios. The proposed results validate that, by taking fine-grained request probability and request status into consideration, the customized in-network caching algorithm can improve the ICN streaming content delivery performance by high cache utilization, fast content delivery, and lower network traffic. Full article

► Show Figures

Figure 1

Figure 1
Default cache management scheme in Named Data Networking (NDN). LCE: Leave Copy Everywhere; LRU: Least Recently Used. Full article ">Figure 2
In-network caching for a streaming content delivery scenario. ICN: Information-Centric Networking; CS: Cache Space. Full article ">Figure 3
Monitor the request ratio <math display="inline"> <semantics> <mrow> <mi>R</mi> <mi>E</mi> <msub> <mi>Q</mi> <mi>f</mi> </msub> <mrow> <mo>(</mo> <mi>i</mi> <mo>)</mo> </mrow> </mrow> </semantics> </math>. REQ: Request ratio; RXI: Request expectation index; IRXI: Internal request expectation index. Full article ">Figure 4
<math display="inline"> <semantics> <mrow> <mi>I</mi> <mi>R</mi> <mi>X</mi> <msub> <mi>I</mi> <msub> <mi>f</mi> <mi>i</mi> </msub> </msub> <mrow> <mo>(</mo> <mi>j</mi> <mo>)</mo> </mrow> </mrow> </semantics> </math> calculation. Full article ">Figure 5
Simulation topologies. (a) hierarchical topology; (b) hybrid topology. Full article ">Figure 6
Simulation results of hierarchical topology. (a) average cache hit ratio; (b) average hop count; (c) network traffic; (d) total retrieval time. LFU: Least Frequently Used; TLP-TTH: Two-level popularity oriented time-to-hold policy. Full article ">Figure 7
Average cache hit ratio in different levels of hierarchical topology. Full article ">Figure 8
Simulation results of hybrid topology. (a) average cache hit ratio; (b) average hop count; (c) network traffic; (d) total retrieval time. Full article ">

913 KiB

Open AccessArticle

A Combinational Buffer Management Scheme in Mobile Opportunistic Network

by Peiyan Yuan and Hai Yu

Future Internet 2017, 9(4), 82; https://doi.org/10.3390/fi9040082 - 14 Nov 2017

Cited by 3 | Viewed by 5145

Abstract

Nodes in Mobile Opportunistic Network (MON) have to cache packets to deal with the intermittent connection. The buffer management strategy obviously impacts the performance of MON, and it attracts more attention recently. Due to the limited storage capacity of nodes, traditional buffer management [...] Read more.

Nodes in Mobile Opportunistic Network (MON) have to cache packets to deal with the intermittent connection. The buffer management strategy obviously impacts the performance of MON, and it attracts more attention recently. Due to the limited storage capacity of nodes, traditional buffer management strategies just drop messages based on the property of message, and they neglect the collaboration between neighbors, resulting in an ineffective performance improvement. Therefore, effective buffer management strategies are necessary to ensure that each node has enough buffer space to store the message when the node buffer is close to congestion. In this paper, we propose a buffer management strategy by integrating the characteristics of messages and nodes, and migrate the redundant messages to the neighbor to optimize the total utility, instead of deleting them. The simulation experiment results show that it can obviously improve the delivery ratio, the overhead ratio and the average delays, and reduce the amount of hops compared with the traditional ones. Full article

► Show Figures

Graphical abstract

2873 KiB

Open AccessArticle

Network Intrusion Detection through Discriminative Feature Selection by Using Sparse Logistic Regression

by Reehan Ali Shah, Yuntao Qian, Dileep Kumar, Munwar Ali and Muhammad Bux Alvi

Future Internet 2017, 9(4), 81; https://doi.org/10.3390/fi9040081 - 10 Nov 2017

Cited by 32 | Viewed by 9097

Abstract

Intrusion detection system (IDS) is a well-known and effective component of network security that provides transactions upon the network systems with security and safety. Most of earlier research has addressed difficulties such as overfitting, feature redundancy, high-dimensional features and a limited number of [...] Read more.

Intrusion detection system (IDS) is a well-known and effective component of network security that provides transactions upon the network systems with security and safety. Most of earlier research has addressed difficulties such as overfitting, feature redundancy, high-dimensional features and a limited number of training samples but feature selection. We approach the problem of feature selection via sparse logistic regression (SPLR). In this paper, we propose a discriminative feature selection and intrusion classification based on SPLR for IDS. The SPLR is a recently developed technique for data analysis and processing via sparse regularized optimization that selects a small subset from the original feature variables to model the data for the purpose of classification. A linear SPLR model aims to select the discriminative features from the repository of datasets and learns the coefficients of the linear classifier. Compared with the feature selection approaches, like filter (ranking) and wrapper methods that separate the feature selection and classification problems, SPLR can combine feature selection and classification into a unified framework. The experiments in this correspondence demonstrate that the proposed method has better performance than most of the well-known techniques used for intrusion detection. Full article

(This article belongs to the Collection Information Systems Security)

► Show Figures

Figure 1

Figure 1
Network Architecture for IDS. Full article ">Figure 2
Sparse logistic regression (SPLR) (Lasso) feature selection. The <math display="inline"> <semantics> <mrow> <msub> <mi>X</mi> <mi>i</mi> </msub> </mrow> </semantics> </math> are the feature sets. The <math display="inline"> <semantics> <mi>w</mi> </semantics> </math> is sparse coefficient vector and white element in <math display="inline"> <semantics> <mi>w</mi> </semantics> </math> the stand for zero elements (sparse data) and rest of all are selected feature. Full article ">Figure 3
Estimation picture for the ℓ1-norm regularization (Lasso). Full article ">Figure 4
A taxonomy of SPLR for the IDS. Full article ">Figure 5
(a,b) Overall Classification Accuracy (OCA) and Feature Selection (FS) along with degree of sparsity by SPLR on KDD ’99. Full article ">Figure 6
(a–d) Feature selection and degree of sparsity via SPLR on KDD ’99 dataset. Full article ">

1290 KiB

Open AccessFeature PaperArticle

A Framework for Cloud Based E-Government from the Perspective of Developing Countries

by Pusp Raj Joshi, Shareeful Islam and Syed Islam

Future Internet 2017, 9(4), 80; https://doi.org/10.3390/fi9040080 - 9 Nov 2017

Cited by 15 | Viewed by 8923

Abstract

Despite significant efforts to initiate electronic government projects, developing countries are still struggling to reap the benefits of using e-government services. An effective implementation of e-government infrastructure is necessary to increase the efficiency and transparency of the government services. There are several studies [...] Read more.

Despite significant efforts to initiate electronic government projects, developing countries are still struggling to reap the benefits of using e-government services. An effective implementation of e-government infrastructure is necessary to increase the efficiency and transparency of the government services. There are several studies that observed causes like lack of infrastructure support, lack of payment gateway and improper e-government service delivery channel as main barriers to a wider adoption of e-government services. The main contribution of this research is to propose a cloud-based G2G (Government-to-government) e-government framework for a viable e-government solution from the perspective of developing countries. We have introduced a list of concepts and a systematic process to guide the implementation of e-government project based on the government’s vision, goals, chosen services through the service delivery channel to the appropriate cloud service and deployment model. We have used Nepal as a context of the case study and applied the framework to a real e-government project of driving licensing department using action research methodology. The results from the study show that the G2G approach of e-government implementation would be the best for providing effective government services to the stakeholders of developing countries. The proposed framework also supports a smooth integration of government services and reduces the time of the overall project. Full article

► Show Figures

Figure 1

1626 KiB

Open AccessArticle

Malicious Cognitive User Identification Algorithm in Centralized Spectrum Sensing System

by Jingbo Zhang, Lili Cai and Shufang Zhang

Future Internet 2017, 9(4), 79; https://doi.org/10.3390/fi9040079 - 8 Nov 2017

Cited by 10 | Viewed by 5381

Abstract

Collaborative spectral sensing can fuse the perceived results of multiple cognitive users, and thus will improve the accuracy of perceived results. However, the multi-source features of the perceived results result in security problems in the system. When there is a high probability of [...] Read more.

Collaborative spectral sensing can fuse the perceived results of multiple cognitive users, and thus will improve the accuracy of perceived results. However, the multi-source features of the perceived results result in security problems in the system. When there is a high probability of a malicious user attack, the traditional algorithm can correctly identify the malicious users. However, when the probability of attack by malicious users is reduced, it is almost impossible to use the traditional algorithm to correctly distinguish between honest users and malicious users, which greatly reduces the perceived performance. To address the problem above, based on the β function and the feedback iteration mathematical method, this paper proposes a malicious user identification algorithm under multi-channel cooperative conditions (β-MIAMC), which involves comprehensively assessing the cognitive user’s performance on multiple sub-channels to identify the malicious user. Simulation results show under the same attack probability, compared with the traditional algorithm, the β-MIAMC algorithm can more accurately identify the malicious users, reducing the false alarm probability of malicious users by more than 20%. When the attack probability is greater than 7%, the proposed algorithm can identify the malicious users with 100% certainty. Full article

► Show Figures

Figure 1

4548 KiB

Open AccessFeature PaperArticle

Proposed Fuzzy-NN Algorithm with LoRaCommunication Protocol for Clustered Irrigation Systems

by Sotirios Kontogiannis, George Kokkonis, Soultana Ellinidou and Stavros Valsamidis

Future Internet 2017, 9(4), 78; https://doi.org/10.3390/fi9040078 - 7 Nov 2017

Cited by 13 | Viewed by 6820

Abstract

Modern irrigation systems utilize sensors and actuators, interconnected together as a single entity. In such entities, A.I. algorithms are implemented, which are responsible for the irrigation process. In this paper, the authors present an irrigation Open Watering System (OWS) architecture that spatially clusters [...] Read more.

Modern irrigation systems utilize sensors and actuators, interconnected together as a single entity. In such entities, A.I. algorithms are implemented, which are responsible for the irrigation process. In this paper, the authors present an irrigation Open Watering System (OWS) architecture that spatially clusters the irrigation process into autonomous irrigation sections. Authors’ OWS implementation includes a Neuro-Fuzzy decision algorithm called FITRA, which originates from the Greek word for seed. In this paper, the FITRA algorithm is described in detail, as are experimentation results that indicate significant water conservations from the use of the FITRA algorithm. Furthermore, the authors propose a new communication protocol over LoRa radio as an alternative low-energy and long-range OWS clusters communication mechanism. The experimental scenarios confirm that the FITRA algorithm provides more efficient irrigation on clustered areas than existing non-clustered, time scheduled or threshold adaptive algorithms. This is due to the FITRA algorithm’s frequent monitoring of environmental conditions, fuzzy and neural network adaptation as well as adherence to past irrigation preferences. Full article

(This article belongs to the Special Issue Big Data and Internet of Thing)

► Show Figures

Figure 1

4197 KiB

Open AccessReview

A Comprehensive Survey on Real-Time Applications of WSN

by Ahmad Ali, Yu Ming, Sagnik Chakraborty and Saima Iram

Future Internet 2017, 9(4), 77; https://doi.org/10.3390/fi9040077 - 7 Nov 2017

Cited by 139 | Viewed by 15616

Abstract

Nowadays, the investigation of the Wireless Sensor Network (WSN) has materialized its functional area ubiquitously such as environmental engineering, industrial and business applications, military, feedstock and habitat, agriculture sector, seismic detection, intelligent buildings, smart grids, and predictive maintenance, etc. Although some challenges still [...] Read more.

Nowadays, the investigation of the Wireless Sensor Network (WSN) has materialized its functional area ubiquitously such as environmental engineering, industrial and business applications, military, feedstock and habitat, agriculture sector, seismic detection, intelligent buildings, smart grids, and predictive maintenance, etc. Although some challenges still exist in the wireless sensor network, in spite of the shortcoming, it has been gaining significant attention among researchers and technologists due to its versatility and robustness. WSN is subject to a high potential technology that has been successfully implemented and tested in real-time scenarios, as well as deployed practically in various applications. In this paper, we have carried out an extensive survey in real-time applications of wireless sensor network deployment in a practical scenario such as the real-time intelligent monitoring of temperature, criminal activity in borders and surveillance on traffic monitoring, vehicular behavior on roads, water level and pressure, and remote monitoring of patients. The application of the Wireless Sensor Network in the assorted field of research areas has been widely deliberated. WSN is found to be the most effective solution in remote areas which are not yet explored due to its perilous nature and unreachable places. Here, in this study, we have cited the recent and updated research on the ubiquitous usage of WSN in diverse fields in an extensive and comprehensive approach. Full article

(This article belongs to the Special Issue Communications and Computing for Sustainable Development Goals)

► Show Figures

Figure 1

425 KiB

Open AccessFeature PaperReview

Understanding the Digital Marketing Environment with KPIs and Web Analytics

by José Ramón Saura, Pedro Palos-Sánchez and Luis Manuel Cerdá Suárez

Future Internet 2017, 9(4), 76; https://doi.org/10.3390/fi9040076 - 4 Nov 2017

Cited by 132 | Viewed by 61301

Abstract

In the practice of Digital Marketing (DM), Web Analytics (WA) and Key Performance Indicators (KPIs) can and should play an important role in marketing strategy formulation. It is the aim of this article to survey the various DM metrics to determine and address [...] Read more.

In the practice of Digital Marketing (DM), Web Analytics (WA) and Key Performance Indicators (KPIs) can and should play an important role in marketing strategy formulation. It is the aim of this article to survey the various DM metrics to determine and address the following question: What are the most relevant metrics and KPIs that companies need to understand and manage in order to increase the effectiveness of their DM strategies? Therefore, to achieve these objectives, a Systematic Literature Review has been carried out based on two main themes (i) Digital Marketing and (ii) Web Analytics. The search terms consulted in the databases have been (i) DM and (ii) WA obtaining a result total of n = 378 investigations. The databases that have been consulted for the extraction of data were Scopus, PubMed, PsyINFO, ScienceDirect and Web of Science. In this study, we define and identify the main KPIs in measuring why, how and for what purpose users interact with web pages and ads. The main contribution of the study is to lay out and clarify quantitative and qualitative KPIs and indicators for DM performance in order to achieve a consensus on the use and measurement of these indicators. Full article

► Show Figures

Figure 1

5003 KiB

Open AccessArticle

Creation and Staging of Android Theatre “Sayonara”towards Developing Highly Human-Like Robots

by Takenobu Chikaraishi, Yuichiro Yoshikawa, Kohei Ogawa, Oriza Hirata and Hiroshi Ishiguro

Future Internet 2017, 9(4), 75; https://doi.org/10.3390/fi9040075 - 2 Nov 2017

Cited by 11 | Viewed by 7794

Abstract

Even after long-term exposures, androids with a strikingly human-like appearance evoke unnatural feelings. The behavior that would induce human-like feelings after long exposures is difficult to determine, and it often depends on the cultural background of the observers. Therefore, in this study, we [...] Read more.

Even after long-term exposures, androids with a strikingly human-like appearance evoke unnatural feelings. The behavior that would induce human-like feelings after long exposures is difficult to determine, and it often depends on the cultural background of the observers. Therefore, in this study, we generate an acting performance system for the android, in which an android and a human interact in a stage play in the real world. We adopt the theatrical theory called Contemporary Colloquial Theatre Theory to give the android natural behaviors so that audiences can comfortably observe it even after long-minute exposure. A stage play is created and shown in various locations, and the audiences are requested to report their impressions of the stage and their cultural and psychological backgrounds in a self-evaluating questionnaire. Overall analysis indicates that the audience had positive feelings, in terms of attractiveness, towards the android on the stage even after 20 min of exposure. The singularly high acceptance of the android by Japanese audiences seems to be correlated with a high animism tendency, rather than to empathy. We also discuss how the stage play approach is limited and could be extended to contribute to realization of human–robot interaction in the real world. Full article

(This article belongs to the Special Issue Engaging in Interaction with Robots)

► Show Figures

Figure 1

2738 KiB

Open AccessArticle

Efficient Traffic Engineering Strategies for Improving the Performance of TCP Friendly Rate Control Protocol

by Nalavala Ramanjaneya Reddy, Pakanati Chenna Reddy and Mokkala Padmavathamma

Future Internet 2017, 9(4), 74; https://doi.org/10.3390/fi9040074 - 1 Nov 2017

Cited by 3 | Viewed by 5529

Abstract

Multimedia services will play a prominent role in the next generation of internet. With increasing real time requirements, internet technology has to provide Quality of Service (QoS) for various kinds of real time streaming services. When the bandwidth required exceeds the available network [...] Read more.

Multimedia services will play a prominent role in the next generation of internet. With increasing real time requirements, internet technology has to provide Quality of Service (QoS) for various kinds of real time streaming services. When the bandwidth required exceeds the available network resources, network paths can get congested, which results in a delay in packet delivery and packet loss. This situation leads to the design of new strategies for congestion avoidance and control. One of the popular and appropriate congestion control mechanisms that is useful in transmitting multimedia applications in the transport layer is TCP Friendly Rate Control Protocol (TFRC). However, TFRC still suffers from packet loss and delay due to long distance heavy traffic and network fluctuations. This paper introduces a number of key concerns like enhanced Round Trip Time (RTT) and Retransmission Time Out (RTO) calculations, Enhanced Average Loss Interval (ALI) methods and improved Time to Live (TTL) features are applied to TFRC to enhance the performance of TFRC over wired networks. Full article

(This article belongs to the Special Issue Future Computing for Real Time Intelligent Systems)

► Show Figures

Figure 1

714 KiB

Open AccessFeature PaperArticle

Quality of Service Based NOMA Group D2D Communications

by Asim Anwar, Boon-Chong Seet and Xue Jun Li

Future Internet 2017, 9(4), 73; https://doi.org/10.3390/fi9040073 - 1 Nov 2017

Cited by 15 | Viewed by 5719

Abstract

Non-orthogonal multiple access (NOMA) provides superior spectral efficiency and is considered as a promising multiple access scheme for fifth generation (5G) wireless systems. The spectrum efficiency can be further enhanced by enabling device-to-device (D2D) communications. In this work, we propose quality of service [...] Read more.

Non-orthogonal multiple access (NOMA) provides superior spectral efficiency and is considered as a promising multiple access scheme for fifth generation (5G) wireless systems. The spectrum efficiency can be further enhanced by enabling device-to-device (D2D) communications. In this work, we propose quality of service (QoS) based NOMA (Q-NOMA) group D2D communications in which the D2D receivers (DRs) are ordered according to their QoS requirements. We discuss two possible implementations of proposed Q-NOMA group D2D communications based on the two power allocation coefficient policies. In order to capture the key aspects of D2D communications, which are device clustering and spatial separation, we model the locations of D2D transmitters (DTs) by Gauss–Poisson process (GPP). The DRs are then considered to be clustered around DTs. Multiple DTs can exist in proximity of each other. In order to characterize the performance, we derive the Laplace transform of the interference at the probe D2D receiver and obtain a closed-form expression of its outage probability using stochastic geometry tools. The performance of proposed Q-NOMA group D2D communications is then evaluated and benchmarked against conventional paired D2D communications. Full article

(This article belongs to the Special Issue Recent Advances in Cellular D2D Communications)

► Show Figures

Figure 1

1411 KiB

Open AccessArticle

Throughput-Aware Cooperative Reinforcement Learning for Adaptive Resource Allocation in Device-to-Device Communication

by Muhidul Islam Khan, Muhammad Mahtab Alam, Yannick Le Moullec and Elias Yaacoub

Future Internet 2017, 9(4), 72; https://doi.org/10.3390/fi9040072 - 1 Nov 2017

Cited by 23 | Viewed by 6276

Abstract

Device-to-device (D2D) communication is an essential feature for the future cellular networks as it increases spectrum efficiency by reusing resources between cellular and D2D users. However, the performance of the overall system can degrade if there is no proper control over interferences produced [...] Read more.

Device-to-device (D2D) communication is an essential feature for the future cellular networks as it increases spectrum efficiency by reusing resources between cellular and D2D users. However, the performance of the overall system can degrade if there is no proper control over interferences produced by the D2D users. Efficient resource allocation among D2D User equipments (UE) in a cellular network is desirable since it helps to provide a suitable interference management system. In this paper, we propose a cooperative reinforcement learning algorithm for adaptive resource allocation, which contributes to improving system throughput. In order to avoid selfish devices, which try to increase the throughput independently, we consider cooperation between devices as promising approach to significantly improve the overall system throughput. We impose cooperation by sharing the value function/learned policies between devices and incorporating a neighboring factor. We incorporate the set of states with the appropriate number of system-defined variables, which increases the observation space and consequently improves the accuracy of the learning algorithm. Finally, we compare our work with existing distributed reinforcement learning and random allocation of resources. Simulation results show that the proposed resource allocation algorithm outperforms both existing methods while varying the number of D2D users and transmission power in terms of overall system throughput, as well as D2D throughput by proper Resource block (RB)-power level combination with fairness measure and improving the Quality of service (QoS) by efficient controlling of the interference level. Full article

(This article belongs to the Special Issue Recent Advances in Cellular D2D Communications)

► Show Figures

Figure 1

Figure 1
Device-to-device (D2D) communication in a cellular network. RB1 and RB2 resource allocated to the Cellular User equipments (UE) and the D2D pair TX-D2D pair Rx, respectively. D2D candidate Tx-D2D candidate Rx has joined the network, it will contend for the resources, i.e., either reusing RB1 or RB2. Full article ">Figure 2
Basic components of a reinforcement learning. The agent performs an action to the environment which gives a reward and helps to shift from one state to another. Full article ">Figure 3
(a) Average system throughput over number of iterations (b) Convergence of learning algorithms. Full article ">Figure 4
D2D throughput versus transmit power. Full article ">Figure 5
Joint D2D throughput and cellular user throughput optimization. Full article ">Figure 6
Throughput analysis over a number of D2D users. Full article ">Figure 7
Fairness index of D2D throughput versus number of D2D pairs. Full article ">

3337 KiB

Open AccessFeature PaperArticle

FttC-Based Fronthaul for 5G Dense/Ultra-Dense Access Network: Performance and Costs in Realistic Scenarios

by Franco Mazzenga, Romeo Giuliano and Francesco Vatalaro

Future Internet 2017, 9(4), 71; https://doi.org/10.3390/fi9040071 - 27 Oct 2017

Cited by 14 | Viewed by 6451

Abstract

One distinctive feature of the next 5G systems is the presence of a dense/ultra-dense wireless access network with a large number of access points (or nodes) at short distances from each other. Dense/ultra-dense access networks allow for providing very high transmission capacity to [...] Read more.

One distinctive feature of the next 5G systems is the presence of a dense/ultra-dense wireless access network with a large number of access points (or nodes) at short distances from each other. Dense/ultra-dense access networks allow for providing very high transmission capacity to terminals. However, the deployment of dense/ultra-dense networks is slowed down by the cost of the fiber-based infrastructure required to connect radio nodes to the central processing units and then to the core network. In this paper, we investigate the possibility for existing FttC access networks to provide fronthaul capabilities for dense/ultra-dense 5G wireless networks. The analysis is realistic in that it is carried out considering an actual access network scenario, i.e., the Italian FttC deployment. It is assumed that access nodes are connected to the Cabinets and to the corresponding distributors by a number of copper pairs. Different types of cities grouped in terms of population have been considered. Results focus on fronthaul transport capacity provided by the FttC network and have been expressed in terms of the available fronthaul bit rate per node and of the achievable coverage. Full article

► Show Figures

Figure 1

775 KiB

Open AccessArticle

Challenges When Using Jurimetrics in Brazil—A Survey of Courts

by Bruna Armonas Colombo, Pedro Buck and Vinicius Miana Bezerra

Future Internet 2017, 9(4), 68; https://doi.org/10.3390/fi9040068 - 25 Oct 2017

Cited by 6 | Viewed by 7141

Abstract

Jurimetrics is the application of quantitative methods, usually statistics, to law. An important step to implement a jurimetric analysis is to extract raw data from courts and organize that data in a way that can be processed. Most of the raw data is [...] Read more.

Jurimetrics is the application of quantitative methods, usually statistics, to law. An important step to implement a jurimetric analysis is to extract raw data from courts and organize that data in a way that can be processed. Most of the raw data is unstructured and written in natural language, which stands as a challenge to Computer Science experts. As it requires expertise in law, statistics, and computer science, jurimetrics is a multidisciplinary field. When trying to implement a jurimetric system in Brazil, additional challenges were identified due to the heterogeneity of the different court systems, the lack of standards, and how the open data laws in Brazil are interpreted and implemented. In this article, we present a survey of Brazilian courts in terms of readiness to implement a jurimetric system. Analyzing a sample of data, we have found, in light of Brazil’s open data regulation, privacy issues and technical issues. Finally, we propose a roadmap that encompasses both technology and public policy to meet those challenges. Full article

(This article belongs to the Special Issue Computation, Law and the Net—The Future of Law in the Computational Social Science Era)

► Show Figures

Figure 1

465 KiB

Open AccessArticle

Exploring Data Model Relations in OpenStreetMap

by Hippolyte Pruvost and Peter Mooney

Future Internet 2017, 9(4), 70; https://doi.org/10.3390/fi9040070 - 24 Oct 2017

Cited by 4 | Viewed by 6929

Abstract

The OpenStreetMap (OSM) geographic data model has three principal object types: nodes (points), ways (polygons and polylines), and relations (logical grouping of all three object types to express real-world geographical relationships). While there has been very significant analysis of OSM over the past [...] Read more.

The OpenStreetMap (OSM) geographic data model has three principal object types: nodes (points), ways (polygons and polylines), and relations (logical grouping of all three object types to express real-world geographical relationships). While there has been very significant analysis of OSM over the past decade or so, very little research attention has been given to OSM relations. In this paper, we provide an exploratory overview of relations in OSM for four European cities. In this exploration, we undertake analysis of relations to assess their complexity, composition and flexibility within the OSM data model. We show that some of the patterns discovered by researchers related to OSM nodes and ways also exist in relations. We find some other interesting aspects of relations which we believe can act as a catalyst for a more sustained future research effort on relations in OSM. These aspects include: the potential influence of bulk imports of geographical data to OSM, tagging of relations, and contribution patterns of edits to OSM relations. Full article

► Show Figures

Graphical abstract

1483 KiB

Open AccessArticle

Signal Consensus in TSP of the Same Grid in Road Network

by Dongyuan Li, Chengshuai Li, Zidong Wang, Deqiang Wang, Jianping Xing and Bo Zhang

Future Internet 2017, 9(4), 69; https://doi.org/10.3390/fi9040069 - 24 Oct 2017

Cited by 1 | Viewed by 5103

Abstract

In this paper, we propose a consensus algorithm with input constraints for traffic light signals in transit signal priority (TSP). TSP ensures control strategy of traffic light signals can be adjusted and applied according to the real-time traffic status, and provides priority for [...] Read more.

In this paper, we propose a consensus algorithm with input constraints for traffic light signals in transit signal priority (TSP). TSP ensures control strategy of traffic light signals can be adjusted and applied according to the real-time traffic status, and provides priority for buses. We give the convergence conditions of the consensus algorithms with and without input constraints in TSP respectively and analyze the convergence performance of them by using matrix theory and graph theory, and PTV-VISSIM is used to simulate the traffic accident probability of three cases at intersections. Simulation results are presented that a consensus is asymptotically reached for all weights of priority; the algorithm with input constraints is more suitable for TSP than the algorithm without input constraints, and the traffic accident rate is reduced. Full article

(This article belongs to the Special Issue Future Computing for Real Time Intelligent Systems)

► Show Figures

Figure 1

Figure 1
Distribution of intersections in a traffic grid. Full article ">Figure 2
Topology network of intersection traffic lights in a grid. Full article ">Figure 3
Simulation results of consensus algorithm in transit signal priority (TSP). Full article ">Figure 4
State trajectories and the disagreement function <math display="inline"> <semantics> <mrow> <msup> <mrow> <mrow> <mo>‖</mo> <mi>δ</mi> <mo>‖</mo> </mrow> </mrow> <mn>2</mn> </msup> </mrow> </semantics> </math>. Full article ">Figure 5
Simulation results of consensus algorithm with input constraints in TSP. Full article ">Figure 6
State trajectories and the disagreement function <math display="inline"> <semantics> <mrow> <msup> <mrow> <mrow> <mo>‖</mo> <mi>δ</mi> <mo>‖</mo> </mrow> </mrow> <mn>2</mn> </msup> </mrow> </semantics> </math>. Full article ">Figure 7
PTV-VISSIM (v4.3, PTV Group, Karlsruhe, Germany) simulation interface. Full article ">

389 KiB

Open AccessArticle

SDMw: Secure Dynamic Middleware for Defeating Port and OS Scanning

by Dalal Hanna, Prakash Veeraraghavan and Ben Soh

Future Internet 2017, 9(4), 67; https://doi.org/10.3390/fi9040067 - 21 Oct 2017

Cited by 3 | Viewed by 5768

Abstract

Fingerprinting is a process of identifying the remote network devices and services running on the devices, including operating systems (OS) of the devices, and hosts running different OSs. Several research proposals and commercial products are available in the market to defeat fingerprinting. However, [...] Read more.

Fingerprinting is a process of identifying the remote network devices and services running on the devices, including operating systems (OS) of the devices, and hosts running different OSs. Several research proposals and commercial products are available in the market to defeat fingerprinting. However, they have performance limitations and expose themselves to attackers. In this paper, we utilize some real-time fault-tolerance concepts (viz. real-time/dynamic, detection/locating, confinement/localizing and masking/decoy) to propose a plug-and-play adaptive middleware architecture called Secure Dynamic Middleware (SDMw) with a view to defeat attackers fingerprinting the network, without exposing itself to the attackers. We verify that the proposed scheme works seamlessly and requires zero-configuration at the client side. Full article

► Show Figures

Figure 1

1561 KiB

Open AccessFeature PaperArticle

Deep Classifiers-Based License Plate Detection, Localization and Recognition on GPU-Powered Mobile Platform

by Syed Tahir Hussain Rizvi, Denis Patti, Tomas Björklund, Gianpiero Cabodi and Gianluca Francini

Future Internet 2017, 9(4), 66; https://doi.org/10.3390/fi9040066 - 21 Oct 2017

Cited by 20 | Viewed by 6463

Abstract

The realization of a deep neural architecture on a mobile platform is challenging, but can open up a number of possibilities for visual analysis applications. A neural network can be realized on a mobile platform by exploiting the computational power of the embedded [...] Read more.

The realization of a deep neural architecture on a mobile platform is challenging, but can open up a number of possibilities for visual analysis applications. A neural network can be realized on a mobile platform by exploiting the computational power of the embedded GPU and simplifying the flow of a neural architecture trained on the desktop workstation or a GPU server. This paper presents an embedded platform-based Italian license plate detection and recognition system using deep neural classifiers. In this work, trained parameters of a highly precise automatic license plate recognition (ALPR) system are imported and used to replicate the same neural classifiers on a Nvidia Shield K1 tablet. A CUDA-based framework is used to realize these neural networks. The flow of the trained architecture is simplified to perform the license plate recognition in real-time. Results show that the tasks of plate and character detection and localization can be performed in real-time on a mobile platform by simplifying the flow of the trained architecture. However, the accuracy of the simplified architecture would be decreased accordingly. Full article

► Show Figures

Figure 1

Journal Menu

Journal Browser

Future Internet, Volume 9, Issue 4 (December 2017) – 42 articles

Further Information

Guidelines

MDPI Initiatives

Follow MDPI