发布求助
文献互助 智能选刊 最新文献

2016 IEEE 37th Sarnoff Symposium最新文献

筛选
英文 中文
Designing optimal heterogeneous networks 设计最优异构网络
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846763
Amit Mukhopadhyay, H. Batteram, Xiaohua Chen, Frank Louwdyk, A. Sharma, Z. J. Zhao
{"title":"Designing optimal heterogeneous networks","authors":"Amit Mukhopadhyay, H. Batteram, Xiaohua Chen, Frank Louwdyk, A. Sharma, Z. J. Zhao","doi":"10.1109/SARNOF.2016.7846763","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846763","url":null,"abstract":"Wireless operators worldwide are struggling with network congestion following explosion of mobile data traffic over the last several years. In many countries, spectrum addition is not an option. Improvement in spectral efficiency is not keeping up with traffic growth. Hence, the only option to add network capacity is to re-use existing spectrum. However, in many large cities, inter-site distances among macro cells are reaching the lower bounds of practical deployment, thereby forcing the industry to explore alternative network architectures. Heterogeneous Networks (HetNets) are defined as a mix of multi-technology macro and Small Cells. Small Cells may be used in licensed and/or unlicensed spectrum bands. There are three primary challenges of deploying Small Cells: (1)Where to deploy them so that maximum traffic is captured, (2)How to minimize interference with macro cells and (3)How to minimize deployment costs. This paper discusses a methodology for balancing the three constraints in a real-life network.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127358654","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}
引用次数: 0
Transient analysis of a resource-limited recovery policy for epidemics: A retrial queueing approach 流行病资源有限恢复策略的瞬态分析:一种重试排队方法
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-07-28 DOI: 10.1109/SARNOF.2016.7846752
Aresh Dadlani, Muthukrishnan Senthil Kumar, Kiseon Kim, F. Sahneh
{"title":"Transient analysis of a resource-limited recovery policy for epidemics: A retrial queueing approach","authors":"Aresh Dadlani, Muthukrishnan Senthil Kumar, Kiseon Kim, F. Sahneh","doi":"10.1109/SARNOF.2016.7846752","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846752","url":null,"abstract":"Knowledge on the dynamics of standard epidemic models and their variants over complex networks has been well-established primarily in the stationary regime, with relatively little light shed on their transient behavior. In this paper, we analyze the transient characteristics of the classical susceptible-infected (SI) process with a recovery policy modeled as a state-dependent retrial queueing system in which arriving infected nodes, upon finding all the limited number of recovery units busy, join a virtual buffer and try persistently for service in order to regain susceptibility. In particular, we formulate the stochastic SI epidemic model with added retrial phenomenon as a finite continuous-time Markov chain (CTMC) and derive the Laplace transforms of the underlying transient state probability distributions and corresponding moments for a closed population of size N driven by homogeneous and heterogeneous contacts. Our numerical results reveal the strong influence of infection heterogeneity and retrial frequency on the transient behavior of the model for various performance measures.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"22 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127161376","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}
引用次数: 1
Overlay secondary spectrum sharing with independent re-attempts in cognitive radios 在认知无线电中，将二次频谱共享与独立重新尝试叠加
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-07-28 DOI: 10.1109/SARNOF.2016.7846750
Muthukrishnan Senthil Kumar, Aresh Dadlani, Kiseon Kim, R. Afolabi
{"title":"Overlay secondary spectrum sharing with independent re-attempts in cognitive radios","authors":"Muthukrishnan Senthil Kumar, Aresh Dadlani, Kiseon Kim, R. Afolabi","doi":"10.1109/SARNOF.2016.7846750","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846750","url":null,"abstract":"Opportunistic spectrum access (OSA) is a promising reform paradigm envisioned to address the issue of spectrum scarcity in cognitive radio networks (CRNs). While current models consider various aspects of the OSA scheme, the impact of retrial phenomenon in multi-channel CRNs has not yet been analyzed. In this work, we present a continuous-time Markov chain (CTMC) model in which the blocked/preempted secondary users (SUs) enter a finite retrial group (or orbit) and re-attempt independently for service in an exponentially distributed random manner. Taking into account the inherent retrial tendency of SUs, we numerically assess the performance of the proposed scheme in terms of dropping probability and throughput of SUs.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132610774","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}
引用次数: 1
Rate performance of adaptive link selection in buffer-aided cognitive relay networks 缓冲辅助认知中继网络中自适应链路选择的速率性能
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-01-06 DOI: 10.1109/SARNOF.2016.7846749
B. Kumar, S. Prakriya
{"title":"Rate performance of adaptive link selection in buffer-aided cognitive relay networks","authors":"B. Kumar, S. Prakriya","doi":"10.1109/SARNOF.2016.7846749","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846749","url":null,"abstract":"We investigate the performance of a two-hop cognitive relay network with a buffered decode and forward (DF) relay. We derive expressions for the rate performance of an adaptive link selection-based buffered relay (ALSBR) scheme with peak power and peak interference constraints on the secondary nodes, and compare its performance with that of conventional unbuffered relay (CUBR) and conventional buffered relay (CBR) schemes. Use of buffered relays with adaptive link selection is shown to be particularly advantageous in underlay cognitive radio networks. The insights developed are of significance to system designers since cognitive radio frameworks are being explored for use in 5G systems. Computer simulation results are presented to demonstrate accuracy of the derived expressions.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114074949","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}
引用次数: 2
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信