Journal of High Speed Networks - Volume 21, issue 2

Authors: Li, Jin | Xhafa, Fatos | Weng, Jian

Article Type: Editorial

DOI: 10.3233/JHS-150511

Citation: Journal of High Speed Networks, vol. 21, no. 2, pp. 81-82, 2015

Authors: Gui-Cheng, Wu | Jie, Yang

Article Type: Research Article

Abstract: SOA web services are widely used as the new platform to build interoperable distributed applications which can eliminate the differences between the enterprise systems. Web services deployed over the network are accessible for a wider user base. However, the user interfaces are still implemented manually, and concepts that aim to automate this process are still in their infancy. In this paper, we introduce a web service customization method with a UI display and layout model as well as a UI layout algorithm. By using web service, we allow generation of form controls such as selection lists, text boxes, text areas, …checkboxes and radio buttons on the client side. The UI layout algorithm is described and the time consumed by building service is compared in table. Performance tests are given in different testing environments. The experimental results demonstrate that our generated web services are efficient and effective in interoperability, flexibility and visualization. Show more

Keywords: Data extraction, layout generation, web service

DOI: 10.3233/JHS-150517

Citation: Journal of High Speed Networks, vol. 21, no. 2, pp. 83-94, 2015

Authors: Zhao, Chunlei | Xia, Chengyi | Jia, Chunfu

Article Type: Research Article

Abstract: In this paper, a spatial adaptive strategy for End-hopping systems is proposed, based on the study of attack–defense models. It has been conceived as a combination of adaptive and End-hopping technologies. Modules such as attack detection, feedback transmission and adaptive control are added to the original End-hopping system model. Then, guidance is put forward for next hop with the help of real-time evaluation on each hopping node. Furthermore, investigations are provided on how to adjust related parameters automatically, according to the network communication status and the degree according to which the nodes are attacked. The new system can maintain good …service efficiency as well as high security. This technique is applied to the End-hopping prototype system. By presenting different attack experiments on a prototype system, the feasibility and effectiveness of such End-hopping technique are shown. Show more

Keywords: Network security, End-hopping, spatial adaptive strategy

DOI: 10.3233/JHS-150514

Citation: Journal of High Speed Networks, vol. 21, no. 2, pp. 95-106, 2015

Authors: Wang, Ruoyu | Liu, Zhen | Tao, Ming | Zhang, Ling

Article Type: Research Article

Abstract: IBR (Internet Background Radiation) traffic identification is significant for malicious behavior detection. This paper presents a novel IBR traffic identification method since traditional methods depend on tough conditions, such as full bi-direction traffic or unassigned IP address space. We firstly explored the traffic source distribution of each destination IP on a traffic dataset, and found that the traffic sources of active IPs are relatively certain but that of inactive IPs are relatively uncertain. Secondly, based on this exploration results, we present a method to identify IBR traffic. It utilizes the presented metric to evaluate the certainty of traffic sources of …a destination IP, so as to identify inactive IPs. Then it detects IBR traffic according to some heuristics built according to malicious traffic behavior patterns. We carried out several experiments to evaluate our method on real traffic datasets, and results show that it obtains 99% precision and 0.1% omission rate on detecting IPv4 IBR traffic. The detected IBR traffic includes the traffic that sent to assigned IPs besides unassigned IPs, which is more valuable and practical for detecting the malicious traffic in real networks. Show more

Keywords: Internet background radiation traffic, malicious behavior, information entropy, network management

DOI: 10.3233/JHS-150512

Citation: Journal of High Speed Networks, vol. 21, no. 2, pp. 107-120, 2015

Authors: Zhang, Jing | Yang, Ting | Zhao, Chengli

Article Type: Research Article

Abstract: Wireless sensor networks have received increasing attention in recent years and have proven their capability in dealing with problems occurring in wide areas with difficult access. In other types of sensor networks, the nodes can modify their position to better adapt to changes in the monitored phenomenon. Thus, routing is one of the important issues to be considered for a WSN. In this paper, a distributed algorithm is proposed to ensure that the mean square deviation of the number of member nodes within each cluster is as small as possible, thus effectively balancing the number of member nodes among each …cluster. The cluster-based algorithms has proven to be better than multi-hop routing. In this paper, a novel, energy-efficient, cluster-based routing algorithm for a WSN is proposed. To evaluate the efficiency of the proposed algorithm, we studied its performance in a sensor network against other applied algorithms. The simulation results indicate that the network load balancing of the Node Local Density Load Balancing (NLDLB) algorithm is better than that of other join cluster models, and that the Load Balancing and Data Aggregation Tree Routing (LBDATR) algorithm can greatly reduce the energy consumption of a node, thus efficiently extending the lifecycle of the network and enhancing its robustness. Show more

Keywords: Wireless sensor networks, clustering, local density, load balancing, data aggregation tree, routing algorithm

DOI: 10.3233/JHS-150515

Citation: Journal of High Speed Networks, vol. 21, no. 2, pp. 121-129, 2015

Authors: Chen, Xiaomao | Ouyang, Shan | Ding, Yong

Article Type: Research Article

Abstract: The resource allocation problem is investigated for cooperative cognitive radio networks, considering energy efficiency of the primary users (PUs) and spectrum efficiency of the secondary users (SUs). The cooperation framework involves a PU selecting a SU as the relay and allocating the spectrum access intervals for the selected SU as a reward. The above sequential decision procedure is formulated as a Stackelberg game. Based on the knowledge of the effects of PUs decision on the behavior of a SU, the leader (PU) determines a fraction of the time slot duration to be used for the primary. The follower (SU) is …allowed to transmit its own data to the corresponding receiver in the remaining duration and determines its optimal transmission power. The outcomes of the proposed cooperative resource allocation scheme, including primary user and secondary user power control, as well as dynamic access spectrum, are analyzed. Numerical results demonstrate that, with the proposed resource allocation scheme, the PU can achieve high energy saving by cooperation with the SU. Show more

Keywords: Cognitive radio, Stackelberg game, energy efficiency, resource allocation

DOI: 10.3233/JHS-150513

Citation: Journal of High Speed Networks, vol. 21, no. 2, pp. 131-139, 2015

Authors: Wang, Kai | Zhao, Hong | Ding, Yanan | Li, Tao | Hou, Lujian | Sun, Fengjuan

Article Type: Research Article

Abstract: The design of air quality monitoring stations (AQMS) is very important for environmental protection department. The task, however, has been proven to be in the class of nondeterministic polynomial (NP)-hard problem. The powerful search capability of the genetic algorithm (GA) is helpful for selecting optimal monitoring sites. A mathematical programming model based method is proposed, in which environmental, social and economical factors are considered and the GA is used to optimize AQMS. Modelling results indicate that the proposed method outperforms the method of random site of AQMS. The proposed method/framework is also suitable for the design of communication network. For …example, the wireless base stations can be well placed by similar method, providing sufficient signal strength for better service with lower cost. Show more

Keywords: Air pollution monitoring sites, genetic algorithm, optimization, constraints

DOI: 10.3233/JHS-150516

Citation: Journal of High Speed Networks, vol. 21, no. 2, pp. 141-153, 2015