{"title":"Distributed collaborative beamforming designs for real-world applications in relayed and cooperative communications","authors":"S. Zaidi, S. Affes","doi":"10.1109/COMNET.2015.7566622","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566622","url":null,"abstract":"Three main distributed collaborative beamforming (DCB) designs based on different channel models could be employed in real-world applications where scattering and implementation imperfections might exist: the monochromatic (i.e., single-ray) DCB (M-DCB), the bichromatic (i.e., two-ray) DCB (B-DCB), and the polychormatic (i.e., multi-ray) DCB (P-DCB). In this paper, we perform an analytical comparison, under practical constraints, between these DCB designs in terms of achieved signal-to-noise ratio (SNR) as well as achieved throughput. Assuming the presence of scattering and accounting for implementation errors incurred by each DCB design, we derive closed-form expressions of their true achieved SNRs. Excluding exceptional circumstances of unrealistic low quantization levels (i.e., very large quantization errors) hard to justify in practice, we show that B-DCB always outperforms M-DCB as recently found nominally in ideal conditions. We also show that for low AS B-DCB and P-DCB achieve almost the same SNR while for high AS the latter outperforms the first. Furthermore, this work pushes the performance analysis of DCB to the throughput level by taking into account the feedback overhead cost incurred by each design. We prove both by concordant analysis and simulations that the P-DCB's throughput gain against B-DCB reduces as the channel Doppler frequency increases.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125247011","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":"The Cloud Broker Architecture for Dependability assurance in cloud services","authors":"Wiem Abderrahim, Z. Choukair","doi":"10.1109/COMNET.2015.7566643","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566643","url":null,"abstract":"Cloud computing is a frequent place for failures. Therefore many industrial and research labs are working on finding models for tolerating failures and adapting the common mechanisms of fault management to the cloud environments specificities and nature. In this context, this paper proposes an architecture for cloud brokering that implements dependability properties as a mean for trust assurance. We integrated the fault management features in our architecture and bolstered them with CORBA as the de facto standard for distributed systems.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125478269","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":"Optimal scheduling of CIOQ switches resources in virtual network environments","authors":"Maha Jebalia, Asma BEN LETAIFA, S. Tabbane","doi":"10.1109/COMNET.2015.7566638","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566638","url":null,"abstract":"Nowadays, virtualization is an important technique that offers illimited resources to network users. It allows users to share switch's resources in time and space. Sharing in time is done by scheduling algorithms determining at which moment each input queue is matched with an output queue. Regarding sharing in space, it takes place in the queues which are split into multiple virtual queues. Being this, the switches have to support scheduling features and efficient algorithms to match input and output queues. In this paper, we deal with scheduling and resource management in Combined Input Output Queued (CIOQ) Switches. In this paper, we are intended to propose a scheduling scheme that shares switch's resources and guarantees fairness between different flows.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126924788","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":"Clustering enhancement for VANETs in highway scenarios","authors":"Emna Daknou, Mariem Thaalbi, N. Tabbane","doi":"10.1109/COMNET.2015.7566617","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566617","url":null,"abstract":"The recent research on reliable data dissemination techniques vehicular ad hoc networks (VANETs) motivates for a stable VANET clustering algorithm. However, considering topology dynamics and the high mobility of vehicles, it's not easy to make the network connected in a restricted delay. In this paper, we develop an enhanced clustering algorithm to form stable clusters for delay-bounded applications (car crash alert, dangerous zone advertisement, etc.) on highway scenarios. Because these applications can't support long cluster formation process, our scheme aims to minimize both the cluster head election and the cluster member selection durations. To achieve this goal, the network partition is initially done by the slowest vehicle in order to accelerate the cluster formation. Then, a multi-metric waiting time function is implemented to select the cluster head. It takes as parameters speed difference and relative distance between neighboring nodes. Finally, we add a switching mechanism which allows for choosing a new substitute cluster head when the current cluster head risks leaving the cluster. This effectively enhances cluster lifetime and reduces frequent re-clustering in high speed scenarios. Simulation results confirm that our technique enables formation of long living and stable clusters in a reduced delay.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125034740","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":"Early termination techniques for MIMO lattice sequential decoders","authors":"Asma Mejri, G. R. Othman, Mohamed-Achraf Khsiba","doi":"10.1109/COMNET.2015.7566620","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566620","url":null,"abstract":"In practical communication systems and realistic radio applications, there are throughput and latency restraints that have to be fulfilled together with a fixed hardware decoding complexity constraint that should be satisfied. Because of these requirements, in some bad channel realizations, a guaranteed throughput needs to be enforced with a premature end of the decoding process at the expense of a bit error rate performance penalty. In such scenarios, the decoding algorithm should stop and return a premature estimation of the original data such that the authorized decoding complexity and convergence time are respected. This problem is known as early termination decoding. In this work we propose efficient termination techniques for best-first tree-search sequential decoders applicable to a plurality of linear communication systems including MIMO channels addressed in this paper.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114860169","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":"Optical intensity modulation direct detection versus heterodyne detection: A high-SNR capacity comparison","authors":"A. Chaaban, Mohamed-Slim Alouini","doi":"10.1109/COMNET.2015.7566632","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566632","url":null,"abstract":"An optical wireless communications system which employs either intensity-modulation and direct-detection (IM-DD) or heterodyne detection (HD) is considered. IM-DD has lower complexity and cost than HD, but on the other hand, has lower capacity. It is therefore interesting to investigate the capacity gap between the two systems. The main focus of this paper is to investigate this gap at high SNR. Bounds on this gap are established for two cases: between IM-DD and HD, and between IM-DD and an HD-PAM which is an HD system employing pulse-amplitude modulation (PAM). While the gap between IM-DD and HD increases as the signal-to-noise ratio (SNR) increases, the gap between IM-DD and an HD-PAM is upper bounded by a constant at high SNR.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134099023","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":"Compute-and-forward on Compound Multiple Access Relay Channel","authors":"Ammar Jlassi, L. B. Slama, A. Zaidi, S. Cherif","doi":"10.1109/COMNET.2015.7566623","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566623","url":null,"abstract":"In this work, we study a Compound Multiple Access Relay Channel (C-MARC). The system is a simultaneous multicast network where all destinations are intended to receive and decode signals from all transmitters. Particularly, we focus on the model of two transmitters communicating, simultaneously, with two destinations with the help of a half-duplex relay. We extend and adapt the lattice-based compute-and-forward coding scheme to the model we study. This coding scheme is implemented at the relay and at the destinations through some modulo reduction operations. The relay computes one of the linear combinations and then forwards it, simultaneously to the destinations where the other linear combinations will be computed based on the direct transmissions. In this paper, we discuss the design criteria, and derive the allowed symmetric-rate. An optimization problem will then be formulated and solved through a Mixed Integer Quadratic Programming (MIQP) problem. The analysis shows that our coding scheme can offer substantial gain over standard relaying techniques such that amplify-and-forward and decode-and-forward for this model. We illustrate our results through some numerical examples.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"58-60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134272501","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":"Analysis of feedback multi-thresholding in cognitive radio networks based on opportunistic beamforming","authors":"Ayman Massaoudi, N. Sellami, M. Siala","doi":"10.1109/COMNET.2015.7566618","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566618","url":null,"abstract":"In this paper, we consider an underlay cognitive radio network where a large number of secondary users (SUs) can share the spectrum with a primary user (PU). We suppose that the cognitive base station (CBS) has multiple antennas and does not have the full channel state information (CSI) from SUs. We study the problem of SUs scheduling based on opportunistic beamforming. In order to reduce the feedback amount needed from SUs to CBS, we apply a multi-threshold mechanism to the signal to interference and noise ratio (SINR) feedback. The aim of our work is to determine analytically the optimal thresholds which reduce the number of SUs feeding back their SINR or the delay related to the average number of attempts (the average number of thresholds considered in the feedback process). To do this, we derive an accurate statistical characterization of the largest SINR for a particular user and we deduce upper bounds of the average number of SUs feeding back their SINR and of the average number of attempts.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131077653","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":"An Extended Soft Handover scheme for real-time service with QoS guarantee in LTE-A system","authors":"Imen Jouili, M. Frikha, H. Tounsi","doi":"10.1109/COMNET.2015.7566642","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566642","url":null,"abstract":"Long term evolution advanced (LTE-A) has emerged as a promising mobile broadband access technology aiming to cope with the traffic demand increasing in wireless networks. QoS offered by LTE-A must be maintained during the communication especially for real-time services. Moreover, with the integration of carrier aggregation technology, the handover procedure became more delicate. In fact, the current used resources in source node can be not available in target node during the handover decision. In this paper we propose a soft handover scheme for real-time service users in the case of high speed vehicle. This solution called Extended Soft Handover is based on the carrier aggregation and CoMP techniques. Secondly, we enhance our algorithm to guarantee QoS after handover when there are no resources available in target node. The main idea is to confiscate the bandwidth of best effort traffic in target node in order to favor real time traffic during the handover.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117175293","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":"System performance of cellular network underlaying D2D multi-hop communication","authors":"Leila Melki, S. Najeh, Hichem Besbes","doi":"10.1109/COMNET.2015.7566629","DOIUrl":"https://doi.org/10.1109/COMNET.2015.7566629","url":null,"abstract":"Device-to-Device (D2D) communication was initially proposed in cellular networks as a new paradigm to enhance network performance. The main focus is on the capacity of the proposed system with multiple idle UEs serving as relays. This paper investigates the tight integration of D2D communication into an LTE-A network and the performance of D2D multi-hop communication. Further, we present numerical results based on the system simulations in an interference limited scenario. Our studies and analysis and numerical results indicate that multi-hop D2D communications combined schemes can be useful not only for harvesting the potential gains previously identified in the literature, but also for extending the coverage of cellular networks.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133307438","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}