The search functionality is under construction.
The search functionality is under construction.

Author Search Result

[Author] Celimuge WU(12hit)

1-12hit
  • Color-Based Cooperative Cache and Its Routing Scheme for Telco-CDNs

    Takuma NAKAJIMA  Masato YOSHIMI  Celimuge WU  Tsutomu YOSHINAGA  

     
    PAPER-Information networks

      Pubricized:
    2017/07/14
      Vol:
    E100-D No:12
      Page(s):
    2847-2856

    Cooperative caching is a key technique to reduce rapid growing video-on-demand's traffic by aggregating multiple cache storages. Existing strategies periodically calculate a sub-optimal allocation of the content caches in the network. Although such technique could reduce the generated traffic between servers, it comes with the cost of a large computational overhead. This overhead will be the cause of preventing these caches from following the rapid change in the access pattern. In this paper, we propose a light-weight scheme for cooperative caching by grouping contents and servers with color tags. In our proposal, we associate servers and caches through a color tag, with the aim to increase the effective cache capacity by storing different contents among servers. In addition to the color tags, we propose a novel hybrid caching scheme that divides its storage area into colored LFU (Least Frequently Used) and no-color LRU (Least Recently Used) areas. The colored LFU area stores color-matching contents to increase cache hit rate and no-color LRU area follows rapid changes in access patterns by storing popular contents regardless of their tags. On the top of the proposed architecture, we also present a new routing algorithm that takes benefit of the color tags information to reduce the traffic by fetching cached contents from the nearest server. Evaluation results, using a backbone network topology, showed that our color-tag based caching scheme could achieve a performance close to the sub-optimal one obtained with a genetic algorithm calculation, with only a few seconds of computational overhead. Furthermore, the proposed hybrid caching could limit the degradation of hit rate from 13.9% in conventional non-colored LFU, to only 2.3%, which proves the capability of our scheme to follow rapid insertions of new popular contents. Finally, the color-based routing scheme could reduce the traffic by up to 31.9% when compared with the shortest-path routing.

  • A Distributed Dynamic Channel Assignment and Routing Framework for Cognitive Sensor Systems

    Celimuge WU  Satoshi OHZAHATA  Yusheng JI  Toshihiko KATO  

     
    PAPER

      Vol:
    E97-D No:10
      Page(s):
    2613-2622

    With the increase of the number of wireless sensing or metering devices, the collection of sensing data using wireless communication becomes an important part of a smart grid system. Cognitive radio technology can be used to facilitate the deployment of smart grid systems. In this paper, we propose a data collection and dissemination framework for cognitive radio smart grid systems to fully utilize wireless resources while maintaining a reliably connected and efficient topology for each channel. In the proposed framework, each sensor node selects a channel considering the primary user (PU) channel utilization and network connectivity. In this way, the data collection and dissemination can be performed with a high reliability and short delay while avoiding a harmful effect on primary users. We use computer simulations to evaluate the proposed framework.

  • Distributed Reinforcement Learning Approach for Vehicular Ad Hoc Networks

    Celimuge WU  Kazuya KUMEKAWA  Toshihiko KATO  

     
    PAPER-Network

      Vol:
    E93-B No:6
      Page(s):
    1431-1442

    In Vehicular Ad hoc Networks (VANETs), general purpose ad hoc routing protocols such as AODV cannot work efficiently due to the frequent changes in network topology caused by vehicle movement. This paper proposes a VANET routing protocol QLAODV (Q-Learning AODV) which suits unicast applications in high mobility scenarios. QLAODV is a distributed reinforcement learning routing protocol, which uses a Q-Learning algorithm to infer network state information and uses unicast control packets to check the path availability in a real time manner in order to allow Q-Learning to work efficiently in a highly dynamic network environment. QLAODV is favored by its dynamic route change mechanism, which makes it capable of reacting quickly to network topology changes. We present an analysis of the performance of QLAODV by simulation using different mobility models. The simulation results show that QLAODV can efficiently handle unicast applications in VANETs.

  • A TDMA/DCF Hybrid QoS Scheme for Ad Hoc Networks

    Jing LIN  Celimuge WU  Satoshi OHZAHATA  Toshihiko KATO  

     
    PAPER-Network

      Vol:
    E100-B No:1
      Page(s):
    42-53

    We propose a QoS scheme for ad hoc networks by combining TDMA and IEEE 802.11 DCF, and present performance evaluation results of the scheme. In the proposed scheme, the channel time is composed of two different periods, specifically TDMA period and DCF period. The TDMA period provides contention free transmission opportunities for QoS flows, and the DCF period provides contention-based access for best effort or low priority flows. We evaluate the proposed scheme for various numbers of TCP flows and different CBR data rates with QualNet simulator. Simulation results show that the protocol is able to provide an efficient solution for QoS control in ad hoc networks.

  • A Failsoft Scheme for Mobile Live Streaming by Scalable Video Coding

    Hiroki OKADA  Masato YOSHIMI  Celimuge WU  Tsutomu YOSHINAGA  

     
    PAPER

      Pubricized:
    2021/09/08
      Vol:
    E104-D No:12
      Page(s):
    2121-2130

    In this study, we propose a mechanism called adaptive failsoft control to address peak traffic in mobile live streaming, using a chasing playback function. Although a cache system is avaliable to support the chasing playback function for live streaming in a base station and device-to-device communication, the request concentration by highlight scenes influences the traffic load owing to data unavailability. To avoid data unavailability, we adapted two live streaming features: (1) streaming data while switching the video quality, and (2) time variability of the number of requests. The second feature enables a fallback mechanism for the cache system by prioritizing cache eviction and terminating the transfer of cache-missed requests. This paper discusses the simulation results of the proposed mechanism, which adopts a request model appropriate for (a) avoiding peak traffic and (b) maintaining continuity of service.

  • A Sequential Classifiers Combination Method to Reduce False Negative for Intrusion Detection System

    Sornxayya PHETLASY  Satoshi OHZAHATA  Celimuge WU  Toshihito KATO  

     
    PAPER

      Pubricized:
    2019/02/27
      Vol:
    E102-D No:5
      Page(s):
    888-897

    Intrusion detection system (IDS) is a device or software to monitor a network system for malicious activity. In terms of detection results, there could be two types of false, namely, the false positive (FP) which incorrectly detects normal traffic as abnormal, and the false negative (FN) which incorrectly judges malicious traffic as normal. To protect the network system, we expect that FN should be minimized as low as possible. However, since there is a trade-off between FP and FN when IDS detects malicious traffic, it is difficult to reduce the both metrics simultaneously. In this paper, we propose a sequential classifiers combination method to reduce the effect of the trade-off. The single classifier suffers a high FN rate in general, therefore additional classifiers are sequentially combined in order to detect more positives (reduce more FN). Since each classifier can reduce FN and does not generate much FP in our approach, we can achieve a reduction of FN at the final output. In evaluations, we use NSL-KDD dataset, which is an updated version of KDD Cup'99 dataset. WEKA is utilized as a classification tool in experiment, and the results show that the proposed approach can reduce FN while improving the sensitivity and accuracy.

  • Learning-Based WiFi Traffic Load Estimation in NR-U Systems

    Rui YIN  Zhiqun ZOU  Celimuge WU  Jiantao YUAN  Xianfu CHEN  Guanding YU  

     
    PAPER-Mobile Information Network and Personal Communications

      Pubricized:
    2020/08/20
      Vol:
    E104-A No:2
      Page(s):
    542-549

    The unlicensed spectrum has been utilized to make up the shortage on frequency spectrum in new radio (NR) systems. To fully exploit the advantages brought by the unlicensed bands, one of the key issues is to guarantee the fair coexistence with WiFi systems. To reach this goal, timely and accurate estimation on the WiFi traffic loads is an important prerequisite. In this paper, a machine learning (ML) based method is proposed to detect the number of WiFi users on the unlicensed bands. An unsupervised Neural Network (NN) structure is applied to filter the detected transmission collision probability on the unlicensed spectrum, which enables the NR users to precisely rectify the measurement error and estimate the number of active WiFi users. Moreover, NN is trained online and the related parameters and learning rate of NN are jointly optimized to estimate the number of WiFi users adaptively with high accuracy. Simulation results demonstrate that compared with the conventional Kalman Filter based detection mechanism, the proposed approach has lower complexity and can achieve a more stable and accurate estimation.

  • A Sparsely-Connected OTFS-BFDM System Using Message-Passing Decoding Open Access

    Tingyao WU  Zhisong BIE  Celimuge WU  

     
    PAPER-Communication Theory and Signals

      Pubricized:
    2021/08/27
      Vol:
    E105-A No:3
      Page(s):
    576-583

    The newly proposed orthogonal time frequency space (OTFS) system exhibits excellent error performance on high-Doppler fading channels. However, the rectangular prototype window function (PWF) inherent in OTFS leads to high out-of-band emission (OOBE), which reduces the spectral efficiency in multi-user scenarios. To this end, this paper presents an OTFS system based on bi-orthogonal frequency division multiplexing (OTFS-BFDM) modulation. In OTFS-BFDM systems, PWFs with bi-orthogonal properties can be optimized to provide lower OOBE than OTFS, which is a special case with rectangular PWF. We further derive that the OTFS-BFDM system is sparsely-connected so that the low-complexity message passing (MP) decoding algorithm can be adopted. Moreover, the power spectral density, peak to average power ratio (PAPR) and bit error rate (BER) of the OTFS-BFDM system with different PWFs are compared. Simulation results show that: i) the use of BFDM modulation significantly inhibits the OOBE of OTFS system; ii) the better the frequency-domain localization of PWFs, the smaller the BER and PAPR of OTFS-BFDM system.

  • Practical Solution for Broadcasting in VANETs Using Neighbor Information

    Celimuge WU  Satoshi OHZAHATA  Toshihiko KATO  

     
    PAPER-Network

      Vol:
    E96-B No:11
      Page(s):
    2856-2864

    Due to vehicle movement and lossy wireless channels, providing a reliable and efficient multi-hop broadcast service in vehicular ad hoc networks (VANETs) is a well-known challenging problem. In this paper, we propose BR-NB (broadcast with neighbor information), a fuzzy logic based multi-hop broadcast protocol for VANETs. BR-NB achieves a low overhead by using only a subset of neighbor nodes to relay data packets. For the relay node selection, BR-NB jointly considers multiple metrics of the inter-vehicle distance, vehicle mobility and link quality by employing fuzzy logic. Since the expected coverage and vehicle mobility are inferred from the two-hop neighbor information which can be acquired from the hello message exchange, BR-NB is independent of position information. BR-NB provides a practical and portable solution for broadcast services in VANETs. We use computer simulations and real-world experiments to evaluate the performance of BR-NB.

  • Future Channel Utilization-Aware Routing for Cognitive Radio Ad Hoc Networks

    Celimuge WU  Juan XU  Yusheng JI  Satoshi OHZAHATA  Toshihiko KATO  

     
    PAPER

      Vol:
    E98-B No:1
      Page(s):
    107-115

    Cognitive radio ad hoc networks can be used to solve the problems of limited available spectrum and inefficient spectrum usage by adaptively changing their transmission parameters. Routing protocol design has a significant impact on the network performance. However, an efficient protocol that takes account of primary user flows and the long-term channel assignment issue in route selection is still missing. In this paper, we propose AODV-cog, a cognitive routing protocol for CSMA/CA ad hoc networks based on AODV. AODV-cog chooses a route by considering the effect on the primary users, available channel bandwidth and link reliability. AODV-cog also takes account of future channel utilization which is an important but underexplored issue. AODV-cog switches channels for secondary user flows when network congestion occurs. We use theoretical analysis and computer simulations to show the advantage of AODV-cog over existing alternatives.

  • VANET Broadcast Protocol Based on Fuzzy Logic and Lightweight Retransmission Mechanism

    Celimuge WU  Satoshi OHZAHATA  Toshihiko KATO  

     
    PAPER-Network

      Vol:
    E95-B No:2
      Page(s):
    415-425

    Vehicular ad hoc networks have been attracting the interest of both academic and industrial communities on account of their potential role in Intelligent Transportation Systems (ITS). However, due to vehicle movement and fading in wireless communications, providing a reliable and efficient multi-hop broadcast service in vehicular ad hoc networks is still an open research topic. In this paper, we propose FUZZBR (FUZZy BRoadcast), a fuzzy logic based multi-hop broadcast protocol for information dissemination in vehicular ad hoc networks. FUZZBR has low message overhead since it uses only a subset of neighbor nodes to relay data messages. In the relay node selection, FUZZBR jointly considers multiple metrics of inter-vehicle distance, node mobility and signal strength by employing the fuzzy logic. FUZZBR also uses a lightweight retransmission mechanism to retransmit a packet when a relay fails. We use computer simulations to evaluate the performance of FUZZBR.

  • Feature Based Modulation Classification for Overlapped Signals

    Yizhou JIANG  Sai HUANG  Yixin ZHANG  Zhiyong FENG  Di ZHANG  Celimuge WU  

     
    LETTER-Digital Signal Processing

      Vol:
    E101-A No:7
      Page(s):
    1123-1126

    This letter proposes a novel modulation classification method for overlapped sources named LRGP involving multinomial logistic regression (MLR) and multi-gene genetic programming (MGGP). MGGP based feature engineering is conducted to transform the cumulants of the received signals into highly discriminative features and a MLR based classifier is trained to identify the combination of the modulation formats of the overlapped sources instead of signal separation. Extensive simulations demonstrate that LRGP yields superior performance compared with existing methods.