• 제목/요약/키워드: Internet Based Laboratory

검색결과 491건 처리시간 0.028초

Modeling and Analysis of Load-Balancing Based on Base-Station CoMP with Guaranteed QoS

  • Feng, Lei;Li, WenJing;Yin, Mengjun;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권9호
    • /
    • pp.2982-3003
    • /
    • 2014
  • With the explosive deployment of the wireless communications technology, the increased QoS requirement has sparked keen interest in network planning and optimization. As the major players in wireless network optimization, the BS's resource utilization and mobile user's QoS can be improved a lot by the load-balancing technology. In this paper, we propose a load-balancing strategy that uses Coordinated Multiple Points (CoMP) technology among the Base Stations (BS) to effectively extend network coverage and increase edge users signal quality. To use universally, different patterns of load-balancing based on CoMP are modeled and discussed. We define two QoS metrics to be guaranteed during CoMP load balancing: call blocking rate and efficient throughput. The closed-form expressions for these two QoS metrics are derived. The load-balancing capacity and QoS performances with different CoMP patterns are evaluated and analyzed in low-dense and high-dense traffic system. The numerical results present the reasonable CoMP load balancing pattern choice with guaranteed QoS in each system.

JND-based Multiple Description Image Coding

  • Zong, Jingxiu;Meng, Lili;Zhang, Huaxiang;Wan, Wenbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권8호
    • /
    • pp.3935-3949
    • /
    • 2017
  • In this paper, a novel multiple description image coding (MDC) scheme is proposed, which is based on the characteristics of the human visual model. Due to the inherent characteristics of human vision, the human eye can only perceive the change of the specific thresholds, that is, the just noticeable difference (JND) thresholds. Therefore, JND model is applied to improve MDC syetem. This paper calculates the DCT coefficients firstly, and then they are compared with the JND thresholds. The data that is less than the JND thresholds can be neglected, which will improve the coding efficiency. Compared with other existing methods, the experimental results of the proposed method are superior.

Power Control with Nearest Neighbor Nodes Distribution for Coexisting Wireless Body Area Network Based on Stochastic Geometry

  • Liu, Ruixia;Wang, Yinglong;Shu, Minglei;Zhao, Huiqi;Chen, Changfang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권11호
    • /
    • pp.5218-5233
    • /
    • 2018
  • The coexisting wireless body area networks (WBAN) is a very challenging issue because of strong inter-networks interference, which seriously affects energy consumption and spectrum utilization ratio. In this paper, we study a power control strategy with nearest neighbor nodes distribution for coexisting WBAN based on stochastic geometry. Using homogeneous Poisson point processes (PPP) model, the relationship between the transmission power and the networks distribution is analytically derived to reduce interference to other devices. The goal of this paper is to increase the transmission success probability and throughput through power control strategy. In addition, we evaluate the area spectral efficiency simultaneously active WBAN in the same channel. Finally, extensive simulations are conducted to evaluate the power control algorithm.

DPW-RRM: Random Routing Mutation Defense Method Based on Dynamic Path Weight

  • Hui Jin;Zhaoyang Li;Ruiqin Hu;Jinglei Tan;Hongqi Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권11호
    • /
    • pp.3163-3181
    • /
    • 2023
  • Eavesdropping attacks have seriously threatened network security. Attackers could eavesdrop on target nodes and link to steal confidential data. In the traditional network architecture, the static routing path and the important nodes determined by the nature of network topology provide a great convenience for eavesdropping attacks. To resist monitoring attacks, this paper proposes a random routing mutation defense method based on dynamic path weight (DPW-RRM). It utilizes network centrality indicators to determine important nodes in the network topology and reduces the probability of important nodes in path selection, thereby distributing traffic to multiple communication paths, achieving the purpose of increasing the difficulty and cost of eavesdropping attacks. In addition, it dynamically adjusts the weight of the routing path through network state constraints to avoid link congestion and improve the availability of routing mutation. Experimental data shows that DPW-RRM could not only guarantee the normal algorithmic overhead, communication delay, and CPU load of the network, but also effectively resist eavesdropping attacks.

From WiFi to WiMAX: Efficient GPU-based Parameterized Transceiver across Different OFDM Protocols

  • Li, Rongchun;Dou, Yong;Zhou, Jie;Li, Baofeng;Xu, Jinbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권8호
    • /
    • pp.1911-1932
    • /
    • 2013
  • Orthogonal frequency-division multiplexing (OFDM) has become a popular modulation scheme for wireless protocols because of its spectral efficiency and robustness against multipath interference. Although the components of various OFDM protocols are functionally similar, they remain distinct because of the characteristics of the environment. Recently, graphics processing units (GPUs) have been used to accelerate the signal processing of the physical layer (PHY) because of their great computational power, high development efficiency, and flexibility. In this paper, we describe the implementation of parameterized baseband modules using GPUs for two different OFDM protocols, namely, 802.11a and 802.16. First, we introduce various modules in the modulator/demodulator parts of the transmitter and receiver and analyze the computational complexity of each module. We then describe the integration of the GPU-based baseband modules of the two protocols using the parameterized method. GPU-based implementations are addressed to explain how to accelerate the baseband processing to archive real-time throughput. Finally, the performance results of each signal processing module are evaluated and analyzed. The experiments show that the GPU-based 802.11a and 802.16 PHY meet the real-time requirement and demonstrate good bit error ratio (BER) performance. The performance comparison indicates that our GPU-based implemented modules have better flexibility and throughput to the current ones.

