During the 1980s, as part of a policy of liberalization, following budgetary cuts linked to the implementation of structural adjustment programs, management responsibilities for AHAs were transferred from ONAHA to coo...During the 1980s, as part of a policy of liberalization, following budgetary cuts linked to the implementation of structural adjustment programs, management responsibilities for AHAs were transferred from ONAHA to cooperatives concerned. Due to lack of financial resources, but also because of poor management, everywhere in Niger we are witnessing an accelerated deterioration of the irrigation infrastructure of hydro-agricultural developments. Institutional studies carried out on this situation led the State of Niger to initiate a reform of the governance of hydro-agricultural developments, by streng-thening the status of ONAHA, by creating an Association of Irrigation Water Users (AUEI) and by restructuring the old cooperatives. Indeed, this research aims to analyze the creation of functional and sustainable Irrigation Water User Associations (AUEI) in Niger in a context of reform of the irrigation sector, and based on the experience of the Konni AHA. It is based on a methodological approach which takes into account documentary research and the collection of data from 115 farmers, selected by reasoned choice and directly concerned by the management of the irrigated area. The data collected was analyzed and the results were analyzed using the systemic approach and the diagnostic process. The results show that the main mission of the AUEI is to ensure better management of water, hydraulic equipment and infrastructure on the hydro-agricultural developments of Konni. The creation of the Konni AUEI was possible thanks to massive support from the populations and authorities in the implementation process. After its establishment, the AUEI experienced a certain lethargy for some time due to the rehabilitation work of the AHA but currently it is functional and operational in terms of associative life and governance. Thus, the constraints linked to the legal system, the delay in the completion of the work, the uncertainties of access to irrigation water but also the problems linked to the change in mentality of certain ONAHA agents constitute the challenges that must be resolved in the short term for the operationalization of the Konni AUEI.展开更多
In this paper, we investigate a cooperation mechanism for satellite-terrestrial integrated networks. The terrestrial relays act as the supplement of traditional small cells and cooperatively provide seamless coverage ...In this paper, we investigate a cooperation mechanism for satellite-terrestrial integrated networks. The terrestrial relays act as the supplement of traditional small cells and cooperatively provide seamless coverage for users in the densely populated areas.To deal with the dynamic satellite backhaul links and backhaul capacity caused by the satellite mobility, severe co-channel interference in both satellite backhaul links and user links introduced by spectrum sharing,and the difference demands of users as well as heterogeneous characteristics of terrestrial backhaul and satellite backhaul, we propose a joint user association and satellite selection scheme to maximize the total sum rate. The optimization problem is formulated via jointly considering the influence of dynamic backhaul links, individual requirements and targeted interference management strategies, which is decomposed into two subproblems: user association and satellite selection. The user association is formulated as a nonconvex optimization problem, and solved through a low-complexity heuristic scheme to find the most suitable access point serving each user. Then, the satellite selection is resolved based on the cooperation among terrestrial relays to maximize the total backhaul capacity with the minimum date rate constraints. Finally,simulation results show the effectiveness of the proposed scheme in terms of total sum rate and power efficiency of TRs' backhaul.展开更多
The exchange of information is an innate and natural process that assist in content dispersal.Social networking sites emerge to enrich their users by providing the facility for sharing information and social interacti...The exchange of information is an innate and natural process that assist in content dispersal.Social networking sites emerge to enrich their users by providing the facility for sharing information and social interaction.The extensive adoption of social networking sites also resulted in user content generation.There are diverse research areas explored by the researchers to investigate the influence of social media on users and confirmed that social media sites have a significant impact on markets,politics and social life.Facebook is extensively used platform to share information,thoughts and opinions through posts and comments.The identification of influential users on the social web has grown as hot research field because of vast applications in diverse areas for instance political campaigns marketing,e-commerce,commercial and,etc.Prior research studies either uses linguistic content or graph-based representation of social network for the detection of influential users.In this article,we incorporate association rule mining algorithms to identify the top influential users through frequent patterns.The association rules have been computed using the standard evaluation measures such as support,confidence,lift,and conviction.To verify the results,we also involve conventional metrics for example accuracy,precision,recall and F1-measure according to the association rules perspective.The detailed experiments are carried out using the benchmark College-Msg dataset extracted by Facebook.The obtained results validate the quality and visibility of the proposed approach.The outcome of propose model verify that the association rule mining is able to generate rules to identify the temporal influential users on Facebook who are consistent on regular basis.The preparation of rule set help to create knowledge-based systems which are efficient and widely used in recent era for decision making to solve real-world problems.展开更多
In this paper,we reveal the fundamental limitation of network densification on the performance of caching enabled small cell network(CSCN)under two typical user association rules,namely,contentand distance-based rules...In this paper,we reveal the fundamental limitation of network densification on the performance of caching enabled small cell network(CSCN)under two typical user association rules,namely,contentand distance-based rules.It indicates that immoderately caching content would significantly change the interference distribution in CSCN,which may degrade the network area spectral efficiency(ASE).Meanwhile,it is shown that content-based rule outperforms the distance-based rule in terms of network ASE only when small cell base stations(BSs)are sparsely deployed with low decoding thresholds.Moreover,it is proved that network ASE under distance-based user association serves as the upper bound of that under content-based rule in dense BS regime.To enable more spectrum-efficient user association in dense CSCN,we further optimize network ASE by designing a probabilistic content retrieving strategy based on distance-based rule.With the optimized retrieving probability,network ASE could be substantially enhanced and even increase with the growing BS density in dense BS regime.展开更多
Cache-enabling unmanned aerial vehicles(UAVs)are considered for storing popular contents and providing downlink data offloading in cellular networks.In this context,we formulate a joint optimization problem of user as...Cache-enabling unmanned aerial vehicles(UAVs)are considered for storing popular contents and providing downlink data offloading in cellular networks.In this context,we formulate a joint optimization problem of user association,caching placement,and backhaul bandwidth allocation for minimizing content acquisition delay with consideration of UAVs’energy constraint.We decompose the formulated problem into two subproblems:i)user association and caching placement and ii)backhaul bandwidth allocation.We first obtain the optimal bandwidth allocation with given user association and caching placement by the Lagrangian multiplier approach.After that,embedding the backhaul bandwidth allocation algorithm,we solve the user association and caching placement problem by a threedimensional(3D)matching method.Then we decompose it into two two-dimensional(2D)matching problems and develop low-complexity algorithms.The proposed scheme converges and exhibits a low computational complexity.Simulation results demonstrate that the proposed cache-enabling UAV framework outperforms the conventional UAV-assisted cellular networks in terms of content acquisition delay and the proposed scheme achieves significantly lower content acquisition delay compared with other two benchmark schemes.展开更多
构建基于无人机基站(Unmanned Aerial Vehicle Base Station, UBS)的空地网络是解决移动通信网络覆盖等问题的重要途径。区别于地面移动通信网络,空地网络需要对UBS位置和用户关联进行联合优化。针对上述问题,首先通过构建二进制无线电...构建基于无人机基站(Unmanned Aerial Vehicle Base Station, UBS)的空地网络是解决移动通信网络覆盖等问题的重要途径。区别于地面移动通信网络,空地网络需要对UBS位置和用户关联进行联合优化。针对上述问题,首先通过构建二进制无线电地图(Binary Radio Map, BRM)使得UBS能够有效获取整个任务区域中用户位置关联的信道知识,在此基础上提出基于BRM的离线多UBS部署与用户关联联合规划方法。该方法以最大化网络效用函数为目标,通过互嵌套的启发式UBS部署位置搜索和基于匹配博弈的UBS-用户匹配实现UBS位置和用户关联的离线优化。在复杂城市环境下,相比于参考方案,所提方法可使得用户和速率性能提升10%~40%。展开更多
A K-tier uplink heterogeneous cellular network is modelled and analysed by accounting for both truncated channel inversion power control and biased user association. Each user has a maximum transmit power constraint a...A K-tier uplink heterogeneous cellular network is modelled and analysed by accounting for both truncated channel inversion power control and biased user association. Each user has a maximum transmit power constraint and transmits data when it has sufficient transmit power to perform channel inversion. With biased user association, each user is associated with a base station(BS) that provides the maximum received power weighted by a bias factor, but not their nearest BS. Stochastic geometry is used to evaluate the performances of the proposed system model in terms of the outage probability and ergodic rate for each tier as functions of the biased and power control parameters. Simulations validate our analytical derivations. Numerical results show that there exists a trade-off introduced by the power cut-off threshold and the maximum user transmit power constraint. When the maximum user transmit power becomes a binding constraint, the overall performance is independent of BS densities. In addition, we have shown that it is beneficial for the outage and rate performances by optimizing different network parameters such as the power cut-off threshold as well as the biased factors.展开更多
A novel user association model for heterogeneous network(Het Net) with dual connectivity(DC) and constrained backhaul is proposed in this paper, where not only the best combination of serving macro cell and small cell...A novel user association model for heterogeneous network(Het Net) with dual connectivity(DC) and constrained backhaul is proposed in this paper, where not only the best combination of serving macro cell and small cell for each user to associate is selected but also the optimal traffi c split between the macro cell and small cell is determined to enhance both radio resource effi ciency and backhaul capacity utilization. To solve this optimization problem, an intuitive algorithm based on iteratively solving two sub-problems is proposed. One sub-problem is a binary integer programming problem and a corresponding greedy algorithm is proposed, while the other sub-problem is a simple linear programming problem and can be easily solved. Numerical results show that the proposed model and algorithm can achieve better radio resource effi ciency and backhaul capacity utilization compared with user association in Het Net without DC, which validate the capacity enhancement potentials of radio resource coordination in Het Net with DC.展开更多
In order to meet the exponentially increasing demand on mobile data traffic, self-backhaul ultra-dense networks(UDNs) combined with millimeter wave(mm Wave) communications are expected to provide high spatial multiple...In order to meet the exponentially increasing demand on mobile data traffic, self-backhaul ultra-dense networks(UDNs) combined with millimeter wave(mm Wave) communications are expected to provide high spatial multiplexing gain and wide bandwidths for multi-gigabit peak data rates. In selfbackhaul UDNs, how to make the radio access rates of small cells match their backhaul rates by user association and how to dynamically allocate bandwidth for the access links and backhaul links to balance two-hop link resources are two key problems on improving the overall throughputs. Based on this, a joint scheme of user association and resource allocation is proposed in self-backhaul ultra-dense networks. Because of the combinatorial and nonconvex features of the original optimization problem, it has been divided into two subproblems. Firstly, to make the radio access rates of small base stations match their backhaul rates and maximize sum access rates per Hz of all small cells, a proportional constraint is introduced, and immune optimization algorithm(IOA) is adopted to optimize the association indicator variables and the boresight angles of between users and base stations. Then, the optimal backhaul and access bandwidths are calculated by differentiating the general expression of overall throughput. Simulation results indicatethat the proposed scheme increases the overall throughputs significantly compared to the traditional minimum-distance based association scheme.展开更多
Unmanned aerial vehicles(UAVs)can be employed as aerial base stations(BSs)due to their high mobility and flexible deployment.This paper focuses on a UAV-assisted wireless network,where users can be scheduled to get ac...Unmanned aerial vehicles(UAVs)can be employed as aerial base stations(BSs)due to their high mobility and flexible deployment.This paper focuses on a UAV-assisted wireless network,where users can be scheduled to get access to either an aerial BS or a terrestrial BS for uplink transmission.In contrast to state-of-the-art designs focusing on the instantaneous cost of the network,this paper aims at minimizing the long-term average transmit power consumed by the users by dynamically optimizing user association and power allocation in each time slot.Such a joint user association scheduling and power allocation problem can be formulated as a Markov decision process(MDP).Unfortunately,solving such an MDP problem with the conventional relative value iteration(RVI)can suffer from the curses of dimensionality,in the presence of a large number of users.As a countermeasure,we propose a distributed RVI algorithm to reduce the dimension of the MDP problem,such that the original problem can be decoupled into multiple solvable small-scale MDP problems.Simulation results reveal that the proposed algorithm can yield lower longterm average transmit power consumption than both the conventional RVI algorithm and a baseline algorithm with myopic policies.展开更多
For the mobile edge computing network consisting of multiple base stations and resourceconstrained user devices,network cost in terms of energy and delay will incur during task offloading from the user to the edge ser...For the mobile edge computing network consisting of multiple base stations and resourceconstrained user devices,network cost in terms of energy and delay will incur during task offloading from the user to the edge server.With the limitations imposed on transmission capacity,computing resource,and connection capacity,the per-slot online learning algorithm is first proposed to minimize the time-averaged network cost.In particular,by leveraging the theories of stochastic gradient descent and minimum cost maximum flow,the user association is jointly optimized with resource scheduling in each time slot.The theoretical analysis proves that the proposed approach can achieve asymptotic optimality without any prior knowledge of the network environment.Moreover,to alleviate the high network overhead incurred during user handover and task migration,a two-timescale optimization approach is proposed to avoid frequent changes in user association.With user association executed on a large timescale and the resource scheduling decided on the single time slot,the asymptotic optimality is preserved.Simulation results verify the effectiveness of the proposed online learning algorithms.展开更多
Video streaming,especially hypertext transfer protocol based(HTTP) adaptive streaming(HAS) of video,has been expected to be a dominant application over mobile networks in the near future,which brings huge challenge fo...Video streaming,especially hypertext transfer protocol based(HTTP) adaptive streaming(HAS) of video,has been expected to be a dominant application over mobile networks in the near future,which brings huge challenge for the mobile networks.Although some works have been done for video streaming delivery in heterogeneous cellular networks,most of them focus on the video streaming scheduling or the caching strategy design.The problem of joint user association and rate allocation to maximize the system utility while satisfying the requirement of the quality of experience of users is largely ignored.In this paper,the problem of joint user association and rate allocation for HTTP adaptive streaming in heterogeneous cellular networks is studied,we model the optimization problem as a mixed integer programming problem.And to reduce the computational complexity,an optimal rate allocation using the Lagrangian dual method under the assumption of knowing user association for BSs is first solved.Then we use the many-to-one matching model to analyze the user association problem,and the joint user association and rate allocation based on the distributed greedy matching algorithm is proposed.Finally,extensive simulation results are illustrated to demonstrate the performance of the proposed scheme.展开更多
Although association rule mining is an important pattern recognition and data analysis technique, extracting and finding significant rules from a large collection has always been challenging. The ability of informatio...Although association rule mining is an important pattern recognition and data analysis technique, extracting and finding significant rules from a large collection has always been challenging. The ability of information visualization to enable users to gain an understanding of high dimensional and large-scale data can play a major role in the exploration, identification, and interpretation of association rules. In this paper, we propose a method that provides multiple views of the association rules, linked together through a filtering mechanism. A visual inspection of the entire association rule set is enabled within a matrix view. Items of interest can be selected, resulting in their corresponding association rules being shown in a graph view. At any time, individual rules can be selected in either view, resulting in their information being shown in the detail view. The fundamental premise in this work is that by providing such a visual and interactive representation of the association rules, users will be able to find important rules quickly and easily, even as the number of rules that must be inspected becomes large. A user evaluation was conducted which validates this premise.展开更多
文摘During the 1980s, as part of a policy of liberalization, following budgetary cuts linked to the implementation of structural adjustment programs, management responsibilities for AHAs were transferred from ONAHA to cooperatives concerned. Due to lack of financial resources, but also because of poor management, everywhere in Niger we are witnessing an accelerated deterioration of the irrigation infrastructure of hydro-agricultural developments. Institutional studies carried out on this situation led the State of Niger to initiate a reform of the governance of hydro-agricultural developments, by streng-thening the status of ONAHA, by creating an Association of Irrigation Water Users (AUEI) and by restructuring the old cooperatives. Indeed, this research aims to analyze the creation of functional and sustainable Irrigation Water User Associations (AUEI) in Niger in a context of reform of the irrigation sector, and based on the experience of the Konni AHA. It is based on a methodological approach which takes into account documentary research and the collection of data from 115 farmers, selected by reasoned choice and directly concerned by the management of the irrigated area. The data collected was analyzed and the results were analyzed using the systemic approach and the diagnostic process. The results show that the main mission of the AUEI is to ensure better management of water, hydraulic equipment and infrastructure on the hydro-agricultural developments of Konni. The creation of the Konni AUEI was possible thanks to massive support from the populations and authorities in the implementation process. After its establishment, the AUEI experienced a certain lethargy for some time due to the rehabilitation work of the AHA but currently it is functional and operational in terms of associative life and governance. Thus, the constraints linked to the legal system, the delay in the completion of the work, the uncertainties of access to irrigation water but also the problems linked to the change in mentality of certain ONAHA agents constitute the challenges that must be resolved in the short term for the operationalization of the Konni AUEI.
基金supported by National Natural Science Foundation of China (No. 62201593, 62471480, and 62171466)。
文摘In this paper, we investigate a cooperation mechanism for satellite-terrestrial integrated networks. The terrestrial relays act as the supplement of traditional small cells and cooperatively provide seamless coverage for users in the densely populated areas.To deal with the dynamic satellite backhaul links and backhaul capacity caused by the satellite mobility, severe co-channel interference in both satellite backhaul links and user links introduced by spectrum sharing,and the difference demands of users as well as heterogeneous characteristics of terrestrial backhaul and satellite backhaul, we propose a joint user association and satellite selection scheme to maximize the total sum rate. The optimization problem is formulated via jointly considering the influence of dynamic backhaul links, individual requirements and targeted interference management strategies, which is decomposed into two subproblems: user association and satellite selection. The user association is formulated as a nonconvex optimization problem, and solved through a low-complexity heuristic scheme to find the most suitable access point serving each user. Then, the satellite selection is resolved based on the cooperation among terrestrial relays to maximize the total backhaul capacity with the minimum date rate constraints. Finally,simulation results show the effectiveness of the proposed scheme in terms of total sum rate and power efficiency of TRs' backhaul.
基金The authors extend their appreciation to the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University for funding this work through Research Group No.RG-21-51-01.
文摘The exchange of information is an innate and natural process that assist in content dispersal.Social networking sites emerge to enrich their users by providing the facility for sharing information and social interaction.The extensive adoption of social networking sites also resulted in user content generation.There are diverse research areas explored by the researchers to investigate the influence of social media on users and confirmed that social media sites have a significant impact on markets,politics and social life.Facebook is extensively used platform to share information,thoughts and opinions through posts and comments.The identification of influential users on the social web has grown as hot research field because of vast applications in diverse areas for instance political campaigns marketing,e-commerce,commercial and,etc.Prior research studies either uses linguistic content or graph-based representation of social network for the detection of influential users.In this article,we incorporate association rule mining algorithms to identify the top influential users through frequent patterns.The association rules have been computed using the standard evaluation measures such as support,confidence,lift,and conviction.To verify the results,we also involve conventional metrics for example accuracy,precision,recall and F1-measure according to the association rules perspective.The detailed experiments are carried out using the benchmark College-Msg dataset extracted by Facebook.The obtained results validate the quality and visibility of the proposed approach.The outcome of propose model verify that the association rule mining is able to generate rules to identify the temporal influential users on Facebook who are consistent on regular basis.The preparation of rule set help to create knowledge-based systems which are efficient and widely used in recent era for decision making to solve real-world problems.
基金supported in part by Natural Science Foundation of China(Grant No.62121001,62171344,61931005)in part by Young Elite Scientists Sponsorship Program by CAST+2 种基金in part by Key Industry Innovation Chain of Shaanxi(Grant No.2022ZDLGY0501,2022ZDLGY05-06)in part by Key Research and Development Program of Shannxi(Grant No.2021KWZ-05)in part by The Major Key Project of PCL(PCL2021A15)。
文摘In this paper,we reveal the fundamental limitation of network densification on the performance of caching enabled small cell network(CSCN)under two typical user association rules,namely,contentand distance-based rules.It indicates that immoderately caching content would significantly change the interference distribution in CSCN,which may degrade the network area spectral efficiency(ASE).Meanwhile,it is shown that content-based rule outperforms the distance-based rule in terms of network ASE only when small cell base stations(BSs)are sparsely deployed with low decoding thresholds.Moreover,it is proved that network ASE under distance-based user association serves as the upper bound of that under content-based rule in dense BS regime.To enable more spectrum-efficient user association in dense CSCN,we further optimize network ASE by designing a probabilistic content retrieving strategy based on distance-based rule.With the optimized retrieving probability,network ASE could be substantially enhanced and even increase with the growing BS density in dense BS regime.
基金supported by National Natural Science Foundation of China(No.61971060)Beijing Natural Science Foundation(4222010)。
文摘Cache-enabling unmanned aerial vehicles(UAVs)are considered for storing popular contents and providing downlink data offloading in cellular networks.In this context,we formulate a joint optimization problem of user association,caching placement,and backhaul bandwidth allocation for minimizing content acquisition delay with consideration of UAVs’energy constraint.We decompose the formulated problem into two subproblems:i)user association and caching placement and ii)backhaul bandwidth allocation.We first obtain the optimal bandwidth allocation with given user association and caching placement by the Lagrangian multiplier approach.After that,embedding the backhaul bandwidth allocation algorithm,we solve the user association and caching placement problem by a threedimensional(3D)matching method.Then we decompose it into two two-dimensional(2D)matching problems and develop low-complexity algorithms.The proposed scheme converges and exhibits a low computational complexity.Simulation results demonstrate that the proposed cache-enabling UAV framework outperforms the conventional UAV-assisted cellular networks in terms of content acquisition delay and the proposed scheme achieves significantly lower content acquisition delay compared with other two benchmark schemes.
文摘构建基于无人机基站(Unmanned Aerial Vehicle Base Station, UBS)的空地网络是解决移动通信网络覆盖等问题的重要途径。区别于地面移动通信网络,空地网络需要对UBS位置和用户关联进行联合优化。针对上述问题,首先通过构建二进制无线电地图(Binary Radio Map, BRM)使得UBS能够有效获取整个任务区域中用户位置关联的信道知识,在此基础上提出基于BRM的离线多UBS部署与用户关联联合规划方法。该方法以最大化网络效用函数为目标,通过互嵌套的启发式UBS部署位置搜索和基于匹配博弈的UBS-用户匹配实现UBS位置和用户关联的离线优化。在复杂城市环境下,相比于参考方案,所提方法可使得用户和速率性能提升10%~40%。
基金supported by the National Natural Science Foundation of China (61401225, 61571234)the National Science Foundation of Jiangsu Province (BK20140894, BK20140883, BK20160899)+4 种基金the Six Talented Eminence Foundation of Jiangsu Province (XYDXXJS-044)the National Science Foundation of the Higher Education Institutions of Jiangsu Province (14KJD510007, 16KJB510035)the Jiangsu Planned Projects for Postdoctoral Research Funds (1501125B)China Postdoctoral Science Foundation funded project (2015M581844)the Introduction of Talent Scientific Research Fund of Nanjing University of Posts Telecommunications project (NY213104, NY214190)
文摘A K-tier uplink heterogeneous cellular network is modelled and analysed by accounting for both truncated channel inversion power control and biased user association. Each user has a maximum transmit power constraint and transmits data when it has sufficient transmit power to perform channel inversion. With biased user association, each user is associated with a base station(BS) that provides the maximum received power weighted by a bias factor, but not their nearest BS. Stochastic geometry is used to evaluate the performances of the proposed system model in terms of the outage probability and ergodic rate for each tier as functions of the biased and power control parameters. Simulations validate our analytical derivations. Numerical results show that there exists a trade-off introduced by the power cut-off threshold and the maximum user transmit power constraint. When the maximum user transmit power becomes a binding constraint, the overall performance is independent of BS densities. In addition, we have shown that it is beneficial for the outage and rate performances by optimizing different network parameters such as the power cut-off threshold as well as the biased factors.
基金supported by the National High Technical Research and Development Program of China(863 program)(No.2015AA01A705)
文摘A novel user association model for heterogeneous network(Het Net) with dual connectivity(DC) and constrained backhaul is proposed in this paper, where not only the best combination of serving macro cell and small cell for each user to associate is selected but also the optimal traffi c split between the macro cell and small cell is determined to enhance both radio resource effi ciency and backhaul capacity utilization. To solve this optimization problem, an intuitive algorithm based on iteratively solving two sub-problems is proposed. One sub-problem is a binary integer programming problem and a corresponding greedy algorithm is proposed, while the other sub-problem is a simple linear programming problem and can be easily solved. Numerical results show that the proposed model and algorithm can achieve better radio resource effi ciency and backhaul capacity utilization compared with user association in Het Net without DC, which validate the capacity enhancement potentials of radio resource coordination in Het Net with DC.
基金supported by NSFC under Grant 61471303EU FP7 QUICK project under Grant PIRSES-GA-2013-612652
文摘In order to meet the exponentially increasing demand on mobile data traffic, self-backhaul ultra-dense networks(UDNs) combined with millimeter wave(mm Wave) communications are expected to provide high spatial multiplexing gain and wide bandwidths for multi-gigabit peak data rates. In selfbackhaul UDNs, how to make the radio access rates of small cells match their backhaul rates by user association and how to dynamically allocate bandwidth for the access links and backhaul links to balance two-hop link resources are two key problems on improving the overall throughputs. Based on this, a joint scheme of user association and resource allocation is proposed in self-backhaul ultra-dense networks. Because of the combinatorial and nonconvex features of the original optimization problem, it has been divided into two subproblems. Firstly, to make the radio access rates of small base stations match their backhaul rates and maximize sum access rates per Hz of all small cells, a proportional constraint is introduced, and immune optimization algorithm(IOA) is adopted to optimize the association indicator variables and the boresight angles of between users and base stations. Then, the optimal backhaul and access bandwidths are calculated by differentiating the general expression of overall throughput. Simulation results indicatethat the proposed scheme increases the overall throughputs significantly compared to the traditional minimum-distance based association scheme.
基金This work was supported in part by the National Natural Science Foundation of China under Grant 61901216,61631020 and 61827801the Natural Science Foundation of Jiangsu Province under Grant BK20190400+1 种基金the open research fund of National Mobile Communications Research Laboratory,Southeast University(No.2020D08)the Foundation of Graduate Innovation Center in NUAA under Grant No.KFJJ20190408.
文摘Unmanned aerial vehicles(UAVs)can be employed as aerial base stations(BSs)due to their high mobility and flexible deployment.This paper focuses on a UAV-assisted wireless network,where users can be scheduled to get access to either an aerial BS or a terrestrial BS for uplink transmission.In contrast to state-of-the-art designs focusing on the instantaneous cost of the network,this paper aims at minimizing the long-term average transmit power consumed by the users by dynamically optimizing user association and power allocation in each time slot.Such a joint user association scheduling and power allocation problem can be formulated as a Markov decision process(MDP).Unfortunately,solving such an MDP problem with the conventional relative value iteration(RVI)can suffer from the curses of dimensionality,in the presence of a large number of users.As a countermeasure,we propose a distributed RVI algorithm to reduce the dimension of the MDP problem,such that the original problem can be decoupled into multiple solvable small-scale MDP problems.Simulation results reveal that the proposed algorithm can yield lower longterm average transmit power consumption than both the conventional RVI algorithm and a baseline algorithm with myopic policies.
基金the National Natural Science Foundation of China(61971066,61941114)the Beijing Natural Science Foundation(No.L182038)National Youth Top-notch Talent Support Program.
文摘For the mobile edge computing network consisting of multiple base stations and resourceconstrained user devices,network cost in terms of energy and delay will incur during task offloading from the user to the edge server.With the limitations imposed on transmission capacity,computing resource,and connection capacity,the per-slot online learning algorithm is first proposed to minimize the time-averaged network cost.In particular,by leveraging the theories of stochastic gradient descent and minimum cost maximum flow,the user association is jointly optimized with resource scheduling in each time slot.The theoretical analysis proves that the proposed approach can achieve asymptotic optimality without any prior knowledge of the network environment.Moreover,to alleviate the high network overhead incurred during user handover and task migration,a two-timescale optimization approach is proposed to avoid frequent changes in user association.With user association executed on a large timescale and the resource scheduling decided on the single time slot,the asymptotic optimality is preserved.Simulation results verify the effectiveness of the proposed online learning algorithms.
基金fully supported under the National Natural Science Funds(Project Number:61501042 and 61302089)National High Technology Research and Development Program(863)of China(Project Number:2015AA016101 and 2015AA015702)BUPT Special Program for Youth Scientific Research Innovation(Grant No.2015RC10)
文摘Video streaming,especially hypertext transfer protocol based(HTTP) adaptive streaming(HAS) of video,has been expected to be a dominant application over mobile networks in the near future,which brings huge challenge for the mobile networks.Although some works have been done for video streaming delivery in heterogeneous cellular networks,most of them focus on the video streaming scheduling or the caching strategy design.The problem of joint user association and rate allocation to maximize the system utility while satisfying the requirement of the quality of experience of users is largely ignored.In this paper,the problem of joint user association and rate allocation for HTTP adaptive streaming in heterogeneous cellular networks is studied,we model the optimization problem as a mixed integer programming problem.And to reduce the computational complexity,an optimal rate allocation using the Lagrangian dual method under the assumption of knowing user association for BSs is first solved.Then we use the many-to-one matching model to analyze the user association problem,and the joint user association and rate allocation based on the distributed greedy matching algorithm is proposed.Finally,extensive simulation results are illustrated to demonstrate the performance of the proposed scheme.
文摘Although association rule mining is an important pattern recognition and data analysis technique, extracting and finding significant rules from a large collection has always been challenging. The ability of information visualization to enable users to gain an understanding of high dimensional and large-scale data can play a major role in the exploration, identification, and interpretation of association rules. In this paper, we propose a method that provides multiple views of the association rules, linked together through a filtering mechanism. A visual inspection of the entire association rule set is enabled within a matrix view. Items of interest can be selected, resulting in their corresponding association rules being shown in a graph view. At any time, individual rules can be selected in either view, resulting in their information being shown in the detail view. The fundamental premise in this work is that by providing such a visual and interactive representation of the association rules, users will be able to find important rules quickly and easily, even as the number of rules that must be inspected becomes large. A user evaluation was conducted which validates this premise.
