International Journal of Internet Protocol Technology (13 papers in press)
Broadcasting Algorithm Based on Successful Broadcasting Ratio and Energy Balance of Nodes in Mobile Ad Hoc Networks
by Yanping Yu, Long Li, Keyan Liu, Yichen Deng, Xue Su
Abstract: Blind flooding in mobile ad hoc networks could result in a large number of redundant packets, which causes the broadcast storm problem and broadcast unreliability, leading to overall network performance degradation. In order to mitigate the broadcast storm, improve the broadcasting reliability and prolong the lifetime of networks, we propose a Broadcasting algorithm based on Successful broadcasting Ratio and Energy Balance of nodes (BSREB) in mobile ad hoc networks. In BSREB, each node in the network calculates its own forwarding probability according to its successful broadcasting ratio and its own residual energy. Then, the node retransmits the received packets with the forwarding probability. The usual ways to deal with broadcast problem generally use local topology information, for example, the number of neighbors. However, heavy traffic will aggravate the broadcast problem. Thus, we introduce the successful broadcasting ratio which reflects both local topology and traffic to determine the forwarding probability. To prolong the network lifetime, energy balance strategy is adopted by using residual energy to determine the forwarding probability. Since the forwarding probability of each node is determined by its own successful broadcasting ratio and residual energy, which can be acquired without extra packet exchanging and complex calculation, BSREB is simple and easy to implement. The simulation results show that BSREB can achieve a lower latency and higher reachability. Meanwhile, the BSREB algorithm has a strong adaptability to node mobility.
Keywords: mobile ad hoc networks; broadcast storm; broadcast unreliability; successful broadcasting ratio; energy balance; forwarding probability.
Wireless sensor network node deployment based on multi-objective immune algorithm
by Shanshan Li
Abstract: Wireless sensor network (WSN) is made up of a large number of low-cost wireless sensor nodes, which can collect all types of data in its lifetime. Node deployment of WSN is a NP complete problem, and it can significantly influence the network coverage and energy consumption in WSN. In this paper, we try to exploit multi-objective immune algorithm to solve the node deployment problem in WSN. The proposed node deployment algorithm aims to maximize the degree of network coverage and minimize the energy consumption. In the proposed multi-objective immune algorithm, each antibody refers to a candidate solution in node deployment process, and the antibodies are randomly initialized with a specific range. In addition, we design a fitness function by two ranking modes. Finally, experiments are conducted to test the performance of the proposed algorithm. Experimental results demonstrate that the proposed can both enhance the network coverage degree and reduce the energy consumption by minimizing the moved distance.
Keywords: Wireless sensor network; Node deployment algorithm; Multi-objective immune algorithm; Network coverage; Energy consumption.
An Improved Routing Algorithm in Communication Network Based on Cloud Computing Technology
by Shuaiqiu Xiang, Dongsheng Cheng, Zhenjia Zhu
Abstract: Traditional communication network routing algorithm mostly takes the distance between the nodes as the weight coefficient, completing the routing selection based on the shortest distance between the source node and the target node without considering the problem of energy consumption between nodes. This algorithm is not suitable for communication network. This paper proposed a research of communication network routing algorithm based on cloud computing technology. Our research designed cloud computing platform which applies to big data through the introduction of different types of routing protocols. The optimal routing selection of communication network and node energy balanced load provided the data storage and computing environment. In the route optimization stage, this research used pheromone anycast mechanism for selecting route on the basis of the importance of heuristic factor on the path and the residual pheromone, avoiding the algorithm fall into local optimum. Taking the energy consumption of nodes as weight for the routing updates and adjustment in nodes-cluster, we controlled the energy consumption of inter-nodes at the optimal level. Simulation results show that the proposed communication network routing algorithm has low average error rate of network data, high link reliability and good energy saving effect.
Keywords: Cloud computing technology; Communication network; Routing algorithm.
Research on Mobile Internet Big Data Detecting Method for the Redundant Data
by Guanghua Yu
Abstract: To address the low efficiency of the traditional cleaning method, this paper presents a bulid path tree clean method based on split method for identification of the redundant data, Through the traditional mobile Internet big data cleaning process for identifying the redundant data is analyzed, by using median filtering algorithm, the features of redundant data are extracted. Redundant data is classified by support vector machine (SVM), and the redundant data is identified by self-organizing feature map. Based on this, the redundant data identification model is built, which can clean the redundant data in mobile internet big data. Comparing with the classical methods, the simulation results show that the improved method is effective for the redundant data clean.
Keywords: Mobile Internet; Big Data; Redundant Data; Detection; Cleaning Methods; Optimization.
Research and Realization of Similar Information High Precision Purification and Mining Technology
by Ruiling Zhou
Abstract: Similar information purification and mining methods in the past are generally of low precision and weak usability. Therefore, we propose a method to dynamically update time series, that is, a similar information high precision purification and mining method based on time series updating. The method is used to implement regional linear time similar information time series by using rise analysis and linear regression analysis. Extreme value standardization method is used to collate linear region so that the data in time series can be compared in parallel and the description of similar information feature is realized. Vertically align the two head-ends of time series to be purified; high precision purification is achieved by calculating the similarity of characteristics similarity displacement representation between two segments of similar information. Experimental verification shows that compared with previous methods, the recall value is the highest among different methods for 5 data set, and the time cost of the proposed method is shorter than other methods. It was believed that .purification and mining performance of the proposed method is stronger with shorter time cost.
Keywords: Similar information purification; Mining; Time series; Linear regression analysis; Extreme value standardization.
Security Access Control Policy of Information System under Multi-domain Mode
by Jun Dong
Abstract: The research of this article is ensuring the security implementation of multi-domain secure access control behavior, through the study on unified description language for security policy, strategy conflict classification and strategy conflict detection. Based on current related technologies and combined with the feature of multi-domain system, the framework of access control strategy management is proposed, which specified the content of access control management. We adopt XACML that has better across-platform and scalability to describe the policy uniformly. Then access control policy description template based on XACML is provided and the security policy conflict is classified reasonably according to the factors causing conflict. Then we put forward a model to detect the inconsistency of RBAC and RH in time and space constraint, to design an access control model which needs pruning and collection. It uses logic analysis to strength the conflict detection for developing security policy integration. The simulation shows our work can provide filter on quantities of irrelevant policy and return potential policies to solute the conflict.
Keywords: access control; multi-domain; XACML; conflict detection; inconsistency; RBAC.
An Improved Hybrid Genetic Algorithm for Multi-User Scheduling in 5G Wireless Networks
by Mohamed Saad
Abstract: Motivated by the importance of allowing simultaneous user transmissions, especially in fifth-generation (5G) systems, this papers addresses the problem of maximizing the number of links that can be activated simultaneously in a wireless network. Solving this problem under the physical signal-to-noise-plus-interference (SINR) model has been demonstrated to be NP-hard. Most previous studies focused on approximation algorithms with guaranteed performance ratios. Although such algorithms have tremendous theoretical value, their surprisingly low approximation ratios limit their practicality. Therefore, some recent studies introduced alternative solutions based on meta-heuristics, such as the genetic algorithm. This paper improves upon a previously proposed genetic algorithm by incorporating problem-specific knowledge into the algorithm. This results in a novel hybrid genetic algorithm that activates almost the same number of links as compared to the original one, while reducing the running time by more than 97%.
Keywords: Link scheduling; wireless network capacity; hybrid genetic algorithms.
Extended Common Information Model for Distribution Network Production Repair Platform
by Jun Ma, Hua Leng, Jiran Zhu, Haiguo Tang
Abstract: In order to optimize the process of fault repairs for distribution network, it is necessary to realize standardization and integration of information for different IT systems in DMS (Distribution Management System) through CIM (Common Information Model) . According to the demand of information integration for fault repairs in distribution network, the paper puts forward CIM extensions for feeder model, assert model, fault handling model etc. in compliance with IEC61968. The proposed CIMs have been used for the information integration between the DNPRP (Distribution Network Production Repair Platform) and other IT systems. And it is illustrated how to use the integration platform based on CIM to carry out the repair business and improve the quality and efficiency of the distribution network repair. Practical applications of these extension CIMs show that the extension CIMs are reliable, efficient and convenient to exchange information.
Keywords: Common information model; IEC61970/61968; information integration; Distribution Network Production Repair Platform.
A novel Eliminating Method of Network Invalid Node Based on Credibility Scheme
by Zhichao Wang, Liang Tang, Min Li
Abstract: Traditional invalid node elimination methods is easy to be affected by the interference of invalid node collusion attack and get high invalid node communication success rate. In order to eliminate the influence coused by the interference of invalid node collusion attack, obtain a more effective method for eliminating invalid nodes, A novel Eliminating Method of Network Invalid Node is proposed in this paper based on credibility scheme. Firstly, we analysis the basic structure of invalid node elimination based on credibility scheme, and Opinion Distance based Reputation Evaluation model (ODRE) is proposed. According to the communication signals between nodes, this model obtains the nodes local credibility concept by adopting the updated subjective logic algorithm and updates the concept of node credibility. In order to solve the collusion attack of invalid nodes, concept distance is adopted to carry out the implementation on the recommended concept and eliminate the invalid views. Combination computing comes from different nodes credibility concept. Based on the reliability of the credibility concepts, invalid nodes are detected and excluded. Simulation results show that, the method adopts ineffective node elimination mode, which improves 30% -60% of the performance than that of the other two methods in the state of collusive attack. In the absence of attack, the time this method used in eliminating invalid nodes is reduced by 38%, which indicates that the proposed method has higher probability of constraining the invalid nodes collusive attack node.
Keywords: Network communication; Invalid node; Effective elimination; Credibility Scheme.
Scenario-based Trustworthiness Verification for Systems of Internet of Things
by Junhua Zhang, Yi Zhu
Abstract: Assessment of the running quality for Internet of Things (IoT) is an important scientific question. In this paper, we adopt model checking to solve this question. We extend living sequence chart (LSC) with time to model the demand for a system of IoT, and further add probability element to model the system itself. We present a framework to transform LSC with extensions into corresponding automata based on meta-model. So the model checking question between LSCs is changed into for automata. Through modifying and composing the obtained automata, we can obtain a standard probabilistic timed automaton. By inputting it into probabilistic model checker PRISM, we can calculate a probability, which reflecting the satisfying level of the original system to the demands. Since the system model which we use is more intuitive than classical formal model, it can be used more easily.
Keywords: Internet of Things; model checking; LSC; Trustworthiness; meta-model; probabilistic timed system.
Data Switching Network QoS Routing Optimization Based on ACO
by Ziyi Tao
Abstract: To improve the stability of network data transmission and reduce the network consumption, the routing optimization of computer network using ant colony optimization(ACO) algorithm is studied in this article. A mathematical model of routing optimization is introduced and analyzed to explain possible approaches to improved the performance of traditional ACO algorithms. Our scheme introduces two factors: time delay and bandwidth to the heuristic function, reflecting the comprehensive information of each link to promote the comprehensiveness of ants in finding optimum solution. Then, the advanced strategy of state transition rule and pheromone updating rules are also proposed to raise the convergence speed of ACO. In simulations, we test relative factors including success rate, speed, and transmission delay of path finding. In the weighted connected graph with 20 points, the optimal path can be achieved using fewer iterations. In three standard network test data sets of Matlab, the success rate gets 93.1%, 92.4% and 90.5% respectively. By the comparison of tansmission delay and processing time, it also shows performance compared to classic ACO algorithms.
Keywords: QoS routing; ACO; delay; state transition; pheromones.
An efficient implementation of FPGA based high speed IPSec(AH/ESP) core
by Muzaffar Rao, Thomas Newe
Abstract: The IPSec (Internet Protocol Security) is used to secure the IP traffic. The IPSec protocol was designed to fulfill the need to provide security at the network level, so that all the higher-layer protocols in the OSI model could take advantage of it. There are two main IPSec protocols, AH (Authentication Header) and ESP (Encapsulation Security Payload). Each protocol supports two modes of operation, transport mode and tunnel mode. Cryptographic algorithms are a vital part of IPSec, which is used today to ensure information security in nearly all modern communication systems. The implementation of IPSec is a computationally heavy task that affects the high speed network performance. To overcome this issue, the best possible solution is hardware implementation. For a hardware implementation the FPGA (Field Programmable Gate Array) platform is considered as one of the best solutions because of its re-configurability and high performance capabilities. The work presented here gives a complete FPGA based implementation of IPSec. This includes both IPSec protocol formats, IPSec-AH and IPSec-ESP. Both IPSec formats are implemented using transport mode and tunnel mode operations. IPSec is not bounded to use any specific cryptographic algorithms; here IPSec is used with the AES (Advanced Encryption Standard) and SHA-3 (Secure Hash Algorithm-3) algorithms to provide confidentiality and integrity services respectively. The authentication service is provided using a HMAC scheme and the replay protection service is provided using the IPSec supported sequence number. The performance results from the real-time implementation show that the speed of operation achieved is in the Gbps range. The best achieved results with respect to TP (throughput), number of slices (area) and TPA (Throughput/Area) are as follow: highest throughput is achieved on Virtex-6 for IPSec-AH tunnel mode i.e. 2.16Gbps, highest TPA and minimum area utilization is achieved on Virtex-06 for IPSec-AH transport mode i.e. 8,373 slices and 0.25 TPA. To the best of the authors knowledge this is the first complete implementation of the IPSec protocol on an FPGA device.
Keywords: IPSec; FPGA; AH; ESP; SHA-3; AES.
A Trusted Authentication Model for Remote Users under Cloud Architecture
by Yu-xin SONG, Zhong-xia LIAO, Yan-hua LIANG
Abstract: Trusted computing is principle measure to ensure the security of computing platform, which improves the creditability by functions including data protection, identity authentication, integrity measurement, storage and reports. This article studies the remote identification for TPM. It introduces DAA anonymous authentication technology to traditional PKI and adopts improved DAA scheme to provide trusted identity authentication, secure channel establishment and sub-certificate update operation. We propose a new model for identity authentication under trusted computing environment. The scheme construct a safe elliptic hyperbola by ISSUER and generate DAA certificate, which awards zero knowledge proof to each platform to achieve DAA certificate respectively. Then the code service provided by OPENSSL is used to establish PCA and simulated the AIK certificate process according to creation of AIK certificate. Finally, the experiments are performed under VMware-workstation and SUSE virtual machines, with TPM Emulator and TPM chips simulation, to verify the feasibility of remote user trustworthiness authentication scheme.
Keywords: trusted computing; authentication; DAA; AIK; TPM; cloud computing.