Smoke detection in video sequences based on dynamic texture using volume local binary patterns

  • Lin, Gaohua;Zhang, Yongming;Zhang, Qixing;Jia, Yang;Xu, Gao;Wang, Jinjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5522-5536
    • /
    • 2017
  • In this paper, a video based smoke detection method using dynamic texture feature extraction with volume local binary patterns is studied. Block based method was used to distinguish smoke frames in high definition videos obtained by experiments firstly. Then we propose a method that directly extracts dynamic texture features based on irregular motion regions to reduce adverse impacts of block size and motion area ratio threshold. Several general volume local binary patterns were used to extract dynamic texture, including LBPTOP, VLBP, CLBPTOP and CVLBP, to study the effect of the number of sample points, frame interval and modes of the operator on smoke detection. Support vector machine was used as the classifier for dynamic texture features. The results show that dynamic texture is a reliable clue for video based smoke detection. It is generally conducive to reducing the false alarm rate by increasing the dimension of the feature vector. However, it does not always contribute to the improvement of the detection rate. Additionally, it is found that the feature computing time is not directly related to the vector dimension in our experiments, which is important for the realization of real-time detection.

Vehicle Detection in Aerial Images Based on Hyper Feature Map in Deep Convolutional Network

  • Shen, Jiaquan;Liu, Ningzhong;Sun, Han;Tao, Xiaoli;Li, Qiangyi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권4호
    • /
    • pp.1989-2011
    • /
    • 2019
  • Vehicle detection based on aerial images is an interesting and challenging research topic. Most of the traditional vehicle detection methods are based on the sliding window search algorithm, but these methods are not sufficient for the extraction of object features, and accompanied with heavy computational costs. Recent studies have shown that convolutional neural network algorithm has made a significant progress in computer vision, especially Faster R-CNN. However, this algorithm mainly detects objects in natural scenes, it is not suitable for detecting small object in aerial view. In this paper, an accurate and effective vehicle detection algorithm based on Faster R-CNN is proposed. Our method fuse a hyperactive feature map network with Eltwise model and Concat model, which is more conducive to the extraction of small object features. Moreover, setting suitable anchor boxes based on the size of the object is used in our model, which also effectively improves the performance of the detection. We evaluate the detection performance of our method on the Munich dataset and our collected dataset, with improvements in accuracy and effectivity compared with other methods. Our model achieves 82.2% in recall rate and 90.2% accuracy rate on Munich dataset, which has increased by 2.5 and 1.3 percentage points respectively over the state-of-the-art methods.

Optimal Power Allocation and Outage Analysis for Cognitive MIMO Full Duplex Relay Network Based on Orthogonal Space-Time Block Codes

  • Liu, Jia;Kang, GuiXia;Zhu, Ying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권3호
    • /
    • pp.924-944
    • /
    • 2014
  • This paper investigates the power allocation and outage performance of MIMO full-duplex relaying (MFDR), based on orthogonal space-time block codes (OSTBC), in cognitive radio systems. OSTBC transmission is used as a simple means to achieve multi-antenna diversity gain. Cognitive MFDR systems not only have the advantage of increasing spectral efficiency through spectrum sharing, but they can also extend coverage through the use of relays. In cognitive MFDR systems, the primary user experiences interference from the secondary source and relay simultaneously, owing to full duplexing. It is therefore necessary to optimize the transmission powers at the secondary source and relay. In this paper, we propose an optimal power allocation (OPA) scheme based on minimizing the outage probability in cognitive MFDR systems. We also analyse the outage probability of the secondary user in noise-limited and interference-limited environments in Nakagami-m fading channels. Simulation results show that the proposed schemes achieve performance improvements in terms of reducing outage probability.

Visual Attention Model Based on Particle Filter

  • Liu, Long;Wei, Wei;Li, Xianli;Pan, Yafeng;Song, Houbing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권8호
    • /
    • pp.3791-3805
    • /
    • 2016
  • The visual attention mechanism includes 2 attention models, the bottom-up (B-U) and the top-down (T-D), the physiology of which have not yet been accurately described. In this paper, the visual attention mechanism is regarded as a Bayesian fusion process, and a visual attention model based on particle filter is proposed. Under certain particular assumed conditions, a calculation formula of Bayesian posterior probability is deduced. The visual attention fusion process based on the particle filter is realized through importance sampling, particle weight updating, and resampling, and visual attention is finally determined by the particle distribution state. The test results of multigroup images show that the calculation result of this model has better subjective and objective effects than that of other models.

Cellular Traffic Offloading through Opportunistic Communications Based on Human Mobility

  • Li, Zhigang;Shi, Yan;Chen, Shanzhi;Zhao, Jingwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.872-885
    • /
    • 2015
  • The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.