Pub Date : 2012-06-18DOI: 10.4108/ICST.CROWNCOM.2012.248344
E. Stathakis, M. Skoglund, L. Rasmussen
We consider a pair of secondary nodes (SU) coupled, in Z-topology, with multiple pairs of primary nodes (PU). The secondary (cognitive) transmitter is combining beamforming with orthogonal space-time block coding (BOSTBC) and operates under Quality-of-Service (QoS) constraints that must be guaranteed for the primary receivers (PURx). The cognitive link is designed assuming imperfect channel state information (CSI) for all links, available at the SU transmitter (SUTx). Under this premise we characterize the optimal design in terms of CSI quality and interference and evaluate their impact on the performance of BOSTBC transmission in underlay cognitive networks.
{"title":"On combined beamforming and OSTBC over the cognitive radio Z-channel with partial CSI","authors":"E. Stathakis, M. Skoglund, L. Rasmussen","doi":"10.4108/ICST.CROWNCOM.2012.248344","DOIUrl":"https://doi.org/10.4108/ICST.CROWNCOM.2012.248344","url":null,"abstract":"We consider a pair of secondary nodes (SU) coupled, in Z-topology, with multiple pairs of primary nodes (PU). The secondary (cognitive) transmitter is combining beamforming with orthogonal space-time block coding (BOSTBC) and operates under Quality-of-Service (QoS) constraints that must be guaranteed for the primary receivers (PURx). The cognitive link is designed assuming imperfect channel state information (CSI) for all links, available at the SU transmitter (SUTx). Under this premise we characterize the optimal design in terms of CSI quality and interference and evaluate their impact on the performance of BOSTBC transmission in underlay cognitive networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125085288","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364068
Diep N. Nguyen, M. Krunz
We consider the problem of minimizing network's transmit power for given transmission rate demands of all links in a multi-input multi-output (MIMO) ad hoc network. The problem is nonconvex, hence, challenging to be solved, even in a centralized manner. To derive a distributed solution, we reformulate the problem as a noncooperative game. We then propose a network interference function (NIF) that captures the total interference incurred at unintended receivers by all transmitters. The proposed NIF sets the light for designing transmitter-dependent pricing policies for the above game. A price-based iterative water-filling algorithm (PIWF) is proposed to find MIMO precoding matrices, which determines both beam directions and transmission power allocation among antennas (or data streams) at each transmitter. Simulations show that PIWF is more power-efficient than all existing MIMO precoding methods. Additionally, NIF under PIWF is also the least. Simulations also show the fast convergence of PIWF.
{"title":"Power-efficient spatial multiplexing for multiantenna MANETs","authors":"Diep N. Nguyen, M. Krunz","doi":"10.1109/ICC.2012.6364068","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364068","url":null,"abstract":"We consider the problem of minimizing network's transmit power for given transmission rate demands of all links in a multi-input multi-output (MIMO) ad hoc network. The problem is nonconvex, hence, challenging to be solved, even in a centralized manner. To derive a distributed solution, we reformulate the problem as a noncooperative game. We then propose a network interference function (NIF) that captures the total interference incurred at unintended receivers by all transmitters. The proposed NIF sets the light for designing transmitter-dependent pricing policies for the above game. A price-based iterative water-filling algorithm (PIWF) is proposed to find MIMO precoding matrices, which determines both beam directions and transmission power allocation among antennas (or data streams) at each transmitter. Simulations show that PIWF is more power-efficient than all existing MIMO precoding methods. Additionally, NIF under PIWF is also the least. Simulations also show the fast convergence of PIWF.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115131330","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 : 2012-06-10DOI: 10.1109/ICC.2012.6363862
Visa Holopainen
This paper argues that the scalability problems of the Internet could be solved, not only in the control plane, but also in the forwarding plane. To this end, an explicit forwarding scheme is presented. Our scheme alleviates the Internet routing scalability problem, and facilitates fast forwarding, enforcement of fine-grained ISP transit policies, and stateless multicast, while still retaining the robustness of hop-by-hop forwarding.
{"title":"Towards robust, scalable, and fast Internet via Explicit Forwarding Engines (EFE)","authors":"Visa Holopainen","doi":"10.1109/ICC.2012.6363862","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363862","url":null,"abstract":"This paper argues that the scalability problems of the Internet could be solved, not only in the control plane, but also in the forwarding plane. To this end, an explicit forwarding scheme is presented. Our scheme alleviates the Internet routing scalability problem, and facilitates fast forwarding, enforcement of fine-grained ISP transit policies, and stateless multicast, while still retaining the robustness of hop-by-hop forwarding.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115223557","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 : 2012-06-10DOI: 10.1109/ICC.2012.6363872
Hasan Tuncer, Yoshihiro Nozaki, N. Shenoy
This paper presents a novel mobility architecture called Virtual Mobility Domains that is designed to work with the Floating Cloud Tiered Internetworking model. Virtual Mobility Domains supports both inter Autonomous System (macro) and intra Autonomous System (micro) mobility by leveraging a tiered addressing, a network cloud concept, and a unique packet forwarding scheme introduced by the Floating Cloud Tiered Internetworking model. The proposed mobility architecture is distinct from others by not using IP addressing and classic routing protocols, and deploying user-centric overlapping mobility domains. The comparative simulation study of Virtual Mobility Domains against Mobile IPv6, Hierarchical Mobile IPv6, and Proxy Mobile IPv6 using OPNET shows that Virtual Mobility Domains brings lower latency, lesser signaling overhead, and fewer packets loss during handoffs, specially during inter Autonomous System roaming. The results highlight the potential for a seamless mobility management.
{"title":"Virtual mobility domains — A mobility architecture for the future Internet","authors":"Hasan Tuncer, Yoshihiro Nozaki, N. Shenoy","doi":"10.1109/ICC.2012.6363872","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363872","url":null,"abstract":"This paper presents a novel mobility architecture called Virtual Mobility Domains that is designed to work with the Floating Cloud Tiered Internetworking model. Virtual Mobility Domains supports both inter Autonomous System (macro) and intra Autonomous System (micro) mobility by leveraging a tiered addressing, a network cloud concept, and a unique packet forwarding scheme introduced by the Floating Cloud Tiered Internetworking model. The proposed mobility architecture is distinct from others by not using IP addressing and classic routing protocols, and deploying user-centric overlapping mobility domains. The comparative simulation study of Virtual Mobility Domains against Mobile IPv6, Hierarchical Mobile IPv6, and Proxy Mobile IPv6 using OPNET shows that Virtual Mobility Domains brings lower latency, lesser signaling overhead, and fewer packets loss during handoffs, specially during inter Autonomous System roaming. The results highlight the potential for a seamless mobility management.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115227967","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364866
Z. Islam, Mitchell Romanuik, S. Shah-Heydari, M. Salmanian
This paper presents a multi-node 2-dimensional distributed technique for coarse (approximate) localization of the nodes in a tactical mobile ad-hoc network. The objective of this work is to provide coarse localization information based on layer-3 connectivity information and a few anchor nodes or landmarks, without using traditional methods such as signal strength, Time of Arrival (ToA) or distance information. We propose a localization algorithm based on a force-directed method that will allow us to estimate the approximate location of each node based on network topology information from a local OLSR database with enhancement from known landmarks as reference points. We assume the majority of nodes are not equipped with GPS and thus do not have their exact location information. A simulation based-analysis is conducted to evaluate our proposed approach. The results of this study show that the proposed approach can provide a reasonable and fast approximation of the location of the mobile node for use in situational awareness systems.
{"title":"OLSR-based coarse localization in tactical MANET situational awareness systems","authors":"Z. Islam, Mitchell Romanuik, S. Shah-Heydari, M. Salmanian","doi":"10.1109/ICC.2012.6364866","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364866","url":null,"abstract":"This paper presents a multi-node 2-dimensional distributed technique for coarse (approximate) localization of the nodes in a tactical mobile ad-hoc network. The objective of this work is to provide coarse localization information based on layer-3 connectivity information and a few anchor nodes or landmarks, without using traditional methods such as signal strength, Time of Arrival (ToA) or distance information. We propose a localization algorithm based on a force-directed method that will allow us to estimate the approximate location of each node based on network topology information from a local OLSR database with enhancement from known landmarks as reference points. We assume the majority of nodes are not equipped with GPS and thus do not have their exact location information. A simulation based-analysis is conducted to evaluate our proposed approach. The results of this study show that the proposed approach can provide a reasonable and fast approximation of the location of the mobile node for use in situational awareness systems.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115435613","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 : 2012-06-10DOI: 10.1109/ICC.2012.6363646
Yang Yang, Zixiang Xiong, Yu-chun Wu, Philipp Zhang
We propose a density evolution based dirty-paper code design framework that combines trellis coded quantization with multi-level low-density parity-check (LDPC) codes. Unlike existing design techniques based on Gaussian approximation and EXIT charts, the proposed framework tracks the empirically collected log-likelihood ratio (LLR) distributions at each iteration, and employs density evolution and differential evolution algorithms to design each LDPC component code. In order for the approximated LLR distributions obtained using density evolution to better match the true LLR distributions, a novel decorrelator is added to the decoder to make channel LLRs and check node LLRs almost independent of each other. Simulation results show that at 1 bit per sample transmission rate, the dirty-paper codes designed using the proposed method operate within 0.53 dB of the theoretical limit, reducing the best known result (with a 0.58 dB gap to the limit) by 0.05 dB at the same complexity and block length, while this improvement can be as large as 0.21 dB (corresponding to a 0.37 dB gap to the limit) when we use higher complexity encoder/decoder with longer block length.
{"title":"A density evolution based framework for dirty paper code design using TCQ and multilevel LDPC codes","authors":"Yang Yang, Zixiang Xiong, Yu-chun Wu, Philipp Zhang","doi":"10.1109/ICC.2012.6363646","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363646","url":null,"abstract":"We propose a density evolution based dirty-paper code design framework that combines trellis coded quantization with multi-level low-density parity-check (LDPC) codes. Unlike existing design techniques based on Gaussian approximation and EXIT charts, the proposed framework tracks the empirically collected log-likelihood ratio (LLR) distributions at each iteration, and employs density evolution and differential evolution algorithms to design each LDPC component code. In order for the approximated LLR distributions obtained using density evolution to better match the true LLR distributions, a novel decorrelator is added to the decoder to make channel LLRs and check node LLRs almost independent of each other. Simulation results show that at 1 bit per sample transmission rate, the dirty-paper codes designed using the proposed method operate within 0.53 dB of the theoretical limit, reducing the best known result (with a 0.58 dB gap to the limit) by 0.05 dB at the same complexity and block length, while this improvement can be as large as 0.21 dB (corresponding to a 0.37 dB gap to the limit) when we use higher complexity encoder/decoder with longer block length.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115668982","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364732
B. Gajic, Janne Riihijärvi, P. Mähönen
In this work we analyze topology discovery and the procedure for joining the network in the information-centric context. We develop and evaluate such a network attachment procedure in an information-centric network utilizing the publish-subscribe paradigm for the data exchange. In our work the publish-subscribe concept is not only used as a communication means, but we aim at fully exploiting its characteristics for native merging of fine-grained network operations such as topology management and network connectivity establishment. Such an integration adds not only to the simplicity of the network and efficiency of the network information gathering, but includes the means for handling mobility issues. We examine the performance characteristics of the proposed solution particularly focusing on complexity and introduced message overhead. The evaluation results obtained from the testbed experiments show the outstanding performance in terms of delay, while the signaling overhead remains at a very low level.
{"title":"On flexible topology formation in publish-subscribe networks","authors":"B. Gajic, Janne Riihijärvi, P. Mähönen","doi":"10.1109/ICC.2012.6364732","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364732","url":null,"abstract":"In this work we analyze topology discovery and the procedure for joining the network in the information-centric context. We develop and evaluate such a network attachment procedure in an information-centric network utilizing the publish-subscribe paradigm for the data exchange. In our work the publish-subscribe concept is not only used as a communication means, but we aim at fully exploiting its characteristics for native merging of fine-grained network operations such as topology management and network connectivity establishment. Such an integration adds not only to the simplicity of the network and efficiency of the network information gathering, but includes the means for handling mobility issues. We examine the performance characteristics of the proposed solution particularly focusing on complexity and introduced message overhead. The evaluation results obtained from the testbed experiments show the outstanding performance in terms of delay, while the signaling overhead remains at a very low level.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115680175","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364741
V. Mišić, J. Misic, Dragan Nerandzic
We discuss the changes needed in several of the key areas of 3GPP Long Term Evolution (LTE) network technology that would enable LTE networks to accommodate Machine-Type Communication traffic and applications, in particular those related to smart metering.
{"title":"Extending LTE to support machine-type communications","authors":"V. Mišić, J. Misic, Dragan Nerandzic","doi":"10.1109/ICC.2012.6364741","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364741","url":null,"abstract":"We discuss the changes needed in several of the key areas of 3GPP Long Term Evolution (LTE) network technology that would enable LTE networks to accommodate Machine-Type Communication traffic and applications, in particular those related to smart metering.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124382874","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 : 2012-06-10DOI: 10.1109/icc.2012.6364899
Weider D. Yu, Xiaolei Su, Jason Hansen
This paper investigates the feasibility and potential of using a mobile smartphone as a user administration control for storage system network. It includes the design and implementation of a mobile smartphone software system that can be used to perform system administration activities on the storage system without the need of using a laptop or desktop system. In the paper the design of some effective metaphors to present the storage system on the limited display area of a mobile smartphone device and the set of system features chosen for implementation are presented. Current storage system administration is limited to using storage controller console or Microsoft Windows Clients. The solution described in this paper provides an alternative smart interface to the storage system. This research effort is focused on investigating the potential of using mobile smartphone software application as a smart user interface protocol to communicate with the storage system network.
{"title":"A smartphone design approach to user communication interface for administering storage system network","authors":"Weider D. Yu, Xiaolei Su, Jason Hansen","doi":"10.1109/icc.2012.6364899","DOIUrl":"https://doi.org/10.1109/icc.2012.6364899","url":null,"abstract":"This paper investigates the feasibility and potential of using a mobile smartphone as a user administration control for storage system network. It includes the design and implementation of a mobile smartphone software system that can be used to perform system administration activities on the storage system without the need of using a laptop or desktop system. In the paper the design of some effective metaphors to present the storage system on the limited display area of a mobile smartphone device and the set of system features chosen for implementation are presented. Current storage system administration is limited to using storage controller console or Microsoft Windows Clients. The solution described in this paper provides an alternative smart interface to the storage system. This research effort is focused on investigating the potential of using mobile smartphone software application as a smart user interface protocol to communicate with the storage system network.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114667778","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 : 2012-06-10DOI: 10.1109/ICC.2012.6364414
R. Alegre-Godoy, N. Alagha, M. Vázquez-Castro
In this paper we investigate capacity optimization mechanisms for multi-beam satellite systems built on a realistic payload model. The first proposed mechanism deals with long term traffic variations, for which capacity optimization algorithms are proposed based on per-beam traffic requests. Due to the high asymmetry of the traffic, our algorithms provide time and spatial flexibility illuminating a specific set of beams within a window of several time-slots. Our algorithms maximize the amount of capacity actually offered while providing reduced power consumption. The second proposed mechanism deals with short-term traffic variations, for which we propose Network Coding (NC) based techniques at the link layer. The aim is to increase the offered capacity taking advantage of overlapping beam coverage, usually considered as a source of interference. This technique is meant to be applied not only in classical multi-beam systems, but also on top of the per-beam capacity optimization as a method to deal with fast traffic unbalances not evaluated in the first mechanism. Analysis and simulations results show that system capacity can be increased up to 13% in the first case and up to 90% in the second case.
{"title":"Offered capacity optimization mechanisms for multi-beam satellite systems","authors":"R. Alegre-Godoy, N. Alagha, M. Vázquez-Castro","doi":"10.1109/ICC.2012.6364414","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364414","url":null,"abstract":"In this paper we investigate capacity optimization mechanisms for multi-beam satellite systems built on a realistic payload model. The first proposed mechanism deals with long term traffic variations, for which capacity optimization algorithms are proposed based on per-beam traffic requests. Due to the high asymmetry of the traffic, our algorithms provide time and spatial flexibility illuminating a specific set of beams within a window of several time-slots. Our algorithms maximize the amount of capacity actually offered while providing reduced power consumption. The second proposed mechanism deals with short-term traffic variations, for which we propose Network Coding (NC) based techniques at the link layer. The aim is to increase the offered capacity taking advantage of overlapping beam coverage, usually considered as a source of interference. This technique is meant to be applied not only in classical multi-beam systems, but also on top of the per-beam capacity optimization as a method to deal with fast traffic unbalances not evaluated in the first mechanism. Analysis and simulations results show that system capacity can be increased up to 13% in the first case and up to 90% in the second case.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121807688","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
扫码关注我们
求助内容：
应助结果提醒方式：