Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883744
Luyao Wang, Kwan-Wu Chin, R. Raad, S. Soh
Recently, researchers have created Wireless Mesh Networks (WMNs) where routers have multiple transmit (Tx) or receive (Rx) capability. A fundamental problem in such WMNs is deriving a transmission schedule that yields minimal end-to-end delays. In this paper, we approach this problem via joint routing and link scheduling. Specifically, we consider two fundamental issues that influence end-to-end delays: superframe length and transmission slot order. We propose two algorithms: JRS-Multi-DEC and JRS-BIP, where the former uses a novel metric to minimize the load of each link whilst the latter uses a binary integer program solver. Both algorithms have the similar aim of minimizing overall delay and to re-order slots such that packets are forwarded quickly along their path. Numerical results show that our algorithms can reduce average delay by approximately 50% as compared to a non joint routing and scheduling algorithm.
{"title":"Delay aware joint routing and scheduling for multi-Tx-Rx Wireless Mesh Networks","authors":"Luyao Wang, Kwan-Wu Chin, R. Raad, S. Soh","doi":"10.1109/ICC.2014.6883744","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883744","url":null,"abstract":"Recently, researchers have created Wireless Mesh Networks (WMNs) where routers have multiple transmit (Tx) or receive (Rx) capability. A fundamental problem in such WMNs is deriving a transmission schedule that yields minimal end-to-end delays. In this paper, we approach this problem via joint routing and link scheduling. Specifically, we consider two fundamental issues that influence end-to-end delays: superframe length and transmission slot order. We propose two algorithms: JRS-Multi-DEC and JRS-BIP, where the former uses a novel metric to minimize the load of each link whilst the latter uses a binary integer program solver. Both algorithms have the similar aim of minimizing overall delay and to re-order slots such that packets are forwarded quickly along their path. Numerical results show that our algorithms can reduce average delay by approximately 50% as compared to a non joint routing and scheduling algorithm.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124787842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883550
Qiong Wu, Junni Zou, Zhuo Wu
Cooperative cognitive radio (CR) improves quality of service (e.g. rate) of primary users by cooperative transmission from secondary uses. However, as owners of the spectrum, primary users' traffic demands are relatively easy to be satisfied. The rationale is that they would be more interested in the benefits of other format (e.g. revenue), instead of the enhanced rate. In this paper, we propose a new cooperative CR framework, where primary users assist transmissions of secondary users. In exchange for this concession, primary users receive the payments of secondary users for the spectrum and cooperative transmit power being used in cooperation. An auction-theoretic model with multiple auctioneers, multiple bidders and multiple commodities is developed for a joint spectrum and cooperative power allocation. Finally, we mathematically prove the convergence of the proposed auction, and verify the performance of the proposed scheme by numerical results.
{"title":"Joint spectrum and power allocation in coded cooperative cognitive radio networks","authors":"Qiong Wu, Junni Zou, Zhuo Wu","doi":"10.1109/ICC.2014.6883550","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883550","url":null,"abstract":"Cooperative cognitive radio (CR) improves quality of service (e.g. rate) of primary users by cooperative transmission from secondary uses. However, as owners of the spectrum, primary users' traffic demands are relatively easy to be satisfied. The rationale is that they would be more interested in the benefits of other format (e.g. revenue), instead of the enhanced rate. In this paper, we propose a new cooperative CR framework, where primary users assist transmissions of secondary users. In exchange for this concession, primary users receive the payments of secondary users for the spectrum and cooperative transmit power being used in cooperation. An auction-theoretic model with multiple auctioneers, multiple bidders and multiple commodities is developed for a joint spectrum and cooperative power allocation. Finally, we mathematically prove the convergence of the proposed auction, and verify the performance of the proposed scheme by numerical results.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124930636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883948
Chunzhi He, K. Yeung, S. Jamin
In a data center with TCP/IP communications, it is generally believed that packet-based load balancing is not suitable because the associated packet out-of-order problem will significantly lower the network utilization. In this paper, we first show that if packet-based load balancing is performed properly in a fat-tree based data center, the packet out-of-order problem is not as severe as most researchers believed. This is due to the fact that multiple (minimal) paths between any given pair of servers in a fat-tree are of the same hop count. If packets are evenly routed onto different paths, they will experience similar delay performance. As a result, the packet out-of-order arrivals at the receiver are usually within a small sequence number range. Notably, the fast retransmit (FR) algorithm in TCP will be triggered for resending the “lost” packet if three duplicate ACKs are received (i.e. FR threshold is three). To provide leeway for out-of-order packet arrivals due to packet-based load balancing, we propose to judiciously increase the FR threshold. Simulation results show that FR threshold values between 6 and 9 can effectively suppress unnecessary fast retransmits and at the same time, the impact to real packet losses is minimal. Compared to a flow-based load balancing scheme, we found that our packet-based load balancing with modified TCP consistently provides higher goodput and noticeably smaller delay.
{"title":"Packet-based load-balancing in fat-tree based data center networks","authors":"Chunzhi He, K. Yeung, S. Jamin","doi":"10.1109/ICC.2014.6883948","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883948","url":null,"abstract":"In a data center with TCP/IP communications, it is generally believed that packet-based load balancing is not suitable because the associated packet out-of-order problem will significantly lower the network utilization. In this paper, we first show that if packet-based load balancing is performed properly in a fat-tree based data center, the packet out-of-order problem is not as severe as most researchers believed. This is due to the fact that multiple (minimal) paths between any given pair of servers in a fat-tree are of the same hop count. If packets are evenly routed onto different paths, they will experience similar delay performance. As a result, the packet out-of-order arrivals at the receiver are usually within a small sequence number range. Notably, the fast retransmit (FR) algorithm in TCP will be triggered for resending the “lost” packet if three duplicate ACKs are received (i.e. FR threshold is three). To provide leeway for out-of-order packet arrivals due to packet-based load balancing, we propose to judiciously increase the FR threshold. Simulation results show that FR threshold values between 6 and 9 can effectively suppress unnecessary fast retransmits and at the same time, the impact to real packet losses is minimal. Compared to a flow-based load balancing scheme, we found that our packet-based load balancing with modified TCP consistently provides higher goodput and noticeably smaller delay.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125099397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884182
Shuai Han, Desi Luo, W. Meng, Cheng Li
The Global Navigation Satellite System (GNSS) has been widely used by militaries as well as civilians. Generally, the locating accuracy is high, but the system is lack of immunity against spoofing attack, which may deceive the receiver into error positioning. In order to deal with the problem, a maximum particle weight monitoring scheme based on particle filter (PF) is proposed for spoofing detection in this paper. The scheme exploits the relation between spoofing and particle weight, and it can detect spoofing by catching the abnormal maximum particle weight. After detection process, an improved robust estimation method is applied in the spoofing suppression, thereby eliminating the impairing. Both the theoretical analyses and the simulation results verify the effectiveness of the spoofing detection and suppression schemes.
{"title":"A novel anti-spoofing method based on particle filter for GNSS","authors":"Shuai Han, Desi Luo, W. Meng, Cheng Li","doi":"10.1109/ICC.2014.6884182","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884182","url":null,"abstract":"The Global Navigation Satellite System (GNSS) has been widely used by militaries as well as civilians. Generally, the locating accuracy is high, but the system is lack of immunity against spoofing attack, which may deceive the receiver into error positioning. In order to deal with the problem, a maximum particle weight monitoring scheme based on particle filter (PF) is proposed for spoofing detection in this paper. The scheme exploits the relation between spoofing and particle weight, and it can detect spoofing by catching the abnormal maximum particle weight. After detection process, an improved robust estimation method is applied in the spoofing suppression, thereby eliminating the impairing. Both the theoretical analyses and the simulation results verify the effectiveness of the spoofing detection and suppression schemes.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126029295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883575
S. Fowler, George Baravdish, D. Yuan
The 4G standard Long Term Evolution (LTE) utilizes discontinuous reception (DRX) to extend the user equipments battery lifetime. DRX permits an idle UE to power off the radio receiver for two predefined sleep period and then wake up to receive the next paging message. Two major basic power saving models proposed to data are the 3GPP ETSI model and industrial DRX model proposed by Nokia. While previous studies have investigated power saving with the 3GPP ETSI models, the industrial DRX model has not been considered for analytical studies to date. Thus, there is a need to optimize the DRX parameters in the industrial model so as to maximize power saving without incurring network reentry and packet delays. In this paper, we take an overview of various static DRX cycles of the LTE/LTE-Advanced power saving mechanisms by modelling the system with bursty packet data traffic using a semi-Markov process. Using this analytical model, we will show the tradeoff relationship between the power saving and wake-up delay performance in the industrial model.
{"title":"Numerical analysis of an industrial power saving mechanism in LTE","authors":"S. Fowler, George Baravdish, D. Yuan","doi":"10.1109/ICC.2014.6883575","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883575","url":null,"abstract":"The 4G standard Long Term Evolution (LTE) utilizes discontinuous reception (DRX) to extend the user equipments battery lifetime. DRX permits an idle UE to power off the radio receiver for two predefined sleep period and then wake up to receive the next paging message. Two major basic power saving models proposed to data are the 3GPP ETSI model and industrial DRX model proposed by Nokia. While previous studies have investigated power saving with the 3GPP ETSI models, the industrial DRX model has not been considered for analytical studies to date. Thus, there is a need to optimize the DRX parameters in the industrial model so as to maximize power saving without incurring network reentry and packet delays. In this paper, we take an overview of various static DRX cycles of the LTE/LTE-Advanced power saving mechanisms by modelling the system with bursty packet data traffic using a semi-Markov process. Using this analytical model, we will show the tradeoff relationship between the power saving and wake-up delay performance in the industrial model.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126176090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883871
Jing Chen, B. Sikdar
Hardware techniques such as dynamic voltage and frequency scaling may be used to reduce the energy consumption of network interfaces and achieve load-proportional energy usage. These techniques slow down the operation of the hardware and thus their power savings come at the cost of increased packet delays. This paper presents a methodology to address the energy-delay tradeoff while achieving load-proportional energy usage in wireless networks. The proposed system uses a pipelined implementation of the functional blocks of the medium access control (MAC) layer. Each functional block has its own job queue and is treated as an individual system with an independent clock. The clock frequency of each functional block is dynamically selected based on the length of its job queue. While the pipelined implementation reduces the MAC layer processing delays, the use of queue-length based frequency scaling provides load-proportional energy usage and enhances the overall stability of the system. The performance of the proposed system has been verified through extensive simulations.
{"title":"Addressing the energy-delay tradeoff in wireless networks with load-proportional energy usage","authors":"Jing Chen, B. Sikdar","doi":"10.1109/ICC.2014.6883871","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883871","url":null,"abstract":"Hardware techniques such as dynamic voltage and frequency scaling may be used to reduce the energy consumption of network interfaces and achieve load-proportional energy usage. These techniques slow down the operation of the hardware and thus their power savings come at the cost of increased packet delays. This paper presents a methodology to address the energy-delay tradeoff while achieving load-proportional energy usage in wireless networks. The proposed system uses a pipelined implementation of the functional blocks of the medium access control (MAC) layer. Each functional block has its own job queue and is treated as an individual system with an independent clock. The clock frequency of each functional block is dynamically selected based on the length of its job queue. While the pipelined implementation reduces the MAC layer processing delays, the use of queue-length based frequency scaling provides load-proportional energy usage and enhances the overall stability of the system. The performance of the proposed system has been verified through extensive simulations.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123718346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883725
Xiao Zhang, Xiaoming Tao, Yang Li, N. Ge, Jianhua Lu
This paper investigates QoS-aware relay selection and subcarrier assignment in cooperative OFDMA networks. In contrast to some existing works, which solve the sum-rate maximization problem directly, we first simplify it by exploiting the structure of the optimal solution, then we solve the simplified problem. To characterize the optimal network sum-rate performance, we solve the simplified problem optimally by the branch-and-cut method. In addition to the sum-rate maximization problem, we demonstrate that its two variants can also be similarly simplified and then be solved optimally by the branch-and-cut method. The optimal method serving as the benchmark is particularly suitable for moderate scale problems. Simulations show that the branch-and-cut method can locate the optimal solution effectively, which may in turn provide some insights into the performance of the heuristic method.
{"title":"On optimal relay selection and subcarrier assignment in OFDMA relay networks with QoS guarantees","authors":"Xiao Zhang, Xiaoming Tao, Yang Li, N. Ge, Jianhua Lu","doi":"10.1109/ICC.2014.6883725","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883725","url":null,"abstract":"This paper investigates QoS-aware relay selection and subcarrier assignment in cooperative OFDMA networks. In contrast to some existing works, which solve the sum-rate maximization problem directly, we first simplify it by exploiting the structure of the optimal solution, then we solve the simplified problem. To characterize the optimal network sum-rate performance, we solve the simplified problem optimally by the branch-and-cut method. In addition to the sum-rate maximization problem, we demonstrate that its two variants can also be similarly simplified and then be solved optimally by the branch-and-cut method. The optimal method serving as the benchmark is particularly suitable for moderate scale problems. Simulations show that the branch-and-cut method can locate the optimal solution effectively, which may in turn provide some insights into the performance of the heuristic method.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126706885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884065
Chenxi Liu, Nan Yang, Giovanni Geraci, Jinhong Yuan, R. Malaney
We propose two beamforming schemes supporting multi-stream transmission in multi-input multi-output multi-antenna eavesdropper wiretap channels with imperfect channel state information of the eavesdropper. We first propose a generalized eigenvalue decomposition (GEVD)-based beamforming scheme by designing the beamforming matrix and determining the power allocation matrix. In particular, we determine a general power allocation matrix for arbitrary signal-to-noise ratio (SNR) and a simplified power allocation matrix for high SNR. We demonstrate that our GEVD-based beamforming scheme delivers a higher achievable secrecy rate than the existing beamforming schemes in the medium and high SNR regime. We also demonstrate that the simplified power allocation matrix delivers the same achievable secrecy rate as the general power allocation matrix at high SNRs. We then propose an easy-to-construct EVD-based beamforming scheme which reduces signal processing cost and eliminates power allocation. We demonstrate that our EVD-based beamforming scheme delivers a higher secrecy rate than the GEVD-based beamforming scheme and the existing beamforming schemes in the low SNR regime.
{"title":"Secrecy in MIMOME wiretap channels: Beamforming with imperfect CSI","authors":"Chenxi Liu, Nan Yang, Giovanni Geraci, Jinhong Yuan, R. Malaney","doi":"10.1109/ICC.2014.6884065","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884065","url":null,"abstract":"We propose two beamforming schemes supporting multi-stream transmission in multi-input multi-output multi-antenna eavesdropper wiretap channels with imperfect channel state information of the eavesdropper. We first propose a generalized eigenvalue decomposition (GEVD)-based beamforming scheme by designing the beamforming matrix and determining the power allocation matrix. In particular, we determine a general power allocation matrix for arbitrary signal-to-noise ratio (SNR) and a simplified power allocation matrix for high SNR. We demonstrate that our GEVD-based beamforming scheme delivers a higher achievable secrecy rate than the existing beamforming schemes in the medium and high SNR regime. We also demonstrate that the simplified power allocation matrix delivers the same achievable secrecy rate as the general power allocation matrix at high SNRs. We then propose an easy-to-construct EVD-based beamforming scheme which reduces signal processing cost and eliminates power allocation. We demonstrate that our EVD-based beamforming scheme delivers a higher secrecy rate than the GEVD-based beamforming scheme and the existing beamforming schemes in the low SNR regime.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126920690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884173
Maria Gregori, M. Payaró
This paper considers a communication system composed of multiple transmitter-receiver pairs (users) that must share the same frequency band. As battery replacement may be a tedious task, transmitters are solely powered by energy harvesters, specifically, by solar and electromagnetic energies. In previous works for non-harvesting nodes, transmissions of other nodes limit the achievable rate of a certain user due to interference. In contrast, when a certain transmitter harvests electromagnetic energy, transmissions of other nodes may be beneficial as part of the transmitted energy can be harvested and later used to increase the transmission power and, accordingly, the achievable rate. In this context, this paper formulates a Nash Equilibrium (NE) problem with prices to assign the transmission powers of the different nodes by taking into account constraints in the transmission power and the Energy Causality Constraints (ECCs), which intrinsically couple the different user transmission strategies. The existence and uniqueness of the equilibrium are characterized by using the theory of finite dimensional Variational Inequalities (VIs).
{"title":"Multiuser communications with energy harvesting transmitters","authors":"Maria Gregori, M. Payaró","doi":"10.1109/ICC.2014.6884173","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884173","url":null,"abstract":"This paper considers a communication system composed of multiple transmitter-receiver pairs (users) that must share the same frequency band. As battery replacement may be a tedious task, transmitters are solely powered by energy harvesters, specifically, by solar and electromagnetic energies. In previous works for non-harvesting nodes, transmissions of other nodes limit the achievable rate of a certain user due to interference. In contrast, when a certain transmitter harvests electromagnetic energy, transmissions of other nodes may be beneficial as part of the transmitted energy can be harvested and later used to increase the transmission power and, accordingly, the achievable rate. In this context, this paper formulates a Nash Equilibrium (NE) problem with prices to assign the transmission powers of the different nodes by taking into account constraints in the transmission power and the Energy Causality Constraints (ECCs), which intrinsically couple the different user transmission strategies. The existence and uniqueness of the equilibrium are characterized by using the theory of finite dimensional Variational Inequalities (VIs).","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114882978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6883995
H. Nomura, H. Uzawa, Y. Arikawa, Y. Nishida, H. Ujikawa, Ken-ichi Suzuki, N. Yoshimoto
We propose a novel energy-efficient power saving technique coordinating CPEs via ONU. In addition, we first evaluate the proposal in a 10G-EPON system whose ONU sleep mechanism complies with IEEE Std. 1904.1 SIEPON and IEEE 802.3az EEE. It is revealed that the proposal yields ONU power savings of the order of 42 %. Moreover, it reduces the excessive latency by 40 % compared to unsynchronized power saving control.
{"title":"Coordinating energy-efficient CPEs on IEEE 1904.1 compliant systems Via ONU for enhanced power savings: Proposal and demonstration","authors":"H. Nomura, H. Uzawa, Y. Arikawa, Y. Nishida, H. Ujikawa, Ken-ichi Suzuki, N. Yoshimoto","doi":"10.1109/ICC.2014.6883995","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883995","url":null,"abstract":"We propose a novel energy-efficient power saving technique coordinating CPEs via ONU. In addition, we first evaluate the proposal in a 10G-EPON system whose ONU sleep mechanism complies with IEEE Std. 1904.1 SIEPON and IEEE 802.3az EEE. It is revealed that the proposal yields ONU power savings of the order of 42 %. Moreover, it reduces the excessive latency by 40 % compared to unsynchronized power saving control.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115220999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：