{"title":"A New Low-Complexity Decodable Rate-5/4 STBC for Four Transmit Antennas with Nonvanishing Determinants","authors":"Amr Ismail, J. Fiorina, H. Sari","doi":"10.1109/GLOCOM.2011.6134225","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6134225","url":null,"abstract":"The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a new low- complexity decodable rate-5/4 full-diversity 4 x 4 STBC. We provide an analytical proof that the proposed code has the Non-Vanishing-Determinant (NVD) property, a property that can be exploited through the use of adaptive modulation which changes the transmission rate according to the wireless channel quality. We compare the proposed code to the best existing low-complexity decodable rate-5/4 full-diversity 4 x 4 STBCs in terms of performance over quasi-static Rayleigh fading channels, worst- case complexity, average complexity, and Peak-to- Average Power Ratio (PAPR). Our code is found to provide better performance, lower average decoding complexity, and lower PAPR at the expense of a slight increase in worst-case decoding complexity.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131581008","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}
{"title":"Enhancing Contact Graph Routing for Delay Tolerant Space Networking","authors":"J. Segui, E. Jennings, S. Burleigh","doi":"10.1109/GLOCOM.2011.6134460","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6134460","url":null,"abstract":"When designing routing protocols for space-based networks, we must take into consideration the unique characteristics of such networks. Since space-based networks are inherently sparse with constrained resources, one needs to design smart routing algorithms that use the resources efficiently to maximize network performance. In Space Exploration Missions, the trajectories and orbits of spacecraft are predetermined, thus communication opportunities are predictable. This a-priori knowledge can be used to the advantage of scheduling and routing. In this paper, we focus on analyzing Contact Graph Routing (CGR) for space-based networks. CGR makes use of the predictable nature of the contacts to make routing decisions. Mars and Lunar mission-like scenarios were used in our simulations to gather statistics on routing protocol performance in terms of delay and buffer usage. We provide improvements to the underlying cost function of CGR to avoid routing loops and suggest applying Dijkstra's shortest path algorithm for path selection. The cost function change was incorporated into the latest Internet Draft posted for CGR. Dijkstra's shortest path algorithm was successfully implemented and tested in NASA's Interplanetary Overlay Network (ION) implementation of the DTN protocols.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124795665","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}
Peng Guo, Tao Jiang, Youwen Yi, Qian Zhang, Kui Zhang
{"title":"Novel Navigation Algorithm for Wireless Sensor Networks without Information of Locations","authors":"Peng Guo, Tao Jiang, Youwen Yi, Qian Zhang, Kui Zhang","doi":"10.1109/GLOCOM.2011.6133794","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6133794","url":null,"abstract":"In this paper, we propose a novel distributed navigation algorithm for people to escape from critical event region in wireless sensor networks (WSNs). Unlike existing works, the scenario discussed in the paper has no goal or exit as guidance, leading to a big challenge for the navigation problem. To solve it, our proposed navigation algorithm computes the convex hull of the event region just by some topological methods. With the reference of the convex hull, people can be easily navigated out of the event region. Both the computation complexity and communication overhead of the proposed algorithm are very low, as it only needs to flood two shortest path trees in a limited area around the event region with a distance $lfloor L/2pirfloor+1$ to the event boundary, where $L$ is the length of the boundary. Conducted simulations have verified the effectiveness and scalability of the proposed algorithm.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115847884","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}
{"title":"Semidefinite Programming Relaxation Based Virtually Antipodal Detection for Gray Coded 16-QAM MIMO Signalling","authors":"Shaoshi Yang, L. Hanzo","doi":"10.1109/GLOCOM.2011.6134531","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6134531","url":null,"abstract":"An efficient semidefinite programming relaxation (SDPR) based virtually antipodal (VA) detection approach is proposed for Gray coded 16-QAM signalling over multiple-input--multiple-output (MIMO) channels. The existing index-bit-based VA-SDPR (IVA-SDPR) method is incapable of making direct binary decisions concerning the individual information bits without making symbol decisions first, except for the linear natural-mapping aided rectangular QAM constellations. By contrast, our new method is capable of directly deciding on the information bits of the ubiquitous Gray-mapping aided 16-QAM by employing a strikingly simple linear matrix representation (LMR) of 4-QAM. As an appealing benefit, the conventional ``signal-to-symbol-to-bits'' decision process is substituted by a simpler ``signal-to-bits'' decision process for the classic Gray-mapping aided rectangular 16-QAM. Furthermore, when combined with low-complexity bit-flipping based ``hill climbing'', the proposed direct-bit-based VA-SDPR (DVA-SDPR) detector achieves the best bit-error-ratio (BER) performance among the known SDPR-based MIMO detectors in the context considered, while still maintaining a worst-case complexity order as low as O[(4N_T+1)^{3.5}].","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114696744","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}
{"title":"Opportunistic Interference Alignment by Receiver Selection in a K-User 1x3 SIMO Interference Channel","authors":"Jung Hoon Lee, Wan Choi","doi":"10.1109/GLOCOM.2011.6134199","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6134199","url":null,"abstract":"In this paper, we show that opportunistic interference alignment (OIA) by receiver selection achieves a total K degrees of freedom (DoF) in a K-user 1 ¡A 3 single-input multiple-output (SIMO) interference channel (IC) when the number of receive antennas is three (N_R=3) at each receiver. The concept of OIA is geometrically interpreted on the complex unit sphere when the number of interferers is larger than N_R, i.e., K ¡Y 4. We prove that OIA achieves DoF of one if the number of receivers associated with each transmitter increases with P_I^(K-3) where P_I is the average power of each interferer.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"28 4-5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123430371","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}
Ilhem Fajjari, N. Aitsaadi, G. Pujolle, H. Zimmermann
{"title":"VNR Algorithm: A Greedy Approach for Virtual Networks Reconfigurations","authors":"Ilhem Fajjari, N. Aitsaadi, G. Pujolle, H. Zimmermann","doi":"10.1109/GLOCOM.2011.6134006","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6134006","url":null,"abstract":"In this paper we address the problem of virtual network reconfiguration. In our previous work on virtual network embedding strategies, we found that most virtual network rejections were caused by bottlenecked substrate links while peak resource use is equal to 18%. These observations lead us to propose a new greedy Virtual Network Reconfiguration algorithm, VNR. The main aim of our proposal is to 'tidy up' substrate network in order to minimise the number of overloaded substrate links, while also reducing the cost of reconfiguration. We compare our proposal with the related reconfiguration strategy VNA-Periodic, both of them are incorporated in the best existing embedding strategies VNE-AC and VNE-Greedy in terms of rejection rate. The results obtained show that VNR outperforms VNA-Periodic. Indeed, our research shows that the performances of VNR do not depend on the virtual network embedding strategy. Moreover, VNR minimises the rejection rate of virtual network requests by at least 83% while the cost of reconfiguration is lower than with VNA-Periodic.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121630381","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}
Péter Vingelmann, M. Pedersen, F. Fitzek, J. Heide
{"title":"On-the-Fly Packet Error Recovery in a Cooperative Cluster of Mobile Devices","authors":"Péter Vingelmann, M. Pedersen, F. Fitzek, J. Heide","doi":"10.1109/GLOCOM.2011.6133577","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6133577","url":null,"abstract":"This paper investigates the possibility of packet error recovery in a cooperative cluster of mobile devices. We assume that these devices receive data from a broadcast transmission on their primary network interface (e.g. LTE network), and they are using a secondary network interface (e.g. ad hoc WLAN network) to form a cooperative cluster in order to exchange missing data packets among each other. Our goal is to devise a protocol that minimizes the number of packets exchanged on the secondary network whilst maximizes the number of packet errors recovered on the primary network. Moreover, we aim to repair the packet losses on-the-fly (as the data is being received), which also imposes real-time constraints on the protocol. We propose a solution based on random linear network coding to form cooperative clusters of mobile devices to facilitate the efficient exchange of information among them. We also introduce a demo application that implements this technique on Nokia phones. Then we present our testbed and the collected measurement results in order to evaluate the performance of our protocol.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131622246","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}
{"title":"On the Stability of Contention Resolution Diversity Slotted ALOHA (CRDSA)","authors":"C. Kissling","doi":"10.1109/GLOCOM.2011.6134329","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6134329","url":null,"abstract":"The stability of Random Access protocols is of high importance to ensure an efficient usage of resources and good service perception by the users. In this paper the stability region for the recently proposed Contention Resolution Diversity Slotted ALOHA random access protocol is discussed for finite user populations. The system dynamics of a CRDSA Random Access channel are described and a mathematical model is formulated, which allows predicting the stability of the system. From the derived model quantitative approximations of the stability regions and parameter selection for stable operation are provided. Numerical results are derived by means of simulations for validating the mathematical model and the quantitative approximations of the stability region","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121251243","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}
{"title":"User Relaying in a Two-User MIMO Broadcast Channel","authors":"J. Ryu, Eun Young Ahn, Wan Choi","doi":"10.1109/GLOCOM.2011.6133555","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6133555","url":null,"abstract":"A novel user relaying scheme based on bit concatenation is proposed for a two-user multiple input multiple output(MIMO) broadcast channel (BC). In broadcasting phase, a part of information for a destination user is concatenated to data for a relaying user and transmitted to a relaying user. The destination user receives the part of information via the relaying user in relaying phase in addition to the data in broadcasting phase. Achievable rate region of the proposed scheme is derived and an algorithm to characterize the boundary of the rate region is proposed. Our analysis and simulations show that the proposed user relaying in a MIMO BC expands the achievable rate region of a zero-forcing dirty paper coding (ZF-DPC) in a MIMO BC without relaying.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123201227","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}
{"title":"MBMS with User Cooperation and Network Coding","authors":"Qi Zhang, J. Heide, M. Pedersen, F. Fitzek","doi":"10.1109/GLOCOM.2011.6133643","DOIUrl":"https://doi.org/10.1109/GLOCOM.2011.6133643","url":null,"abstract":"In this paper user cooperation with network coding is applied to MBMS (Multimedia broadcast/multicast service) where Raptor codes are currently used. User cooperation together with network coding is used to save bandwidth and improve user perceived QoS for broadcast/multicast services in the future mobile communication networks. The proposed approach is tailored to LTE networks and extended with local cooperation. The simulation results show that local retransmissions can reduce the amount of redundant information on the cellular link with up to $80$% as long as there are at least two cooperative mobile devices. The results also show that network coding can save more than half of the traffic on the short-range link as long as there are four devices in the cooperation cluster.","PeriodicalId":349364,"journal":{"name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122116723","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}