{"title":"Energy efficient distributed power management algorithm with directional antenna for wireless sensor networks","authors":"N. Pradhan, T. Saadawi","doi":"10.1109/SARNOF.2011.5876471","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876471","url":null,"abstract":"Energy efficiency is an important consideration in a battery powered wireless sensor network (WSN). We propose an energy efficient Distributed Power Management algorithm with Directional Antenna (DDISPOW) that adaptively manages nodes' power in a dynamic wireless network to preserve network connectivity and reduce interference cooperatively. DDISPOW, with adequate transmit power, is capable of providing strongly connected reliable network. It stabilizes node connectivity over the dynamic network environment and attempts to prevent nodes from being completely disconnected from the network. It highlights the benefits of using directional antenna with lower average power, reduced interference and as much as 31% improved throughput. It will be shown that DDISPOW, while adaptively maintaining network connectivity and improving network performance, is energy efficient and significantly reduces interference when compared to common power strategy. It also alleviates the dependency of common node power strategy on few nodes that are isolated in the network by their physical location and surrounding network environment.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128263039","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 schemes for on-demand relaying","authors":"Fanny Parzysz, M. Vu, F. Gagnon","doi":"10.1109/SARNOF.2011.5876473","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876473","url":null,"abstract":"This paper approaches the fading relay channel from an energy consumption perspective and proposes an on-demand scheme based on superposition coding and incremental redundancy (IR). The scheme aims at minimizing the relay's energy consumption, while maintaining a rate desired by the source. The source divides its message into two parts, which allows the destination to request only the missing part(s) from the relay. We derive the set of joint power and rate allocation optimal for energy. The proposed scheme only requires local SNR knowledge and is robust to feedback delay. Compared to classical IR, this scheme always provides energy gain, which can attain up to 50% (at each instant and on average), and helps decrease the outage probability.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116504179","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":"Ensuring voters and candidates' confidentiality in E-voting systems","authors":"Haijun Pan, E. Hou, N. Ansari","doi":"10.1109/SARNOF.2011.5876452","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876452","url":null,"abstract":"A new method based on cryptography to ensure voters and candidates' confidentiality in the Internet E-Voting, referred to as the Name and vOte separaTed E-voting (NOTE) system, is proposed. In NOTE, an impartial party, the Election Commission (EC) will be responsible for part of the vote counting duties besides collecting and verifying the voter ID. The votes and the candidates' names are separated into two parts during the counting process. EC will hold the candidates' names secret before the tally comes up; the Vote Counting Committee (VCC) only counts the votes and is not involved in unveiling the vote tally by virtue of the anonymity of the candidates. Only EC can disclose the final tally after VCC has counted all votes without knowing who the votes are for during the vote counting procedure. This scheme will effectively ensure voters and candidates' confidentiality, and thus improving election security and fairness.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129968841","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":"UE centric coordinated beamforming in multi-cell MU-MIMO systems","authors":"Jialing Li, Yingxue Li, I. Lu","doi":"10.1109/SARNOF.2011.5876454","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876454","url":null,"abstract":"User Equipment (UE) centric coordinated beamforming (CBF) is an enabling technology in multi-cell MU-MIMO systems. It is of great importance to know the suggested cooperating set size for CBF and the corresponding performance. In this paper, a novel joint space-time-frequency proportionally fair scheduler for CBF is proposed to provide a tradeoff between the average system performance and UE fairness. The impact of the cooperating set size on system performance is predicted through the analysis of a simplified system, and then confirmed through numerical results of the whole system using the proposed scheduler.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129790378","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":"Allocating bandwidth in the resilient packet ring networks by PI controller","authors":"Fahd Alharbi, N. Ansari","doi":"10.1109/SARNOF.2011.5876463","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876463","url":null,"abstract":"The Resilient Packet Ring (RPR), defined under IEEE 802.17, has been proposed as a high-speed backbone technology for metropolitan area networks. RPR is introduced to mitigate the underutilization and unfairness problems associated with the current technologies, SONET and Ethernet, respectively. The key performance objectives of RPR are to achieve high bandwidth utilization, optimum spatial reuse on the dual rings, and fairness. The challenge is to design an algorithm that can react dynamically to the traffics in achieving these objectives. The RPR fairness algorithm is comparatively simple, but it poses some critical limitations that require further investigation and remedy. One of the major problems is that the amount of bandwidth allocated by the algorithm oscillates severely under unbalanced traffic scenarios. These oscillations are barrier to achieving spatial reuse and high bandwidth utilization. Moreover, the performance of the RPR fairness algorithm is very sensitive to the algorithm parameter settings. In this paper, we apply Control Theory to solve the fairness issue. We construct a PI controller to dynamically adjust the fair rate in order to eliminate the state of congestion and to converge to the optimal fair rate.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114361174","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":"Optimizing beyond the carrier by carrier proportional fair scheduler","authors":"Alexander X. Han, I. Lu","doi":"10.1109/SARNOF.2011.5876485","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876485","url":null,"abstract":"The multi-carrier proportional fair scheduling (MC-PFS) problem in a multi-user system has been shown to be NP-hard. Carrier by carrier proportional fair scheduling (CC-PFS) is commonly used instead to allocate resources in real-time. Considering the sub-optimal nature of CC-PFS and its popularity, this paper formulates the optimization beyond CC-PFS as a constrained maximum sum rate problem (with users' data rates scheduled by CC-PFS as the constraint) and tackles the problem in two ways. Firstly, the problem is shown to be equivalent to the well-studied generalized assignment problem (GAP) under the assumption of infinitely backlogged data. By considering traffic arrivals, the problem becomes a nonlinear integer programming problem which can be solved by outer approximation (OA) algorithms. Secondly, the problem is shown to be equivalent to a classical trading problem, and a low complexity heuristic algorithm that can be run in real-time is developed based on trading resource blocks (RBs). Using a system scheduling many video call users, we show that in about half of the time slots, the sum rate can be improved over CC-PFS while each user transmits at least as many bits as scheduled by CC-PFS. The heuristic algorithm captures about 30% of the throughput improvement found by OA. Finally, the reason for the improvements over CC-PFS is found to be traffic arrival.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134493977","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}
Dorra Ben Cheikh Battikh, J. Kélif, M. Coupechoux, P. Godlewski
{"title":"Dynamic system performance of SISO, MISO and MIMO Alamouti schemes","authors":"Dorra Ben Cheikh Battikh, J. Kélif, M. Coupechoux, P. Godlewski","doi":"10.1109/SARNOF.2011.5876457","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876457","url":null,"abstract":"In this paper, the performance of a SISO system, a 2 × 1 MISO Alamouti transmission system and a 2 × N MIMO Alamouti transmission with maximum ratio combining (MRC) receiver system is studied in terms of mean flow throughput per user. A dynamic study (dynamic number of active users) is derived considering the downlink Rayleigh channel in a multi-cellular system. Two assumptions are considered: admission control based on a maximum number of users or no admission control. The studied cell is divided into concentric rings. Analytical expressions of the mean flow throughput of a user in each ring are proposed. A comparison between the performance of the different systems is presented and discussed.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129201127","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":"Improved soft de-mapping scaling for a constrained MMSE receiver in OFDM MIMO systems","authors":"I. Lu, Hui-Yuan Teng","doi":"10.1109/SARNOF.2011.5876458","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876458","url":null,"abstract":"Since different spatial streams in MIMO systems experience different SINRs, the soft bits of each spatial stream should be scaled according to its SINR. In this paper, we introduced the idea of soft demapping scaling according to SINR and proposed an improved scaling method using a constrained MMSE approach for OFDM MIMO systems. Based on IEEE 802.11n examples, good system performances are observed in various modulation and coding schemes using the proposed soft demapping scaling while computational efficiency is preserved.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122922761","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 design and network architecture for a millimeter-wave mobile broadband (MMB) system","authors":"Zhouyue Pi, F. Khan","doi":"10.1109/SARNOF.2011.5876444","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876444","url":null,"abstract":"Evolution beyond 4G (LTE and mobile WiMAX) is crucial in keeping up with the exponential growth of mobile data traffic. In this paper, we describe a millimeter-wave mobile broadband (MMB) system that utilizes frequencies in the 3–300 GHz spectrum as a candidate for next generation mobile communication. A few key concepts in MMB network architecture such as the MMB inter-BS backhaul link, MMB base station grid, and hybrid MMB + 4G system are described. We demonstrate the feasibility of using millimeter waves to provide Giga bps data rate at a distance up to 1 km for mobility up to 350 kmph. We also discuss a few aspects of MMB air interface design such as beamforming, multiple access, and adaptive modulation and coding.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132533100","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":"MSOM based automatic modulation recognition and demodulation","authors":"Lei Zhou, Qiao Cai, Fangming He, H. Man","doi":"10.1109/SARNOF.2011.5876460","DOIUrl":"https://doi.org/10.1109/SARNOF.2011.5876460","url":null,"abstract":"Automatic modulation recognition (AMR) and demodulation are two essential components in cognitive radio receivers. This paper proposes a novel method based on MSOM neural networks to automatically recognize the modulation type and demodulate the radio signal at the same time. This efficient method is directly applied to the normalized radio signal samples and has relatively low computation complexity. A dynamic AMR method is also introduced, which further can reduce the computation without obvious loss in recognition. In this paper, four modulation types, i.e. BPSK, MSK, 2FSK and QPSK, are investigated. Our simulation results show that, compared with the traditional cyclic feature-based methods, the proposed MSOM classifier has better performance while requiring less number of signal samples, and it can also perform demodulation at good accuracy.","PeriodicalId":339596,"journal":{"name":"34th IEEE Sarnoff Symposium","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131744002","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}