Hui Tang

Chongqing University, Ch’ung-ch’ing-shih, Chongqing Shi, China

Are you Hui Tang?

Claim your profile

Publications (70)28.46 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: Using renewable energy system in powering cellular base stations (BSs) has been widely accepted as a promising avenue to reduce and optimize energy consumption and corresponding carbon footprints and operational expenditures for 4G and beyond cellular communications. However, how to design a reliable and economical renewable energy powering (REPing), while guaranteeing communication reliability, renewable energy utilization, and system durability, is still a great challenge. Motivated by this challenge, we firstly model the dynamic energy flow behavior of solar energy-powered BS by using stochastic queue model, jointly considering instability of solar energy generation, non-linear effects of energy storage, and time varies of traffic load. On the basis of the model, three key performance metrics, including service outage probability (SoP), solar energy utilization efficiency (SEuE), and mean depth of discharge (MDoD), are defined, and close-form expressions of them are derived. Finally, under the guidelines of defined metrics, the sizing optimization problem is formulated, and then we propose the capital expenditure (CAPEX) minimization algorithm to resolve it with considerations of communication reliability, efficiency, and durability. Numerical results conducted to demonstrate the effectiveness of our proposed metrics vividly showed the close relationship between design metrics and system parameters. Simulation results also showed that our proposed algorithm can reduce at least 12.1% CAPEX compared with the classic algorithms and guarantee SoP below 0.82%, SEuE above 97%, and MDoD ranging from 7.2% to 9.1%, which means that the optimal design was achieved in terms of system reliability, efficiency, durability, and investment. The proposed modeling, design metrics, and sizing method provide a theoretical basis for actual designs of REPing BS system, which also can be further applied to the scenario of other forms of renewable energy powered system.
    No preview · Article · Dec 2015 · EURASIP Journal on Wireless Communications and Networking
  • [Show abstract] [Hide abstract]
    ABSTRACT: In the recent years, energy harvesting technology has been integrated into wireless sensor networks for resolving the energy “bottleneck” problems caused by the limited-capacity batteries equipped in traditional sensor nodes. However, due to the limited capacity of energy buffers equipped for storing the harvested energy, excessive harvested energy is indiscreetly discarded while sensor nodes are staying at the status of energy saturation. To address this issue, we present a topology control approach, for the energy harvesting wireless sensor network, that allows each node to adaptively adjust its transmission power for utilizing the harvested energy effectively. Specifically, we first model the behaviors of sensor nodes as an ordinal potential game where the high harvesting power nodes cooperate with the low harvesting power nodes to maintain the connectivity of the whole network. And we theoretically prove the existence of a Nash equilibrium for the game. Then, a polynomial-time algorithm is proposed to achieve the Nash equilibrium. Simulation results show that our proposed scheme improves the energy availability and outperforms existing energy-aware schemes in terms of energy conservation and balanced distribution.
    No preview · Article · Apr 2015 · Ad Hoc Networks
  • Qian Tan · Yanwei Liu · Yanni Han · Wei An · Song Ci · Hui Tang
    [Show abstract] [Hide abstract]
    ABSTRACT: A cross-layer based QoS optimization algorithm for wireless traffic networking is presented in this paper. In terms of the fuzzy measure theory, we propose a nonlinear wireless traffic networking optimization model based on the Choquet integral. The model can characterize not only the protocol parameters’ significance but also the interdependency among those parameters on the QoS of data transmission by a non-additive function. The distinct characteristic of the proposed model lies in that the contribution of interaction among the system parameters to the network performance can be evaluated quantitatively by a general nonlinear and non-additive integral. Once the network condition cannot satisfy the user’s QoS requirement, the most significant networking parameters can be adjusted to improve the data transmission performance and further achieve the user’s QoS demand. Finally, simulation results are given to verify the effectiveness and efficiency of the proposed method over the WLAN network.
    No preview · Article · Oct 2014
  • Lei Yang · Yifang Qin · Xu Zhou · Hongjia Li · Song Ci · Hui Tang

    No preview · Article · Sep 2014 · Journal of Networks
  • [Show abstract] [Hide abstract]
    ABSTRACT: Information Centric Network (ICN) is an emerging network paradigm centered around the named contents rather than the host-to-host connectivity. The common characteristic of ICN leverages in-network caching to achieve an efficient and reliable content distribution but also brings challenges. The in-network caching technique equips all ICN routers with cache storage. However, no existing works focus on the cache storage sharing mechanism among different applications to satisfy the line speed requirements and diversity of applications in ICN. In this paper, we formulate the per-application storage management problem into an optimized resource allocation problem and introduce a manifold learning method to classify the priority of applications. Dynamic programming is adopted to solve the formulated problem and an adaptive per-application storage management scheme is proposed on the basis of the optimal solutions. Extensive experiments have been performed to evaluate the proposed scheme and show that our approach is superior to static partitioning and shared storage schemes.
    No preview · Article · Jul 2014 · Future Generation Computer Systems
  • Yuemei Xu · Yang Li · Tao Lin · Zihou Wang · Wenjia Niu · Hui Tang · Song Ci
    [Show abstract] [Hide abstract]
    ABSTRACT: Content Centric Networking (CCN) is an emerging network architecture, shifting from an end-to-end connection to a content centric communication model. Each router in CCN has a content store module to cache the chunks passed by, and is arranged in an arbitrary network topology. It is important to allocate an appropriate cache size to each router in order to both improve the network performance and reduce the economic investment. Previous works have proposed several heterogeneous cache allocation schemes, but the gain brought by these schemes is not obvious. In this paper, we introduce a data mining method into the cache size allocation. The proposed algorithm uses manifold learning to analyze the regularity of network traffic and user behaviors, and classify routers based on their roles in the content delivery. Guided by the manifold learning embedding results, a novel cache size optimization scheme is developed. Extensive experiments have been performed to evaluate the proposed scheme. Simulation results show that the proposed scheme outperforms the existing cache allocation schemes in CCN.
    No preview · Article · Jan 2014 · Journal of Network and Computer Applications
  • Shoushou Ren · Yinlong Liu · Xu Zhou · Hui Tang · Song Ci · Min Wang
    [Show abstract] [Hide abstract]
    ABSTRACT: Peer selection is one of the key issues in wireless peer-to-peer (P2P) networks and most of the traditional methods and algorithms those have been proposed are only based on homogeneous network. However, networks in the future will be highly heterogeneous. Different kinds of wireless networks such as GSM, UMTS, WLAN, exist together in the same area and different networks have different features and abilities. Thus peer selection in heterogeneous wireless networks will become more realistic. To solve this problem, we first propose a novel mechanism in which peer and its access network are treated together as a whole entity, which we call a virtual peer and then propose a virtual peer selection (VPS) algorithm based on information entropy theory and utility function to complete our mechanism. Simulation results show that our mechanism has much better performance. Simulations show that our mechanism has a better performance both in peer ability and energy consumption.
    No preview · Conference Paper · Dec 2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the rapid development of wireless networks and mobile terminals (MTs), cooperation among MTs in heterogeneous wireless networks is currently widely investigated. Cooperation among MTs has a lot of advantages such as increasing network throughput, decreasing file download time, saving energy. Traffic distribution, which means how to distribute the traffic to the cooperating MTs, is a key issue in MTs cooperation. To improve the quality of service and user's experience, we propose two distribution approaches: time-based approach and AHP-based (analytic hierarchy process based) approach. In time-based approach, an optimization model is used, in which the transmit time is decreased to the shortest. Besides, with the QoS parameters and cost taken into consideration, we proposed the AHP-based approach, in which the client's preference is also considered. Both the two proposed approaches show better performance than the traditional approach.
    No preview · Conference Paper · Dec 2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Coverage is an importance issue in wireless sensor networks. In this work, we first propose a novel notion of information coverage, which refers to the coverage efficiency of field information covered by deployed sensor nodes. On the basis of information coverage, we consider an optimization problem of how to partition the given field into multiple parcels and to deploy sensor nodes in some selected parcels such that the field information covered by the deployed sensor nodes meets the requirement. First, we develop two effective polynomial-time algorithms to determine the deployed locations of source nodes for information 1-coverage and q-coverage of the field, respectively, without consideration of communication, where information q-coverage implies that the field information in terms of information point is covered by at least q source nodes. Also, we prove the upper bound in the theoretical for the approximate solution derived by our proposed method. Second, another polynomial-time algorithm is presented for deriving the deployed locations of relay nodes. In the theoretical, this proposed algorithm can achieve the minimized number of relay nodes. Further, the related information 1-coverage algorithms are applied in our wireless sensor network-based automatic irrigation project in precision agriculture. Experimental results show the major trade-offs of impact factors in sensor deployment and significant performance improvements achieved by our proposed method. Copyright © 2013 John Wiley & Sons, Ltd.
    No preview · Article · Oct 2013 · Wireless Communications and Mobile Computing
  • Yuemei Xu · Wenjia Niu · Hui Tang · Gang Li · Zhijun Zhao · Song Ci
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) are attractive for monitoring and gathering physical information (e.g. temperature) via lots of deployed sensors. For the applications in WSNs, Web service is one of the recommended frameworks to publish, invoke, and manage services. However, the standard Web service description language (WSDL), defines only the service input and output while ignoring the corresponding input-to-output mapping relationships. This presents a serious challenge in distinguishing services with similar input and output interface. In this paper, we address this challenge by embedding the service policy into the traditional WSDL2.0 schema to describe the input-to-output mapping relationships. The service policy is then transformed into a policy binary tree so that the similarity between different Web services can be quantitatively evaluated. Furthermore, a new service redundancy detection approach is proposed based on this similarity. Finally, the case study and experimental analysis illustrate the applicability and capability of the proposed service redundancy detection approach.
    No preview · Article · Sep 2013 · Journal of Network and Systems Management
  • Shoushou Ren · Yinlong Liu · Xu Zhou · Hui Tang · Song Ci
    [Show abstract] [Hide abstract]
    ABSTRACT: Cooperation among mobile terminals (MTs) in heterogeneous wireless networks is currently widely investigated. Cooperation among MTs has a lot of advantages such as increasing network throughput, decreasing file download time, saving energy and so on. Since different cooperate MTs have different influence on quality of service and user's experience, MT selection becomes a key issue in MTs cooperation. To improve the quality of service and user's experience, we propose a novel mechanism for MT selection which we call NMC (Network MTs Cooperation) mechanism in this paper. In NMC mechanism, MTs and its access network are integrated as a virtual MT. Then we propose a Cooperative Terminal Selection (CTS) algorithm to select the optimal virtual MT. Simulation results show that NMC can help to save energy consumption of MTs as well as ensure the download rates.
    No preview · Conference Paper · Jul 2013
  • Zihou Wang · Yanni Han · Tao Lin · Yuemei Xu · Song Ci · Hui Tang
    [Show abstract] [Hide abstract]
    ABSTRACT: Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtual nodes and virtual edges onto substrate networks. Previous research has presented several heuristic algorithms, which fail to consider that the attributes of the substrate topology and virtual networks affect the embedding process. In this paper, for the first time, we introduce complex network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering of the attributes of nodes and edges in the topology, our studies are more reasonable than existing work. In addition, with the guidance of topology quantitative evaluation, the proposed network embedding approach largely improves the network utilization efficiency and decreases the embedding complexity. We also investigate our algorithms on real network topologies (e.g., AT&T, DFN) and random network topologies. Experimental results demonstrate the usability and capability of the proposed approach.
    No preview · Article · Jun 2013 · Frontiers of Computer Science (print)
  • Zihua Wang · Yanni Han · Tao Lin · Hui Tang
    [Show abstract] [Hide abstract]
    ABSTRACT: Network virtualization has been a promising technology for overcoming the Internet impasse. A main challenge in network virtualization is the efficient assignment of virtual resources. Existing work focused on intra-domain solutions whereas inter-domain situation is more practical in realistic setting. In this paper, we present a distributed inter-domain framework for mapping virtual networks to physical networks which can ameliorate the performance of the virtual network embedding. The distributed framework is based on a Multi-agent approach. A set of messages for information exchange is defined. We design different operations and IPTV use scenarios to validate the advantages of our framework. Use cases shows that our framework can solve the inter-domain problem efficiently.
    No preview · Article · Mar 2013 · Proceedings of SPIE - The International Society for Optical Engineering

  • No preview · Conference Paper · Jan 2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: The traditional cross-layer model for video streaming can achieve significant improvement to the end-to-end video quality. However, the video quality measurement in terms of sum of squared error (SSE) in the model does not always correlate well with the perception of the human visual system. In this paper, we propose a perceptual quality driven cross-layer optimization scheme based on the structural similarity (SSIM) index for wireless video streaming. The H.264/AVC encoding parameters on the application layer and the modulation and channel coding modes on the physical layer are mainly considered to optimize the end-to-end perceptual video quality. In order to decrease the computation complexity, a low complexity optimization algorithm based on the rate-quantization (R-Q) model is proposed to reduce the range of the candidate optimization parameters. Experimental results show that the proposed SSIM-based cross-layer optimization scheme achieves better perceptual quality than the SSE-based cross-layer optimization scheme, and the proposed low complexity optimization algorithm can achieve about 62% computation decrease compared to the conventional exhaustive searching algorithm with little loss in perceptual quality.
    No preview · Conference Paper · Jan 2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: The SSIM-based rate distortion optimization (R-DO) has been proved to be an effective way to promote the perceptual video coding performance, and the Lagrange multiplier decision is the key to the SSIM-based RD-optimized video coding. Through extensively analyzing the characteristics of SSIM-based and SSE-based video distortions, this paper presents a low-complexity content-adaptive Lagrange multiplier decision method. The proposed method first estimates frame-level SSIM-based Lagrange multiplier by scaling the traditional SSE-based Lagrange multiplier with the ratio of SSE-based distortion to SSIM-based distortion. Via predicting the macroblock's perceptual importance in the whole frame, the macroblock-level Lagrange multiplier is further refined to promote the accuracy of the Lagrange multiplier decision. Experimental results show that the proposed method can obtain almost the same rate-SSIM performance and subjective quality as the state-of-the-art SSIM-based RD-optimized video coding methods with lower computation overheads.
    No preview · Conference Paper · Jan 2013
  • Tongmin Fu · Yang Li · Tao Lin · Hongyan Tan · Hui Tang · Song Ci
    [Show abstract] [Hide abstract]
    ABSTRACT: Content-Centric Networking (CCN), a typical future Internet architecture focused on content dissemination and retrieval, brings a paradigm shift in network model by addressing named-data instead of host location. Many fields related to CCN become the research hotspots, such as caching and name-based routing. However, little work has addressed on its transmission protocol in literature. In this paper, we proposed an effective Congestion Control Scheme (CCS) in CCN through combining a router-driven congestion forecast with a requester-driven Interest control protocol. Each router detects the network congestion status and then informs the requester by setting Congestion Information Bits into the returned Data packet passed by. Then the requester dynamically adjusts its Interest sending window according to the received feedback congestion information. Furthermore, in our scheme, a Fair Queuing algorithm is used on each router, allowing max-min fair share of the link capacity. A performance evaluation using simulation designed on OMNet++ network simulator showed that the proposed CCS causes fewer packet losses, decreases Data packet delay, treats each flow fairly and maximizes the use of bandwidth.
    No preview · Conference Paper · Dec 2012
  • Zihou Wang · Yanni Han · Tao Lin · Hui Tang · Song Ci
    [Show abstract] [Hide abstract]
    ABSTRACT: Network virtualization provides a powerful way to run multiple heterogeneous virtual networks (VNs) at the same time on a shared substrate network. A major challenge in network virtualization is the efficient virtual network embedding: mapping virtual nodes and virtual edges onto substrate networks. Previous researches have presented several heuristic algorithms, which fail to consider the topology attributes of substrate and virtual networks. However, the topology information affects the performance of the embedding obviously. In this paper, for the first time, we exploit the topology attributes of substrate and virtual networks, introduce network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering the topology information, our study is more reasonable than the existing work in coordinating node and edge embedding. In addition, with the guidance of topology quantitative evaluation, the proposed network embedding approaches largely improve the network utilization efficiency and decrease the embedding complexity. Experimental results demonstrate the usability and feasibility of the proposed approach.
    No preview · Conference Paper · Dec 2012
  • Jun Lei · WenJia Niu · YiFang Qin · Hui Tang · Song Ci
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks(WSNs) are always deployed for monitoring and gathering physical information via lots of sensors. For facilitating the internet usage of WSN, Web service is regarded as the most promising technology to wrap the sensor functionality to form WSN service. With the growth of WSN services, making service ranking to help users select the best performance services becomes more and more important. However, traditional service ranking only considering from user's perspective does not suit WSN service any more due to the dynamic WSN environment and slow-reacting characteristic of user ratings. In order to address this problem, in this article, we propose a context-aware WSN service ranking approach by aggregating the user rating and WSN service context. Firstly, the User QoS Assessment(UQA) and Context QoS Assessment(CQA) are proposed respectively. Then through investigating the performance influence of WSN service brought by their context variation, a fuzzy-based mechanism is further developed for the aggregation of UQA and CQA. The case study and experimental evaluation show the validity of the proposed approach.
    No preview · Conference Paper · Dec 2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Efficient information routing mechanism is a critical research issue for wireless sensor networks (WSN) due to the limit energy and storage resource of sensor nodes. The clustering-based approaches (e.g. LEACH, Gupta and CHEF) for information routing have been developed. Although these approaches did actually improve the routing efficiency and prolong the network lifetime, the clustering frequency f is usually pre-designed and fixed. However, the network context (e.g. Energy and load) often dynamically changes, which can provide the dynamical adjustment determination for f. Hence, in this paper, we propose a frequency-adaptive cluster-head election approach, which applies the network context for making corresponding f adjustment. Furthermore, an f -based clustering algorithm is presented as well. The case study and experimental evaluations demonstrate the effectiveness of the proposed approach.
    No preview · Chapter · Oct 2012

Publication Stats

308 Citations
28.46 Total Impact Points

Institutions

  • 2010-2015
    • Chongqing University
      • Department of Communication Engineering
      Ch’ung-ch’ing-shih, Chongqing Shi, China
  • 2009-2013
    • Chinese Academy of Sciences
      • • Institute of Acoustics
      • • High Performance Network Laboratory
      Peping, Beijing, China
  • 2009-2010
    • Institute of Aviation
      Warszawa, Masovian Voivodeship, Poland