Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5207967
K. Pentikousis, C. Meirosu, A. Miron, M. Brunner
Network management has been traditionally considered in the last stages of the design and development cycles of network technology. The typical modus operandi relies mostly on networkers that manually configure active elements, troubleshoot problems as they arise and reconfigure equipment accordingly. In fact, we note that several initiatives in the Future Internet research area do not take proactive steps towards developing self-managing network architec- tures. This position paper presents the first steps taken towards adopting self-management from the initial design stages of NetInf, an information-centric, clean-slate architecture for the Future Internet, proposed by the 4WARD project. We introduce a preliminary set of guidelines on how to apply in-network management principles to Ne- tInf. Through scenarios, we examine the advantages of tightly inte- grating self-management functionality and network awareness with actual service delivery in NetInf.
{"title":"Self-Management for a Network of Information","authors":"K. Pentikousis, C. Meirosu, A. Miron, M. Brunner","doi":"10.1109/ICCW.2009.5207967","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207967","url":null,"abstract":"Network management has been traditionally considered in the last stages of the design and development cycles of network technology. The typical modus operandi relies mostly on networkers that manually configure active elements, troubleshoot problems as they arise and reconfigure equipment accordingly. In fact, we note that several initiatives in the Future Internet research area do not take proactive steps towards developing self-managing network architec- tures. This position paper presents the first steps taken towards adopting self-management from the initial design stages of NetInf, an information-centric, clean-slate architecture for the Future Internet, proposed by the 4WARD project. We introduce a preliminary set of guidelines on how to apply in-network management principles to Ne- tInf. Through scenarios, we examine the advantages of tightly inte- grating self-management functionality and network awareness with actual service delivery in NetInf.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114509392","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208017
F. Ghannouchi, M. Ebrahimi, M. Helaoui
This work proposes the steps to design a high efficiency inverse class F power amplifier (PA). In the first step, the optimal termination conditions for the inverse class F are extracted through load-pull measurement. Afterward, low loss and precisely tunable output matching network was chosen in order to obtain high efficiency of the PA. The fabrication of an inverse class F power amplifier for WiMAX applications at a carrier frequency equal to 2.45 GHz following the described design procedure is carried out and the obtained results demonstrate a measured power added efficiency equal to 71.5% and drain efficiency equal to 74%.
{"title":"Inverse Class F Power Amplifier for WiMAX Applications with 74% Efficiency at 2.45 GHz","authors":"F. Ghannouchi, M. Ebrahimi, M. Helaoui","doi":"10.1109/ICCW.2009.5208017","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208017","url":null,"abstract":"This work proposes the steps to design a high efficiency inverse class F power amplifier (PA). In the first step, the optimal termination conditions for the inverse class F are extracted through load-pull measurement. Afterward, low loss and precisely tunable output matching network was chosen in order to obtain high efficiency of the PA. The fabrication of an inverse class F power amplifier for WiMAX applications at a carrier frequency equal to 2.45 GHz following the described design procedure is carried out and the obtained results demonstrate a measured power added efficiency equal to 71.5% and drain efficiency equal to 74%.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128526258","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208034
L. Morales-Tirado, J. E. Suris-Pietri, J. Reed
Third generation (3G) wireless networks have been well studied and optimized with traditional radio resource management techniques, but still there is room for improvement. Cognitive radio (CR) technology can bring significant network improvements by providing awareness to the surrounding radio environment, exploiting previous network knowledge and optimizing the use of radio resources using machine learning and artificial intelligence techniques. Cognitive radio can also co-exist with legacy equipment thus acting as a bridge among heterogenous communication systems. In this paper, we present a hybrid cognitive radio engine for 3G wireless networks. The engine is designed using case-based reasoning (CBR) and decision tree (DT) searches, as the main blocks to the engine's reasoning, learning and optimization functions. The engine model was implemented and tested via simulation, it was applied to improve coverage in the network.
{"title":"A Hybrid Cognitive Engine for Improving Coverage in 3G Wireless Networks","authors":"L. Morales-Tirado, J. E. Suris-Pietri, J. Reed","doi":"10.1109/ICCW.2009.5208034","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208034","url":null,"abstract":"Third generation (3G) wireless networks have been well studied and optimized with traditional radio resource management techniques, but still there is room for improvement. Cognitive radio (CR) technology can bring significant network improvements by providing awareness to the surrounding radio environment, exploiting previous network knowledge and optimizing the use of radio resources using machine learning and artificial intelligence techniques. Cognitive radio can also co-exist with legacy equipment thus acting as a bridge among heterogenous communication systems. In this paper, we present a hybrid cognitive radio engine for 3G wireless networks. The engine is designed using case-based reasoning (CBR) and decision tree (DT) searches, as the main blocks to the engine's reasoning, learning and optimization functions. The engine model was implemented and tested via simulation, it was applied to improve coverage in the network.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128654501","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208018
R. Tresch, M. Guillaud
Interference alignment is evaluated as a technique to mitigate inter-cell interference in the downlink of a cellular network using OFDMA. The sum mutual information achieved by interference alignment together with a zero-forcing receiver is considered, and upper and lower bounds are derived for the case of imperfect channel knowledge. The sum mutual information achieved by interference alignment when the base stations share their information about the channels is shown to compare favorably to the achievable sum-rate of methods where the base stations do not cooperate, even under moderately accurate knowledge of the channel state.
{"title":"Cellular Interference Alignment with Imperfect Channel Knowledge","authors":"R. Tresch, M. Guillaud","doi":"10.1109/ICCW.2009.5208018","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208018","url":null,"abstract":"Interference alignment is evaluated as a technique to mitigate inter-cell interference in the downlink of a cellular network using OFDMA. The sum mutual information achieved by interference alignment together with a zero-forcing receiver is considered, and upper and lower bounds are derived for the case of imperfect channel knowledge. The sum mutual information achieved by interference alignment when the base stations share their information about the channels is shown to compare favorably to the achievable sum-rate of methods where the base stations do not cooperate, even under moderately accurate knowledge of the channel state.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129186987","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207981
R. Rembarz, D. Catrein, J. Sachs
The networking research community has recently started looking into so-called information-centric networks, which regard information objects as the primary elements in the network. Users store and retrieve the information objects, denoted by object identifi- ers, from the network without knowing or bothering which host serves the actual request, comparable to earlier initiatives in networking that separate node identifiers from network locations. The capability to address content directly takes many optimizations, such as content- optimized routing or transparent caching, to the next level, while at the same time enabling novel services. In order to prevent unautho- rized access to the information objects that roam around freely in the global network, objects shall be encrypted. We argue that for some use cases, e.g. when dealing with sensitive company-internal information, a stricter partitioning of the network is required. We propose and discuss two solutions to this problem, one focusing on securing the name resolution procedure, the other concentrating on the actual re- trieval. Both mechanisms complement existing proposals by separating information objects in the private network domain while maintaining global reachability.
{"title":"Private Domains in Networks of Information","authors":"R. Rembarz, D. Catrein, J. Sachs","doi":"10.1109/ICCW.2009.5207981","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207981","url":null,"abstract":"The networking research community has recently started looking into so-called information-centric networks, which regard information objects as the primary elements in the network. Users store and retrieve the information objects, denoted by object identifi- ers, from the network without knowing or bothering which host serves the actual request, comparable to earlier initiatives in networking that separate node identifiers from network locations. The capability to address content directly takes many optimizations, such as content- optimized routing or transparent caching, to the next level, while at the same time enabling novel services. In order to prevent unautho- rized access to the information objects that roam around freely in the global network, objects shall be encrypted. We argue that for some use cases, e.g. when dealing with sensitive company-internal information, a stricter partitioning of the network is required. We propose and discuss two solutions to this problem, one focusing on securing the name resolution procedure, the other concentrating on the actual re- trieval. Both mechanisms complement existing proposals by separating information objects in the private network domain while maintaining global reachability.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114716697","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208053
V. Stavroulaki, Y. Kritikou, E. Darra
One of the key features of emerging and future wireless systems is the continuous increase in the number and diversity of available radio access technologies. A great number of research efforts in the past decade have focused on ways to more efficiently exploit the various wireless access technologies. Among the recent trends in this direction are cognitive wireless networks and systems, targeting to tackle the complexity of the diversified radio environment. Eventually, the goal of these evolving systems is to provide personalised services to users at any time, at any place. Clearly in order to really improve the experience of all users, even technology agnostic ones, functionality is required, on both the network and the user-device side, for providing the "always best connection" in a transparent manner. This paper focuses on mechanisms for acquiring and learning information on user preferences, requirements and constraints as part of a cognitive device management system that enables optimal device configuration taking into account in addition to user requirements, environment characteristics and experience established through learning mechanisms. In this context, the paper presents a scheme for learning and estimating user preferences based on Bayesian networks.
{"title":"Acquiring and Learning User Information in the Context of Cognitive Device Management","authors":"V. Stavroulaki, Y. Kritikou, E. Darra","doi":"10.1109/ICCW.2009.5208053","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208053","url":null,"abstract":"One of the key features of emerging and future wireless systems is the continuous increase in the number and diversity of available radio access technologies. A great number of research efforts in the past decade have focused on ways to more efficiently exploit the various wireless access technologies. Among the recent trends in this direction are cognitive wireless networks and systems, targeting to tackle the complexity of the diversified radio environment. Eventually, the goal of these evolving systems is to provide personalised services to users at any time, at any place. Clearly in order to really improve the experience of all users, even technology agnostic ones, functionality is required, on both the network and the user-device side, for providing the \"always best connection\" in a transparent manner. This paper focuses on mechanisms for acquiring and learning information on user preferences, requirements and constraints as part of a cognitive device management system that enables optimal device configuration taking into account in addition to user requirements, environment characteristics and experience established through learning mechanisms. In this context, the paper presents a scheme for learning and estimating user preferences based on Bayesian networks.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487856","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208002
O. Teyeb, V. Phan, B. Raaf, S. Redana
Relaying is one of the proposed technologies for future releases of UTRAN long term evolution (LTE) networks. Introducing relaying is expected to increase the coverage and capacity of LTE networks. In order to enable relaying, the architecture, protocol and radio resource management procedures of LTE, such as handover, have to be modified. A user can be handed over not only between two base stations, but also between relays and base stations, and between two relays. With the introduction of relaying, there is a need for a new procedure to hand over a relay and all its associated users to another base station, allowing a flexible and dynamic relay deployment. In this paper, we extend the LTE release 8 handover mechanisms so that it can accommodate these new handover functionalities in a flexible manner.
{"title":"Handover Framework for Relay Enhanced LTE Networks","authors":"O. Teyeb, V. Phan, B. Raaf, S. Redana","doi":"10.1109/ICCW.2009.5208002","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208002","url":null,"abstract":"Relaying is one of the proposed technologies for future releases of UTRAN long term evolution (LTE) networks. Introducing relaying is expected to increase the coverage and capacity of LTE networks. In order to enable relaying, the architecture, protocol and radio resource management procedures of LTE, such as handover, have to be modified. A user can be handed over not only between two base stations, but also between relays and base stations, and between two relays. With the introduction of relaying, there is a need for a new procedure to hand over a relay and all its associated users to another base station, allowing a flexible and dynamic relay deployment. In this paper, we extend the LTE release 8 handover mechanisms so that it can accommodate these new handover functionalities in a flexible manner.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122013573","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207993
J. Rodas, C. Escudero
Wireless sensor networks are a promising solution for indoor location systems. However, many of these systems rely on algorithms that use parametric models of channel propagation where the parameters can be time variant. This paper introduces a new technique based on a Bayesian filtering method that estimates network node positions at the same time that propagation model parameters are extracted. Experimental results show the location estimation improvement of the proposed technique.
{"title":"Joint Estimation of Position and Channel Propagation Model Parameters in a Bluetooth Network","authors":"J. Rodas, C. Escudero","doi":"10.1109/ICCW.2009.5207993","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207993","url":null,"abstract":"Wireless sensor networks are a promising solution for indoor location systems. However, many of these systems rely on algorithms that use parametric models of channel propagation where the parameters can be time variant. This paper introduces a new technique based on a Bayesian filtering method that estimates network node positions at the same time that propagation model parameters are extracted. Experimental results show the location estimation improvement of the proposed technique.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134572801","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207970
R. Aguiar, H. Einsiedler, J. I. Moreno, S. Gutknecht, T. Dørflinger
This paper refers to the problem of defining a proper requirements structure able to reflect the complexities to be expected in the Future Internet. The approach relies on the requirements addressed by end-users (customers of network service providers/consumers of network services), operators, and on the structuring of the networks that can be seen on industry fora. It reveals a complex set of intertwined requirements, a matrix structure with simple functional blocks and layered structures augmented by an inter-operator dimension.
{"title":"A Requirements Analysis for the Protocol Stack of the Future Internet","authors":"R. Aguiar, H. Einsiedler, J. I. Moreno, S. Gutknecht, T. Dørflinger","doi":"10.1109/ICCW.2009.5207970","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207970","url":null,"abstract":"This paper refers to the problem of defining a proper requirements structure able to reflect the complexities to be expected in the Future Internet. The approach relies on the requirements addressed by end-users (customers of network service providers/consumers of network services), operators, and on the structuring of the networks that can be seen on industry fora. It reveals a complex set of intertwined requirements, a matrix structure with simple functional blocks and layered structures augmented by an inter-operator dimension.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132613774","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208108
R. Schoenen, A. Otyakmaz, Z. Xu
Cellular radio systems of the next generation aim to make the most out of the available radio resources in the dimensions bandwidth, time and space. The division of time into slots, frames and superframes is standard, both for TDD and FDD duplex modes. OFDMA allows the individual disposition of subchannels as a subdivision of the bandwidth but an aggregation of subcarriers. A basic resource unit is hence a brick in this two-dimensional grid. Space is important both as the location of the base station in whose surrounding the resources are used and in spatial diversity channels. These resources are the scarce good in future radio communications, because they are required proportionally to the traffic demand per area. Due to adaptive modulation and coding schemes and large ranges of possible SINR values, the required resources for a transmission may differ by a factor ten depending on the distances. In this paper we discuss the resource allocation and scheduling mission. We introduce a control system view on the topic, taking adaptive algorithms for modulation, power, subchannel usage and channel quality indication into account.
{"title":"Resource Allocation and Scheduling in FDD Multihop Cellular Systems","authors":"R. Schoenen, A. Otyakmaz, Z. Xu","doi":"10.1109/ICCW.2009.5208108","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208108","url":null,"abstract":"Cellular radio systems of the next generation aim to make the most out of the available radio resources in the dimensions bandwidth, time and space. The division of time into slots, frames and superframes is standard, both for TDD and FDD duplex modes. OFDMA allows the individual disposition of subchannels as a subdivision of the bandwidth but an aggregation of subcarriers. A basic resource unit is hence a brick in this two-dimensional grid. Space is important both as the location of the base station in whose surrounding the resources are used and in spatial diversity channels. These resources are the scarce good in future radio communications, because they are required proportionally to the traffic demand per area. Due to adaptive modulation and coding schemes and large ranges of possible SINR values, the required resources for a transmission may differ by a factor ten depending on the distances. In this paper we discuss the resource allocation and scheduling mission. We introduce a control system view on the topic, taking adaptive algorithms for modulation, power, subchannel usage and channel quality indication into account.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133706953","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
扫码关注我们
求助内容：
应助结果提醒方式：