Forthcoming articles

International Journal of Internet Protocol Technology

International Journal of Internet Protocol Technology (IJIPT)

These articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Register for our alerting service, which notifies you by email when new issues are published online.

Open AccessArticles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.
We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Internet Protocol Technology (39 papers in press)

Regular Issues

  • Simulation Research of Nodes Target Tracking Algorithm Based on Clustering in Wireless Sensor Network   Order a copy of this article
    by Kaibin Wei 
    Abstract: Since sensor nodes are constrained in cost and volume, they have limited ability in data storage and processing. Therefore, the routing algorithm needs lower time and space complexity for energy conservation. This article design a dynamic cluster head selection mechanism based on backoff time of residual energy of nodes, aiming at energy conservation and low complexity for the algorithm. At the phase of cluster head selection, we reduce the backoff time of nodes with more energy, so it can win the competition in cluster head selection and control the number of cluster heads, by controlling the radius of cluster lead broadcasting. Then the cluster member nodes are chosen according to the hop range to cluster head, whose weights are computed by the distance to cluster head and the residual energy. At the premise of saving self-energy, it can choose different cluster head and save the energy of cluster head to achieve global energy balance and prolong the network lifetime. The simulations verify that the improved algorithm can make reasonable distribution location of cluster head. The membership has close number and the reasonable topology ensure the global consumption of network.
    Keywords: WSN; target tracking; LEACH; energy efficient; cluster head.

  • Integrated Monitoring Algorithms for Software Data Security Situation on Private Cloud Computing Platform   Order a copy of this article
    by Ying Liu, Haitao Liu 
    Abstract: Aiming at the problems of large monitoring error, poor real-time performance, serious missing detection of abnormal data and high energy consumption in current data security monitoring methods, a comprehensive monitoring algorithm of software data security situation for private cloud computing platform based on scenario entropy is proposed. Based on data redundancy clearance and data security mechanism, data security situation monitoring indicators are selected, and the scenario entropy difference of each index calculated is taken as monitoring target. The experimental results show that the detection error of this method is between 1% and 3%, and it has high monitoring accuracy. The anomalous response delay is between 0.5 and 1 μs, which has high response efficiency. The loss rate of abnormal data is between 0.2% and 0.5%, and the rate of missing abnormal data is low. The monitoring energy consumption is between 60NJ and 75NJ, and the monitoring energy consumption is low.
    Keywords: private cloud; data; security situation; monitoring;rnrn.

  • Wireless Sensor Networks Secure Routing Algorithm Based on Trust Value Computation   Order a copy of this article
    by Qingzeng Xu 
    Abstract: In this paper, the security attack status in WSN is analyzed, and integrated with the features of WSN, a safety trust evaluation mechanism is proposed for WSN. It evaluates the nodes by delivery behavior of sensor nodes and considers the subjective evaluation with trust value recommendation of other nodes, to establish trust evaluation model which is easy to be implemented. It refers to indirect reputation parameters of neighbour nodes and integrates them to the energy reputation parameters, to achieve comprehensive evaluation value of nodes. The credibility is determined by the degree that is beyond or lower that the threshold. Simultaneously, we also take into account the link quality of links and put forward improved routing setting strategy. The simulation results indicate the model can reflect the credibility of nodes accurately and it can effectively protect malicious libel, which also improves the system security and reliability, to shoe the fairness of network.
    Keywords: trust value; WSN; neighbour node; TCRA; reputation.

  • Big Data Network Security Index Correlation Measure Based on the Fusion of Modified Two Order Cone Programming Model   Order a copy of this article
    by Xiaohai Lan 
    Abstract: The existing technology can not meet the needs of large data network security index measurement in the era of big data. New theories and methods need to be explored to support the application of large data. In this paper, an improved second-order cone programming model (MTOCPM) is used as the data expression vector. The power spectral density feature of large data is extracted from a large number of noisy and fuzzy data. The second-order cone programming model of large data information flow is constructed by rough concept lattice method. Combining with the finite convergence of the second-order cone programming model algorithm, the reliability of each clustering sample is measured, and the accurate search of data clustering center is realized. Experiments show that the method based on MTOCPM fusion can not only greatly reduce the communication cost between network nodes, but also improve the global measurement accuracy by about 10%.
    Keywords: Big Data; Modified Two Order Cone Programming Model; Network Security; Correlation Measure.

  • Research on the On-Demand Scheduling Algorithm of Intelligent Routing Load based on SDN   Order a copy of this article
    by Zheng Ma, Yan Ma, Xiaohong Huang, Manjun Zhang, Bo Su, Liang Zhao 
    Abstract: Aiming at the traditional on-demand scheduling method of routing load, there are many problems, such as long time to complete the total task and high energy consumption. An on-demand scheduling method of routing load based on multiple SINKs is proposed. The total routing load task is sent from multiple SINK nodes to SDN network. After receiving the sub-tasks sent by SINK, the intra-cluster nodes begin to collect network data together. After the cluster heads fuse the network data transmitted by the nodes, the results are sent to SINK nodes. As a result, the shortest total task completion time is obtained, and the shortest total task completion time is used as the objective function of routing load scheduling on demand. Ant colony algorithm is used to solve the problem and complete the scheduling. Experimental results show that the proposed method has shorter completion time and lower energy consumption of total task.
    Keywords: SDN; routing load; on-demand scheduling; intelligence.

  • Graph-based Recommendation by Trust   Order a copy of this article
    by Liejun Wang, Long Pan, Ji-Wei Qin 
    Abstract: The recommendation system as an effective tool is used to alleviate the information overload problem, and is being applied to personalized services. In recommendation, users ratings as explicit feedback data can clearly express users preference, however explicit feedback data has a natural defect that users interest for an item would varies in context such as emotions, time etc. and the ratings couldnt reflect the changing. In this paper, a novel graph recommendation algorithm is presented based on users trust relation that is regarded as implicit feedback data to calculate similarity to enhance the performance for Top-K recommendations. By evaluating the presented algorithm and compared to four competitive algorithms on the four real world datasets, the results show that the presented algorithm performs better than other algorithms in Precision, Recall and Converge.
    Keywords: Recommendation; Graph-based Algorithm; Implicit Feedback; Social Networks.

  • A novel optimal road layout model based on urban cloud data   Order a copy of this article
    by Lede Niu, Liran Xiong 
    Abstract: The model in traditional methods is poor in stability, efficiency and accuracy in urban road layout. In order to solve those problems, an optimal road layout model based on urban cloud data is proposed in this paper. In this model, the hardware is supplemented by GIS application software and Arc GIS technology is adopted for integrated development mode; geographic information is processed according to urban cloud data. Starting from road layout, simulation software such as VISSIM and VISSUM is combined on the designed model for traffic data sharing and simulation decision; software is designed based on calibration processing of 3S optimal urban road layout model parameters and traffic data are collected for road layout design, and the optimal layout is extracted through the genetic algorithm.The experimental results show that the method has high stability and design efficiency.
    Keywords: Cloud data; GIS; Arc GIS technology; optimal layout; model; genetic algorithm.

  • A Novel Network Intrusion Prevention System Based on Android Platform   Order a copy of this article
    by Guanlin Chen, Kunlong Zhou, Yubo Peng, Liang Zhou, Yong Zhang 
    Abstract: With the popularity of wireless networks in recent years, the mobile phone users accounted for 95.1% in China. Meanwhile, the security issues cannot be ignored. The cost of wireless attacks is getting lower, and there are more frequent occurrence of wireless fishing, wireless crack and other security events. However, the current traditional intrusion prevention method can only cope with relatively simple attack scenarios. Therefore, the development of new intrusion prevention system is particularly important. In this paper, we design and implement a novel network intrusion prevention system, which uses VpnService and TcpDump to capture traffic as a data source, cooperates with the single-step attack rule signature database and the attack chain signature database to perform real-time intrusion detection, and combines intent analysis to detect intrusion intention-behavior and output alarms. The results show that the system is effective in recognizing typical wireless attacks.
    Keywords: WiFi; Intrusion Prevention System; Intrusion Intent; TcpDump.

  • A novel Neuro-Fuzzy based localization system for WSN using node proximity   Order a copy of this article
    by Somnath Sinha, Aditi Paul 
    Abstract: Localization is a challenging issue in wireless sensor network. This paper describes a neural network and fuzzy logic based approach for localization in Wireless Sensor Network (WSN). The Received Signal Strength Indicators (RSSIs) of some anchor nodes are used as basic parameter to estimate the location of sensor nodes. Using Fuzzy Logic the RSSI values of anchor nodes are categorized into some predefined regions and RSSI patterns are generated using Fuzzy Inference rules. These patterns are then used as input to a trained Neural Network (NN) for estimating a proximity factor of sensor nodes which in turn is used to calculate their positions. The RSSI patterns are used to find out the weighted position of the anchor nodes which when divided by the proximity factor gives the estimated position of the sensor nodes. A modified back propagation method is used to train the neural network. Proposed model is tested using network simulator NS2 and result shows accuracy up to 95%.
    Keywords: wireless sensor network (WSN); fuzzy logic system; localization; receive signal strength indicator (RSSI); neural network; proximity.

  • Unsaturated traffic oriented spatial clustering multiusers MAC protocol for the next generation WLAN   Order a copy of this article
    by Yong Li, Bo Li, Mao Yang 
    Abstract: The next generation wireless local area network (WLAN) needs to significantly improve area throughput in high-dense deployment scenarios. Facing to the interference spread problem of OFDMA MAC, some existing studies introduce spatial clustering group-based OFDMA protocol (SCG-OFDMA), which enables geographically close nodes to send uplink OFDMA data simultaneously. However, SCG-OFDMA assumes that all the nodes have saturated traffic, which cannot be directly extended to the unsaturated traffic case. In this paper, an unsaturated traffic oriented spatial clustering multiusers MAC protocol (SCM-MAC) is proposed. Specifically, spatial clustering multiusers (SCM) discovery process is designed. After that, whether the cluster heads have traffic or not, they contend channel for their group members. Moreover, theoretical analysis of the optimal access radius is derived. Simulation results are in agreement with the theoretical analysis, and show that the area throughput of SCM-MAC is 34% and 50% higher than that of IEEE 802.11ax and OMAX protocol, respectively.
    Keywords: the next generation WLAN; high dense deployment scenario; unsaturated traffic; spatial clustering multiusers discovery; OFDMA.

  • Energy Management Control System of Prefabricated Construction Based on Internet of Things Technology   Order a copy of this article
    by Lu Wang, Difei Jiang 
    Abstract: Energy management control of prefabricated construction is affected by the environment temperature and the internal structure of construction, and it is prone to energy drift distortion and larger energy consumption cost of the construction. This paper proposed an energy management control system of prefabricated construction based on internet of things (IoT) technology. ISA/EISA/Micro Channel were used as expansion bus. Program loading and cross-compiling methods were adopted to realize instruction complication and loading. And the energy management control system of prefabricated construction was developed under the low-power consumption Visual DSP++ 4.5 development environment according to the instruction loading results. The control constraint parameters of energy management control system of prefabricated construction were determined. The construction temperature, power consumption and electricity consumption were used as constraint indexes. Combined with the indexes, the inversion integral control law and the fuzzy PID control law were adopted to optimize and improve the prefabricated construction control system. In order to verify the effectiveness of the system designed in this paper, a simulation comparison experiment was carried out. The experimental results showed that the root mean square (RMS) error of energy management under the prefabricated construction energy management control system was convergent to 0.0101, which was 12.23% and 21.87% lower than that of traditional methods. In the condition of reducing energy consumption cost of construction, the control system designed in this paper also had the advantages of high accuracy and shorter time-consumption.
    Keywords: Internet of Things (IoT) Technology; Prefabricated construction; Energy management; Control; Energy consumption.

  • Mathematical Model Construction of Communication Security Assessment Method based on TST Switching Network Matrix   Order a copy of this article
    by Jingbo Hu 
    Abstract: In view of the shortcomings of the existing communication security assessment methods, such as long communication transmission delay and high packet loss rate, a communication security assessment method integrating TST(timeslot switching) switching network matrix is proposed. Firstly, a TST switching network matrix needs to be created, then control measures are selected according to the communication security standards, and the weight values corresponding to the control measures are solved. According to the weight value, the communication control measures are classified. Finally, the best communication scheme is obtained by calculating the compromise rate, and the mathematical model of the communication security assessment method is constructed. Experimental results show that this method has short communication delay, low packet loss rate and high security.
    Keywords: TST matrix; multiplexing; digital switching; communication security assessment.

  • Research on resource allocation algorithm of wireless network based on game feedback   Order a copy of this article
    by Juefu Liu 
    Abstract: In order to solve the problems of poor denoising low resource utilization, low fairness and serious interruption in resource allocation algorithm of wireless network based on chaotic immune algorithm,, a wireless network resource allocation algorithm based on game feedback is proposed in this paper, which combines wavelet transform domain interpolation with low-pass filter combination.Effective denoising of transmission resources ; classification of users based on game theory,, establishment of optimization utility function,.analysis of channel distribution. By comparing the two existing algorithms, the simulation environment is constructed, and the performance comparison experiments are carried out from four aspects: denoising effect, resource utilization, fairness and interruption. The results show that the algorithm is highly de-noising , improve the efficiency of resource utilization and fairness of allocation, and allocates 0 interruption rate. Therefore, the method can flexibly configure and dynamically adjust the available resources of wireless transmission part to maximize transmission efficiency.
    Keywords: Game feedback; Wireless network; Resource allocation.

  • An Extended Mechanism to Prevent Distributed Denial of Service Attack in DV-Hop Localization Algorithm in Wireless Sensor Networks   Order a copy of this article
    by Simarjeet Kaur, Navdeep Kaur, Kamaljit Singh Bhatia 
    Abstract: Node localization is the procedure for finding the physical position of the nodes in a Wireless sensor network (WSN). The network performance is enhanced with nodes precise location. DV (Distance Vector) - Hop localization scheme is one of the most successful localization schemes. It executes competently with the assistance of beacon nodes. However, when network is interrupted with Distributed Denial of Service (DDoS) attack then the localization process of DV-Hop scheme is badly affected. This paper has examined the effects of the DDoS attack on the DV-Hop algorithm. So, a mechanism consisting of swarm optimization and machine learning is proposed to guard against DDoS attack. The architecture also designs a novel fitness function for Artificial Bee Colony (ABC). To check the appropriate effectiveness of the proposed fitness function of ABC, Feed Forward Neural Network with Gradient satisfaction is applied. The cross validation architecture further uses Mean Square Error (MSE) for the back propagation model and effectiveness is checked through a regression model as well. The evaluation is done in terms of Localization error and Transmission loss. The simulation results are obtained using Matlab and show the reduction of 33% for localization error and 27% for transmission loss respectively.
    Keywords: wireless sensor networks; node localization; DV-Hop; distributed denial of service attack; swarm intelligence; machine learning.

  • New Media Fine Art Education Platform Based on Internet of Things Technology   Order a copy of this article
    by Ruixia Feng, Tinghua Li, Junliang Dong 
    Abstract: In order to solve the problems of poor real-time output performance, poor resource recall performance and high execution time cost of the new media art information platform, this paper proposes to build a new media art education platform based on Internet of Things technology. Firstly, the overall framework of the Internet of Things platform is designed and the functional modules are divided for optimization. Secondly, the VXI bus (vmebus extension for instrumentation) technology is used to optimize the resource acquisition. The comparative experiments show that the new media art education platform in this paper has good resource recall performance, and provides a relatively high the recall rate of resource retrieval, 21% and 14% higher than the other two methods respectively. The execution time cost increases with the increase of the amount of educational resources data, but the execution time cost of this method is obviously less than that of the other two methods.
    Keywords: Internet of Things (IoT) Technology; new media; fine art education platform; embedded.

  • Simulation on Dynamic Load Balancing of Distributed Parallel Computing Network System   Order a copy of this article
    by Huawei Wu, Chuan Sun, Yicheng Li, Yong Kuang 
    Abstract: In order to improve the dynamic load balancing scheduling capability of distributed parallel computing network system and the throughput performance of network, a dynamic load balancing scheduling algorithm of distributed parallel computing network system is proposed. In this algorithm, a channel transmission model for task scheduling of distributed parallel computing network is constructed; the adaptive link equalization method is adopted to perform balanced design of distributed parallel computing network transmission channel; the fractional interval interpolation method is adopted to construct the priority list decision function for dynamic load scheduling in balanced transmission channel; based on the decision function, the balancing scheduling threshold of dynamic load of distributed computing network is determined to reach dynamic load balancing scheduling effect. The experimental results show that the method has strong anti-interference performance and the maximum amplitude of equilibrium state is 0.2. The data transmission throughput performance of distributed parallel computing network is improved.
    Keywords: distributed parallel computing network; load; channel; transmission link; balancing scheduling.

  • Deep Mining Method for High-dimensional Big data based on Association rule   Order a copy of this article
    by Shu Xu 
    Abstract: Existing high dimensional deep data mining methods have the problems of low precision and high energy consumption. Therefore, a deep mining method of high-dimensional big data based on association rules is proposed. Ealat algorithm is used to change the format of high-dimensional large data set. On this basis, MapRdeuce computing model is introduced to divide parallel tasks into map and reduce phases to realize the construction of operation platform. Hadoop's distributed file system is used to store distributed data. The input and output of the algorithm are converted into the form required by the MapRdeuce computing model to realize the deep mining of high-dimensional big data. Experimental results show that this method has higher mining accuracy and lower energy consumption. The result of practical application is good.
    Keywords: Association rule; high-dimensional big data; deep mining.

  • Research on security evaluation system of network information system based on Rough Set Theory   Order a copy of this article
    by Yingkai Miao, Jia Chen 
    Abstract: In view of the poor stability and long response time of the traditional network information system security evaluation system, a rough set based network information system security evaluation system is proposed. Based on the related principles of system safety engineering, the paper constructed the evaluation model of ANN and AHP by using the network topology structure, extracted the basic indexes of related safety evaluation, and processed the basic index data by using the multi-level gray comprehensive evaluation method. Construct the network information system security evaluation index system, use rough set theory to simplify the knowledge, obtain the initial index set, delete the redundant index, and obtain the optimized evaluation index system. The experimental results show that the designed system is more than 80% stable and the system response time is less than 1.32ms, which proves that the designed system is more efficient and stable.
    Keywords: rough set; network information system; security evaluation system; evaluation index.

  • Iterative Learning Feedback Control of Network Inverse System   Order a copy of this article
    by Xuelian Yang 
    Abstract: The traditional iterative learning feedback control has the problems of large feedback error and long searching time. Based on instruction set operation, the hardware part constructs the administrator module, the teacher module and the student module, and carries on the detailed analysis. In the software design of the system, based on the system dynamics method and genetic algorithm, an iterative learning feedback controller for the network inverse system is proposed, which can effectively improve the anti-interference performance of the system. The experimental results show that the feedback error of the designed system is less than 1% and the searching time of learning materials is less than 200 ms, which proves the practicability of the designed system and lays a theoretical foundation for the further development of iterative learning feedback control of network inverse system.
    Keywords: Modular teaching; Network inverse system; Iterative learning; Feedback control system.

  • The Quality Factor for detecting Node Isolation Attack in Mobile Ad hoc Networks Using OLSR Protocol   Order a copy of this article
    by Abdellah NABOU, My Driss LAANAOUI, Mohammed OUZZIF 
    Abstract: The Optimized Link State Routing (OLSR) protocol is a proactive routing protocol for Mobile Ad hoc Network (MANET), it is more suitable for large and dense mobile networks thanks to its new concept of Multi-Point Relay (MPR) nodes that reduce the overhead of the network, unfortunately the performance of OLSR routing protocol can be affected by various routing attacks. Node Isolation Attack is considered as a DOS (Denial of Service) attack that affects the function of OLSR routing protocols precisely by isolating the victim nodes and hiding them from the network. In this paper, we propose a new method to detect the Node Isolation Attack by using a modified version of the Quality Factor (Q) that is applied in the physical domain in order to calculate the Q of OLSR control messages and detect the attack. The experimental results show that when the attack is launched in the network between 30 and 70 second, our method can detect it without any modification in the algorithm of OLSR protocol.
    Keywords: MANET; Node; Security; OLSR; MPR; Quality Factor; Node Isolation Attack.

  • Advance Routing Strategy for VANETs   Order a copy of this article
    by Amrit Suman, Chiranjeev Kumar, Preetam Suman 
    Abstract: The VANET is an autonomous kind of network in which the nodes can create a wireless connection without the control of base stations. In recent years VANET has become a massive point of attraction for researchers because of its unique characteristics that are link failure and frequent changes in topology because of its high mobility. This makes VANET unique from the mobile ad-hoc network. Intelligent transportation that is a part of VANET helps in increasing transportation efficiency, enhancing safety in traffic and, improving the driving experience. Apart from these benefits, Network instability is the main drawback of VANET that reduces network efficiency. Due to various reasons, a high range of security measures required from multiple network attacks to protecting the communication between the vehicular nodes. In this paper, a routing strategy is proposed, which is based on AODV and MAC to enhance the route discovery and to avoid the collision. The proposed routing strategy consists of automatic size adjustment of contention window depending on the network capacity, channel allocation for each node, priority assigning for different types of messages, and security checking for each packet using CRC; all these are based on MAC. Route discovery and table preparation are based on the AODV. The proposed routing protocol (P-Routing) has been implemented in Qualnet 5.0. The results with the performance of C-AODV then compared. The parameters taken for comparison is total byte received, the signal received with error, total packet loss, and throughput. The number of nodes and speeds of nodes kept in variation to create different scenarios. In all cases, the performance of the proposed protocol is better. The results are described with the graphs in the result section.
    Keywords: MAC; AODV; Contention window; Message priority; Network Attacks; Collision avoidance; Channel Allocation.

  • Position-related Content Acquisition for CCM   Order a copy of this article
    by Yanli Li, Xiaonan Wang 
    Abstract: The content-centric networking (CCN) depends on reverse paths and limited broadcast to achieve content acquisition, but the reverse-path disruption due to node mobility leads to content acquisition failures and flooding results in considerable content acquisition costs. In this paper, we propose a Unicast-based content acquisition scheme for Content-Centric MANET (UCCM) to reduce content acquisition costs and improve success rates. UCCM employs the address-centric unicast instead of the content-centric broadcast to achieve the content acquisition, so the content acquisition cost is lowered. Moreover, a requester acquires the content from the nearest provider in the address-centric unicast way, so the content is returned to a requester based on the requesters address rather than the reverse paths. UCCM is evaluated, and the analysis results show that UCCM reduces the content acquisition cost by nearly 63.8% and improve the success rate by nearly 5.9%.
    Keywords: Content-centric; address-centric; unicast; broadcast.

  • Construction of Emergency Dispatching and Controlling Platform for Multi-elevator in Cloud Computing   Order a copy of this article
    by Junjun Liu, Jian Wu, Lanzhong Guo 
    Abstract: Traditional elevator emergency dispatching platforms are limited by their computing power, they cannot automatically collect knowledge and learning information, and they can easily fall into local optimization problems. Therefore, in the context of cloud computing, a multi-elevator emergency dispatching control platform is constructed through fuzzy control technology. According to the fuzzy control input amount, the weighting coefficients of waiting time, driving time and the congestion degree of the cabinet are continuously updated to obtain the optimal weighting coefficient. The maximum membership degree method is used to perform the deblurring processing, and the maximum value in the fuzzy output vector is used as the data after the deblurring processing to obtain the emergency dispatching result of multiple elevators. The results show that the average waiting time of the platform is 20.35s, less than other platform methods, which indicate that this platform has excellent dispatching performance and good application prospects.
    Keywords: cloud computing background; multi-elevator; emergency dispatching; control platform; construction.

  • Analysis Method for Structured Big Data Feature based on Hypernetwork Model   Order a copy of this article
    by Shu Xu 
    Abstract: In view of the problems existing in current big data feature analysis methods, such as long data feature retrieval delay, low comparison fitting index and low success rate of abnormal data extraction, this paper proposes a structured big data feature method based on the hypernetwork model.Based on the commonality of different components, the abnormal data features in big data are extracted.The characteristics of structured big data are analyzed comprehensively by using the hypernetwork model, and the comprehensive data classification is carried out.The hypernetwork model is adopted to realize the structural and clustering analysis of big data features, so as to ensure the quality of data feature analysis.The experimental results show that the proposed method has shorter data feature retrieval delay, the comparison fitting index is basically above 0.9, the fitting effect is better than the literature method, and the success rate of abnormal data extraction is higher.
    Keywords: Hypernetwork model; Structured; Data characteristics;.

  • Study on Network Security Intrusion Target Detection Method in Big Data Environment   Order a copy of this article
    by Yingkai Miao, Jia Chen 
    Abstract: In view of the traditional network security intrusion target detection method can not effectively estimate the trend of the intrusion target, resulting in poor detection accuracy, a new network security intrusion target detection method under the big data environment is proposed. Set up under the environment of big data sequence model of network intrusion in the invasion of the information collected from different data center, according to the binary feature of syntax tree for the intrusion information decomposition, the invasion of the target and get the feature sequences, with closed frequent search method, combining with the characteristics of sequence invasion of target extraction, using path, trends of binary weighted semantic of intrusion path direction get trend path set, exception path is obtained by covariance correction model trend estimation results, achieve network security intrusion detection. The experimental results show that this method has a better performance and better stability in the estimation of intrusion target path trend, with an estimated accuracy of between 94.9% and 98.6% and a detection time of 0.24-0.38s.
    Keywords: Big data; network security; intrusion target; path trend; detection.

  • Real-Time Fault Diagnosis Method for Low-Voltage Power Line Carrier Communication Network Based On Network Topology   Order a copy of this article
    by Fangui Li, Hao Wang, Hai Huang, Anxin Chen, Xiaoqing Li 
    Abstract: In order to overcome the problems of long diagnosis time, high cost and low accuracy in traditional communication network fault diagnosis methods, a real-time fault diagnosis method based on network topology for low-voltage power line carrier communication network is proposed. Detect the fault features around the communication network, get the original fault feature set, input the support vector machine, get the optimal feature subset of the low-voltage power line carrier communication network, use the optimal feature subset to construct the network topology structure, collect different fault information on the protection line, form the fault matrix and calculate, so as to get the optimal feature of the low-voltage power line carrier communication network. It can realize the accurate diagnosis of faults. The experimental results show that the fault diagnosis time of this method is less than 10s, the accuracy of fault diagnosis is up to 95%, and the cost is low.
    Keywords: Low-voltage power line carrier; communication network; characteristic set; fault diagnosis.

  • Design of Hole Repair System for Wireless Sensor Networks based on Triangle Partition   Order a copy of this article
    by Zheng Xie, DaQin Wu, HaiYan Hu 
    Abstract: Aiming at the problems of low coverage, high redundancy and low repair efficiency in the current design methods of network hole repair system, a design method of wireless sensor network hole repair system based on triangular partition method is proposed. The location and shape of holes in the bottleneck area of wireless sensor networks are determined ; the best interior points of the hole edge in the bottleneck area are obtained, and the moving direction and distance of sensor nodes in wireless sensor networks are calculated; the best interior points are selected according to the results of calculation, and the holes in the bottleneck area of wireless sensor networks are self-repaired. The experimental results show that the coverage level of the proposed method is always higher than 80%, and the redundancy can be stabilized below 20%, laying a foundation for the further application of wireless sensor networks in practice.
    Keywords: Triangular partition; Wireless sensor network; Bottleneck area; Hole repair.

  • Small Area Purification and Recognition of Network Intrusion Signals Based On the Second Order Matching Filter Detection   Order a copy of this article
    by Yucai Zhou, Lianguang Mo 
    Abstract: In order to improve the ability of intrusion detection and recognition. This paper proposes a method of small area purification and recognition of network intrusion signal based on second-order matched filter detection. In this method, the time-frequency analysis of network intrusion signal is carried out, and Hilbert Huang transform is used to decompose the time-delay scale of small-scale network intrusion signal, and then the spectrum feature is input into the second-order lattice matched filter to improve the signal resolution, and adaptive weighting method is used to adjust the filter tap coefficient to improve the detection and recognition ability. The simulation results show that the method can accurately recover two groups of component information of network intrusion signal: sinusoidal signal and sinusoidal frequency modulation signal. The recognition accuracy of network intrusion signal can reach 100%, which shows that the method has good signal purification performance.
    Keywords: network intrusion signal; detection; filter; recognition; spectral characteristic quantity extraction; time-frequency analysis.

  • Risk Assessment Method for Power Grid Communication Link Failure Based On Fuzzy Comprehensive Assessment   Order a copy of this article
    by Liang Wei, Lianguang Mo 
    Abstract: In order to overcome the problems of long time and inaccurate evaluation results of traditional power grid communication link fault assessment methods, a new power grid communication link fault risk assessment algorithm based on fuzzy comprehensive evaluation is proposed. The fuzzy comprehensive evaluation method is used to comprehensively evaluate the risk of the power grid communication link. Based on the failure rate curve of the power grid failure rate model and the Weibull distribution function, a power grid communication link failure risk analysis model is established to complete the power grid communication link failure risk assessment. The experimental results show that compared with the existing risk assessment algorithms, the average assessment time is shortened by 17 seconds, the accuracy of the assessment results is increased by 7.9%, and the cost is reduced by 23.35%.
    Keywords: Power grid; communication link; risk assessment; failure fault; fuzzy assessment.

  • Security Enhancement of an Auditing Scheme for Shared Cloud Data   Order a copy of this article
    by Reyhaneh Rabaninejad, Maryam Rajabzadeh 
    Abstract: In cloud storage services, public auditing mechanisms allow a third party to verify integrity of the outsourced data on behalf of data owners without the need to retrieve data from the cloud server. In some applications, the identity of data users should be kept private from the third party auditor. Oruta, is a privacy preserving public auditing scheme for shared data in the cloud which exploits ring signatures to protect the identity privacy. In this paper, we propose two attacks and demonstrate that the scheme is insecure and a dishonest server can arbitrarily tamper the outsourced data without being detected by the auditor. We also propose a solution to remedy this weakness with the minimum overhead and without losing any desirable features of the scheme. Performance evaluation demonstrate acceptable efficiency of improved scheme in comparison to the original protocol.
    Keywords: Cloud storage; shared data; public auditing; security analysis.

  • Secure node ID assignment for Internet integrated sensor network   Order a copy of this article
    by Amit Kumar Gautam 
    Abstract: Internet integrating sensor network (IISN) has gained much importance and exponential growth has been seen over the last twenty years. It is typically installed in remote and unattended terrains to monitor, process and collect time-critical and sensitive data. Internet integrated wireless sensor network can be used in various critical sectors such as monitoring of nuclear power plant, disaster management, internet of things (IoT), industrial management etc. As the application area of sensor network is increasing rapidly, the adversaries can trigger duplicate ID based attacks such as Clone and Sybil attacks. In this paper, for joining a new node in the existing network, we propose a secure identity assignment who wish to join the network with the help of any existing node of the network. With the collaboration of an existing node, an overlay ID will be assigned to new node which is secured by using a public key cryptography. The paper included a complexity and communication overhead analysis to demonstrate the effectiveness of proposed method which maximizes the defence/protection against ID based attacks. Complexity analysis demonstrates the superiority of the proposed method.
    Keywords: ID based attacks; public key cryptography; sybil attack; internet integrated WSN.

  • ModQUIC Protocol Performance Verification with CUBIC and BBR Congestion Control Mechanisms   Order a copy of this article
    by Prashant Kharat, Muralidhar Kulkarni 
    Abstract: ModQUIC protocol is the Modified QUIC protocol is an application and transport layer solution, which is developed to compete for TCP's dominance. This is an extension to ModQUIC protocol performance investigation, which has been contributed to congestion control dynamics of the protocol. This work adds one more dimension to congestion control using Bottleneck Bandwidth Round-trip-propagation-time (BBR) and suggested CUBIC decrease factor beta = beta_{TCP}/n. A testbed has been prepared with Chromium server-client model and traffic monitoring tool. Results show that ModQUIC with BBR outperform ModQUIC with CUBIC and QUIC with CUBIC and BBR. To verify the performance of ModQUIC, a Chromium server-client model based testbed has been setup. The experiment results, show that the ModQUIC with BBR shows better performance in terms of throughput, delay and datarate. The performance has been tested for limited (2 Mbps) and sufficient (10 Mbps) link bottleneck bandwidth in presence of loss. The result analysis shows that throughput with ModQUIC/BBR improved by 6.8%, 19.06% and 27.9% over ModQUIC/CUBIC, QUIC/BBR and QUIC/CUBIC respectively whereas, delay is reduced by 8.02%, 6.56% and 14.38% over ModQUIC/CUBIC, QUIC/BBR and QUIC/CUBIC respectively. Overall observations conclude that the performance of ModQUIC/BBR is improved and stable as compared to ModQUIC/CUBIC, QUIC/BBR and QUIC/CUBIC.
    Keywords: ModQUIC; Congestion control; BBR; CUBIC; Network performance analysis.

  • Efficient Routing Algorithm for improving the Network performance in Internet of Things   Order a copy of this article
    by Vijayakrishna Akula, Anny Leema 
    Abstract: In the recent years, many routing protocols have been developed for Internet of Things (IoT) which reduces the delay and network congestion. However, in some urgent situations, the transmission of urgent or priority packets to the destination with in the specified time are compulsory. The tradition routing methods explores all the paths from source to destination which leads to longer paths and doesnt guarantee the delivery of priority packets. This paper concentrates on developing the priority based event detection routing scheme in IoT. This method analyses the arrival packets and forwards to the destination by finding the shortest path with queue difference. The priority packets which arrive at the priority queue having minimum deadline is selected. The regular packets are followed with their normal queue policy. The experimental results proved that proposed method achieved 34% less end to end delay and 26% high accuracy in throughput compared to the other existing algorithms.
    Keywords: Routing; Priority packets; Sensor networks; Internet of Things; Event detection.
    DOI: 10.1504/IJIPT.2022.10035468
  • Multicast Routing and Allocation of Wavelengths in a WDM Network with Splitters and Converters   Order a copy of this article
    by Abdelhakim DAFEUR, Bernard Cousin, Rezki Ziani 
    Abstract: This paper deals with the problem of multicast routing and the allocation of wavelengths in a WDM network with optical splitters and converters. We present an exact formulation in integer linear programming (ILP) to find a set of optical structures connecting a source to a set of destination nodes. We use a new optical structure called hierarchical. In hierarchical structure, an optical signal can pass more than once through the same optical node and an intermediate node can belong to the set of destinations; this is a generalization of "light trails"). The problem of multicast routing with sparse wavelength conversion and sparse splitting using the hierarchical structure has not yet been studied. So, our main contribution consists of introducing new optical constraints of wavelength converters with the hierarchical structure. The objective is to focus on the benefits and performances of using wavelength converters in a WDM network. Simulation results show that the hierarchical structure gets better results in terms of overall link cost and the number of wavelengths in the case of WDM network sparse wavelength converters than the WDM network without converters.
    Keywords: Multicast routing; Wavelength division multiplexing (WDM); Wavelength converters;Optical networks; Hierarchical structure; Tree structure.

  • Cognitive decision engine design for cognitive radio networks using gravitational search algorithm and flower pollination algorithm   Order a copy of this article
    by Badr Benmammar 
    Abstract: In cognitive radio networks, the real-time setting of the transmission parameters required by the cognitive engine according to the quality of service requested by the cognitive users has become an essential task. This adjustment is becoming increasingly difficult in OFDM-based cognitive radio networks because of the existence of a large number of decision variables to be optimized for multi-carrier systems. For decision making, the cognitive engine in OFDM-based cognitive radio networks uses optimization algorithms. However, in order to reduce the complexity and obtain a resource allocation in a reasonable time, cognitive radio networks use artificial intelligence techniques and in particular metaheuristics. We analyze in this article the performances of two recent metaheuristics namely gravitational search algorithm and flower pollination algorithm in OFDM-based cognitive radio networks. Simulation results show that FPA has surpassed GSA in terms of Fitness. In contrast, GSA outperformed FPA in terms of execution time. On the other side, FPA and GSA outperform genetic algorithms in terms of solution quality (fitness) with improvements reaching 10% and 7% respectively and prove their efficiencies in order to support three modes of transmission of the cognitive user.
    Keywords: CRN ; OFDM ; QAM ; PSK ; GSA ; FPA ; GA.

  • Policy based Heterogeneous Server Utilization using Controller Framework   Order a copy of this article
    by Aditi Bankura, Anirban Kundu 
    Abstract: In this paper, authors have proposed a controller based framework having transmission flow for query search and/or query responses. In this approach, total structure is divided into number of levels, and each level has two set of controllers. Servers are worked together in each set of controllers. Servers are heterogeneous in nature based on functionality and configurations. Server selection in each level, communication establishment, and transmission of information between two servers placed at two consecutive levels are three major tasks to be executed for entire query search processing. Several policies are proposed for communication establishment and transmission of information between servers with consideration of risks management. Several load management strategies have been proposed for server selection dynamically from set of available servers having distinct loads using load balance factor. In this paper, we have also introduced a procedure to follow two separate paths for transmission of search query and query response to avoid congestion in network to achieve minimum delay in query response.
    Keywords: Query Searching; Heterogeneous Servers; Packet Formation Policy; Data Migration Policy; Data Block Placement Policy; Failure Policy; Data Block Replication Policy; Server Feedback Policy; Entry Controller; Exit Controller; Server Pool.

  • On the Minimization of Resource Utilization for Cost Reduction in Space Division Multiplexing Based Elastic Optical Networks   Order a copy of this article
    by Sridhar Iyer 
    Abstract: In the current work, for a Space Division Multiplexing (SDM) based Elastic Optical Network (EON) (SDM-b-EON), we formulate a routing, modulation format, spatial granularity , and spectrum assignment (RMFSpGlSA) problem which aims to minimize the overall network cost by reducing the resource (i.e., wavelength selective switches (WSSs), Lasers, and spectrum) usage. Initially, RMFSpGlSA is formulated as a joint integer linear program (J-ILP) model (namely, J-ILP-RMFSpGlSA) following which, to obtain better convergence and reasonable execution times; J-ILP is split as a RMFSpGl+SA problem (namely, ILP-RMFSpGl+SA) which successively solves the RMFSpGl and the SA problems. Next, considering realistic network topologies and parameters, extensive simulations are conducted to evaluate performances of the two formulated ILP models with an aim to find the best spatial granularity value under various conditions. The obtained results demonstrate that when the unit cost ratio of the WSSs and the frequency slots (FSs), and the lasers and the FSs is low (e.g., 0.01) then, compared to the WSSs and the Lasers, there occurs more preservation of the spectrum, and a fine value (e.g., 8) is chosen more number of times compared to a coarse value (e.g., 12) which is always chosen for higher values of unit cost ratio of the WSSs and the FSs, and the lasers and the FSs. Further, a coarse spatial granularity value does not have a major effect on the required FSs amount; however, it significantly impacts the required WSSs and Lasers amount which implies that only when equal importance is imposed on the requirement of all the resources, a coarse spatial granularity value is the best value. It is also observed that the fine values of spatial granularity are mostly chosen with the widening of the guardband width values, and for a guardband width value of 50 GHz, a low value (e.g., 8) is only chosen. Also, the obtained results show that with an increase in the mean bit-rate values of the demands, a coarse value of spatial granularity is mostly chosen. Finally, all the results demonstrate that ILP-RMFSpGl+SA obtains similar performance when compared to J-ILP-RMFSpGlSA simultaneously requiring much lesser execution times.
    Keywords: Elastic optical networks; space division multiplexing; ILP; switching; resource allocation.

  • Efficient IPv4-IPv6 translation mechanism for IMS using SIP proxy   Order a copy of this article
    by Ali Abdulrazzaq, Alhamza Munther, Supriyanto Praptodiyono 
    Abstract: Next-generation IP Multimedia Subsystem (IMS) has a promise future in Internet technologies. Technically, IMS utilizes Session Initiation Protocol (SIP) for call communication. Potentially, SIP clients might reside in coexistence network family like IPv6 and/or IPv4. The coexistence of SIP clients considered a serious issue in SIP communication and IPv6 migration in general. Specifically, when IPv6 client try to send a voice call toward IPv4 client, the call will fail or end up with incomplete message. In this paper a SIP-Proxy IP Translator (SPIPT) is proposed to translate SIP call between from IPv6 to IPv4 and vice versa. The proposed solution comes to insure successive connectivity in term of IP version compatibility. The experiment shows that SIP proxy performs with acceptable CPU usage, throughput, and Call Response Time parameters. In sum, the solution aims to reduce call setup complexity and leverages user experience which in turn accelerates IPv6 transition.
    Keywords: SIP; IPv6; SIP over IPv6; IPv4-to-IPv6; SIP Service Provider.

  • The Study of Dynamic Resource Allocation on Aggregation of Unlicensed Spectrum in LTE-A Networks   Order a copy of this article
    by Wu Jung-Shyr 
    Abstract: The 3GPP formulated the fourth-generation LTE-Advanced specifications, in which Carrier Aggregation technology can increase the data transmission rate by aggregating continuous and non-continuous carriers to meet the transmission needs of a large number of users. However, users demand for multimedia network application services continues to increase and makes the licensed spectrum more and more overwhelming. Therefore, this article hopes to combine the licensed and unlicensed spectrum to provide a wider data channel with higher data transmission. We focus on improving the throughput of the downlink system, and propose a genetic algorithm to optimize the weights which referring to the carrier unit channel quality and load conditions to select the most suitable carrier unit for the user. Afterwards, resource allocation methods are presented for the different traffic of GBR and Non-GBR effectively. Finally, we show the simulation results to prove that the proposed method is effective in improving system throughput and user satisfaction.
    Keywords: LTE-A; Carrier aggregation; Genetic algorithm ; resource allocation.