Ai-Chun Pang

National Taiwan University, T’ai-pei, Taipei, Taiwan

Are you Ai-Chun Pang?

Claim your profile

Publications (95)68.14 Total impact

  • Source
    Computer Communications 03/2015; 58(1). DOI:10.1016/j.comcom.2015.02.001 · 1.35 Impact Factor
  • IEEE Transactions on Computers 01/2015; DOI:10.1109/TC.2015.2394453 · 1.47 Impact Factor
  • 01/2015; DOI:10.1109/TETC.2015.2433936
  • Computer Communications 01/2015; · 1.35 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the rapid growth of mobile data traffic, operators are expected to densely deploy base stations to meet user demands. Recent researches have indicated that the densely deployed base stations lead to the significant increase of the operational expenses of operators due to the electricity bills to maintain their operation, and thus the profit of operators is greatly decreased. Different from the past works in dynamically switching on/off base stations for energy saving, we propose to consider the benefits of users in service fee discounts as a joint optimization process in cutting down the energy consumption of base stations to maximize the total profit of operators. The optimization problem is formulated and shown being NP-hard. We then propose a profit-aware algorithm to switch off base stations, as needed, with the adjustment of the data rates provided to the users who are willing to receive discounts. The simulation results show that the proposed algorithm can significantly increase the total profit of operators and introduce a win-win situation to both users and operators.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Thanks to the recent advance on power engineering and wireless communications, the smart grid technology has emerged and users are now capable of deploying renewable energy generators and storage devices at their homes. On the other side, due to the rise of environmental consciousness, electric companies are eager to replace traditional generators with renewable energy. One of the most efficient ways is to provide an electricity buyback scheme for electric companies to encourage users to generate more renewable energy at their homes. Different from the previous works, we consider dynamic pricing with renewable energy buyback as our target scenario. We formulate the dynamic pricing problem as a convex optimization problem and propose a day-ahead time-dependent pricing scheme. The goal of our developed framework is to achieve the maximum benefits for both users and electric companies. To the best of our knowledge, this is one of the very first works to tackle the time-dependent problem with taking the environmental benefit of renewable energy into consideration for smart grid. The numerical results show that our framework can significantly reduce the peak time loading and efficiently balance the system energy provision.
    2014 ICC - 2014 IEEE International Conference on Communication Workshop (ICC); 06/2014
  • Yuan-Yao Shih, Ai-Chun Pang, Pi-Cheng Hsiu
    [Show abstract] [Hide abstract]
    ABSTRACT: With the increasing sophistication and maturity of biomedical sensors and the significant advances on low-power circuits and wireless communications technologies, wireless body area networks (WBANs) have emerged recently to provide pervasive health monitoring for humans. In WBANs, smart phones can serve as data sinks to forward the sensing data to back-end servers. Due to the battery concern of smart phones and the postural changes of humans, temporary disconnection between sensors and their associated smart phones may frequently happen in WBANs. In this case, the sensing data would be lost when the limited memory space of sensors overflows. To prevent excessive data loss, this paper proposes a scheme to parasitize the data on existing public Wi-Fi networks, once the links from sensors to the smart phones become unavailable. Specifically, an optimization problem to maximize the time during which data loss can be avoided by exploiting the data parasitizing scheme is formulated, where a decision set of the packets' size and sending timing to public Wi-Fi networks needs to be determined. We develop an offline algorithm to obtain an optimal decision set and present an efficient online algorithm for practical implementations. The feasibility of the proposed scheme and the efficacy of the algorithms are demonstrated through prototype implementations on a WBAN testbed with biomedical sensor devices for real-world experiments.
    2014 IFIP Networking Conference; 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Human mobility models strongly affect the performance in Mobile Ad Hoc Network (MANET). In order to get a more precise estimation of routing performance, it is crucial to construct a more realistic human mobility model. There are three properties investigated in literature which represent the patterns of human mobility. This paper analyzes real human traces and introduces a new property that the inter-hub movement of a human is not straight. We then construct a new random human mobility model called Irregular Orbit Levy-walk (IROL), and verify its ability to capture all of the four properties simultaneously. To investigate the feasibility of IROL, we measure routing performance of real traces, IROL, and other models in MANET on two data sets. In both data sets, IROL describes the real traces the best in terms of throughput and receive rate.
    ICC 2014 - 2014 IEEE International Conference on Communications; 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: Mobile users have become increasingly addicted to multimedia applications which are extremely downlink-intensive. We observed that conventional objectives, like rate adaptive and margin adaptive, adopted for radio resource allocation may lead to unnecessary energy consumption of mobile devices, which is adverse to the development of mobile multimedia applications. This paper presents an alternative objective, called energy adaptive, and formulates the energy-efficient downlink resource allocation problem. The objective is to minimize the total energy consumption of mobile devices for data reception while satisfying users' data rate requirements and base station's available transmit power. We prove that the target problem is NP-hard and propose an efficient heuristic algorithm to solve the problem. The results of simulations conducted to evaluate the efficacy of the proposed algorithm agree with our observation on the conventional objectives, as well as providing some useful insights into the design of energy-efficient downlink resource allocation for wireless systems.
    2013 IEEE Globecom Workshops (GC Wkshps); 12/2013
  • Wei-Te Wong, Ai-Chun Pang, Miao-Ru Hsu
    [Show abstract] [Hide abstract]
    ABSTRACT: The next-generation cellular networks are envisioned to operate with heterogeneous wireless networks. Under such scenario, user device is required to periodically perform sensing for available RATs and switch between the one that best fits its current usage scenario. Such requirement may be highly energy-consuming; hence, efficient RAT selection mechanism is necessary to help user device select the best available RAT for its data transmission. In this paper, we propose a mechanism to make accurate RAT access recommendations to user devices by the Support Vector Machine tool, which can reduce unnecessary energy consumption due to periodic sensing. Simulation results demonstrate that our proposed methodology is highly accurate and capable of maintaining the average number of sensings as low as possible.
    Proceedings of the 2013 Research in Adaptive and Convergent Systems; 10/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Recently, large-scale data centers are widely built to support various kinds of cloud services, which are mostly delivered by multicast. Even with multicast, cloud services may still generate a large amount of data traffic in some bottleneck links and, even worse, cause network congestion. Thus, how to reduce the redundancy of data transmissions to mitigate network congestion is essential. In addition to wired transmissions, modern data centers adopt wireless links to augment network capacity. Under the coexisting scenario of wired and wireless links, this paper studies multicast data delivery problem. Specifically, a multicast tree problem is defined, and the objective is to minimize the total multicast data traffic. We prove the problem is NP-hard and propose an efficient heuristic algorithm to solve the problem. A series of experiment results shows that our proposed algorithm is very effective, compared with an optimal solution designed for traditional wired data centers.
    38th Annual IEEE Conference on Local Computer Networks (LCN 2013); 10/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: ZigBee is a specification formalized by the IEEE 802.15.4 standard for low-power low-cost low-data-rate wireless personal area networks. In ZigBee networks, a tree topology is often used to construct a wireless sensor network for data delivery applications. However, delivery failures constantly occur in ZigBee wireless applications due to node movements and network topology changes. The conventional route reconstruction method is designed to mitigate the effects of topology changes, but it consumes a large amount of resources. In this paper, we exploit the regularity in node mobility patterns to reduce the frequency of route reconstructions and ensure that the transmission of data to mobile nodes is efficient. To increase the data delivery ratio and mitigate the effects of packet loss caused by the node mobility, we propose a ZigBee node deployment and tree construction framework. In particular, the framework considers the regularity in mobility patterns during the construction of the routing tree and deployment of nodes. It also includes an overhearing mechanism for mobile nodes to further improve the data delivery ratio. We present details of the proposed algorithms for node deployment and tree construction in the framework. The effectiveness of network topologies constructed under the framework is demonstrated through comprehensive ns-2 simulations based on two real-world scenarios. The results show that our approach can construct ZigBee tree topologies with a high data delivery ratio and low routing overhead.
    IEEE Transactions on Vehicular Technology 07/2013; 62(6):2763-2779. DOI:10.1109/TVT.2013.2245693 · 2.64 Impact Factor
  • Chien-Han Chai, Yuan-Yao Shih, Ai-Chun Pang
    [Show abstract] [Hide abstract]
    ABSTRACT: With the explosive growth of mobile data traffic, the femtocell technology is one of the proper solutions to enhance mobile service quality and system capacity for cellular networks. However, one of the key problems for femtocell deployment is to find appropriate access control in which mobile operators and users are willing to be involved. Among all kinds of access control modes, the hybrid access mode is considered as the most promising one, which allows femtocells to provide preferential access to femtocell owners and subscribers while other public users can access femtocells with certain restriction. Since all femtocell owners are selfish, how to provide enough incentives to the owners for sharing their femtocell resources is challenging. In this paper, we construct an economic framework for mobile operator and femtocell users by a game theoretical analysis and introduce the concept of profit sharing to provide a positive cycle to sustain the femtocell service. In this framework, a femtocell game is formulated, where the femtocell owners determine the proportion of femtocell resources shared with public users while the operator can maximize its own benefit by determining the ratio of revenue distribution to femtocell owners. The existence of the Nash equilibrium of the game is analyzed. Extensive simulations are conducted to show that the profit of the operator can be maximized while the service requirements of users can be maintained by the proposed framework.
    INFOCOM, 2013 Proceedings IEEE; 01/2013
  • Hsin-Chun Wu, Shuo-Cheng Hu, Ai-Chun Pang
    [Show abstract] [Hide abstract]
    ABSTRACT: Cognitive radio (CR) network is proposed to solve the utilization of radio spectrum resource. Spectrum trading has been an interesting topic in CR networks. In this paper, we formulate the problem as a game between multiple primary users (PUs) and multiple secondary users (SUs). We model the dynamic behavior of SUs using the theory of evolutionary game and the competition among PUs using a non-cooperative game. An evolution algorithm is presented to achieve the evolutionary equilibrium for a SU. For a PU, an iterative algorithm for strategy adaption to achieve Nash equilibrium is presented. We also introduce the idea of giving discount to the SUs which can provide help for the PU in broadcasting information. The numerical results show that our proposed model can achieve the optimal equilibrium point and the payoffs of both PUs and SUs are higher than those in the ordinary pricing-based game.
    Advances in Intelligent Systems and Applications - Volume 1, 01/2013: pages 581-590;
  • Source
    Ya-Ju Yu, Pi-Cheng Hsiu, Ai-Chun Pang
    [Show abstract] [Hide abstract]
    ABSTRACT: Layer-based video coding, together with adaptive modulation and coding, is a promising technique for providing real-time video multicast services on heterogeneous mobile devices. With the rapid growth of data communications for emerging applications, reducing the energy consumption of mobile devices is a major challenge. This paper addresses the problem of resource allocation for video multicast in fourth-generation wireless systems, with the objective of minimizing the total energy consumption for data reception. First, we consider the problem when scalable video coding is applied. We prove that the problem is NP-hard and propose a 2-approximation algorithm to solve it. Then, we investigate the problem under multiple description coding, and show that it is also NP-hard and cannot be approximated in polynomial time with a ratio better than 2, unless P=NP. To solve this case, we develop a pseudo-polynomial time 2 approximation algorithm. The results of simulations conducted to compare the proposed algorithms with a brute-force optimal algorithm and a conventional approach are very encouraging.
    IEEE Transactions on Mobile Computing 10/2012; 11(99-PP):1 - 1. DOI:10.1109/TMC.2011.186 · 2.91 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: ZigBee, a unique communication standard designed for low-rate wireless personal area networks, has extremely low complexity, cost, and power consumption for wireless connectivity in inexpensive, portable, and mobile devices. Among the well-known ZigBee topologies, ZigBee cluster-tree is especially suitable for low-power and low-cost wireless sensor networks because it supports power saving operations and light-weight routing. In a constructed wireless sensor network, the information about some area of interest may require further investigation such that more traffic will be generated. However, the restricted routing of a ZigBee cluster-tree network may not be able to provide sufficient bandwidth for the increased traffic load, so the additional information may not be delivered successfully. In this paper, we present an adoptive-parent-based framework for a ZigBee cluster-tree network to increase bandwidth utilization without generating any extra message exchange. To optimize the throughput in the framework, we model the process as a vertex-constraint maximum flow problem, and develop a distributed algorithm that is fully compatible with the ZigBee standard. The optimality and convergence property of the algorithm are proved theoretically. Finally, the results of simulation experiments demonstrate the significant performance improvement achieved by the proposed framework and algorithm over existing approaches.
    IEEE Transactions on Parallel and Distributed Systems 03/2012; 23(3):513-520. DOI:10.1109/TPDS.2011.192 · 2.17 Impact Factor
  • Source
    Yung-Feng Lu, Chin-Fu Kuo, Ai-Chun Pang
    [Show abstract] [Hide abstract]
    ABSTRACT: Wireless Embedded Systems (WEBs) has attracted significant interest in recent years, for instance, Wireless Sensor Networks (WSN), have recently been in the limelight for many domains. The characteristics of WEBs have imposed various restrictions on their system designs. Since embedded systems usually are developed by low-cost hardware, one major challenge in the development of many WEBs applications is to provide high-security features with limited resources. In this paper, we propose a novel key establishment scheme, named half-key scheme that based on the well-known random key pre-distribution scheme and DDHV-D deployment knowledge to provide resource-efficient key management in WEBs with reduced memory space requirements and better security enforcement. The capability of the proposed approach is evaluated by an analytical model and a series of experiments.
    ACM SIGAPP Applied Computing Review 03/2012; 12(1):50-59. DOI:10.1145/2188379.2188384
  • [Show abstract] [Hide abstract]
    ABSTRACT: ZigBee, a unique communication standard designed for low-rate personal area networks, has extremely low complexity, cost, and power consumption for wireless connectivity in inexpensive, portable, and mobile devices. Among the well-known ZigBee topologies, the cluster tree is especially suitable for wireless sensor networks because of its support for power saving operations and light-weight routing. However, the restricted routing paths caused by the cluster tree would form transmission bottlenecks such that it is difficult to guarantee quality of service (QoS) for critical packet deliveries in mission-critical networks. To address the problem, we propose a QoS-oriented framework with an analytical model to provide stochastic QoS guarantees for urgent information deliveries in ZigBee cluster-tree networks. Through analysis and simulations, we demonstrate the efficacy of the proposed framework.
    Communications (ICC), 2012 IEEE International Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Data center plays an important role in cloud computing. Cloud computing provides novel perspectives in Internet technologies and raises issues in the architecture, protocol, and implementation of existing networks and data centers. Although various cloud-based data center architectures have been proposed in recent years, some challenging issues, e.g., congestion control, load balancing and energy efficiency, still need to be addressed. In this paper, we present the designs of network architecture for data center servers, and then analyze and compare several promising solutions to tackle those challenging problems.
    Wireless Personal Multimedia Communications (WPMC), 2012 15th International Symposium on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless charging technology is considered as one of the promising solutions to solve the energy limitation problem for large-scale wireless sensor networks. Obviously, charger deployment is a critical issue since the number of chargers would be limited by the network construction budget, which makes the full-coverage deployment of chargers infeasible. In many of the applications targeted by large-scale wireless sensor networks, end-devices are usually equipped by the human and their movement follows some degree of regularity. Therefore in this paper, we utilize this property to deploy chargers with partial coverage, with an objective to maximize the survival rate of end-devices. We prove this problem is NP-hard, and propose an algorithm to tackle it. The simulation results show that our proposed algorithm can significantly increase the survival rate of end-devices. To our knowledge, this is one of very first works that consider charger deployment with partial coverage in wireless rechargeable sensor networks.
    Network Operations and Management Symposium (APNOMS), 2012 14th Asia-Pacific; 01/2012

Publication Stats

595 Citations
68.14 Total Impact Points

Institutions

  • 2004–2015
    • National Taiwan University
      • Department of Computer Science and Information Engineering
      T’ai-pei, Taipei, Taiwan
  • 2012–2014
    • Academia Sinica
      • Research Center for Information Technology Innovation
      T’ai-pei, Taipei, Taiwan
  • 2005–2007
    • National Tsing Hua University
      Hsin-chu-hsien, Taiwan, Taiwan
  • 2003
    • Quanta Computer Inc.
      Taoyuan City, Taiwan, Taiwan
  • 2000–2001
    • National Chiao Tung University
      • Institute of Computer Science and Engineering
      Hsin-chu-hsien, Taiwan, Taiwan