Showing papers in "Peer-to-peer Networking and Applications in 2019"
TL;DR: This survey evaluated the techniques of deep learning in developing SDN-based Network Intrusion Detection Systems (NIDS) and covered tools that can be used to develop NIDS models in SDN environment.
Abstract: Software Defined Networking Technology (SDN) provides a prospect to effectively detect and monitor network security problems ascribing to the emergence of the programmable features. Recently, Machine Learning (ML) approaches have been implemented in the SDN-based Network Intrusion Detection Systems (NIDS) to protect computer networks and to overcome network security issues. A stream of advanced machine learning approaches – the deep learning technology (DL) commences to emerge in the SDN context. In this survey, we reviewed various recent works on machine learning (ML) methods that leverage SDN to implement NIDS. More specifically, we evaluated the techniques of deep learning in developing SDN-based NIDS. In the meantime, in this survey, we covered tools that can be used to develop NIDS models in SDN environment. This survey is concluded with a discussion of ongoing challenges in implementing NIDS using ML/DL and future works.
341 citations
TL;DR: An Unmanned Aerial Vehicles (UAVs) joint Vehicles as Data Mules for Fast Codes Dissemination (UVDCD) scheme is proposed to spread codes as a fast and low-cost pattern for edge networking in smart city.
Abstract: With the rapid development of software-defined technologies, emerging multimedia applications are booming, which require real-time communication and computation via devices. Meanwhile, the program codes in multimedia applications need to be updated periodically to accommodate changes in the edge networking environment. Therefore, a huge number of smart sensing devices which are deployed in the infrastructures of smart city can play a bigger role than ever before due to their program codes in multimedia applications can be updated by sensing data. However, how to spread program codes to a large amount of devices which are distributed in smart city in a low-cost and fast way is a challenging issue. To solve the issue, in this paper, an Unmanned Aerial Vehicles (UAVs) joint Vehicles as Data Mules for Fast Codes Dissemination (UVDCD) scheme is proposed to spread codes as a fast and low-cost pattern for edge networking in smart city. In UVDCD scheme, first of all, large amount of vehicles in smart city act as mules for code dissemination. Although the cost of the method is low and can quickly cover most networks, there is a very long trailing phenomenon for this approach, i.e. in the early stage of code dissemination, the code dissemination rate increases rapidly over time and have a high efficiency, but after a short time, the increase of code dissemination rate has become very slowly over time. So, in this situation, the unmanned aerial vehicle is used to spread the program codes of intelligent devices where vehicles are hard to spread, thereby eliminating the trailing phenomenon in code dissemination. In order to achieve a high dissemination efficiency for UAV, first, we cluster the device nodes which have not received codes, then we select the optimized UAV flight trajectory based on the cluster so that the total length of the UAV flight path is the shortest, i.e. low-cost, and the number of devices which can receive codes is the largest. Finally, the validity of UVDCD scheme is confirmed based on real vehicle data, and through experiments, it can effectively overcome the trailing phenomenon in code dissemination after using UAV. The coverage ratio and dissemination speed are higher than those of previous strategies and increase 2.11% and 69.44% respectively.
68 citations
TL;DR: Simulation results show that the proposed LBLP can work with the existing routing protocols to improve the network throughput substantially and balance the load even when the switching delay is large.
Abstract: Cooperative channel allocation and scheduling are key issues in wireless mesh networks with multiple interfaces and multiple channels. In this paper, we propose a load balance link layer protocol (LBLP) aiming to cooperatively manage the interfaces and channels to improve network throughput. In LBLP, an interface can work in a sending or receiving mode. For the receiving interfaces, the channel assignment is proposed considering the number, position and status of the interfaces, and a task allocation algorithm based on the Huffman tree is developed to minimize the mutual interference. A dynamic link scheduling algorithm is designed for the sending interfaces, making the tradeoff between the end-to-end delay and the interface utilization. A portion of the interfaces can adjust their modes for load balancing according to the link status and the interface load. Simulation results show that the proposed LBLP can work with the existing routing protocols to improve the network throughput substantially and balance the load even when the switching delay is large.
65 citations
TL;DR: An IoT based efficient community-based recommender system that diagnoses cardiac disease and its type and provides recommendations related to the physical and dietary plan and achieves 98% accuracy is proposed.
Abstract: A fog-based IoT model can be helpful for patients from remote areas with cardiovascular disease. An expert cardiologist is usually not available in such remote areas. There are some systems available to classify heart disease and provide recommendations but these existing systems only use classification for recommendations. From this line of research, we propose an IoT based efficient community-based recommender system that diagnoses cardiac disease and its type and provides recommendations related to the physical and dietary plan. The first part intent to collect the data from the patient remotely by using the bio sensors. The IoT based environment is used to transmit the data to the server. Afterward, heart disease prediction model is implemented, that can diagnose the cardiovascular disease and classify into eight available cardiovascular classes i.e. Myocardial Infarction (MI stable), Myocardial Infarction (MI unstable), Acute Coronary Syndrome (ACS), Atrial Fibrillation (AF), Hypertension (HTN), Ischemic Heart Disease (IHD), Left Ventricular Hypertrophy (LVH), Chronic Heart Failure/ Left Ventricle Function (CCF/LVF), Supraventricular Tachycardia (SVT). The second part pursues to provide physical and dietary plan recommendation to the cardiac patient according to gender and age groups. A dataset for diseases and corresponding recommendations is collected from a well-renowned hospital with the help of an expert cardiologist. The performance of the system is evaluated in terms of precision, recall and Mean absolute error and achieves 98% accuracy.
64 citations
TL;DR: This paper designs a novel decentralized architecture using blockchain technology, which is called blockchain-based VANET, and shows its superior in the aspect of protecting identity and location privacy.
Abstract: With the breakthroughs in sensor technology and internet of things, Vehicular Ad Hoc Network (VANET) is developing into a new generation. The technical challenges of current VANET are decentralized architecture deployment and privacy protection. Since the blockchain owns the characteristics of being decentralized, distributed, collective maintenance and non-tampering, this paper designs a novel decentralized architecture using blockchain technology, which is called blockchain-based VANET. The blockchain-based VANET involves four major stages: blockchain set-up, registration of vehicles, SBMs upload, and blockchain record. It can effectively address the problems of centralization and mutual distrust between entities in current VANET. For protecting identity and location privacy, we propose UGG, IPP and LPP algorithms with the way of dynamic threshold encryption and k-anonymity unity in the stage of SBMs upload of blockchain-based VANET. To quantify the availability of k-anonymity unity, we propose two indicators: connectivity and average distance. Extensive simulations have been conducted to validate the effectiveness of blockchain-based VANET. We analyze the simulation results from four aspects: system time, average distance, connectivity, and privacy leakage. The simulation results show that our proposed architecture performs better in terms of processing time than current architectures. Furthermore, our proposed architecture shows its superior in the aspect of protecting identity and location privacy.
59 citations
TL;DR: Due to multiple working sets are alternately covered under MWSAC, the workload and wake-up time of each working node is greatly reduced, which makes the energy consumption more balanced and the network lifetime longer.
Abstract: Coverage of wireless sensor networks is a fundamental problem which has been studied for more than two decades. In duty cycle based wireless sensor networks, the nodes are sleep/wake periodic working, and the sleeping of nodes selected to achieve coverage results in a lack of network coverage, which make the coverage of the research difficult to apply in practice. In this paper, a Multi Working Sets Alternate Covering (MWSAC) scheme is proposed to achieve continuous partial coverage of the network. Firstly, a distributed algorithm is proposed to construct the maximum number of working sets, each working set is required to satisfy the partial coverage requirement of the application. Then, the sleeping time of the working nodes is scheduled, which makes the nodes belonging to the same working set wake up synchronously and nodes between multiple working sets wake up asynchronously. Thus, at any time, as long as the nodes of one working set are in waking state, the nodes of other working sets are adjusted to sleeping state to save energy. Due to multiple working sets are alternately covered under MWSAC, the workload and wake-up time of each working node is greatly reduced, which makes the energy consumption more balanced and the network lifetime longer. Both the theoretical analysis and the experimental results show that, compared with the previous continuous coverage scheme, MWSAC scheme has obvious advantages in terms of coverage, network lifetime and node utilization.
56 citations
TL;DR: A routing protocol called Dual Sink approach using Clustering in Body Area Network (DSCB) which is more reliable in terms of network stability, and energy efficient in comparison to its counterparts is presented.
Abstract: Wireless Body Area Networks (WBANs) is a revolutionary achievement in the field of health services. The field is envisioned to play an important role in medical, psychological, and even in non-medical applications. Different routing protocols are being designed in WBAN to enhance its performance, focusing on delay, energy efficiency, throughput, and network lifetime. Line-of-sight (LoS) and Non-Line-of-Sight (NLoS) communications and clustering are the least focused areas in the literature. This paper presents a routing protocol called Dual Sink approach using Clustering in Body Area Network (DSCB) which is more reliable in terms of network stability, and energy efficient in comparison to its counterparts. This protocol enhances network life-time by introducing the concept of clustering while using two sink nodes. The proposed scheme is compared with existing protocols named as SIMPLE and DARE. The cost function is established for selection of forwarder node, based on nodal distance from the sink, residual energy, and transmission power. Simulation results depict that the proposed protocol achieves significant performance improvement in network throughput by attaining 55% and 22% more efficient results compared to SIMPLE and DARE respectively. Furthermore, the results show improved performance of DSCB protocol, in terms of network stability and end-to-end delay performance metrics.
55 citations
TL;DR: Improved Dual Hop Routing protocol (IDHR) and Multiple data sink-based Energy Efficient Cluster-based routing protocol (MEEC) are proposed and node density factor proves to be adherent for energy preservation of nodes by abating the average communication distance between the nodes and respective CH.
Abstract: In this paper, Improved Dual Hop Routing protocol (IDHR) and Multiple data sink-based Energy Efficient Cluster-based routing protocol (MEEC) are proposed. The Cluster Head (CH) selection in IDHR and MEEC is done by incorporating node density parameter along with other parameters, namely energy and distance between the node and the sink. In MEEC, multiple data sinks are employed to pact with the burden on the relaying nodes involved in data forwarding. The node density factor proves to be adherent for energy preservation of nodes by abating the average communication distance between the nodes and respective CH. The employment of multiple data sinks in MEEC avoids any dual hop communication between CHs and sink, which in turn alleviates hot-spot problem and ameliorates network longevity. As evident from the simulation results, IDHR and MEEC individually outperform competitive protocols, namely SEECP, DRESEP and TEDRP with respect to various performance metrics. Furthermore, the performance comparison of MEEC and IDHR is investigated to limelight the essence of employing multiple data sinks for a network.
50 citations
TL;DR: A Pipeline Slot based Fast Rerouting (PSFR) Scheme is proposed to reduce delay in duty cycle based WSNs and can improve the energy utilization of network by more than 27.66%.
Abstract: In recent years, with the development of networked Cyber-Physical Systems (CPSs), wireless sensor networks (WSNs), as an important carrier of CPSs, has been applied more and more. In WSNs, many applications require low delay and high reliability for routing the sensing data to sink. Due to the lossy nature of wireless channels, rerouting schemes are often applied to ensure reliable data collection for mission-critical applications. However, rerouting together with multi-hop routing in duty cycle base WSNs will make designing a low delay routing scheme a challenge issue. In this paper, a Pipeline Slot based Fast Rerouting (PSFR) Scheme is proposed to reduce delay in duty cycle based WSNs. The main innovation points of PSFR scheme are as follows: (a) In duty cycle based WSNs, the major delay is caused by the sleep delay when nodes in the route forwarding to next hop node. Therefore, in PSFR scheme, we add a sequential active (SA) slot at the next hop node which is active at the next slot of the active slot of the previous node, which enables the previous node to forward packets to the next hop node in the slot right after receiving packet in active slot and greatly reduces sleep delay. (b) The second, in PSFR scheme, the backup path is designed beforehand in a less stringent pipeline active slot, so the packet can reach the sink with a relatively low delay when rerouting. (c) More importantly, in PSFR scheme, the added SA slots use the residual energy of peripheral nodes, which means they reduce the routing delay without decreasing network lifetime. After sufficient theoretical analysis and experiment, results show that the PSFR scheme can reduce the delay by more than 58.215% in the experiment networks without reducing the network lifetime, and the PSFR scheme can improve the energy utilization of network by more than 27.66%.
50 citations
TL;DR: With satisfactory results from simulation and comparison with some existing algorithms, the new method is found to not only decrease tendency of energy consumption but also improve the delivery ratio, overhead and End-to-end delay in social opportunistic networks.
Abstract: In social communication, mobile devices can be regarded as socialization nodes in social networks. Furthermore, they carry and store useful information. Mobile devices can select destination nodes and deliver messages through opportunistic networks because messages can be securely and conveniently stored, carried, and transmitted with nodes. However, many communities may deliver messages often depending on one or two nodes. If those nodes are not enough cache and over-flooding, data transmission in communities may wait for a long time. In this study, weight distribution between nodes and communities reconstitution would be established to solve this problem in social opportunistic networks. With satisfactory results from simulation and comparison with some existing algorithms, the new method is found to not only decrease tendency of energy consumption but also improve the delivery ratio, overhead and End-to-end delay in social opportunistic networks.
49 citations
TL;DR: A novel routing formation algorithm called Geometric programming based Energy Efficient Routing protocol (GEER) is proposed for hybrid ad-hoc network that optimizes two sets of objectives: maximize network lifetime and throughput and minimize packet loss and routing overhead.
Abstract: In this paper, a novel routing formation algorithm called Geometric programming based Energy Efficient Routing protocol (GEER) is proposed for hybrid ad-hoc network. It optimizes two sets of objectives: (i) maximize network lifetime and throughput, and (ii) minimize packet loss and routing overhead. The stated optimizations are done by the fusion of multi-objective optimization, geometric programming, and intuitionistic fuzzy set. The combination of stated techniques provides an effective tool that evaluates an optimal solution based on all objectives and estimates non-linear parameters of the network. The proposed method GEER is simulated in LINGO optimization software and validated with some existing methods in several scenarios. The outcomes of validation illustrate that the proposed method GEER outperforms the other existing methods based on several network metrics.
TL;DR: An improved three-factor authentication scheme which is more suitable than Gope et al.
Abstract: Wireless sensor networks (WSNs) play an important role and support a variety of real time applications, such as healthcare monitoring, military surveillance, vehicular tracking and, so on. Secure and real time information accessing from the sensor nodes in these applications is very important. Because wireless sensor nodes are limited in computing and communication capabilities and data storage, it is very crucial to design an effective and secure lightweight authentication and key agreement scheme. Recently, Gope et al. proposed a realistic lightweight anonymous authentication scheme in WSNs and claimed that their scheme satisfied all security concerns in these networks. However, we show that in their scheme the adversary can obtain the session key between the user and the sensor node. In order to fix this drawback, we propose an improved three-factor authentication scheme which is more suitable than Gope et al.’s scheme and also provides more desired security properties such as three-factor authentication and access control. Through the informal analysis, we show that our scheme is secure against various known attacks including the attack found in Gope et al.’s scheme. Furthermore, we have demonstrated the validity of our proposed scheme using the BAN logic. As compared with the previous authentication schemes, the proposed scheme is not only more secure but also enough practical and competitive with existing schemes.
TL;DR: This paper proposed a virtual network embedding algorithm based on modified genetic algorithm that improved the classical genetic algorithm from three aspects: population initialization strategy, improved mutation operation and improvement operation, took advantage of the selection operation, crossover operation, mutation operation, feasibility checking operation, and utilized the fitness function to choose the best chromosome.
Abstract: To fend off the ossification of Internet architecture, virtual network embedding has been propounded as one of the most important techniques to address this issue. Virtual network embedding is a process that consists of two stages including node mapping stage and link mapping stage, the aim of node mapping stage is to map the virtual nodes from virtual network requests (VNRs) onto the substrate nodes meanwhile satisfying the CPU capacity constraints on nodes, the goal of link mapping stage is to map the virtual links from VNRs onto the substrate paths while satisfying the bandwidth resource constraints on links. This paper proposed a virtual network embedding algorithm based on modified genetic algorithm, improved the classical genetic algorithm from three aspects: population initialization strategy, improved mutation operation and improvement operation, took advantage of the selection operation, crossover operation, mutation operation, feasibility checking operation, and utilized the fitness function to choose the best chromosome. Simulation results indicated that our proposed method has significantly increased the acceptance ratio of VNRs and the long-term average revenue of Infrastructures (InPs) compared with other two state-of-the-art algorithms.
TL;DR: This approach focuses on the attacks like network scanning attack, OpenFlow flooding attack, switch compromised attack and ARP attack in both data plane and control plane and uses multiple observations hidden Markov model (HMM) to quantify the network status and get security situation assessment values for SDN.
Abstract: Software Defined Network (SDN) is a network framework which can be controlled and defined by software programming, and OpenFlow is the basic protocol in SDN that defines the communication protocol between SDN control plane and data plane. With the deployment of SDN in reality, many security threats and issues are of great concern. In this paper, we propose a security situation awareness approach for SDN. This approach focuses on the attacks like network scanning attack, OpenFlow flooding attack, switch compromised attack and ARP attack in both data plane and control plane. Based on the features of these attacks, we use multiple observations hidden Markov model (HMM) to quantify the network status and then get the security situation assessment values for SDN. The proposed approach can also detect these four attacks and predict the network status based on HMM when given a sequence of observed feature values. We build a test scenario to simulate our approach with Ryu controller and OpenFlow switch and prove the feasibility of this approach.
TL;DR: The evidence from experiments suggest that the proposed energy efficient cluster-based routing protocol method (called MLSEEP) gives better results than the existing protocols by the supplement of those techniques.
Abstract: In this paper, we propose a new power-aware routing protocol for Wireless Sensor Network (WSN) based on the threshold rate and fuzzy logic for improving energy efficiency. The cluster heads are elected based on the probability values of every node in WSN, which are calculated from the remaining energy of every node. Cumulative remaining node energy is used to calculate mean energy of the whole network of the current phase. The nodes with high probability will have more chances to be selected as the cluster head, which gathers packets from the cluster member via single hop communication. The cluster head forwards the gathered data to sink by using fuzzy control with multi-hop communication. Fuzzy control takes three parameters namely queue length of a node, the distance of a node from the base station, and the remaining energy of node. The evidence from experiments suggest that the proposed energy efficient cluster-based routing protocol method (called MLSEEP) gives better results than the existing protocols by the supplement of those techniques.
TL;DR: A multilayer clustering architecture for selection of forwarding node, rotation of cluster head, and inter and intra-cluster routing communication and results show that the proposed scheme successful achieve better results than TLPER and EADUC in energy consumption per node, end-to-end communication, hop count in cluster formation.
Abstract: Load balancing and energy conservation techniques are one of the significant constraints in the design of in software defined wireless sensor network (SD-WSN). Usually, clustering method helps the network in the minimum utilization of energy that results in enhancing network lifetime. Moreover, various nodes in the multi-hop network that are near to the base station drain their battery very quickly thus lead to creating hot spot problem in a network. To overcome such constraints, this paper proposes a multilayer clustering architecture for selection of forwarding node, rotation of cluster head, and inter and intra-cluster routing communication. The proposed scheme efficiently tackle the rotation of forwarder node by incorporating routing table (table list) at each node. Moreover, the rotation is performed by the consideration of two threshold levels of the residual energy of a node. Also, the exploitation of decision maker node, forwarder node, backup forwarder node, and non-forwarder node enhancing the routing strategy in a network. The performance of the proposed scheme is tested and evaluated by C programming language. The results show that the proposed scheme successful achieve better results than TLPER and EADUC in energy consumption per node, end-to-end communication, hop count in cluster formation.
TL;DR: The IACO algorithm is proposed, a variety of the basic Ant Colony Optimization (ACO) algorithm, to improve load balancing among the peers, where the effect of pheromone on the selected paths by ants is inverted.
Abstract: In recent years, the attractiveness of Peer-to-Peer (P2P) networks has been grown rapidly due to the easiness of use. The P2P system is a decentralized relationship model in which every party has the analogous abilities and either party can start a relationship session. In these networks, due to the high number of users, the resource discovery process becomes one of the important parts of the P2P networks. But, in many previously proposed methods, there is a common problem that is called load balancing. If the balance of workload is inefficient, it reduces the resource utilization. Therefore, in this article, we propose the Inverted Ant Colony Optimization (IACO) algorithm, a variety of the basic Ant Colony Optimization (ACO) algorithm, to improve load balancing among the peers. In the proposed method, the effect of pheromone on the selected paths by ants is inverted. In this approach, ants start to traverse the graph from the requester peer and each ant chooses the best peer for moving. Then, requirements and pheromone amount are updated. Finally, we simulate the method and evaluate its performance in comparison to the ACO algorithm in different terms. The obtained results show that the performance of the IACO is better than the ACO algorithm in terms of load balancing, waiting time and resource utilization.
TL;DR: It has been observed and proved that this proposed secured routing algorithm is capable of increasing the network performance in terms of improved packet delivery ratio, reduction in delay as well as false positive rate when compared with related secure routing algorithms.
Abstract: Mobile Ad-hoc Networks have distinct characteristics namely lack of centralized control and management, severe resource constraints in terms of energy level of nodes, computing power, frequent mobility and frequent change of topology. This dynamic nature of mobile adhoc networks lead to additional overhead in the provision of secured and stable routing. In order to address these issues, we propose a new integrated approach for secure routing approach in this paper which is made of two new algorithms called as the Trust based Next Forwarding Node Selection algorithm and Fuzzy Based Stable and Secure Routing algorithm that makes use of the trust based node selection procedure for providing efficient routing performance. The main contribution of this newly proposed node selection procedure is that this technique uses trust values to isolate the malicious nodes from the routing process in order to enhance the security. Hence, this proposed stable and secured routing technique performs reliable routing by selecting only trusted nodes with high residual energy and link stability. Another contribution of this work is the development of a Fuzzy Inference System which is used to handle uncertainty in the selection of trusted nodes and to identify the stable routes by performing qualitative analysis on trust values and link properties. From the implementation and testing carried out in this research work, it has been observed and proved that this proposed secured routing algorithm is capable of increasing the network performance in terms of improved packet delivery ratio, reduction in delay as well as false positive rate when compared with related secure routing algorithms.
TL;DR: A framework named FINDER (Finding Isolated Nodes using D2D for Emergency Response) to locate-and-reconnect the isolated Mobile Nodes in the disaster zone, so that the damage to assets and loss of life can be minimized.
Abstract: Public Safety Network communications technologies are at crossroads with next-generation networks to render better solutions and applications that can manage disaster efficiently. The fifth generation (5G) network is poised to have a guaranteed network connection, even in the case of partial dysfunction of cellular infrastructure due to disaster. In this paper, we have designed a framework named FINDER (Finding Isolated Nodes using D2D for Emergency Response) to locate-and-reconnect the isolated Mobile Nodes (MNs) in the disaster zone, so that the damage to assets and loss of life can be minimized. If the cellular link is non-existent over a disaster, the MNs under the impaired Base Station (BS) switch to the Device-to-Device (D2D) communications mode, and a critical D2D network is formed. The MNs in the disaster zone can reach an active network through a neighboring BS or a Wi-Fi access point. A multi-hop D2D communications based on hybrid Ant Colony Optimization is adopted to increase the energy efficiency of individual nodes and the overall network lifetime. Further, dynamic clustering curtails the numbers of active participating nodes, and data aggregation shrinks the number of packets in the network. Assistance from the Software-Defined Networking (SDN) controller at the BS benefits to have an intelligent and reliable connectivity to the MNs in the disaster zone. Our proposal FINDER is implemented using MATLAB, and the simulation results show that our framework extends the network lifetime with improved message delivery probability.
TL;DR: In this article, the authors proposed an efficiency-aware switch migration (EASM) scheme to balance the controllers' loads and improve migration efficiency in distributed multi-controller deployment.
Abstract: Distributed multi-controller deployment is a promising method to achieve a scalable and reliable control plane of Software-Defined Networking (SDN). However, it brings a new challenge for balancing loads on the distributed controllers as the network traffic dynamically changes. The unbalanced load distribution on the controllers will increase response delay for processing flows and reduce the controllers’ throughput. Switch migration is an effective approach to solve the problem. However, existing schemes focus only on the load balancing performance but ignore migration efficiency, which may result in high migration costs and unnecessary control overheads. This paper proposes Efficiency-Aware Switch Migration (EASM) to balance the controllers’ loads and improve migration efficiency. We introduce load difference matrix and trigger factor to measure load balancing on controllers. We also introduce the migration efficiency problem, which considers load balancing rate and migration cost simultaneously to optimally migrate switches. We propose EASM to efficiently solve to the problem. The simulation results show that EASM outperforms baseline schemes by reducing the controller response time by about 21.9%, improving the controller throughput by 30.4% on average, maintaining good load balancing rate, low migration costs and migration time, when the network scale changes.
TL;DR: Simulation has been done and it is shown that the main characteristics such as reduction of computational overhead and increasing reliability against of attacks in the network are improved compared with other efficient algorithms in this field.
Abstract: Rapid developments in the field of processors and radio technology have provided the context of small sensor nodes which are able to communicate in wireless sensor networks. But data security is restricted by these factors. An intelligent trust management plan needs to be applied for detection of the reliability of sensor nodes to distinguish between malicious nodes from other nodes. In this paper a trust-based energy-aware routing algorithm has been proposed. Considering direct and indirect trust of nodes and energy saving issue, the routing function metrics are optimized by Gravitational Search Approach. This routing method is called Energy-aware Trust-based Gravitational Search Approach (ETGSA). Simulation has been done by NS-2 and it is shown that the main characteristics such as reduction of computational overhead and increasing reliability against of attacks in the network are improved compared with other efficient algorithms in this field.
TL;DR: A survey on state of the art on the 5G integration with the SDN is presented and the role of virtualization is highlighted and an analysis of abstraction for resource allocation in SDN based cellular network is provided.
Abstract: The deployment and operation of Fifth Generation (5G) network is expected in 2020. The 5G aim to provide high throughput, reduced latency, increased capacity and a shift from service-orientation to user-orientation in requirements and innovations. The users require an efficient resource allocation and management. The closed infrastructure and ossified services of existing networks lead to complex, inefficient resource allocation and underutilized network resources especially in wireless networks. Different allocation techniques are proposed based on the utility gain of a service provider and user satisfaction. Software Defined Network (SDN) and Network Function Virtualization (NFV) are a hot topic in the wired and wireless network for the network management. SDN based 5G network is another stepping research domain for resource allocation and connectivity in 5G network. In this paper, a survey on state of the art on the 5G integration with the SDN is presented. A comprehensive survey is presented for different integrated architectures of 5G cellular network based on SDN and NFV form part of the paper. Different architectural integration of other wireless technologies such as 3G/4G, LTE, WiMAX etc. are highlighted in term of SDN and network virtualization. Furthermore, the paper focuses on the methods and techniques adopted for resource allocation for SDN based cellular network and elaborate requirements for futuristic 5G networks. It also highlights the role of virtualization and provides an analysis of abstraction for resource allocation in SDN based cellular network. In the end, the potential problems and issues are also comprehended in this article.
TL;DR: The experimental results show that this scheme can well achieve the load balancing and failure recovery of the distributed controllers on the basis of the secure communication between the cooperative platform and the controllers.
Abstract: Software-Defined Networking (SDN) is a network architecture which has received much attention in recent years. It represents the future of network industry. As the Internet continues to exceed expectations of rapid development, a single centralized controller can be extended to distributed multiple controllers architecture. However, the distributed multiple controllers architecture is facing more and more serious challenges in the aspects of scalability, stability and security. In order to solve these problems, we propose a smart cooperative platform for load balancing and security on SDN distributed controllers, named SCPLBS. The collaborative platform is built on the control plane. A secure communication mechanism based on message authentication code is adopted between the cooperative platform and the controllers. Collaborative platform uses a data collection algorithm adapting to data fluctuation to collect the controllers’ status and load information. Collaborative platform takes strategy to achieve the distributed controllers load balancing and failure recovery. In this paper, we use the Floodlight controller and develop the cooperative platform based on restlet framework. We test the effectiveness of the proposed scheme. The experimental results show that this scheme can well achieve the load balancing and failure recovery of the distributed controllers on the basis of the secure communication between the cooperative platform and the controllers.
TL;DR: The aim of this paper is to highlight the fundamental Fog three-tier model and emphasize its advantages, challenges and possible attacks, and highlight Fog’s real importance.
Abstract: Internet of things (IoT) services have been accepted and accredited globally for the past couple of years and have had increasing interest from researchers. Fog architecture has been brought up in IoT for enhancing its competence in a variety of applications. Fog computing is an emerging concept that transforms centralized Cloud to distributed Fog by bringing storage and computation closer to the user end. The aim of this paper is to highlight the fundamental Fog three-tier model and emphasize its advantages, challenges and possible attacks. This paper will also focus on Fog computing models pertaining to IoT scenario that have been developed over the period to conquer the challenges of existing Fog computing architecture. This paper also highlights Fog’s real importance which will include a review of scenario-based examples. Moreover, open issues have also been discussed to be worked upon in future.
TL;DR: The proposed method to control attitude of a wheel-legged robot with four legs and four wheels using active disturbance rejection control (ADRC) is illustrated in the electric parallel wheel-leg robot system.
Abstract: Robot systems are complex systems which include many CPUs and communication networks. In order to control attitude of a wheel-legged robot, a cooperative control framework is designed. The wheel-legged robot has four legs and four wheels, and the wheels are installed on the foot. The wheel-legged robot can adjust its attitude by controlling the position of each leg when it is walking with wheels. In addition, in order to avoid the wheels dangling during the driving of the robot, an impedance control based on force method is applied. Moreover, the centroid height of the robot is controlled to guarantee that the robot has maximum motion space. The cooperative control framework is implemented in a host CPU and four slave CPUs. The host CPU calculates the position of each leg by combining the control variables of attitude controller, centroid height controller and impedance controller based on force. The slave CPUs receive the position command, and then control the position of each leg with active disturbance rejection control (ADRC). ADRC can deal with the internal modeling uncertainty and external disturbances. The application of the proposed method is illustrated in the electric parallel wheel-leg robot system. Experimental results are provided to verify the effectiveness of the proposed method.
TL;DR: In this article, an efficient Enhanced Fuzzy C means and Adaptive TDMA Scheduling (ECATS) method is proposed as a protocol to facilitate communication within the network.
Abstract: The energy consumption and the Quality of Service (QoS) are the major concern in Wireless Sensor Network (WSN). Dissimilar sensor nodes in the heterogeneous network are the efficient network strategy. Since it has some capabilities like enhanced processing ability, additional memory power and distant transmission ability. For effective clustering and route formation among the pair of nodes, an efficient Enhanced Fuzzy C means and Adaptive TDMA Scheduling (ECATS) method is proposed as a protocol to facilitate communication within the network. So that data packets can be delivered within time to the mobile sink. Here introducing the novel protocol named as Neural Elliptic Galois (NEG) cryptography for efficient data security. Also, the location privacy (Threshold fault node detection) is taken in to account for better security. Cluster head (CH) selection is done on the basis of energy to manage the data aggregation among a number of nodes in the network. Here, hybridization of TDMA based Ant Lion Optimization scheduling is introduced for optimal CH selection is used for better energy efficiency. Finally, ECATS can be done with optimized WSN performance metrics such as packet delivery ratio, throughput, minimum energy consumptions, communication overheads & end to end delay. Thus, we can increase the reliability of the network while minimizing the energy consumption and the results are compared with few existing routing protocols using MATLAB simulation tool.
TL;DR: A cross-layered system, which leverages the Software Defined Networking (SDN) paradigm and the distributed Fog architecture, for network slicing and task offloading to provide dynamic, security-aware Vulnerability-Assessment as a service for large ICT infrastructures is proposed.
Abstract: Modern ICT ecosystems such as healthcare environments (hospitals, care-centers etc.), operate in different abstraction layers (cloud, fog, extreme-edge) and comprise large numbers of network entities such as terminals, devices, sensors or even specialized appliances (virtual or physical). It is common in such environments, that several network entities with intermittent connectivity, join and leave the network in an unstructured and unsupervised manner (Wi-Fi access-points, BYOD policies, IoT, etc.). Such devices of frivolous nature, or even trusted devices/terminals, are prone to security vulnerabilities, since they are operated by regular, non-expert users who are not aware of any security aspects whatsoever. To effectively manage and proactively protect such large, complex and multilayered networks, dedicated personnel (system administrators, security specialists etc.) must be employed and specialized appliances must be deployed. On the other hand, modern cyber-warfare has become even more elaborate and insightful. Thus, ICT infrastructures must continuously evolve and adapt to the everchanging cyber-threats, which is a rather cumbersome and expensive task to accomplish. Towards addressing the above-mentioned issues, this paper proposes a cross-layered system, which leverages the Software Defined Networking (SDN) paradigm and the distributed Fog architecture, for network slicing and task offloading to provide dynamic, security-aware Vulnerability-Assessment as a service for large ICT infrastructures. The presented system provides seamless assessment for all existing and newly introduced network entities against all known security vulnerabilities, certifies them through a Common Vulnerability Scoring System (CVSS), classifies them according to the cyber-threat they introduce, and finally assigns them to a connectivity-appropriate VLAN. The presented system was preliminarily evaluated under a controlled-conditions simulation environment.
TL;DR: This work presents the pruneable sharding-based blockchain protocol by utilizing the sharding technique and PBFT(Practical Byzantine Fault Tolerance) algorithm in the improved Rollerchain, which has high efficiency, slow cubical dilatation, small capacity expansion and high scalability.
Abstract: As a distributed ledger technology, the block-chain has gained much attention from both the industrical and academical fields, but most of the existing blockchain protocols still have the cubical dilatation problem. Although the latest Rollerchain has mitigated this issue by changing the blockheader’s contents, the low efficiency, severe capacity expansion and non-scalability problems still hinder the adoption of Rollerchain in practice. To this end, we present the pruneable sharding-based blockchain protocol by utilizing the sharding technique and PBFT(Practical Byzantine Fault Tolerance) algorithm in the improved Rollerchain, which has high efficiency, slow cubical dilatation, small capacity expansion and high scalability. Moreover, the pruneable sharding-based blockchain protocol is certifiably secure and scalable. The experimental results show the protocol has good performance.
TL;DR: This work proposes a simple and effective method for semi-supervised deep learning that improves upon the performance of the deep learning model without pre-training and applies it to large-scale unlabeled data sets.
Abstract: To facilitate the utilization of large-scale unlabeled data, we propose a simple and effective method for semi-supervised deep learning that improves upon the performance of the deep learning model. First, we train a classifier and use its outputs on unlabeled data as pseudo-labels. Then, we pre-train the deep learning model with the pseudo-labeled data and fine-tune it with the labeled data. The repetition of pseudo-labeling, pre-training, and fine-tuning is called naive semi-supervised deep learning. We apply this method to the MNIST, CIFAR-10, and IMDB data sets, which are each divided into a small labeled data set and a large unlabeled data set by us. Our method achieves significant performance improvements compared to the deep learning model without pre-training. We further analyze the factors that affect our method to provide a better understanding of how to utilize naive semi-supervised deep learning in practical application.
TL;DR: A DEHCIC (Distributed Energy-aware Hexagon based Clustering algorithm to Improve Coverage) algorithm that considers energy and topological features such as the number of mobile neighbor nodes and number of neighbor nodes for electing the cluster heads and can prolong the coverage lifetime and improve the network coverage effectively.
Abstract: Due to the random deployment of Wireless Sensor Network (WSN) nodes in dangerous and inaccessible environments and their sensing radius limitations, complete coverage of the monitoring area cannot be achieved. Clustering techniques, applying the mobile nodes, and adjusting the sensing radius of sensor nodes are regarded as practical techniques to improve the coverage and reduce the energy consumption. The challenges including, how to grouping the nodes, selecting the cluster heads, managing the mobility of mobile nodes, and scheduling sleep intervals should be considered in the hybrid techniques to improve the coverage with minimum overlapping. In this paper, we propose a DEHCIC (Distributed Energy-aware Hexagon based Clustering algorithm to Improve Coverage) algorithm that considers energy and topological features such as the number of mobile neighbor nodes and number of neighbor nodes for electing the cluster heads. In addition, DEHCIC attempts to cover the holes as much as possible by the static sensor nodes so that if it is not possible, the closest mobile will cover the coverage holes. Moreover, the DEHCIC algorithm retains the sensor nodes in the active mode that cover the interest points; also, it puts others into the low-powered sleep mode. The simulation results show that the proposed algorithm reduces dependency on the movement of mobile nodes and with the minimum number of active nodes can prolong the coverage lifetime and improve the network coverage effectively.