Pub Date : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700464
Dawei Sun, B. Zheng, Jingwu Cui, Sulan Tang
Future cognitive radio broadband wireless networks are expected to support a variety of communication services with diverse quality-of-service (QoS) requirements. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive and need guaranteed throughput. On the other hand, applications like file transfer and email services are relatively delay tolerant so variable-rate transmission is acceptable. This paper is different from most existing work on adaptive resource allocation. In this paper, we investigate the resource allocation problem in a heterogeneous cognitive multi-user OFDM system with both delay-sensitive (DS) and delay-tolerant (DT) services. To cope with this heterogeneous problem we combine the rate adaptive (RA) and margin adaptive (MA) principle. The purpose is to maximize the total rate of all DT services while maintaining guaranteed throughput of DS services under the constraint of primary user in cognitive radio network (CRN). For DS users a low complexity bit allocation algorithm based on geometric progression is proposed and for DT users a linear water-filling algorithm is used. Numerical results are executed to evaluate the performance of the proposed algorithms in terms of service outage probability, achievable transmission rate for DT users.
{"title":"A research of resource allocation algorithm in multi-media heterogeneous cognitive OFDM system","authors":"Dawei Sun, B. Zheng, Jingwu Cui, Sulan Tang","doi":"10.1109/GLOCOMW.2010.5700464","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700464","url":null,"abstract":"Future cognitive radio broadband wireless networks are expected to support a variety of communication services with diverse quality-of-service (QoS) requirements. Multimedia applications such as broadband voice transmission and real-time video streaming are very delay-sensitive and need guaranteed throughput. On the other hand, applications like file transfer and email services are relatively delay tolerant so variable-rate transmission is acceptable. This paper is different from most existing work on adaptive resource allocation. In this paper, we investigate the resource allocation problem in a heterogeneous cognitive multi-user OFDM system with both delay-sensitive (DS) and delay-tolerant (DT) services. To cope with this heterogeneous problem we combine the rate adaptive (RA) and margin adaptive (MA) principle. The purpose is to maximize the total rate of all DT services while maintaining guaranteed throughput of DS services under the constraint of primary user in cognitive radio network (CRN). For DS users a low complexity bit allocation algorithm based on geometric progression is proposed and for DT users a linear water-filling algorithm is used. Numerical results are executed to evaluate the performance of the proposed algorithms in terms of service outage probability, achievable transmission rate for DT users.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124142862","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700099
H. Le‐Minh, Zabih Ghassemlooy, M. Ijaz, S. Rajbhandari, O. Adebanjo, S. Ansari, E. Leitgeb
The paper reports experimental results for the performance of a free space optical (FSO) communication link employing different modulation schemes under the influence of the atmospheric scintillation. A dedicated experimental atmospheric simulation chamber has been developed where weak and medium turbulence can be generated and its effect on the FSO link is investigated. The experimental data obtained is compared to the theoretical prediction. The paper also depicts the effect on the data transmission performance depending on the position of the turbulence source within the chamber.
{"title":"Experimental study of bit error rate of free space optics communications in laboratory controlled turbulence","authors":"H. Le‐Minh, Zabih Ghassemlooy, M. Ijaz, S. Rajbhandari, O. Adebanjo, S. Ansari, E. Leitgeb","doi":"10.1109/GLOCOMW.2010.5700099","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700099","url":null,"abstract":"The paper reports experimental results for the performance of a free space optical (FSO) communication link employing different modulation schemes under the influence of the atmospheric scintillation. A dedicated experimental atmospheric simulation chamber has been developed where weak and medium turbulence can be generated and its effect on the FSO link is investigated. The experimental data obtained is compared to the theoretical prediction. The paper also depicts the effect on the data transmission performance depending on the position of the turbulence source within the chamber.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128553487","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700178
Konstantinos Samdanis, D. Kutscher, M. Brunner
Energy saving management aims to match the capacity offered by operators to the actual traffic demand at off-peak times when the network load under-utilizes the maximum capacity dimension. Such a process is relatively complex in cellular infrastructures since mobility and user activity patterns may create load fluctuations. This paper introduces energy-aware network re-configuration methods to flexibly re-act to load variations encouraging none or minimal extra energy consumption. A simulation-based study evaluates the performance of the proposed schemes considering the network service quality and energy cost.
{"title":"Dynamic energy-aware network re-configuration for cellular urban infrastructures","authors":"Konstantinos Samdanis, D. Kutscher, M. Brunner","doi":"10.1109/GLOCOMW.2010.5700178","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700178","url":null,"abstract":"Energy saving management aims to match the capacity offered by operators to the actual traffic demand at off-peak times when the network load under-utilizes the maximum capacity dimension. Such a process is relatively complex in cellular infrastructures since mobility and user activity patterns may create load fluctuations. This paper introduces energy-aware network re-configuration methods to flexibly re-act to load variations encouraging none or minimal extra energy consumption. A simulation-based study evaluates the performance of the proposed schemes considering the network service quality and energy cost.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128638821","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700339
T. Miyazawa, H. Furukawa, K. Fujikawa, N. Wada, H. Harai
We are developing an integrated optical packet- and circuit-switched network. In this paper, we feature our own control system of the network and experimentally evaluate its performances. In our experimental setup, both best-effort data and control signals are transferred on colored (i.e. multi-wavelength) optical packet-switched links. We successfully transmit high-definition uncompressed real-time video signals on two lightpaths established by our control system without degradation of video quality, while other packet data are transferred in the same optical fibers. The developed system also has a function of adaptive resource change of packet switching and circuit switching. Time distances for resource change and lightpath setup are negligible, and therefore users do not feel stress for path establishment as the following results prove. Controller PCs can achieve lightpath establishment and automatic resource-allocation within approximately 500ms and 830ms, respectively, at the best possible case in our experimental setup.
{"title":"Experimental performance evaluation of control mechanisms for integrated optical packet- and circuit-switched networks","authors":"T. Miyazawa, H. Furukawa, K. Fujikawa, N. Wada, H. Harai","doi":"10.1109/GLOCOMW.2010.5700339","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700339","url":null,"abstract":"We are developing an integrated optical packet- and circuit-switched network. In this paper, we feature our own control system of the network and experimentally evaluate its performances. In our experimental setup, both best-effort data and control signals are transferred on colored (i.e. multi-wavelength) optical packet-switched links. We successfully transmit high-definition uncompressed real-time video signals on two lightpaths established by our control system without degradation of video quality, while other packet data are transferred in the same optical fibers. The developed system also has a function of adaptive resource change of packet switching and circuit switching. Time distances for resource change and lightpath setup are negligible, and therefore users do not feel stress for path establishment as the following results prove. Controller PCs can achieve lightpath establishment and automatic resource-allocation within approximately 500ms and 830ms, respectively, at the best possible case in our experimental setup.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128943609","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700327
Andreas Wundsam, Amir Mehmood, A. Feldmann, O. Maennel
Today diagnosing problems, deploying new services, testing protocol interactions, or validating network configurations are still largely unsolved problems for both enterprise and Internet Service Provider (ISP) networks. Due to the intrinsically distributed nature of network state, frequent timing dependencies, and sources of non-determinism involved, any change may introduce undesired effects-even the impact of a simple configuration change can be hard to predict. In this paper we show how to leverage network virtualization to improve our debugging ability: By replicating and cloning production networks and then applying the changes to the cloned network in a safe fashion. Mirror VNets thus enable troubleshooting as well as safe upgrades to both software and configuration.
{"title":"Network troubleshooting with Mirror VNets","authors":"Andreas Wundsam, Amir Mehmood, A. Feldmann, O. Maennel","doi":"10.1109/GLOCOMW.2010.5700327","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700327","url":null,"abstract":"Today diagnosing problems, deploying new services, testing protocol interactions, or validating network configurations are still largely unsolved problems for both enterprise and Internet Service Provider (ISP) networks. Due to the intrinsically distributed nature of network state, frequent timing dependencies, and sources of non-determinism involved, any change may introduce undesired effects-even the impact of a simple configuration change can be hard to predict. In this paper we show how to leverage network virtualization to improve our debugging ability: By replicating and cloning production networks and then applying the changes to the cloned network in a safe fashion. Mirror VNets thus enable troubleshooting as well as safe upgrades to both software and configuration.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130773296","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700297
M. Corici, J. Fiedler, A. Onofrei, D. Vingarzan
With the deployment of new wireless access technologies, like LTE or WiMAX which complement the existing accesses such as UMTS or WiFi, the mobile devices are able to establish services having different requirements for network capabilities. However, the services deployed are lacking an efficient mechanism of adaptation to the momentary connectivity conditions which deters the dynamic service delivery according to the momentary preferences of the user's applications. This paper introduces a new mechanism for the adaptation of the services to the momentary network conditions which includes as part of the vertical handover procedures a resource reservation decision according to the preferences of the mobile device and the capabilities of adapatation of the application as advertised during service establishment, enabling a more dynamic service delivery without requiring resource re-reservation procedures. Furthermore, the novel concept is exemplified on the 3GPP Evolved Packet Core and evaluated using the Fraunhofer OpenEPC toolkit implementation.
{"title":"Enabling dynamic service delivery in the 3GPP Evolved Packet Core","authors":"M. Corici, J. Fiedler, A. Onofrei, D. Vingarzan","doi":"10.1109/GLOCOMW.2010.5700297","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700297","url":null,"abstract":"With the deployment of new wireless access technologies, like LTE or WiMAX which complement the existing accesses such as UMTS or WiFi, the mobile devices are able to establish services having different requirements for network capabilities. However, the services deployed are lacking an efficient mechanism of adaptation to the momentary connectivity conditions which deters the dynamic service delivery according to the momentary preferences of the user's applications. This paper introduces a new mechanism for the adaptation of the services to the momentary network conditions which includes as part of the vertical handover procedures a resource reservation decision according to the preferences of the mobile device and the capabilities of adapatation of the application as advertised during service establishment, enabling a more dynamic service delivery without requiring resource re-reservation procedures. Furthermore, the novel concept is exemplified on the 3GPP Evolved Packet Core and evaluated using the Fraunhofer OpenEPC toolkit implementation.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130037532","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700172
Aruna Prem Bianzino, Claude Chaudet, Federico Larroca, D. Rossi, J. Rougier
In this work, we analyze the design of green routing algorithms and evaluate the achievable energy savings that such mechanisms could allow in several realistic network scenarios. We formulate the problem as a minimum energy routing optimization, which we numerically solve considering a core-network scenario, which can be seen as a worst-case for energy saving performance (as nodes cannot be switched off). To gather full-relief results, we analyze the energy savings in various conditions (i.e., network topology and traffic matrix) and under different technology assumptions (i.e., the energy profile of the network devices). These results give us insight into the potential benefits of different “green” technologies and their interactions. In particular, we show that depending on the topology and traffic matrices, the optimal energy savings can be modest, partly limiting the interest for green routing approaches for some scenarios. At the same time, we also show that the common belief that there is a trade off between green network optimization and performance does not necessarily hold: in the considered environment, green routing has no effect on the main network performances such as maximum link utilization.
{"title":"Energy-aware routing: A reality check","authors":"Aruna Prem Bianzino, Claude Chaudet, Federico Larroca, D. Rossi, J. Rougier","doi":"10.1109/GLOCOMW.2010.5700172","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700172","url":null,"abstract":"In this work, we analyze the design of green routing algorithms and evaluate the achievable energy savings that such mechanisms could allow in several realistic network scenarios. We formulate the problem as a minimum energy routing optimization, which we numerically solve considering a core-network scenario, which can be seen as a worst-case for energy saving performance (as nodes cannot be switched off). To gather full-relief results, we analyze the energy savings in various conditions (i.e., network topology and traffic matrix) and under different technology assumptions (i.e., the energy profile of the network devices). These results give us insight into the potential benefits of different “green” technologies and their interactions. In particular, we show that depending on the topology and traffic matrices, the optimal energy savings can be modest, partly limiting the interest for green routing approaches for some scenarios. At the same time, we also show that the common belief that there is a trade off between green network optimization and performance does not necessarily hold: in the considered environment, green routing has no effect on the main network performances such as maximum link utilization.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130026635","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700307
Xinyu Jin, Pasd Putthapipat, Deng Pan, N. Pissinou, S. Makki
Recent advancements in micro-computing have provided an exponential increase in the capabilities of a wide range of devices and have allowed the implementation of complex mobile wireless sensor networks (mWSNs). Common battery-powered sensor nodes require security techniques that eliminate redundant processing overhead for resource conservation, without compromising the overall network performance. To address this issue, this paper presents USAS: Unpredictable Software-based Attestation Solution, a node compromise detection algorithm in mWSNs. USAS deploys dynamic node attestation chains to decrease checksum computation time by almost 48% for selective attested nodes. By decentralizing the network, the attestation is unpredictable, preventing malicious data injection. The performance of USAS is estimated in terms of node compromise detection rate.
{"title":"Unpredictable Software-based Attestation Solution for node compromise detection in mobile WSN","authors":"Xinyu Jin, Pasd Putthapipat, Deng Pan, N. Pissinou, S. Makki","doi":"10.1109/GLOCOMW.2010.5700307","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700307","url":null,"abstract":"Recent advancements in micro-computing have provided an exponential increase in the capabilities of a wide range of devices and have allowed the implementation of complex mobile wireless sensor networks (mWSNs). Common battery-powered sensor nodes require security techniques that eliminate redundant processing overhead for resource conservation, without compromising the overall network performance. To address this issue, this paper presents USAS: Unpredictable Software-based Attestation Solution, a node compromise detection algorithm in mWSNs. USAS deploys dynamic node attestation chains to decrease checksum computation time by almost 48% for selective attested nodes. By decentralizing the network, the attestation is unpredictable, preventing malicious data injection. The performance of USAS is estimated in terms of node compromise detection rate.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127779557","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700420
H. Şenol, E. Panayirci, H. Poor
This paper is concerned with the challenging and timely problem of channel estimation for orthogonal frequency division multiplexing (OFDM) systems in the presence of frequency selective and very rapidly time varying channels. In OFDM systems operating over rapidly time-varying channels, the orthogonality between subcarriers is destroyed leading to inter-carrier interference (ICI) and resulting in an irreducible error floor. The band-limited, discrete cosine serial expansion of low-dimensionality is employed to represent the time-varying channel. In this way, the resulting reduced dimensional channel coefficients are estimated iteratively with tractable complexity and independently of the channel statistics. The algorithm is based on the expectation maximization-maximum a posteriori probability (EM-MAP) technique leading to a receiver structure that also yields the equalized output using the channel estimates. The pilot symbols are employed to estimate the initial coefficients effectively and unknown data symbols are averaged out in the algorithm in a non-data-aided fashion. It is shown that the computational complexity of the proposed algorithm to estimate the channel coefficients and to generate the equalized output as a by-product is ≃ O(N) per detected symbol, N being the number of OFDM subcarriers. Computational complexity as well as computer simulations carried out for the systems described in WiMAX and LTE standards indicate that it has significant performance and complexity advantages over existing suboptimal channel estimation and equalization algorithms proposed earlier in the literature.
{"title":"Joint channel estimation and equalization for OFDM based broadband communications in rapidly varying mobile channels","authors":"H. Şenol, E. Panayirci, H. Poor","doi":"10.1109/GLOCOMW.2010.5700420","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700420","url":null,"abstract":"This paper is concerned with the challenging and timely problem of channel estimation for orthogonal frequency division multiplexing (OFDM) systems in the presence of frequency selective and very rapidly time varying channels. In OFDM systems operating over rapidly time-varying channels, the orthogonality between subcarriers is destroyed leading to inter-carrier interference (ICI) and resulting in an irreducible error floor. The band-limited, discrete cosine serial expansion of low-dimensionality is employed to represent the time-varying channel. In this way, the resulting reduced dimensional channel coefficients are estimated iteratively with tractable complexity and independently of the channel statistics. The algorithm is based on the expectation maximization-maximum a posteriori probability (EM-MAP) technique leading to a receiver structure that also yields the equalized output using the channel estimates. The pilot symbols are employed to estimate the initial coefficients effectively and unknown data symbols are averaged out in the algorithm in a non-data-aided fashion. It is shown that the computational complexity of the proposed algorithm to estimate the channel coefficients and to generate the equalized output as a by-product is ≃ O(N) per detected symbol, N being the number of OFDM subcarriers. Computational complexity as well as computer simulations carried out for the systems described in WiMAX and LTE standards indicate that it has significant performance and complexity advantages over existing suboptimal channel estimation and equalization algorithms proposed earlier in the literature.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125526543","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700113
D. Charilas, Polychronis Mathioudakis, A. Panagopoulos, P. Constantinou
Next generation wireless systems represent an heterogeneous environment encompassing different radio access network technologies (RATs) that differ in bandwidth, latency or cost. At the same time, mobile devices can now support multiple radio network interfaces and are therefore able to select from various available multiple heterogeneous access networks the most appropriate one in order to satisfy specific application requirements, according to the “Always Best Connected and Served” model. To support this model, the paper builds on the concept of federation agreements that allow for the collaboration of multiple service providers and exposes a series of churning scenarios in heterogeneous environments, incorporating also financial incentives for both customers and service providers. The paper formulates the relevant scenarios as non-cooperative games in order to perform admission and load control and then through simulation assesses their outcomes, to be expressed in terms of Quality of Service (QoS), income or cost.
{"title":"Federation agreements performance in heterogeneous environments: Non-cooperative games approach","authors":"D. Charilas, Polychronis Mathioudakis, A. Panagopoulos, P. Constantinou","doi":"10.1109/GLOCOMW.2010.5700113","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700113","url":null,"abstract":"Next generation wireless systems represent an heterogeneous environment encompassing different radio access network technologies (RATs) that differ in bandwidth, latency or cost. At the same time, mobile devices can now support multiple radio network interfaces and are therefore able to select from various available multiple heterogeneous access networks the most appropriate one in order to satisfy specific application requirements, according to the “Always Best Connected and Served” model. To support this model, the paper builds on the concept of federation agreements that allow for the collaboration of multiple service providers and exposes a series of churning scenarios in heterogeneous environments, incorporating also financial incentives for both customers and service providers. The paper formulates the relevant scenarios as non-cooperative games in order to perform admission and load control and then through simulation assesses their outcomes, to be expressed in terms of Quality of Service (QoS), income or cost.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128130553","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
扫码关注我们
求助内容：
应助结果提醒方式：