異種混合ネットワークサービス資源協調フレームワーク大石晴夫,矢守恭子,張成,田中良明, 複数の通信方式を組み合わせて通信ネットワークを構築するコグニティブネットワークや異種混合ネットワークにおける利用者の協調による効用，コスト削減，インセンティブメカニズムが研究されている．一方，多様な通信方式のサービスが一般に普及している中で，社会環境の変化に対応した協調行動を取り入れ，これらを統合して利用者にサービス提供するフレームワークは提案されていない．本論文では，交通分野におけるサービス提供の概念であるMaaS (Mobility as a Service)に注目し，MaaSのコンセプトを取り込んだSHaaS (Sharing framework for Heterogeneous network as a Service)を提案する．SHaaSにおける事業者と利用者の間のリソース共有により，利用者の効用と事業者の収益の向上を目指す．SHaaSのアーキテクチャ，料金モデルを提案し，モデルに基づくシミュレーションにより有効性を評価した．従来のサービス提供形態と比較して，特にリソース不足の条件下における高い有効性を示した．, 電子情報通信学会
電子情報通信学会論文誌(B), 2022年01月,
［査読有り］ Relation between Warning Error and Vehicle Speed in Vehicle-to-Pedestrian Warning System
Takahiro Suzuki; Kyoko Yamori; Cheng Zhang; Takumi Miyoshi; Yoshiaki Tanaka
22nd Asia-Pacific Network Operations and Management Symposium (APNOMS), 2021年09月08日, ［査読有り］
通信ネットワーク故障頻度とユーザ効用の関係を用いた回線リソース配分におけるオークション適用大石晴夫,矢守恭子,張成,田中良明, 近年の通信ネットワークの汎用化，アプリケーションサービスの浸透，通信品質に対する料金議論など，通信サービスにおける市場環境が大きく変化している．アプリケーション利用視点の利便が重要となり，アプリケーションを快適に利用可能な通信品質のサービスを，ユーザの望む適切な料金による提供が求められている．従来，通信品質の帯域に対する多数の研究があるが，信頼性に対する検討は少ない．通信サービスの故障が社会インフラに与える影響が拡大し信頼性の観点は重要となっている．そこで，通信サービスの信頼性がユーザ効用へ与える影響に注目して，通信サービスの故障発生時におけるユーザ全体の効用総和を評価する．本論文では，故障頻度に対するユーザ効用のWTP (支払意思額：Willingness To Pay)及びWTA (受取意思額：Willingness To Accept)の関係を活用して，ユーザ間で回線リソースのオークション取引を行う方式を提案した．単一区間及び複数区間に対する適用評価によりユーザ全体の総効用への有効性を示した．, 電子情報通信学会
電子情報通信学会論文誌(B), 2021年03月,
［査読有り］ Gait Phase Detection Based on Muscle Deformation with Static Standing-Based CalibrationTamon Miyake; Shintaro Yamamoto; Satoshi Hosono; Satoshi Funabashi; Zhengxue Cheng; Cheng Zhang; Emi Tamaki; and Shigeki Sugano, Gait phase detection, which detects foot-contact and foot-off states during walking, is important for various applications, such as synchronous robotic assistance and health monitoring. Gait phase detection systems have been proposed with various wearable devices, sensing inertial, electromyography, or force myography information. In this paper, we present a novel gait phase detection system with static standing-based calibration using muscle deformation information. The gait phase detection algorithm can be calibrated within a short time using muscle deformation data by standing in several postures; it is not necessary to collect data while walking for calibration. A logistic regression algorithm is used as the machine learning algorithm, and the probability output is adjusted based on the angular velocity of the sensor. An experiment is performed with 10 subjects, and the detection accuracy of foot-contact and foot-off states is evaluated using video data for each subject. The median accuracy is approximately 90% during walking based on calibration for 60 s, which shows the feasibility of the static standing-based calibration method using muscle deformation information for foot-contact and foot-off state detection., MDPI
Sensors, 2021年02月,
［査読有り］ SNS Data Based Tweet Similarity Evaluation for QoE Estimation
Takaaki Kirikae; Cheng Zhang; Kyoko Yamori; Yoshiaki Tanaka
2020 35th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC), 2020年07月03日, ［査読有り］
Heel-Contact Gait Phase Detection Based on Specific Poses with Muscle DeformationT.Miyake; Cheng Zhang; S.Hosono; S.Yamamoto; S.Funabashi; Zhang Cheng; and E.Tamaki, Gait phase detection and quantitative evaluation are significant for synchronous robotic assistance of human walking, rehabilitation training, or diagnosis of human motion state. Especially, accurate heel-contact detection in a gait cycle is a key requirement for gait analysis applications. Some techniques have been proposed by utilizing wearable devices, however, existing systems typically require precise and continuous time-series data at every single timestep for calibration, which largely increases the burden to users. Therefore, we propose a novel posing-based detection method through measuring muscle deformation, which only requires arbitrary and discrete posture data for calibration without walking. In this study, we firstly collected the posing data as the training set and gait data as the test set from participants through a FirstVR device. Then the Support Vector Machine was trained to be a two-class classifier of heel-contact and non-heel-contact phases by using the collected muscle deformation data during posing. Finally we propose an efficient evaluation system by taking advantage of OpenPose to automatically label our continuous gait data. Experimental results demonstrate the muscle deformation sensor could correctly detect heel-contact with approximately 80% accuracy during walking, which shows the feasibility of posing-based method with muscle deformation information for heel-contact detection.
The 2019 International Conference on Robotics and Biomimetics (IEEE ROBIO), 2019年12月,
［査読有り］ Incentive Mechanism Design for Crowdsourced Indoor LocalizationLi Wei; Cheng Zhang; Liu Zhi; Tanaka Yoshiaki, Wi-Fi based indoor localization systems require to construct a radio map by site survey.
,The process of site survey is time-consuming and crowdsourcing is one feasible option to tackle this issue.Meanwhile, privacy protection has drawn concerns from both industry and academia. In this paper, we propose two incentive mechanisms to stimulate mobile users (MUs) to contribute indoor trajectory data for crowdsourcing-based indoor localization with differential privacy to prevent MUs’ privacy leakage. The
,first mechanism considers fixed reward for MUs and incomplete information where each MU’s sensitivity level of the data privacy is unknown to the crowdsourcing platform (CP). The interaction between MUs and CP is formulated into a two-stage Stackelberg game to maximize MUs’ utility and CP’s profit. The second mechanism jointly considers the variable reward for MUs and assumes CP knows each MUs’ sensitivity level of the data privacy. A demand function is used to model the relationship among CP, MUs
,and service customer (SCs). The optimization problem of CP’s profit is studied to show the impact of the price fluctuation. Comprehensive simulations
IEEE Access, 2019年06月,
［査読有り］ A Novel Web Questionnaire Based Method for Video Quality Experiment
S.Eirai; K.Yamori; Cheng Zhang; and Y.Tanaka
The 34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2019),, 2018年12月, ［査読有り］
A Monte Carlo Based Computation Offloading Algorithm for Feeding Robot IoT SystemCheng Zhang; Takumi Ohashi; Miki Saijo; Jorge Solis; Yukio Takeda; Ann Louise Lindborg; Ryuta Takeda; Yoshiaki Tanaka, 筆頭著者, Ageing is becoming an increasingly major problem in European and Japanese societies. We have so far mainly focused on how to improve the eating experience for both frail elderly and caregivers by introducing and developing the eating aid robot, Bestic, made to get the food from plate to the mouth for frail elderly or person with disabilities. We expand the functionalities of Bestic to create food intake reports automatically so as to decrease the undernutrition among frail elderly and workload of caregivers through collecting data via a vision system connected to the Internet of Things (IoT) system. Since the computation capability of Bestic is very limited, computation offloading, in which resource intensive computational tasks are transferred from Bestic to an external cloud server, is proposed to solve Bestic’s resource limitation. In this paper, we proposed a Monte Carlo algorithm based heuristic computation offloading algorithm, to minimize the total overhead of all the Bestic users after we show that the target optimization problem is NP-hard in a theorem. Numeric results showed that the proposed algorithm is effective in terms of system-wide overhead.
Proceedings of 3rd International Conference on Smart Computing and Communication(SmartCom 2018), 2018年12月,
［査読有り］ Design of IoT System for Robotic Assistive Device with Multi-grip Tools and Vision System
Cheng Zhang; T.Ohashi; M.Saijo; J.Solis; Y.Takeda; A.-L.Lindborg; R.Takeda; Y.Tanaka
2018 IEICE Communications Society Conference, 2018年09月
Charging Content Providers in Non-Neutral Networks
B.Gu; Cheng Zhang; Y.Tanaka
2018 IEICE Communications Society Conference, 2018年09月
A Two-Sided Pricing and Privacy Preservation Based Incentive Mechanism for Mobile Crowdsensing
W.Li; Cheng Zhang; Z.Liu; Y.Tanaka
2018 IEICE Communications Society Conference, 2018年09月
Improved Global PLNC Based on High SNR MIMO Y Channel
Y.Chen; Cheng Zhang; Y.Tanaka
2018 IEICE Communications Society Conference, 2018年09月
Performance Anomaly Reduction by Autonomous Movement of Wireless LAN Access Points
Y.Hayashi; K.Yamori; Cheng Zhang; and Y.Tanaka
The 33rd International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2018),, 2018年07月, ［査読有り］
Image Recognition Based Wireless LAN Throughput Estimation
T.Ishida; K.Yamori; Cheng Zhang; and Y.Tanaka
The 33rd International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2018),, 2018年07月, ［査読有り］
A Deep Reinforcement Learning Based Approach for Cost- and Energy-Aware Multi-Flow Mobile Data OffloadingCheng Zhang; Z.Liu; B.Gu; K.Yamori; and Y.Tanaka, 筆頭著者, \With rapid increases in demand for mobile data, mobile network operators are trying to expand wireless network capacity by deploying WiFi hotspots to offload their mobile traffic. However, these network-centric methods usually do not fulfill interests of mobile users (MUs). MUs consider many problems to decide whether to offload their traffic to a complementary WiFi network. In this paper, we study the WiFi offloading problem from MU's perspective by considering delay-tolerance of traffic, monetary cost, energy consumption as well as the availability of MU's mobility pattern. We first formulate the WiFi offloading problem as a finite-horizon discrete-time Markov decision process (FDTMDP) with known MU's mobility pattern and propose a dynamic programming based offloading algorithm. Since MU's mobility pattern may not be known in advance, we then propose a reinforcement learning based offloading algorithm, which can work well with unknown MU's mobility pattern. Extensive simulations are conducted to validate our proposed offloading algorithms., IEEE
IEICE Transactions on Communications, 2018年07月,
［査読有り］ Topology Mapping for Popularity-aware Video Caching in Content-Centric Network
Z.Liu; M.Dong; S.Ishihara; Cheng Zhang; B.Gu; Y.Ji; Y.Tanaka
ICC 2018, 2018年05月, ［査読有り］
Global PLNC Based on High SNR MIMO Y Channel
Y.Chen; Cheng Zhang; B.Gu; Y.Tanaka
2018 IEICE General Conference, 2018年03月
IR-UWB Sensor Based Multiple Human Status Analysis and Identification
T.S.Chen; Cheng Zhang; Y.Tanaka
2018 IEICE General Conference, 2018年03月
A Heuristic Algorithm for Multi-Flow Mobile Data Offloading
Cheng Zhang; B.Gu; Z.Liu; K.Yamori; Y.Tanaka
2018 IEICE General Conference, 2018年03月
An Incentive Mechanism of Crowdsourcing Fingerprinting for Indoor Localization with Device Heterogeneity Reduction
W.Li; Cheng.Zhang; Z.Liu; Y.Tanaka
2018 IEICE General Conference, 2018年03月
Cost- and energy-aware multi-flow mobile data offloading using Markov decision processCheng Zhang; Bo Gu; Zhi Liu; Kyoko Yamori; Yoshiaki Tanaka, With the rapid increase in demand for mobile data, mobile network operators are trying to expand wireless network capacity by deploying wireless local area network (LAN) hotspots on which they can offload their mobile traffic. However, these network-centric methods usually do not fulfill the interests of mobile users (MUs). Taking into consideration many issues, MUs should be able to decide whether to offload their traffic to a complementary wireless LAN. Our previous work studied single-flow wireless LAN offloading from a MU's perspective by considering delay-tolerance of traffic, monetary cost and energy consumption. In this paper, we study the multi-flow mobile data offloading problem from a MU's perspective in which aMUhas multiple applications to download data simultaneously from remote servers, and different applications' data have different deadlines. We formulate the wireless LAN offloading problem as a finite-horizon discrete-time Markov decision process (MDP) and establish an optimal policy by a dynamic programming based algorithm. Since the time complexity of the dynamic programming based offloading algorithm is still high, we propose a low time complexity heuristic offloading algorithm with performance sacrifice. Extensive simulations are conducted to validate our proposed offloading algorithms., Institute of Electronics, Information and Communication, Engineers, IEICE
IEICE Transactions on Communications, 2018年03月01日,
［査読有り］ Wireless LAN access point deployment and pricing with location-based advertisingCheng Zhang; Zhi Liu; Bo Gu; Kyoko Yamori; Yoshiaki Tanaka, In order to improve the quality of service (QoS) for mobile users (MUs) and save investment cost for deploying new cellular base station, mobile network operators (MNOs) are deploying wireless local area network (LAN) access points (APs) to offload MU's traffic from cellular network to wireless LAN. However, offloading too much traffic from cellular network may impair MNO's profit since the cellular network price is higher than that of wireless LAN, whose price is low or even zero. Therefore, how to deploy wireless LAN APs to offload traffic without impairing MNO's profit is a critical problem for MNOs. As far as the authors understand, existing studies about deployment of wireless LAN APs do not consider MNO's profit and are usually in a heuristic manner. In this paper, we study the location-based advertising (LBA) leveraged wireless LAN deployment, where MNO may also collect revenue by selling LBA service in different locations to advertisers. We formulate MNO's profit maximization problem by considering different MU's demand in different locations, wireless LAN price for MUs, and revenue from LBA service. Extensive simulations are conducted to validate our analytical results., Institute of Electrical and Electronics Engineers Inc.
2017 13th International Conference on Network and Service Management, CNSM 2017, 2018年01月12日,
［査読有り］ Water-Filling Power Allocation Algorithm for Joint Utility Optimization in Femtocell NetworksBo Gu; Mianxiong Dong; Zhi Liu; Cheng Zhang; Yoshiaki Tanaka, The ongoing evolution of personal mobile devices capabilities and wireless technologies result in a huge growth of traffic on mobile networks (3G/4G). One of the most promising approaches to handle this data crisis is to offload the fast growing traffic onto femtocell networks. Since both the 3G/4G macrocell and femtocells operate on the same licensed spectrum, the cross-tier interference should be well managed. In this paper, we propose a utility-based transmission power allocation policy for the uplink transmission in femtocell networks. Our main motivation is to design the transmission power allocation policy aiming at optimizing the joint utility of femtocell users (FUs) subject to a interference temperature constraint at the macrocell base station (MBS) side. We provide a novel floating-ceiling water-filling (FCWF) algorithm with little computational overhead to obtain the optimal solution for the joint utility optimization problem. Numerical results confirm that the joint utility and average SINR can be significant improved with the proposed method., Institute of Electrical and Electronics Engineers Inc.
2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings, 2018年01月10日,
［査読有り］ A stackelberg game based pricing and user association for spectrum splitting macro-femto HetNetsBo Gu; Zhi Liu; Cheng Zhang; Kyoko Yamori; Osamu Mizuno; Yoshiaki Tanaka, The demand for wireless traffic is increasing rapidly, which has posed huge challenges to mobile network operators (MNOs). A heterogeneous network (HetNet) framework, composed of a marcocell and femtocells, has been proved to be an effective way to cope with the fastgrowing traffic demand. In this paper, we assume that both the macrocell and femtocells are owned by the same MNO, with revenue optimization as its ultimate goal. We aim to propose a pricing strategy for macro-femto HetNets with a user centric vision, namely, mobile users would have their own interest to make rational decisions on selecting between the macrocell and femtocells to maximize their individual benefit. We formulate a Stackelberg game to analyze the interactions between the MNO and users, and obtain the equilibrium solution for the Stackelberg game. Via extensive simulations, we evaluate the proposed pricing strategy in terms of its efficiency with respect to the revenue optimization., Institute of Electronics, Information and Communication, Engineers, IEICE
IEICE Transactions on Communications, 2018年01月01日,
［査読有り］ Pricing Wireless Service with MVNO Participation
F.Taniguchi; K.Yamori; Cheng Zhang; B.Gu; and Y.Tanaka
The 19th Asia-Pacific Network Operations and Management Symposium (APNOMS 2017), 2017年09月, ［査読有り］
Utility-Awared Pricing in Femto-Macro Heterogenous Networks
B.Gu; Z.Liu; Cheng Zhang; K.Yamori; O.Mizuno; Y.Tanaka
2017 IEICE Society Conference, 2017年09月
Error Correction for Distance Detection in Indoor Visual Positioning Using SVR and SVM
T.Chen; Cheng Zhang; K.Yamori; Y.Tanaka
2017 IEICE Society Conference, 2017年09月
Time-To-Live Based Caching Mechanism with Nonlinear Pricing
Cheng Zhang, Richar; T.B.Ma; Z.Liu; B.Gu; K.Yamori; Y.Tanaka
2017 IEICE Society Conference, 2017年09月
Topology Mapping for Caching Decision in Topology-known Content-Centric Network
Z.Liu; S.Ishihara; Cheng Zhang; B.Gu, Y.Ji; Y.Tanaka
2017 IEICE Society Conference, 2017年09月
Challenges in developing a robotic assistive eating device for frail elderly’s independent life
Jorge Solis; Ann-Louise Lindborg; Miki SaijoTakeda Yukiko; Cheng Zhang; Takeda Ryuta, This project aims at making a mock-up of a multi grip tool for a robotic assistive device and a camera system which enable frail elderly to live more in-dependently and to keep track of their food intake. The robot will be developed through user centered design with analyses of real use cases in Japan and Sweden. Thanks to the collaborating researchers with a strong applied research approach as well as the companies with a strong experience in engineering solutions in both the Japanese and Swedish teams, the functionalities of Bestic, an assistive eating device, could be enhanced for commercial use, and distributed to munici-palities and to the general pub.
26IEEE International Symposium on Robot and Human Interactive Communication Lisbon Portugal, 2017年08月, ［査読有り］
Japan-Sweden Academia-Industry International Collaboration: Challenges in Developing a Robotic Assistive eating device for frail elderly's independent life
Jorge Solis; Ann-Louise Lindborg; Miki SaijoTakeda Yukiko; Cheng Zhang; Takeda Ryuta, This project aims at making a mock-up of a multi grip tool for a robotic assistive device and a camera system which enable frail elderly to live more independently and to keep track of their food intake. The robot will be developed through user centred design with analyses of real use cases in Japan and Sweden. Thanks to the collaborating researchers with a strong applied research approach as well as the companies with a strong experience in engineering solutions in both the Japanese and Swedish teams, the functionalities of Bestic, an assistive eating device, could be enhanced for commercial use, and distributed to municipalities and to the general public.
JST-VINNOVA Japan-Sweden Academia-Industry International Collaboration Program on Innovative Solutions, Community Design and Services for Elderly People, 2017年08月, ［査読有り］
Design approach of a robotic assistive eating device with a multi-grip and camera for frail elderly's independent life
Ann-Louise Lindborg; Jorge Solis; Saijo Miki; Takeda Yukiko; Cheng Zhang. Takeda Ryuta, This project aims at making a mock-up of a multi grip tool for a robotic assistive device and a camera system which enable frail elderly to live more independently and to keep track
,of their food intake. The robot will be developed through user centred design with analyses of real use cases in Japan and Sweden. Thanks to the collaborating researchers with a strong applied research approach as well as the companies with a strongexper
,ience in engineering solutions in both the Japanese and Swedish teams, the functionalities of Bestic, an assistive eating device, could be enhanced for commercial use, and distributed to municipalities and to the general public.
JST-VINNOVA Japan-SwedenAcademia-Industry International Collaboration Program on Innovative Solutions, Community Design and Services for Elderly People, 2017年05月, ［査読有り］
Design approach of a robotic assistive eating device with a multi-grip and camera for frail elderly's independent life
Ann-Louise Lindborg; Jorge Solis; Saijo Miki; Takeda Yukiko; Cheng Zhang; Takeda Ryuta, This project aims at making a mock-up of a multi grip tool for a robotic assistive device and a camera system which enable frail elderly to live more independently and to keep track
,of their food intake. The robot will be developed through user centred design with analyses of real use cases in Japan and Sweden. Thanks to the collaborating researchers with a strong applied research approach as well as the companies with a strong experience in engineering solutions in both the Japanese and Swedish teams, the functionalities of Bestic, an assistive eating device, could be enhanced for commercial use, and distributed to municipalities and to the general public.
ICRA 2017 Workshop on Advances and challenges on the development, testing and assessment of assistive and rehabilitation robots: Experiences from engineering and human science research, 2017年05月, ［査読有り］
Economic Analysis of Carrier-grade Wireless Local Area Network Deployment
Cheng.Zhang; B.Gu; Z.Liu; K.Yamori; Y.Tanaka
IEICE Technical Report on Communication Quality, 2017年04月, ［査読有り］
Network Selection for Content Distribution in Cache-enabled Vehicle IoT
Z.Liu; Cheng Zhang; B.Gu, Y.Ji; Y.Tanaka
2017 IEICE General Conference, 2017年03月
Coordinate-based Location Calculation with Abandon Type Obstacle Avoidance
T.S.Chen; Cheng Zhang; Y.Tanaka
2017 IEICE General Conference, 2017年03月
Pricing for Internet of Things Service Provider with Cloud Service Provider’s Participation
Cheng Zhang; B.Gu; Z.Liu; K.Yamori; Y.Tanaka
2017 IEICE General Conference, 2017年03月
A User-Centric Pricing Scheme in Femto-Macro HetNets
B.Gu; Cheng Zhang; Z.Liu; K.Yamori; O.Mizuno; Y.Tanaka
2017 IEICE General Conference, 2017年03月
MVNOにおける上位クラスサービスの導入と最適料
谷口文隆; 矢守恭子; 張成,古博; 田中良明
2017年電子情報通信学会総合大会, 2017年03月
Fast-Start Video Delivery in Future Internet Architectures with Intra-domain CachingZhi Liu; Mianxiong Dong; Bo Gu; Cheng Zhang; Yusheng Ji; Yoshiaki Tanaka, Current TCP/IP based network is suffering from the tremendous usage of IP. Recently, content centric network (CCN) is proposed as an alternative of the future network architecture. In CCN, data itself, which is authenticated and secured, is a name and can be directly requested at the network level instead of using IP and DNS. Moreover, routers in CCN have caching abilities. Then end users can obtain the data from routers instead of remote server if the content has been stored in the routers, thus the overall network performance could be improved by reducing the transmission hops. Orthogonally, video plays a more and more important role nowadays and dominates the network traffic. Response time of each video request greatly affects the quality of user experience (QoE), users may even abandon the requested video service if they have to wait for long time before the video playback. Hence how to provide fast-start video delivery in CCN is critical. In this paper, we target to provide users fast-start video delivery in CCN. Specifically, we design a new caching policy for popularity-aware video caching in topology-aware CCN. And we propose to encode the video using scalable video coding (SVC) for fast-start video delivery and cache each video layer separately following the designed caching policies. Given an assigned weight by users, the tradeoff between the waiting time and received video quality is studied. Simulations are conducted to verify the performances and the results show that the proposed scheme outperforms state-of-the-art schemes significantly in typical scenarios., SPRINGER
MOBILE NETWORKS & APPLICATIONS, 2017年02月
Markov-Decision-Process-Assisted Consumer Scheduling in a Networked Smart GridZhi Liu; Cheng Zhang; Mianxiong Dong; Bo Gu; Yusheng Ji; Yoshiaki Tanaka, Many recently built residential houses and factories are equipped with facilities for converting energy from green sources, such as solar energy, into electricity. Electricity consumers may input the extra electricity that they do not consume into the smart grid for sale, which is allowed by law in countries such as Japan. To reduce peak-time electricity usage, time-varying pricing schemes are usually adopted in smart grids, for both the electricity sold to consumers and the electricity purchased from consumers. Thanks to the development of cyber-physical systems and advanced technologies for communication and computation, current smart grids are typically networked, and it is possible to integrate information such as weather forecasts into such a networked smart grid. Thus, we can predict future levels of electricity generation (e.g., the energy from solar and wind sources, whose generation is predominantly affected by the weather) with high accuracy using this information and historical data. The key problem for consumers then becomes how to schedule their purchases from and sales to the networked smart grid to maximize their benefits by jointly considering the current storage status, time-varying pricing, and future electricity consumption and generation. This problem is non-trivial and is vitally important for improving smart grid utilization and attracting consumer investment in new energy generation systems, among other purposes. In this paper, we target such a networked smart grid system, in which future electricity generation is predicted with reasonable accuracy based on weather forecasts. We schedule consumers' behaviors using a Markov decision process model to optimize the consumers' net benefits. The results of extensive simulations show that the proposed scheme significantly outperforms the baseline competing scheme., IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
IEEE ACCESS, 2017年,
［査読有り］ Femtocell Deployment from an Economics Perspective
B.Gu; Cheng.Zhang; Z.Liu; O. Mizuno; K.Yamori; Y.Tanaka
IEICE Technical Report on Communication Quality, 2017年01月, ［査読有り］
MVNOへの上位クラス導入とその効果
谷口文隆; 矢守恭子; 張成,古博; 田中良明
電子情報通信学会技術研究報告, 2017年01月, ［査読有り］
Markov Decision Process Assisted User Multi-flow Mobile Data Offloading
Cheng.Zhang; B.Gu; Z.Liu; K.Yamori; Y.Tanaka
IEICE Technical Report on Communication Quality, 2017年01月, ［査読有り］
Real-Time Pricing for On-Demand Bandwidth Reservation in SDN-Enabled NetworksBo Gu; Mianxiong Dong; Cheng Zhang; Zhi Liu; Yoshiaki Tanaka, Software-defined networking (SDN) enables network subscribers to negotiate QoS parameters in a on-demand basis. On the other hand, peak-time congestion accompanying the fastgrowing traffic in recent years forces Internet service provider (ISP) to put forward a new pricing scheme by taking into account when a user uses Internet in addition to how much a user uses Internet. In this paper, we study the payoff optimization problem of ISP and network subscribers in SDN-enabled networks. A self-interested network subscriber always tries to obtain network resources as much as possible even if the network is congested; on the other hand, rational ISP tends to charge a higher price without providing subscribers guaranteed Quality of Service (QoS). A Stackelberg game is hence constructed to analyze the competitive interactions between ISP and home network subscribers. Specifically, ISP decides its pricing strategy for each time slot by solving a payoff optimization problem. Given the pricing strategy, network subscribers then decide the bandwidth to be reserved in a on-demand basis aiming to optimize their own payoff as well. We analyze the Nash equilibrium solution of the game. Simulation results confirm that the proposed pricing scheme can largely improve the payoff of network subscribers and ISP, compared to the usage-based pricing (UBP) scheme. Furthermore, the portion of surplus obtained by ISP increases with the increase of traffic load., IEEE
2017 14TH IEEE ANNUAL CONSUMER COMMUNICATIONS & NETWORKING CONFERENCE (CCNC), 2017年,
［査読有り］ A Stackelberg Game Based Analysis for Interactions among Internet Service Provider, Content Provider, and AdvertisersCheng Zhang; Bo Gu; Zhi Liu; Kyoko Yamori; Yoshiaki Tanaka, The past few years have witnessed a huge acceleration in global Internet traffic. Users' demand for contents is also rising accordingly. Therefore, content providers (CPs) that provide contents for users get high revenue from the traffic growth. There are generally two ways for CPs to get revenue: (i) charge users for the contents they view or download; (ii) get revenue from advertisers. On the other hand, Internet service providers (ISPs) are investing in network infrastructure to provide better quality of service (QoS), but they do not benefit directly from the content traffic. One option for ISPs to compensate their investment cost is sharing CPs' revenue by side payment from CPs to ISPs. Then ISPs will be motivated to keep on investing in developing new network technology and enlarging the capacity to improve QoS. However, it is important to evaluate how each player is affected by this kind of side payment. Our previous work has studied this problem by assuming that CPs charged users for the contents they view or download, in this paper it is considered that CP does not directly charge end users, but charges advertisers for revenue. Stackelberg game is utilized to study the interactions among ISP, CP, end users and advertisers. A unique Nash equilibrium is established and numerical analysis has validated our theoretic results. It shows that side payment from CP to ISP impairs the CP's investment of contents, and ISP can benefit from charging CP, while CP's payoff is impaired., IEEE
2017 14TH IEEE ANNUAL CONSUMER COMMUNICATIONS & NETWORKING CONFERENCE (CCNC), 2017年,
［査読有り］ Pricing and Service Differentiation in OpenFlow and SDN
B.Gu; Cheng Zhang; Z.Liu; K.Yamori; Y.Tanaka
2016 IEICE Society Conference, 2016年09月
Coordinate-based Location Calculation Using Weighted Arithmetic Mean
T.Chen; Cheng Zhang; K.Yamori; Y.Tanaka
2016 IEICE Society Conference, 2016年09月
Joint Pricing and Load Balancing for Distributed Cloud Data Centres
X.Li; B.Gu; Cheng Zhang; K.Yamori; Y.Tanaka
2016 IEICE Society Conference, 2016年09月
Popularity-aware Caching in Content Centric Network Considering Video Drop Ratio
Z.Liu; B.Gu; Cheng Zhang, Y.Ji; Y.Tanaka
2016 IEICE Society Conference, 2016年09月
Pricing for Monopolistic Internet of Things Service Provider
Cheng Zhang; B.Gu; Z.Liu; K.Yamori; Y.Tanaka
2016 IEICE Society Conference, 2016年09月
OTTサービスにおけるCPとISPの公平な利益分配
谷口文隆; 矢守恭子; 張成,古博; 田中良明
電子情報通信学会技術研究報告, 2016年07月, ［査読有り］
Impact of Item Popularity and Chunk Popularity in CCN Caching ManagementLiu Zhi; Dong mianxiong; Gu Bo; Cheng Zhang; Ji Yusheng; Tanaka Yoshiaki, Content Centric Network (CCN) has become a heated research topic recently, as it is proposed as an alter-native of the future network. The routers in CCN have the caching abilities and the caching strategies affect the system performance greatly. Each content in CCN is associated with a popularity, which is determined by the corresponding
,requested times. Popularity-aware caching scheme caches the popular content close to users and can lead to better caching performance in terms of smaller average transmission hops traveled. Content popularity significantly affects the overall system performance, and the content size is not considered during the content level popularity (i.e. item popularity) calculation. In this paper, we study the impact of the item
,popularity and chunk popularity in CCN, where the chunk popularity is the normalized item popularity considering the content size. Extensive simulations are conducted and the
,simulation results show the advantages and disadvantages of each scheme. A new popularity calculation method is proposed to perform the tradeoff between the item popularity and chunk popularity.., IEEE
The 18th Asia-Pacific Network Operations and Management Symposium (APNOMS) 2016, 2016年05月,
［査読有り］ Intelligent Bandwidth Consumption Scheduler Considering the Connectivity of Heterogeneous Wireless Networks and Users' Preferences
B.Gu; Cheng Zhang; Z.Liu; K.Yamori; Y.Tanaka
2016 IEICE General Conference, 2016年03月
Economic Analysis of Mobile Data Offloading Cooperation Market
Cheng Zhang; B.Gu; Z.Liu; K.Yamori; Y.Tanaka
2016 IEICE General Conference, 2016年03月
Optimal Pricing Strategy for Service Provisioning in the Monopoly Cloud Context with Heterogeneous Users
X.Li; B.Gu; Cheng Zhang; K.Yamori; Y.Tanaka
2016 IEICE General Conference, 2016年03月
Intra-Domain Video Caching in Content Centric Network with Normalized Popularity
Z.Liu; B.Gu; Cheng Zhang, Y.Ji; Y.Tanaka
2016 IEICE General Conference, 2016年03月
協力モバイルデータオフロード市場分析
林珊婷; 張成; 田中良明
電子情報通信学会東京 支部学生会研究発表会, 2016年03月
Intra-Domain Video Caching in Content Centric Network with Normalized PopularityLiu Zhi; Gu Bo; Zhang Cheng; Ji Yusheng; Tanaka Yoshiaki, Recently Content Centric Network (CCN) is proposed as an alternative of the future network architecture since the current TCP/IP based network is suffering from the usage of IP. The routers in CCN have the caching abilities and the caching strategies affect the system performance greatly. Popularity-aware video caching draws much attentions due to its good performance, and the popularity is calculated based on the number of requests at the video content level. In this paper, we normalize the video popularity when we design the caching policy by taking the video size into consideration and the simulation results show that the proposed scheme achieves better performance comparing with the state-of-the-art caching policy in terms of server hit rate.
電子情報通信学会総合大会講演論文集, 2016年03月
A Reinforcement Learning Approach for Cost-and Energy-Aware Mobile Data OffloadingZhang Cheng; Gu Bo; Liu Zhi; Yamori Kyoko; Tanaka Yoshiaki, With rapid increases in demand for mobile data,mobile network operators are trying to expand wireless network capacity by deploying WiFi hotspots to offload their mobile traffic. However, these network-centric methods usually donot fulfill interests of mobile users (MUs). MUs consider many problems to decide whether to offload their traffic to a complementary WiFi network. In this paper, we study the
WiFi offloading problem from MU’s perspective by considering delay-tolerance of tra
ffic, monetary cost, energy consumption as well as the availability of MU’s mobility pattern. We first formulate the WiFi offloading problem as a finite-horizon
discrete-time Markov decision process (FDTMDP) with known MU’s mobility pattern and propose a dynamic programming based offloading algorithm. Since MU’s mobility pattern may not be known in advance, we then propose a reinforcement learning
based offloading algorithm, which can work well with unknown MU’s mobility pattern. Extensive simulations are conducted to validate our proposed offloading algorithms., IEEE
The 18th Asia-Pacific Network Operations and Management Symposium, 2016年,
［査読有り］ Facilitating Incentive-Compatible Access Probability Selection in Wireless Random Access NetworksBo Gu; Cheng Zhang; Kyoko Yamori; Zhenyu Zhou; Song Liu; Yoshiaki Tanaka, This paper studies the impact of integrating pricing with connection admission control (CAC) on the congestion management practices in contention-based wireless random access networks. Notably, when the network is free of charge, each self-interested user tries to occupy the channel as much as possible, resulting in the inefficient utilization of network resources. Pricing is therefore adopted as incentive mechanism to encourage users to choose their access probabilities considering the real-time network congestion level. A Stackelberg leader-follower game is formulated to analyze the competitive interaction between the service provider and the users. In particular, each user chooses the access probability that optimizes its payoff, while the self-interested service provider decides whether to admit or to reject the user's connection request in order to optimize its revenue. The stability of the Stackelberg leader-follower game in terms of convergence to the Nash equilibrium is established. The proposed CAC scheme is completely distributed and can be implemented by individual access points using only local information. Compared to the existing schemes, the proposed scheme achieves higher revenue gain, higher user payoff, and higher QoS performance., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE TRANSACTIONS ON COMMUNICATIONS, 2015年11月
Pricing in Pay-per-View Video System for Content Provider Profit Maximization
Z.Liu; B.Gu; Cheng Zhang; X.Wang, Y.Ji; Y.Tanaka
2015 IEICE Society Conference, 2015年09月
Price-Based Access Probability Control for Slotted-Aloha Random Access MAC Protocols
B.Gu; Cheng Zhang; Z.Liu; K.Yamori; Y.Tanaka
2015 IEICE Society Conference, 2015年09月
Pricing for Revenue Maximization in a Monopoly Cloud Market with Delay Sensitive Users
X.Li; B.Gu; Cheng Zhang; K.Yamori; Y.Tanaka
2015 IEICE Society Conference, 2015年09月
Pricing in Pay-per-View Video System for Content Provider Profit MaximizationLiu Zhi; Gu Bo; Zhang Cheng; Wang Xiaoyan; Ji Yusheng; Tanaka Yoshiaki, Pay-per-view video is now becoming a successful business model which charges every video subscription. The content provider's profit is subscription fee paid by users minus maintenance cost and transmission fee paid to network service provider. Given content provider's capacity is limited, and video requests vary in time domain, how to price the different video to maximize the profit is important for content provider. In this paper, we targets the pay-per-view video system, where the same video at different quality levels are provided for subscribers. A profit optimization problem is formulated taking the system cost into consideration. Simulation results show its superior performance over the scheme without applying the pricing schemes. We can also observe the optimal capacity the content provider should provide in typical situations.
電子情報通信学会ソサイエティ大会講演論文集, 2015年08月
Regulating network traffic by exploiting the price elasticity of demand in wireless random access networksGu; Bo; Zhang; Cheng; Yamori; Kyoko; Yamori; Kyoko; Zhou; Zhenyu; Liu; Song; Tanaka; Yoshiaki; Tanaka; Yoshiaki, © 2015 IEICE. In this paper, pricing is adopted as incentive mechanism to encourage users to choose their access probabilities considering the real-time network congestion level in a contentionbased wireless random access network. A Stackelberg leaderfollower game is formulated to analyze the competitive interaction between the service provider and the users. In particular, each user chooses the access probability to optimize its payoff, while the self-interested service provider decides whether to admit or reject the user's connection request in order to optimize its revenue. The stability of the Stackelberg leader-follower game in terms of convergence to the Nash equilibrium is established. The proposed CAC scheme is completely distributed and can be implemented by individual access points using only local information. Compared with the existing schemes, the proposed scheme limits the amount of traffic admitted into the network and achieves higher QoS performance without decreasing the total revenue of the service provider., IEEE
2015 10th Asia-Pacific Symposium on Information and Telecommunication Technologies, APSITT 2015, 2015年08月
Optimal Pricing for Revenue Maximization in Duopoly Cloud Computing (Poster Presentation)
X.Li; B.Gu; Cheng.Zhang; K.Yamori; Y.Tanaka
IEICE Technical Report on Communication Quality, 2015年07月, ［査読有り］
Price and Time Guarantee for Cloud Service Delivery
X.Li; B.Gu; Cheng Zhang; K.Yamori; Y.Tanaka
2015 IEICE General Conference, 2015年03月
Economic Analysis of Oligopoly Mobile Data Offloading Market
Cheng Zhang; B.Gu; Z.Liu; K.Yamori; Y.Tanaka
2015 IEICE General Conference, 2015年03月
Oligopoly Competition in Time-Dependent Pricing for Improving Revenue of Network Service Providers with Complete and Incomplete InformationCheng Zhang; Bo Gu; Kyoko Yamori; Sugang Xu; Yoshiaki Tanaka, Network traffic load usually differs significantly at different times of a day due to users' different time-preference. Network congestion may happen in traffic peak times. In order to prevent this from happening, network service providers (NSPs) can either over-provision capacity for demand at peak times of the day, or use dynamic time-dependent pricing (TDP) scheme to reduce the demand at traffic peak times. Since over-provisioning network capacity is costly, many researchers have proposed TDP schemes to control congestion as well as to improve the revenue of NSPs. To the best of our knowledge, all the studies on TDP schemes consider only the monopoly or duopoly NSP case. In our previous work, the duopoly NSP case has been studied with the assumption that each NSP has complete information of quality of service (QoS) of the other NSP. In this paper, an oligopoly NSP case is studied. NSPs try to maximize their overall revenue by setting time-dependent price, while users choose NSPs by considering their own time preference, congestion status in the networks and the price set by the NSPs. The interactions among NSPs are modeled as an oligopoly Bertrand game. Firstly, assuming that each NSP has complete information of QoS of all NSPs, a unique Nash equilibrium of the game is established under the assumption that users' valuation of QoS is uniformly distributed. Secondly, the assumption of complete information of QoS of all NSPs is relaxed, and a learning algorithm is proposed for NSPs to achieve the Nash equilibrium of the game. Analytical and experimental results show that NSPs can benefit from TDP scheme, however, not only the competition effect but also the incomplete information among NSPs causes revenue loss for NSPs under the TDP scheme., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE TRANSACTIONS ON COMMUNICATIONS, 2015年01月
Time-Dependent Pricing for Mitigating Fluctuation of Data Traffic Demand
B.Gu; Cheng.Zhang; K.Yamori; S.Liu; Y.Tanaka
IEICE Technical Report on Communication Qualit, 2015年01月, ［査読有り］
Inter-Domain Popularity-aware Video Caching in Future Internet ArchitecturesZhi Liu; Mianxiong Dong; Bo Gu; Cheng Zhang; Yusheng Ji; Yoshiaki Tanaka, Current TCP/IP based network is suffering from the usage of IP especially in the era of Internet of things (IoT). Recently Content Centric Network (CCN) is proposed as an alternative of the future network architecture. In CCN, data itself, which is authenticated and secured, is a name and can be directly requested at the network level instead of using IP and Domain Name System (DNS). Another difference between CCN and traditional networks is that the routers in CCN have the caching abilities. Then the end users can obtain the data from routers instead of from the remote server if the content has been stored in the router. Hence the overall network performance can be improved by reducing the required transmission hops and the advantage of the CCN caching has been shown in literature. In this paper, we design a new caching policy for the popularity-aware video caching in CCN to handle the 'redundancy' problem in the existing schemes, where the same content may be stored multiple times along the road from server to users, thus leading to a significant performance degradation. Simulations are conducted and we could observe that the proposed scheme performs better comparing with the existing caching policies., IEEE
Proceedings of the 11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, 2015年,
［査読有り］ Oligopoly Competition in Time-Dependent Pricing for Improving Revenue of Network Service Providers Considering Different QoS FunctionsCheng Zhang; Bo Gu; Zhi Liu; Kyoko Yamori; Yoshiaki Tanaka, Network traffic load usually differs significantly at different times of a day due to users' different time preference. Network congestion may happen in traffic peak times. In order to prevent this from happening, network service providers (NSPs) can either over-provision capacity for demand at peak times of the day, or use dynamic time-dependent pricing (TDP) scheme to reduce the demand at traffic peak times. Since over-provisioning network capacity is costly, many researchers have proposed TDP schemes to control congestion as well as to improve the revenue of NSPs. To the best of our knowledge, all these studies consider only the monopoly NSP case. In our previous work, the duopoly and oligopoly NSP cases have been studied. NSPs try to maximize their overall revenue by setting time-dependent prices, while users choose NSPs by considering their own time preference, congestion statuses in the networks and the prices set by the NSPs. One assumption that has been made is that Quality of Service (QoS) function of each NSP is linear, which means that the level of QoS degradation is proportional to the number of users in the network. However, in reality, the level of QoS may degrade rapidly after a certain point, which is not reflected through linear QoS functions. Therefore, concave QoS function is a better choice. In this paper, the case of concave QoS function is considered. TDP is evaluated under different QoS functions. The results shows that TDP is also effective under concave QoS functions., IEEE
2015 17TH ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM APNOMS, 2015年
Revenue Management in IaaS Cloud Computing with Reserved Pricing Scheme
X.Li; B.Gu; Cheng Zhang; K.Yamori; Y.Tanaka
2014 IEICE Society Conference, 2014年09月
Pricing Content Provider Considering Advertisers' Participation
Cheng Zhang; B.Gu; K.Yamori; Y.Tanaka
2014 IEICE General Conference, 2014年09月
Price Competition between Content Provider and Internet Service Provider
Cheng Zhang; B.Gu; K.Yamori; S.Xu; Y.Tanaka
2014 IEICE Society Conference, 2014年09月
Incentive Engineering in Wireless Random Access Networks
B.Gu; Cheng Zhang; K.Yamori; Y.Tanaka
2014 IEICE Society Conference, 2014年09月
Price Competition in a Duopoly IaaS Cloud MarketX.Li; B.Gu; Zhang Cheng; K.Yamori; and Y.Tanaka, Pricing cloud resources plays an important role in leading to the success of cloud computing. Cloud services are priced at different levels in infrastructure-as-a-service (IaaS) cloud market. For example, Amazon EC2 offers its cloud resources with three pricing schemes, the subscription model, pay-as-you-go model and spot pricing model. With more and more IaaS cloud service providers (CSPs) beginning to provide cloud services, they form a competitive market to compete for cloud users. Therefore, how to set optimal prices in order to maximize their revenue in a competitive IaaS cloud computing market while at the same time meeting the cloud users’ demand satisfaction is a problem that CSPs should consider. Towards this
end, in this paper, we study subscription pricing competition in a duopoly IaaS cloud computing market. First, we analyze whether or not the cloud users choose to use cloud service. Then, we present a game theoretic analysis of a cloud market with two CSPs competing non-cooperatively for cloud users., IEEE
The 16th Asia-Pacific Network Operations and Management Symposium (APNOMS 2014), 2014年09月,
［査読有り］ Integration of Discounting Service with Admission Control for Flattening out Peak-Time Usage
B.Gu; Cheng Zhang; K.Yamori; Y.Tanaka
2014 IEICE General Conference, 2014年03月
Duopoly Competition in Time-Dependent Pricing for Improving Revenue of Network Service ProvidersCheng Zhang; Bo Gu; Kyoko Yamori; Sugang Xu; Yoshiaki Tanaka, Due to network users' different time-preference, network traffic load usually significantly differs at different time. In traffic peak time, network congestion may happen, which make the quality of service for network users deteriorate. There are essentially two ways to improve the quality of services in this case: (1) Network service providers (NSPs) over-provision network capacity by investment; (2) NSPs use time-dependent pricing (TDP) to reduce the traffic at traffic peak time. However, over-provisioning network capacity can be costly. Therefore, some researchers have proposed TDP to control congestion as well as improve the revenue of NSP. But to the best of our knowledge, all of the literature related time-dependent pricing scheme only consider the monopoly NSP case. In this paper, a duopoly NSP case is studied. The NSPs try to maximize their overall revenue by setting time-dependent price, while users choose NSP by considering their own preference, congestion status in the networks and the price set by the NSPs. Analytical and experimental results show that the TDP benefits the NSPs, but the revenue improvement is limited due to the competition effect., IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
IEICE TRANSACTIONS ON COMMUNICATIONS, 2013年12月
Price Competition between Content Provider and Internet Service Provider
Cheng Zhang; B.Gu; K.Yamori; S.Xu; Y.Tanaka
2013 IEICE Society Conference, 2013年09月
Time-Dependent Pricing for Revenue Maximization of Network Service Providers Considering Users PreferenceZhang Cheng; Gu Bo; Xu Sugang; Yamori Kyoko; Tanaka Yoshiaki, Due to network users' different time-preference, network traffic load differs significantly at different time. In traffic-peak time, the quality of service provided to network users may deteriorate due to congestion. There are two ways to improve the quality of services: (1) Network service providers over-provision network capacity by investment; (2)NSPs use pricing to reduce the traffic at traffic-peak time by exploiting the elasticity demand with respect to price. However, over-provisioning network capacity can be costly. Therefore, some researchers have proposed time-dependent pricing to control congestion as well as improve the revenue of NSP. To the best of our knowledge, all of the literature related to time-dependent pricing scheme only considers the monopoly NSP case. In this paper, a duopoly NSP case is studied. The NSPs try to maximize their overall revenue by setting time-dependent price, while users choose NSP by considering their own preference, congestion status in the networks, the price set by the NSPs and the switching cost set by NSPs. Analytical and experimental results show that the time-dependent pricing (TDP) benefits the NSPs, but the revenue impr, IEEE
15th Asia-Pacific Network Operations and Management Symposium:Hiroshima Japan 2013, 2013年09月,
［査読有り］ Distributed Connection Admission Control Integrated With Pricing for QoS Provisioning and Revenue Maximization in Wireless Random Access NetworksGu Bo; Zhang Cheng; Yamori Kyoko; Tanaka Yoshiaki, This paper studies the impact of connection admission control (CAC) on the congestion management practices and the revenue of a monopoly access point (AP). The AP providescongestion-indication signals that suggest users to choose their access probabilities in response to network loading conditions. A Stackelberg leader-follower game is then formulated to analyze the interaction between the AP and the users. In particular, the AP first estimates the probable utility degradation of existingusers consequent upon the admission of an incoming user. Second, the AP decides whether the connection of the incoming user should be admitted or not. The proposed CAC policy is completely distributed and can be implemented by individual APs using only local information. Simulation results show that the proposed algorithm achieves higher saturation throughput as well as greater revenue gain when compared with an existing algorithm., IEEE
15th Asia-Pacific Network Operations and Management Symposium: Hiroshima Japan, 2013年09月,
［査読有り］ A Greedy Algorithm for Connection Admission Control in Wireless Random Access NetworksB.Gu; Zhang Cheng; K.Yamori; and Y.Tanaka, In this paper, we consider a price-based connection admission control (CAC) for wireless random access networks. In particular, a network operator determines sequential prices to dynamically maintain the traffic admitted into the network below the channel capacity. The CAC tries to ensure quality of service (QoS) guarantees to users and hence maximize the overall revenue. We find that the revenue maximization problem over all sequential prices is NP-hard. Therefore, a greedy algorithm is employed for obtaining a simple, easy-to-implement solution., IEEE
The 19th Asia-Pacific Conference on Communications (APCC 2013), 2013年08月,
［査読有り］ A Time-Dependent Pricing Scheme in Stochastic Environment
Cheng Zhang; K.Yamori; S.Xu; Y.Tanaka
2013 IEICE General Conference, 2013年03月
Time-Dependent Pricing for Revenue Maximization
Cheng Zhang; K.Yamori; S.Xu; Y.Tanaka
2012 IEICE Communications Society Conference, 2012年09月
Forward Contract to Solve Demand and Revenue Uncertainty Problem in Network Congestion Management
Cheng Zhang; K.Yamori; S.Xu; Y.Tanaka
2012 IEICE General Conference, 2012年03月
Utility-Based Load Distribution for QoS Provisioning and Utility Maximization in Wirekess Random Access NetwoeksGu Bo; Zhang Cheng; Yamori Kyoko; Xu SugangTanaka Yoshiaki, In this paper, a utility-based load distribution approach is introduced for relieving congestion at certain popular spaces within the network. Congestion-indication signals are provided for suggesting users to select APs in response to
network load conditions. The heavier traffic load an AP has, the lower utility each associated user gains. Hence, the users incentively adapt themselves to associate to less congested APs.The effectiveness of the algorithm on improving the degree of load balance is evaluated using simulations. Simulation results show that the proposed algorithm achieves greater balance and higher resource utilization when compared with the best existing algorithms., IEEE
2nd International Conference on Computer Science and Network Technology,Chengdu,China.2012, 2012年,
［査読有り］ Congestion-Based Pricing in Differentiated Service Network
Cheng Zhang; K.Yamori; S.Xu; Y.Tanaka
2011 IEICE Communications Society Conference, 2011年09月
Dutch Auction for Network Congestion Control
Cheng.Zhang; K.Yamori; S.Xu; Y.Tanaka
IEICE Technical Report on Network Systems, 2011年05月, ［査読有り］
Comparison between Dutch-Auction Congestion Pricing and Gradient Projection Congestion Pricing
Cheng Zhang; K.Yamori; S.Xu; Y.Tanaka
2011 IEICE General Conference, 2011年03月
A Dutch-Auction Pricing Mechanism for Network Congestion Control
Cheng Zhang; K.Yamori; S.Xu; Y.Tanaka
2010 IEICE Communications Society Conference, 2010年09月
Near Space Temperature Prediction Model Based on RBF Neural Network
Zhang Cheng; Qu Weidong
Control Engineering of China, 2008年, ［査読有り］
