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

2011 Wireless Telecommunications Symposium (WTS)最新文献

筛选
英文 中文
Telco 2015: Re-envision the future of mobile communications 电信2015:重新展望移动通信的未来
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960830
Rob van den Dam, Ekow Nelson
{"title":"Telco 2015: Re-envision the future of mobile communications","authors":"Rob van den Dam, Ekow Nelson","doi":"10.1109/WTS.2011.5960830","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960830","url":null,"abstract":"Telco 2015 is IBM's analysis of four plausible scenarios that might emerge over the next 5–10 years, based on the trajectory and interplay of two uncertainties: future addressable market growth and industry competition/integration structure.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129361437","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}
引用次数: 3
Algorithms to accelerate rare event simulation with Markov chain modeling in wireless telecommunications networks 利用马尔可夫链模型加速无线通信网络中罕见事件仿真的算法
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960826
I. Lokshina
{"title":"Algorithms to accelerate rare event simulation with Markov chain modeling in wireless telecommunications networks","authors":"I. Lokshina","doi":"10.1109/WTS.2011.5960826","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960826","url":null,"abstract":"The paper recommends an effective approach to estimate probability of buffer overflow in wireless telecommunications networks. The buffer overflow probability in queuing systems is defined as a rare event and can be estimated using rare event simulation with Markov chains. Two-node queuing networks are considered in this paper; and an event of buffer overflow at the second node is studied. Probability of a rare event that the content of the second buffer would exceed some high level L, starting from a certain state, is analyzed. The approach is based on Markov additive representation of the buffer processes, leading to exponential change of measure, which is used in an Importance sampling method. The examples, considered in this paper, confirm that when the first buffer is finite, the relative error is bound independent of some high level L. However, when the first buffer is infinite, a natural extension of exponential change of measure for finite buffer case is proposed. The relative error is shown to be bound independent of L only when at the second node is a bottleneck, i.e. buffer overflow may occur. However, when at the first node is a bottleneck, experimental results confirm that the relative error is linearly bound to the level L. Two efficient rare event simulation algorithms, based on the Importance sampling and Cross-entropy methods, are developed and applied to accelerate the overflow probability simulation with Markov chain modeling in wireless telecommunications networks. Numerical examples and simulation results are provided.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129127423","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}
引用次数: 3
Cramer-von Mises test based spectrum sensing for cognitive radio systems 基于Cramer-von Mises测试的认知无线电系统频谱感知
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960831
Thuc Kieu-Xuan, Insoo Koo
{"title":"Cramer-von Mises test based spectrum sensing for cognitive radio systems","authors":"Thuc Kieu-Xuan, Insoo Koo","doi":"10.1109/WTS.2011.5960831","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960831","url":null,"abstract":"In this paper, Cramer-von Mises test is utilized to derive a novel sensing method called Cramer-von Mises test based spectrum sensing, in which the spectrum sensing is performed by comparing the probability distribution of the observations with the one of the noise. Furthermore, a sensing algorithm for unknown noise is also proposed for the case that the noise distribution is unknown to the cognitive terminals. It is shown by numerical results that under the same conditions, the proposed Cramer-von Mises test based spectrum sensing always outperforms the energy detection based spectrum sensing significantly, especially in low SNR regime and small number of observed samples.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125695401","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}
引用次数: 12
Effect of the number of clusters on the performance of Cooperative Network Coding 簇数对协同网络编码性能的影响
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960878
G. Arrobo, R. Gitlin
{"title":"Effect of the number of clusters on the performance of Cooperative Network Coding","authors":"G. Arrobo, R. Gitlin","doi":"10.1109/WTS.2011.5960878","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960878","url":null,"abstract":"Cooperative Network Coding synergistically integrates cluster-based Cooperative Communications and Network Coding to provide high performance by decreasing the outage probability and increasing the network reliability. In this paper, we investigate the effect of the number of hops on the performance of Cooperative Network Coding and analyze different scenarios. Cooperative Network Coding provides a constant throughput when the connectivity (cooperation among the nodes) r is at least 8, and is not sensitive to the probability of transmission loss of a link. When the connectivity r is 4, Cooperative Network Coding maintains the same constant property for the throughput for a number of node per cluster greater or equal than 12 and 14 when the probability of transmission loss of a link 0.1 and 0.25, respectively. Generally, in contrast to multihop ad-hoc networks, where the probability of successful reception exponentially decreases with the number of hops, we demonstrate that Cooperative Network Coding is relatively insensitive to throughput degradation due to the increasing of number of hops.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133134122","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
A reliable, energy efficient memory repository built from an unreliable distributed sensor network 一个可靠的，节能的存储库建立在一个不可靠的分布式传感器网络
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960864
P. Gaynor, D. Coore
{"title":"A reliable, energy efficient memory repository built from an unreliable distributed sensor network","authors":"P. Gaynor, D. Coore","doi":"10.1109/WTS.2011.5960864","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960864","url":null,"abstract":"The energy costs of transferring data from sources in Wireless Sensor Networks (WSNs) to sinks at the edge of the network are high. These high costs have generated much interest in data storage strategies within the WSN. The frequently dangerous and power limited conditions in which nodes are required to operate can however result in the loss of nodes that are vital data storage points. We extend work on a reliability enhancing WSN data storage strategy called Address Coding that provides power efficient self organizing backup capability in networks of homogeneous nodes. We show that the asymptotic energy cost per backup is lower with Address Coding than it would be for a naive storage strategy based on AODV. We also show that probabilistic flooding can be applied to Address Coding, yielding significant reduction in energy cost with negligible loss in reliability.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115626536","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
Wireless Medication Management System: Design and performance evaluation 无线用药管理系统的设计与性能评价
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960858
U. Varshney
{"title":"Wireless Medication Management System: Design and performance evaluation","authors":"U. Varshney","doi":"10.1109/WTS.2011.5960858","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960858","url":null,"abstract":"To keep healthcare costs under control, a high-level of medication adherence, or compliance with medication regimen, must be achieved. In this paper, we show how wireless technologies can be used to improve medication adherence. More specifically, we present the design, operation, and evaluation of a wireless medication system, termed Smart Medication Management System (SMMS). We also present multiple metrics for quality of service and an analytical model for evaluating the medication adherence. The performance results show that very high medication adherence is achievable by SMMS for single and multiple medications even for patients with mild cognitive deficiency. The performance of context-aware reminders as implemented by SMMS is found to be most effective as compared to other interventions. Several powerful \"composite\" interventions are also proposed and evaluated for medication adherence. The results also show that with increasing hospitalization cost the healthcare savings due to improved medication adherence become even more significant. The proposed work forms the basis to provide personalized interventions to patients for improving medication adherence in multiple surroundings using wireless technologies.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114621351","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}
引用次数: 14
A distributed collision-free time slot and channel assignment algorithm for OFDM/TDMA wireless relay networks OFDM/TDMA无线中继网络的分布式无冲突时隙和信道分配算法
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960866
Vida Ferdowsi, K. Mitchell
{"title":"A distributed collision-free time slot and channel assignment algorithm for OFDM/TDMA wireless relay networks","authors":"Vida Ferdowsi, K. Mitchell","doi":"10.1109/WTS.2011.5960866","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960866","url":null,"abstract":"In wireless multi-hop networks employing OFDM/TDMA, a collision-free time slot assignment is equal to finding a matching set in the network routing graph if an exclusive node (single hop) interference model is assumed. In order to maximize throughput, one must compute the maximum weighted matching set of the routing graph. Since the exclusive node interference model does not take into account interference caused by hidden terminals, two-hop interfering links should be scheduled on different channels during a same time slot. For this purpose, we introduce a distributed scheduling algorithm that assigns both time slots and channels to wireless transmission links in a conflict free manner. The suggested algorithm is a greedy solution which finds the local maximum weight of the links. Furthermore, the proposed algorithm can incorporate the effects of changes in topology and routing. We present simulation results for networks where all nodes use a single-radio antenna, the MAC layer protocol is synchronized OFDM, and each channel uses TDMA. Comparisons are made using the proposed algorithm and the three-way handshaking algorithm suggested in the 2004 WiMAX standard.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124477380","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
On the optimal subcarrier mapping scheme in OFDM decode-and-forward relay systems OFDM译码转发中继系统中最优子载波映射方案研究
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960845
E. Kočan, M. Pejanovic, Z. Veljovic
{"title":"On the optimal subcarrier mapping scheme in OFDM decode-and-forward relay systems","authors":"E. Kočan, M. Pejanovic, Z. Veljovic","doi":"10.1109/WTS.2011.5960845","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960845","url":null,"abstract":"BER performance of the DPSK (Differentially Phase Shift Keying) modulated dual-hop OFDM based DF (Decode and Forward) relay system, implementing subcarrier mapping (SCM) at the relay (R) station, is examined. Closed form BER expressions are derived for the two SCM schemes, denoted as BTB SCM (Best-to-Best Subcarrier Mapping) and BTW SCM (Best-to-Worst Subcarrier Mapping) in the scenario with Rayleigh fading on both hops. The accuracy of the obtained analytical results is verified through comparison with the simulation results. It is shown that BTB SCM scheme achieves the lowest BER results for all SNRs (Signal-to-Noise Ratios) of interest, which approves it to be the optimal SCM scheme in dual-hop OFDM DF relay systems, as it has already been known that the same SCM scheme maximizes the capacity.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121754763","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}
引用次数: 12
BER analysis of OFDM signals on frequency-selective Rician fading channels 频率选择信道上OFDM信号的误码率分析
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960843
Zhiwei Mao, Julian Cheng
{"title":"BER analysis of OFDM signals on frequency-selective Rician fading channels","authors":"Zhiwei Mao, Julian Cheng","doi":"10.1109/WTS.2011.5960843","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960843","url":null,"abstract":"Bit-error rate (BER) performance of coded orthogonal frequency division multiplexing (OFDM) signals on frequency-selective Rician fading channels is studied in this paper. The means and the cross-correlations of frequency-selective Rician fading channels seen by OFDM subcarriers are first derived. Then based on a pairwise error probability (PEP) analysis, the mean vector and the cross-correlation matrix are used to obtain an upper bound of the overall BER in a closed-form for coded OFDM signals. Numerical examples are presented to compare the proposed upper bound of the overall BERs and the overall BERs obtained by simulations.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129291031","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
Performance analysis of opportunistic spectrum access in heterogeneous wireless networks 异构无线网络中机会频谱接入的性能分析
2011 Wireless Telecommunications Symposium (WTS) Pub Date : 2011-04-13 DOI: 10.1109/WTS.2011.5960885
Q. Xie, Qing-An Zeng
{"title":"Performance analysis of opportunistic spectrum access in heterogeneous wireless networks","authors":"Q. Xie, Qing-An Zeng","doi":"10.1109/WTS.2011.5960885","DOIUrl":"https://doi.org/10.1109/WTS.2011.5960885","url":null,"abstract":"A critical shortage of spectrum resources and the underutilization of the licensed spectrum urge people to discover new approaches to efficiently utilize the spectrum resources. Opportunistic spectrum access (OSA) has been considered to be a good approach to exploit spectral resources and improve licensed spectral utilization. In this paper, based on this idea, we model and analyze one type of network (i.e., main network) overlaid by another type of network. The main network is defined as primary network while the other type of network is called secondary network. A centralized network access protocol is adopted in primary network and secondary network uses a distributed network access protocol. The system performance is investigated through extensive simulations. The obtained results show that channel utilization can be improved by about 50% compared with traditional sharing spectrum model in a single network. We also observe that there is tradeoff between the blocking probability of calls in primary network and the throughput of OSA network. Therefore, the system performance can be dynamically controlled.","PeriodicalId":307560,"journal":{"name":"2011 Wireless Telecommunications Symposium (WTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128915049","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学术官方微信