Nick Majedi, M. Naeem, Khwaja Ahmed Shaharyar, A. Anpalagan
{"title":"EMI-aware central processing point deployment for wireless networks in hospitals","authors":"Nick Majedi, M. Naeem, Khwaja Ahmed Shaharyar, A. Anpalagan","doi":"10.1109/QBSC.2014.6841208","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841208","url":null,"abstract":"In this paper, we introduce an approach to jointly minimize energy consumption of wireless transmitters and the harmful interference on sensitive medical devices, and optimize the central controller placement for collecting data from transmitters. More specifically, a multi-objective non-convex mixed-integer non-linear programming (MINLP) problem is defined and formulated to optimize transmit power of wireless users and central processing point (CPP) deployment along with guaranteeing minimized EMI to comply with the immunity level of medical devices. To solve this problem, an important step is to convexify it. Then we propose the use of a standard branch-and-bound algorithm. Also the program is coded in MATLAB with the help of OPTItoolbox to find the optimal solution. To conduct a numerical result analysis, we considered different cases within a single floor of a hospital and a few scenarios for a two-storey hospital building. Our results show the improvement in throughput and guaranteed immunity for medical devices, when the proposed formulation is deployed along with a branch-and-bound algorithm.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"23 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123712827","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":"Left degree distribution shaping for LT codes over the binary erasure channel","authors":"Khaled F. Hayajneh, S. Yousefi, M. Valipour","doi":"10.1109/QBSC.2014.6841213","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841213","url":null,"abstract":"Fountain codes were introduced to provide higher reliability, lower complexities, and more scalability for networks such as the Internet. Luby-Transform (LT) codes, which are the first realization of Fountain codes, achieve the capacity of the binary erasure channel (BEC) asymptotically and universally. For finite lengths, the search is continued to find codes closer to the capacity limits at even lower encoding and decoding complexities. Most previous work on single-layer Fountain coding targets the design via the right degree distribution. The left degree distribution of an LT code is left as Poisson to protect the universality. For finite lengths, this is no longer an issue; thus, we focus on the design of better codes for the BEC at practical lengths. Our left degree shaping provides codes outperforming LT and all other competing schemes in the literature. At a bit error rate of 10-7 and packet length k = 256, our scheme provides a realized rate of 0.6 which is 23.5% higher than Sorensen et al.'s scheme [1].","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122351702","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":"Real-time communication of dependent messages","authors":"Zhong Cheng, Yongyi Mao, T. Chan","doi":"10.1109/QBSC.2014.6841193","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841193","url":null,"abstract":"This paper presents a source model to capture the dependency structure of messages generated by a source encoder. Under such a model, the communication problem subject to certain delay constraint may be formulated as a utility maximization problem. Over discrete memoryless channels, we derive the expression of maximal achievable utility, which appears to be governed by the channel coding theorem. We perform numerical study of two examples of source-coded messages, corresponding to layered codes and multiple description codes respectively, and show the impact of delay and channel condition on their respective achievable utilities.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114800359","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 underlay cooperative cognitive network with secure transmission","authors":"Pham Ngoc Son, H. Kong","doi":"10.1109/QBSC.2014.6841206","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841206","url":null,"abstract":"In this paper, we propose and analyze an underlay cooperative cognitive network with Physical Layer Security where a best relay is selected based on maximizing end-to-end secrecy capacity. The cooperative system performance is evaluated by an outage secrecy probability and is compared with the direct transmission protocol. Our simulation results show that system performance is improved when dse > dsd and the cognitive network is far enough from the primary user, where dsd and dse are the distances from a source to a destination and a source to an eavesdropper, respectively. In addition, the theoretical expressions match well with the simulation results.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117233549","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":"Practical OFDM signalling for visible light communications using spatial summation","authors":"Mohammed S. A. Mossaad, S. Hranilovic","doi":"10.1109/QBSC.2014.6841173","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841173","url":null,"abstract":"Visible light communication (VLC) channels leverage solid-state illumination devices to provide a dual role as high-speed communication links. These channels are bandwidth-limited and can have high SNRs. Bandwidth-efficient intensity-modulated/direct-detection (IM/DD) orthogonal frequency-division multiplexing (OFDM) has been considered for VLC systems. Key drawbacks of OFDM in IM/DD channels are its high peak-to-average power ratio (PAPR) as well as the difficulty of implementing power efficient, high current, wideband drivers. In this paper, we propose a new form of IM/DD OFDM termed spatial optical OFDM (SO-OFDM) in which multiple narrowband OFDM signals are transmitted simultaneously from different LEDs and allowed to sum in space. In this way, a conventional OFDM receiver can be employed while having a series of lower power transmitters, each with improved PAPR. Simulation results show that in comparison with conventional IM/DD OFDM, SO-OFDM is more robust to amplifier nonlinearities and can be implemented with more efficient line driver topologies.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121563687","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":"Forensic outlier detection for Cognitive Radio Networks","authors":"I. Kabir, S. Astaneh, S. Gazor","doi":"10.1109/QBSC.2014.6841183","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841183","url":null,"abstract":"We consider forensic outlier detection instead of traditional outlier detection to enforce spectrum security in a Cognitive Radio Network (CRN). We investigate a CRN where a group of sensors report their local binary decisions to a Fusion Center (FC), which makes a global decision on the availability of the spectrum. To ensure the truthfulness of the sensors, we examine the reported decisions in order to determine whether a specific sensor is an outlier. We propose several optimal detectors (for known parameters) and suboptimal detectors (for the practical cases where the parameters are unknown) to detect three types of outlier sensors: 1) selfish sensor, which reports the spectrum to be occupied when locally detects its vacancy, 2) malicious sensor, which reports the spectrum to be vacant when locally detects its occupancy, 3) malfunctioning sensor, whose reports are not accurate enough (i.e., its performance is close to random guessing). We evaluate the proposed detectors by simulations. Our simulation results reveal that the proposed detectors significantly outperform the Grubb's test. Since the unknown or untrustworthy parameters are accurately estimated by the FC, the proposed suboptimal detectors do not require the knowledge of the spectrum statistics and are insensitive to the parameters reported by the suspected user. These detectors can be used by government agencies for forensic testing in policy control and abuser identification in CRNs.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133164908","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":"Energy efficient anycast routing for scheduled lightpath demands in optical grids","authors":"Ying Chen, A. Jaekel, Kevin Li","doi":"10.1109/QBSC.2014.6841174","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841174","url":null,"abstract":"Optical grids are attractive candidates to meet the large-scale computing, storage and data transmission capabilities in a number of emerging application areas. In many grid applications, it may be possible to select one out of a number of possible destinations to execute a specific job. This is known as anycasting, and in this paper we exploit the inherent flexibility of anycasting for energy efficient routing in optical grids. We propose an optimal integer linear program (ILP) formulation for selecting routes and destinations to minimize the total energy consumption of a set of scheduled lightpath demands. Our approach takes into consideration energy consumption at the network nodes and along the optical fibers, as well as the start time and duration of each scheduled demand. To the best of our knowledge, this is the first work to address the problem of energy-aware routing of scheduled demands in optical grids. Simulation results demonstrate that significant improvements in energy consumption can be achieved compared to both existing energy-aware unicast routing and holding-time-unaware approaches.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116245442","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":"A polling MAC for wireless sensor networks with RF recharging of sensor nodes","authors":"V. Mišić, J. Misic","doi":"10.1109/QBSC.2014.6841188","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841188","url":null,"abstract":"Prolonged lifetime of wireless sensor networks can be accomplished by using RF energy transfers that replenish the power sources of individual sensors, or a group of sensors. In this paper we describe a polling-based MAC protocol that uses the same RF band for both energy transfers and data communications, and thus must use interleaving of the two. We investigate the impact of network and traffic parameters on the performance of the network, and highlight some design choices that would optimize the performance.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123072501","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":"Multi-objective MTC device controller resource optimization in M2M communication","authors":"Fatima Hussain, A. Anpalagan, M. Naeem","doi":"10.1109/QBSC.2014.6841210","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841210","url":null,"abstract":"Machine to machine (M2M) communication has received increasing attention in recent years. It exhibits features such as large number of devices and low data rates. In order to accommodate massive, energy efficient M2M traffic and to reduce the access delay and signalling overhead, the recommendation is to introduce a clustered network structure. In this effort, we consider machines (or devices) in a macro cell divided into clusters. The machines belonging to a cluster communicate to the cluster head/controller, which then aggregates the traffic and relays to the eNB. Unlike related work that focuses on formation of clusters and their energy consumption, in this paper we investigate the multi-objective optimization problem of throughput maximization and power control of cluster heads in interference-limited M2M communication. Our objective is to maximize the number of admitted MTC device controllers with least interference caused to conventional (human) devices such that their quality of service (QoS) is not affected by the M2M communications. To maximize the number of machines that can communicate while meeting the interference constraints of human devices and machines themselves, we formulate a mixed-integer non-linear programming (MINLP) problem. OPTI toolbox is used to optimize the power, capacity and maximum number of admitted machines collectively.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132217312","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":"Distributed fast decodable space-frequency coding for CoMP OFDM cellular networks","authors":"Jamshid Rezaei Mianroodi, T. Le-Ngoc","doi":"10.1109/QBSC.2014.6841176","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841176","url":null,"abstract":"This paper presents a distributed fast decodable space-frequency coding (FD-SFC) scheme suitable for Coordinated Multi-Point (CoMP) downlink transmission in an OFDM cellular wireless network to mitigate ICI while benefiting from spatial diversity by grouping cell-edge users (UE) and sharing sub-carriers among neighbor cells. A distributed decoder is proposed to reduce the UE decoding complexity to 50% of that of the optimal decoder for the same non-distributed FD-SFC. Achievable transmission rate (in b/s/Hz) versus UE relative distance to its base-station (eNodeB) of the proposed scheme is studied in comparison with the Alamouti CoMP and non-CoMP schemes, and its performance upper and lower bounds are derived. It is shown that the proposed scheme outperforms both Alamouti-CoMP and non-CoMP schemes in serving cell-edge UE's. The derived performance bounds are then used to establish the UE relative distance threshold for switching between the proposed CoMP and non-CoMP modes to enhance the overall performance.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133914182","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}