2008 IEEE International Networking and Communications Conference最新文献

筛选
英文 中文
Enhanced D-Tree - An Index Structure For Window Queries In Location Based Services 增强型D-Tree——基于位置的服务中窗口查询的索引结构
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562704
M. Vijayalakshmi, A. Kannan
{"title":"Enhanced D-Tree - An Index Structure For Window Queries In Location Based Services","authors":"M. Vijayalakshmi, A. Kannan","doi":"10.1109/INCC.2008.4562704","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562704","url":null,"abstract":"Location based services is considered as a killer application in the wireless data market that provide information based on locations specified in the queries. We consider wireless data broadcasting as a way of disseminating information to a massive number of users. To address the issues of responsiveness, energy consumption and bandwidth contention in wireless communications, an index has to minimize the search time and maintain a small storage overhead. A linear index structure based on the D-tree is used to support location dependent queries, which is reduced to planar point queries. In this paper, we propose a modified D-tree index structure for processing location dependent information focusing on window queries via wireless data broadcast in a mobile environment. Hilbert curve is used to reduce the data regions that have to be searched from the whole space. Filtering mechanisms are used to find the real answer set. To improve the query processing two techniques namely, fixed grid assignment by which the given space is partitioned into several disjoint sub-grids and caching mechanism that improves access latency were used.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128984237","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
On Error-Constrained Data Throughput of Rapid Symbol Duration Adaptation with Imperfect Channel Information 不完全信道信息下符号持续时间快速自适应的错误约束数据吞吐量研究
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562699
D.C. Lee, M. Naeem, S. Xue
{"title":"On Error-Constrained Data Throughput of Rapid Symbol Duration Adaptation with Imperfect Channel Information","authors":"D.C. Lee, M. Naeem, S. Xue","doi":"10.1109/INCC.2008.4562699","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562699","url":null,"abstract":"This paper quantitatively analyzes the effect of noisy outdated channel estimation on symbol-by-symbol (SBS) adaptation. We consider a rudimentary yet simple duration adaptation policy, which prescribes the momentary symbol rate as a linear function of the channel estimation. We present an optimization of such a simple policy to have an error-constrained data throughput as high as possible. The results shows that even with such a rudimentary adaptation policy and with a simple channel estimation scheme, the SBS adaptation achieves significant throughput gains over a frame-by-frame (FBF) adaptation.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121385581","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
Spectral Detection and Time Delay Estimation of a Phase Coded Signal Corrupted by Colored Observation Noise 彩色观测噪声干扰下相位编码信号的频谱检测与时延估计
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562698
S. Awais, M.B. Malik
{"title":"Spectral Detection and Time Delay Estimation of a Phase Coded Signal Corrupted by Colored Observation Noise","authors":"S. Awais, M.B. Malik","doi":"10.1109/INCC.2008.4562698","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562698","url":null,"abstract":"This paper investigates frequency domain detection of a phase coded signal for unknown arrival time and amplitude in radar applications. The signal is barker coded pulse. A sub-optimal detector, i.e. generalized likelihood ratio test (GLRT) is used which replaces the unknown parameters by their maximum likelihood estimates and then pulse embedded in colored noise is detected. The main advantage of this scheme is that the case of colored noise can be handled. The spectral detector is evaluated through Monte Carlo (MC) simulations and receiver operating characteristic (ROC) is plotted for various signal-noise scenarios.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117304698","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
A Cross-Layer Optimization Approach for Efficient Data Gathering in Wireless Sensor Networks 无线传感器网络中高效数据采集的跨层优化方法
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562700
T. Canli, F. Nait-Abdesselam, A. Khokhar
{"title":"A Cross-Layer Optimization Approach for Efficient Data Gathering in Wireless Sensor Networks","authors":"T. Canli, F. Nait-Abdesselam, A. Khokhar","doi":"10.1109/INCC.2008.4562700","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562700","url":null,"abstract":"Data collection techniques in wireless sensor networks (WSN) suffer from heavy congestion particularly at nodes closer to the sink node. In order to combat this problem, either complex MAC layer protocols have been proposed or non scalable data collection solutions have been designed. We propose a novel cross layer optimization approach that assumes a very simple MAC protocol and makes use of both routing and MAC layers information to reduce congestion, improve delivery ratio, and optimize energy usage. The proposed approach uses multiple disjoint collection trees, rooted from sink, with non overlapping duty cycles. At the MAC layer, we exploit the fact that nodes that are on different data collection trees need not to communicate with each other, hence the SMAC based wake up and sleep schedule for each tree is different. Existing multiple tree based data collection protocols have been designed primarily for fault tolerance or load balancing. For MAC layer part of our protocol, we have modified the SMAC code available in ns-2.28 to simulate our data collection scheme. Our scheme improves the data delivery ratio up to 40% for regular traffic, and reduces energy consumption by 30%.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133380138","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}
引用次数: 15
UMTS: High Speed Packet Access (HSPA) Technology UMTS:高速分组接入(HSPA)技术
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562669
S.I. Shah
{"title":"UMTS: High Speed Packet Access (HSPA) Technology","authors":"S.I. Shah","doi":"10.1109/INCC.2008.4562669","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562669","url":null,"abstract":"As of July 31, 2007, there are over 522 million 3G subscribers in the world (source: 3gtoday.com). Out of these 130 million are on UMTS, a growth of almost 100% in one year. Data services are expected to grow significantly within the next few years. Current 2.5 G and 3 G operators are already reporting that a significant proportion of usage is now due to data, implying an increasing demand for high-data-rate, content-rich multimedia services. Although current Release 99 WCDMA systems offer a maximum practical data rate of 384 kbps, the 3rd Generation Partnership Project (3GPP) have included in Release 5 of the specifications a new high-speed, low-delay feature referred to as High Speed Downlink Packet Access (HSDPA). HSDPA also known as Release 5, provides significant enhancements to the Downlink compared to WCDMA Release 99 in terms of peak data rate, cell throughput, and round trip delay. This is achieved through the implementation of a fast channel control and allocation mechanism that employs such features as Adaptive Modulation and Coding and fast Hybrid Automatic Repeat Request (HARQ). Shorter Physical Layer frames are also employed High Speed Uplink Packet Access (HSUPA) (UMTS Release 6) complements the High Speed Downlink Packet Access (HSDPA) technology. As the name suggests the improvement is in the uplink where the theoretical uplink data rate can be up to 5.76 Mbps. Together, HSDPA and HSUPA offer reduced latency and much higher data rates on the downlink and uplink, theoretically as high as 14.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126253266","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}
引用次数: 8
Influence of pilot symbol configuration on data-aided phase noise estimation from a DCT basis expansion 导频符号配置对DCT基扩展数据辅助相位噪声估计的影响
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562696
J. Bhatti, M. Moeneclaey
{"title":"Influence of pilot symbol configuration on data-aided phase noise estimation from a DCT basis expansion","authors":"J. Bhatti, M. Moeneclaey","doi":"10.1109/INCC.2008.4562696","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562696","url":null,"abstract":"This contribution deals with phase noise estimation from pilot symbols. The phase noise process is approximated by an expansion of DCT basis functions containing only a few terms. We propose an algorithm that estimates the DCT coefficients without requiring detailed knowledge about the phase noise statistics. We demonstrate that the resulting (linearized) mean-square estimation error consists of two contributions: a contribution from the additive noise, that equals the Cramer-Rao lower bound, and a noise-independent contribution that results from the phase noise modeling error. Performance can be optimized by a proper selection of the pilot symbol placement scheme, the number of pilot symbols and the number of estimated DCT coefficients. Choosing the pilot symbol positions such that the DCT basis functions are orthogonal and choosing the pilot symbol ratio such that the phase estimation is accurate while minimizing the overhead energy loss leads to considerable performance improvement as compared to other pilot symbol configurations.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115689796","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}
引用次数: 8
Low Correlation Sequences for CDMA 用于CDMA的低相关序列
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562671
G. Garg
{"title":"Low Correlation Sequences for CDMA","authors":"G. Garg","doi":"10.1109/INCC.2008.4562671","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562671","url":null,"abstract":"Summary form only given. Low-correlation pseudorandom sequences find applications in navigation (global positioning system), radar ranging, cryptography, signal synchronization, spread-spectrum communications, multipath resolution and signal identification in multiple-access communication systems. In direct-sequence code division multiple access (DS-CDMA) systems, low-correlation spreading sequences are employed to separate the signals of different users. The first half of this tutorial would focus on the properties and applications of some binary sequence families (Gold, Kasami). Thereafter, we discuss some quaternary sequence families - Family A and Family S(2). Towards the end, we present our recent results on QAM sequences.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128505994","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
A simple cross-layer approach to reduce duplicate acknowledgements for TCP over WLAN 一个简单的跨层方法,以减少重复确认的TCP在WLAN上
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562693
A. Hussain, M. Akbar, M. A. Cheema
{"title":"A simple cross-layer approach to reduce duplicate acknowledgements for TCP over WLAN","authors":"A. Hussain, M. Akbar, M. A. Cheema","doi":"10.1109/INCC.2008.4562693","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562693","url":null,"abstract":"TCP was designed to perform on wired networks, where packet loss is mostly caused by congestion, as compared to wireless networks, where losses due to error in channel are more likely. Hence TCP respond to all kind of losses by invoking congestion control and avoidance schemes resulting in performance degradation. Several solutions for the improvement of TCP over wireless link have been proposed which are divided into four broad categories, namely, transport layer, link layer, cross layer and split connection schemes. Wireless link layer protocol 802.11 is required to receive acknowledgment of every frame it sends, which is too conservative. This paper presents an improved delayed-ACK for wireless LANs (IDAWL), a new cross layer approach which reduces acknowledgments at link layer which a sender get, hence it eliminates the duplication of acknowledgement at link layer and transport layer. It is variation of DAWL in which ACK number of the TCP-ACK is sent at a MAC level and TCP ACK is discarded. This cross-layer approach leads to the local generation of the TCP acknowledgment of the downstream TCP data at the access point (AP). The performance of the proposed scheme is evaluated over NS-2 by comparing it with IEEE 802.11 and DAWL. The results show a significant improvement in TCP goodput.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116782277","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}
引用次数: 5
Performance Loss Due to Imperfect Knowledge of Offered Load in CAC Policies 由于不完全了解CAC策略中提供的负载而导致的性能损失
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562691
M. Naeem, D.C. Lee
{"title":"Performance Loss Due to Imperfect Knowledge of Offered Load in CAC Policies","authors":"M. Naeem, D.C. Lee","doi":"10.1109/INCC.2008.4562691","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562691","url":null,"abstract":"In this paper, we investigate the effect of imperfect traffic load assessment on the performance of call admission control (CAC) policies in a circuit-switched cellular network. We study two policies that are designed to achieve optimal average data throughput of the system - the optimal stationary randomized call admission control policy (DCA-CAC) and the optimal static fixed-set-partition policy (FCA-FSP). We analyze and numerically evaluate the performance of these polices, which are optimized for somewhat erroneous assessment of the subscribers' call traffic load. The evaluation is done in two-fold 1) impact on throughput 2) impact on blocking probability.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114369588","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
Quality of Service: Model, Algorithms and Architectures 服务质量:模型、算法和体系结构
2008 IEEE International Networking and Communications Conference Pub Date : 2008-05-01 DOI: 10.1109/INCC.2008.4562672
A. Haque
{"title":"Quality of Service: Model, Algorithms and Architectures","authors":"A. Haque","doi":"10.1109/INCC.2008.4562672","DOIUrl":"https://doi.org/10.1109/INCC.2008.4562672","url":null,"abstract":"Summary form only given. This presentation will define an abstract model for quality of service. It will cover the evolution of QoS algorithms and associated implementation architectures over the years. The different components of a QoS solution will be discussed and various scheduling algorithms will be compared.","PeriodicalId":339313,"journal":{"name":"2008 IEEE International Networking and Communications Conference","volume":"1959 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129406894","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
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学术官方微信