Pub Date : 2015-04-27DOI: 10.1109/ICT.2015.7124717
Changlin Yang, Kwan-Wu Chin
In energy harvesting wireless sensor networks, ensuring complete targets coverage is a fundamental problem. In particular, targets are required to be monitored by at least one sensor node at all times. To date, past works have proposed to schedule sensor nodes alternately in the active/sleep state to maximize network lifetime whilst maintaining complete targets coverage, and affording sensor nodes recharging opportunities. However, they do not consider connectivity to the sink. We first propose a Linear Programming (LP) based solution to determine the activation time of sensor nodes. The design constraints include complete targets coverage, energy, and flow conservation to ensure data from sensor nodes monitoring targets are able to forward their data to the sink. We also propose an efficient heuristic algorithm as the LP solution requires an exhaustive collection of set covers. The heuristic iteratively selects sensor nodes to monitor targets and forward sensed data according to their residual energy. The simulation results show that the heuristic algorithm achieves 80% of the network lifetime computed by the LP solution at a fraction of the computation time.
{"title":"On complete targets coverage and connectivity in energy harvesting wireless sensor networks","authors":"Changlin Yang, Kwan-Wu Chin","doi":"10.1109/ICT.2015.7124717","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124717","url":null,"abstract":"In energy harvesting wireless sensor networks, ensuring complete targets coverage is a fundamental problem. In particular, targets are required to be monitored by at least one sensor node at all times. To date, past works have proposed to schedule sensor nodes alternately in the active/sleep state to maximize network lifetime whilst maintaining complete targets coverage, and affording sensor nodes recharging opportunities. However, they do not consider connectivity to the sink. We first propose a Linear Programming (LP) based solution to determine the activation time of sensor nodes. The design constraints include complete targets coverage, energy, and flow conservation to ensure data from sensor nodes monitoring targets are able to forward their data to the sink. We also propose an efficient heuristic algorithm as the LP solution requires an exhaustive collection of set covers. The heuristic iteratively selects sensor nodes to monitor targets and forward sensed data according to their residual energy. The simulation results show that the heuristic algorithm achieves 80% of the network lifetime computed by the LP solution at a fraction of the computation time.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514971","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124699
Yuwei Ren, Yingmin Wang, Guixian Xu
Massive multiple-input multiple-output (MIMO) systems are expected to significantly enhance the energy efficiency (EE) and spectrum efficiency (SE). However, RF transceivers introduce huge cost of high complexity of the hardware with the antennas increasing. In this paper, considering the low-complexity hybrid structure, we propose a hybrid precoding scheme to approach the performance of the traditional full-complexity baseband digital zero-forcing (FD-ZF) precoding. The proposed scheme, named two-stage hybrid precoding, essentially applies phase-only control at the RF domain and then performs a low-dimensional baseband digital ZF precoding based on the effective channels seen from baseband. Meanwhile, quantized RF phase (no more than 3bits) is considered. The proposed scheme is simulated in ideal Rayleigh fading channels and the results are nearly equal to FD-ZF.
{"title":"Two-stage hybrid precoding for massive MIMO systems","authors":"Yuwei Ren, Yingmin Wang, Guixian Xu","doi":"10.1109/ICT.2015.7124699","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124699","url":null,"abstract":"Massive multiple-input multiple-output (MIMO) systems are expected to significantly enhance the energy efficiency (EE) and spectrum efficiency (SE). However, RF transceivers introduce huge cost of high complexity of the hardware with the antennas increasing. In this paper, considering the low-complexity hybrid structure, we propose a hybrid precoding scheme to approach the performance of the traditional full-complexity baseband digital zero-forcing (FD-ZF) precoding. The proposed scheme, named two-stage hybrid precoding, essentially applies phase-only control at the RF domain and then performs a low-dimensional baseband digital ZF precoding based on the effective channels seen from baseband. Meanwhile, quantized RF phase (no more than 3bits) is considered. The proposed scheme is simulated in ideal Rayleigh fading channels and the results are nearly equal to FD-ZF.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133346379","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124663
Basel Barakat, K. Arshad
The 3rd Generation Partnership Project (3GPP) introduced Long Term Evolution (LTE) in release 8, and afterwards it was updated significantly in later releases (referred to as LTE-Advanced). LTE and LTE-Advanced (LTE-A) aim to achieve higher spectral efficiency, higher data rates, robustness and flexibility. Intelligent channel-aware radio resource scheduling is one of the key features of LTE-A. A number of schedulers proposed in the literature rely on the feedback sent from the Users Equipment (UE) without considering the presence of feedback delay. In this paper, we analyse the effect of the uplink delay on the cell performance of existing schedulers, in terms of throughput and the users' fairness. We then propose an adaptive hybrid scheduler to overcome the effect of the uplink delay on the scheduler performance. The simulation results show that our proposed scheduling algorithm outperforms the existing schedulers in the presence of uplink feedback delay.
{"title":"An adaptive hybrid scheduling algorithm for LTE-Advanced","authors":"Basel Barakat, K. Arshad","doi":"10.1109/ICT.2015.7124663","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124663","url":null,"abstract":"The 3rd Generation Partnership Project (3GPP) introduced Long Term Evolution (LTE) in release 8, and afterwards it was updated significantly in later releases (referred to as LTE-Advanced). LTE and LTE-Advanced (LTE-A) aim to achieve higher spectral efficiency, higher data rates, robustness and flexibility. Intelligent channel-aware radio resource scheduling is one of the key features of LTE-A. A number of schedulers proposed in the literature rely on the feedback sent from the Users Equipment (UE) without considering the presence of feedback delay. In this paper, we analyse the effect of the uplink delay on the cell performance of existing schedulers, in terms of throughput and the users' fairness. We then propose an adaptive hybrid scheduler to overcome the effect of the uplink delay on the scheduler performance. The simulation results show that our proposed scheduling algorithm outperforms the existing schedulers in the presence of uplink feedback delay.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124591115","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124720
Qahhar Muhammad Qadir, A. Kist, Zhongwei Zhang
The rapid shift toward video on-demand and real time information systems has affected mobile as well as wired networks. The research community has placed a strong focus on optimizing the Quality of Experience (QoE) of video traffic, mainly because video is popular among Internet users. Techniques have been proposed in different directions towards improvement of the perception of video users. This paper investigates the performance of a novel cross-layer architecture for optimizing the QoE of video traffic. The proposed architecture is compared to two other architectures; non-adaptive and adaptive. For the former, video traffic is sent without adaptation, whereas for the later video sources adapt their transmission rate. Both are compared in terms of the mean opinion score of video sessions, number of sessions, delay, packet drop ratio, jitter and utilization. The results from extensive simulations show that the proposed architecture outperforms the non-adaptive and adaptive architectures for video traffic.
{"title":"Optimization of Quality of Experience for video traffic","authors":"Qahhar Muhammad Qadir, A. Kist, Zhongwei Zhang","doi":"10.1109/ICT.2015.7124720","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124720","url":null,"abstract":"The rapid shift toward video on-demand and real time information systems has affected mobile as well as wired networks. The research community has placed a strong focus on optimizing the Quality of Experience (QoE) of video traffic, mainly because video is popular among Internet users. Techniques have been proposed in different directions towards improvement of the perception of video users. This paper investigates the performance of a novel cross-layer architecture for optimizing the QoE of video traffic. The proposed architecture is compared to two other architectures; non-adaptive and adaptive. For the former, video traffic is sent without adaptation, whereas for the later video sources adapt their transmission rate. Both are compared in terms of the mean opinion score of video sessions, number of sessions, delay, packet drop ratio, jitter and utilization. The results from extensive simulations show that the proposed architecture outperforms the non-adaptive and adaptive architectures for video traffic.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122529076","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124674
H. Vangala, E. Viterbo, Y. Hong
We consider the problem of reducing the output alphabet size of a binary input discrete memoryless channel from M to K at minimal loss in mutual information. It was found in [1] that this problem can be solved optimally using a dynamic programming approach, which takes only O(M3) worst-case complexity. We first present a new formulation of the problem, as a K-hop single source shortest path problem (K-hop SSSPP) in a graph G(V,E)with M+1 vertices and(M/2 (M+1)- K/2 (K-1)) edges. This new formulation can in the future serve as a basis to several algorithms on channel quantization. Then we found that the algorithm in [1] has asymptotically optimal complexity in the class of path-comparison based algorithms for general graphs. This implies that we can only expect a constant factor improvement in complexity with any other optimal quantizers, until more specific properties of the graph such as edges and their cost-structure with concave mutual information function are exploited in designing the algorithms (e.g. [2], [3]). We finally present a new optimal quantizer algorithm based on the classic Bellman-Ford algorithm on G, achieving a constant factor improvement in complexity. We claim that our algorithm will be about 50% faster than [1].
{"title":"Quantization of binary input DMC at optimal mutual information using constrained shortest path problem","authors":"H. Vangala, E. Viterbo, Y. Hong","doi":"10.1109/ICT.2015.7124674","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124674","url":null,"abstract":"We consider the problem of reducing the output alphabet size of a binary input discrete memoryless channel from M to K at minimal loss in mutual information. It was found in [1] that this problem can be solved optimally using a dynamic programming approach, which takes only O(M3) worst-case complexity. We first present a new formulation of the problem, as a K-hop single source shortest path problem (K-hop SSSPP) in a graph G(V,E)with M+1 vertices and(M/2 (M+1)- K/2 (K-1)) edges. This new formulation can in the future serve as a basis to several algorithms on channel quantization. Then we found that the algorithm in [1] has asymptotically optimal complexity in the class of path-comparison based algorithms for general graphs. This implies that we can only expect a constant factor improvement in complexity with any other optimal quantizers, until more specific properties of the graph such as edges and their cost-structure with concave mutual information function are exploited in designing the algorithms (e.g. [2], [3]). We finally present a new optimal quantizer algorithm based on the classic Bellman-Ford algorithm on G, achieving a constant factor improvement in complexity. We claim that our algorithm will be about 50% faster than [1].","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128530523","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124681
Craig Wang, S. Durrani, Jing Guo, Xiangyun Zhou
In this paper, we analyse the call completion probability in a two-tier heterogeneous network (HetNet), where all base stations (BSs) in each tier are powered solely by energy harvesting. Since energy harvesting BSs may need to be kept OFF and allowed to recharge, users connected to a BS that turns OFF need to be served by neighboring BSs that are ON. This hand-off of a call can impact the call performance from a users point of view. We formulate the call completion probability for HetNets by adapting the definition from traditional cellular networks. Adopting a realistic BS energy consumption model and using tools from stochastic geometry, we derive very tight upper and lower bounds on the call completion probability in the presence of Rayleigh fading, interference and energy harvesting BSs. We examine the impact of the system parameters on the completion probability. The results show that the macro BS energy harvesting parameters have the dominant impact on the call completion probability. In particular, the call completion probability is an increasing function of the macro BS battery capacity and the minimum energy level at which macro BS switches back ON. However, it is an increasing function of the macro BS energy harvesting rate only when the macro BS battery capacity and the minimum energy level at which macro BS switches back ON are large. The results can be used in network planning to ensure certain quality-of-service (QoS) to users in terms of call completion probability.
{"title":"Call completion probability in heterogeneous networks with energy harvesting base stations","authors":"Craig Wang, S. Durrani, Jing Guo, Xiangyun Zhou","doi":"10.1109/ICT.2015.7124681","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124681","url":null,"abstract":"In this paper, we analyse the call completion probability in a two-tier heterogeneous network (HetNet), where all base stations (BSs) in each tier are powered solely by energy harvesting. Since energy harvesting BSs may need to be kept OFF and allowed to recharge, users connected to a BS that turns OFF need to be served by neighboring BSs that are ON. This hand-off of a call can impact the call performance from a users point of view. We formulate the call completion probability for HetNets by adapting the definition from traditional cellular networks. Adopting a realistic BS energy consumption model and using tools from stochastic geometry, we derive very tight upper and lower bounds on the call completion probability in the presence of Rayleigh fading, interference and energy harvesting BSs. We examine the impact of the system parameters on the completion probability. The results show that the macro BS energy harvesting parameters have the dominant impact on the call completion probability. In particular, the call completion probability is an increasing function of the macro BS battery capacity and the minimum energy level at which macro BS switches back ON. However, it is an increasing function of the macro BS energy harvesting rate only when the macro BS battery capacity and the minimum energy level at which macro BS switches back ON are large. The results can be used in network planning to ensure certain quality-of-service (QoS) to users in terms of call completion probability.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128701262","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 : 2015-04-27DOI: 10.1109/ICT.2015.7124666
Chalakorn Karupongsiri, K. Munasinghe, A. Jamalipour
Long Term Evolution (LTE) is an attractive infrastructure for Smart Grid (SG) networks because it provides high bandwidth and low latency over a large coverage area. Although LTE networks are primary designed for Human-to-Human (H2H) communication, SG networks primarily involve Machine-to-Machine (M2M) communications. One such SG network component is the Smart Meter (SM), which utilizes M2M communications to report power consumption to a centralized control center at periodic intervals. As defined by the LTE standard, all User Equipment (UE), including SMs, need to make a connection to transmit a packet. That means, UEs need a scheduling and resource blocks (RBs). In this paper, we introduce SM packet transmission via LTE control signaling in order to conserve resources at the eNode-B such as physical channels, scheduling and RBs. Heavy and medium load are compared to investigate packet loss at the eNode-B. With our proposed mechanism, results show that SM packets can be sent via a control signal with no scheduling or RB usage required at the eNode-B. Simulation results show that usage of the Physical Uplink Share CHannel (PUSCH), Physical Downlink Control CHannel (PDCCH), and Physical Downlink Share CHannel (PDSCH) are reduced by 2%. In addition, packets loss during heavy load at the eNode-B is decreased by 15% when compared with the LTE standard.
{"title":"Smart meter packet transmission via the control signal at dynamic load on eNode-B in LTE networks","authors":"Chalakorn Karupongsiri, K. Munasinghe, A. Jamalipour","doi":"10.1109/ICT.2015.7124666","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124666","url":null,"abstract":"Long Term Evolution (LTE) is an attractive infrastructure for Smart Grid (SG) networks because it provides high bandwidth and low latency over a large coverage area. Although LTE networks are primary designed for Human-to-Human (H2H) communication, SG networks primarily involve Machine-to-Machine (M2M) communications. One such SG network component is the Smart Meter (SM), which utilizes M2M communications to report power consumption to a centralized control center at periodic intervals. As defined by the LTE standard, all User Equipment (UE), including SMs, need to make a connection to transmit a packet. That means, UEs need a scheduling and resource blocks (RBs). In this paper, we introduce SM packet transmission via LTE control signaling in order to conserve resources at the eNode-B such as physical channels, scheduling and RBs. Heavy and medium load are compared to investigate packet loss at the eNode-B. With our proposed mechanism, results show that SM packets can be sent via a control signal with no scheduling or RB usage required at the eNode-B. Simulation results show that usage of the Physical Uplink Share CHannel (PUSCH), Physical Downlink Control CHannel (PDCCH), and Physical Downlink Share CHannel (PDSCH) are reduced by 2%. In addition, packets loss during heavy load at the eNode-B is decreased by 15% when compared with the LTE standard.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"60 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128012052","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 : 2015-04-01DOI: 10.1109/ICT.2015.7124651
Hongyu Ma, K. Niu, Weilin Wu, Shengyu Li, Guangqian Chu
The secrecy transmission performance of cognitive radio ad hoc networks is investigated in this paper. The existing work on secrecy capacity of cognitive radio networks focus on order sense results like scaling laws, however, these results only give asymptotic predictions without an exact expression. In order to overcome this limitation, we propose a new method to derive the closed-form expression of secrecy transmission capacity of the primary network. The nearest neighbour routing protocol is considered. Furthermore, we evaluate the optimal PR density maximizing the secrecy transmission capacity under constraints of the connection outage probability (COP) and the secrecy outage probability (SOP), and obtain the maximum achievable secrecy transmission capacity. Analytical results show that cognitive interference is helpful to improve the secrecy connection performance satisfying the constraint that the average channel condition of primary networks is better than that of eavesdropping networks. Numerical results indicate that there is a tradeoff between the reliability and security in cognitive radio networks.
{"title":"Secrecy transmission capacity of primary network with help of cognitive interference","authors":"Hongyu Ma, K. Niu, Weilin Wu, Shengyu Li, Guangqian Chu","doi":"10.1109/ICT.2015.7124651","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124651","url":null,"abstract":"The secrecy transmission performance of cognitive radio ad hoc networks is investigated in this paper. The existing work on secrecy capacity of cognitive radio networks focus on order sense results like scaling laws, however, these results only give asymptotic predictions without an exact expression. In order to overcome this limitation, we propose a new method to derive the closed-form expression of secrecy transmission capacity of the primary network. The nearest neighbour routing protocol is considered. Furthermore, we evaluate the optimal PR density maximizing the secrecy transmission capacity under constraints of the connection outage probability (COP) and the secrecy outage probability (SOP), and obtain the maximum achievable secrecy transmission capacity. Analytical results show that cognitive interference is helpful to improve the secrecy connection performance satisfying the constraint that the average channel condition of primary networks is better than that of eavesdropping networks. Numerical results indicate that there is a tradeoff between the reliability and security in cognitive radio networks.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"34 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116482976","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 : 2015-02-11DOI: 10.1109/ICT.2015.7124654
Ni Ding, R. Kennedy, P. Sadeghi
We consider the fairness in cooperative data exchange (CDE) problem among a set of wireless clients. In this system, each client initially obtains a subset of the packets. They exchange packets in order to reconstruct the entire packet set. We study the problem of how to find a transmission strategy that distributes the communication load most evenly in all strategies that have the same sum-rate (the total number of transmissions) and achieve universal recovery (the situation when all clients recover the packet set). We formulate this problem by a discrete minimization problem and prove its M-convexity. We show that our results can also be proved by the submodularity of the feasible region shown in previous works and are closely related to the resource allocation problems under submodular constraints. To solve this problem, we propose to use a steepest descent algorithm (SDA) based on M-convexity. By varying the number of clients and packets, we compare SDA with a deterministic algorithm (DA) based on submodularity in terms of convergence performance and complexity. The results show that for the problem of finding the fairest and minimum sum-rate strategy for the CDE problem SDA is more efficient than DA when the number of clients is up to five.
{"title":"Fairest constant sum-rate transmission for cooperative data exchange: An M-convex minimization approach","authors":"Ni Ding, R. Kennedy, P. Sadeghi","doi":"10.1109/ICT.2015.7124654","DOIUrl":"https://doi.org/10.1109/ICT.2015.7124654","url":null,"abstract":"We consider the fairness in cooperative data exchange (CDE) problem among a set of wireless clients. In this system, each client initially obtains a subset of the packets. They exchange packets in order to reconstruct the entire packet set. We study the problem of how to find a transmission strategy that distributes the communication load most evenly in all strategies that have the same sum-rate (the total number of transmissions) and achieve universal recovery (the situation when all clients recover the packet set). We formulate this problem by a discrete minimization problem and prove its M-convexity. We show that our results can also be proved by the submodularity of the feasible region shown in previous works and are closely related to the resource allocation problems under submodular constraints. To solve this problem, we propose to use a steepest descent algorithm (SDA) based on M-convexity. By varying the number of clients and packets, we compare SDA with a deterministic algorithm (DA) based on submodularity in terms of convergence performance and complexity. The results show that for the problem of finding the fairest and minimum sum-rate strategy for the CDE problem SDA is more efficient than DA when the number of clients is up to five.","PeriodicalId":375669,"journal":{"name":"2015 22nd International Conference on Telecommunications (ICT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132276107","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
扫码关注我们
求助内容：
应助结果提醒方式：