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

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.最新文献

筛选
英文 中文
Process estimation through a self-organizing collaborative wireless sensor network 基于自组织协同无线传感器网络的过程估计
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378940
R. Verdone, A. Conti, D. Sangiorgi, D. Dardari
{"title":"Process estimation through a self-organizing collaborative wireless sensor network","authors":"R. Verdone, A. Conti, D. Sangiorgi, D. Dardari","doi":"10.1109/GLOCOM.2004.1378940","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378940","url":null,"abstract":"An analytical framework for the performance evaluation of a dense energy-efficient wireless sensor network (WSN), enabling distributed collaborative environment monitoring, is developed. We address the estimation of a target multidimensional process by means of samples captured by nodes randomly and uniformly distributed and transmitted to a collector through a self-organizing clustered network. The estimation in the presence and in the absence of collaborative signal processing with different types of data interpolators are compared in terms of both process estimation error and network life-time. Our analytical model, aimed at providing useful information for WSN design, takes many aspects into account, such as distance-dependent path loss and shadowing, energy consumption, information routing, process estimation quality, node density, transmission protocol and system parameters. As an example result, fixing requirements on estimation errors and network life-time, the node density is found as a function of the system/protocol parameters.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"100 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117291390","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
Improving throughput and fairness for MIMO ad hoc networks using antenna selection diversity 利用天线选择分集提高MIMO自组网的吞吐量和公平性
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378972
Minyoung Park, R. Heath, S. Nettles
{"title":"Improving throughput and fairness for MIMO ad hoc networks using antenna selection diversity","authors":"Minyoung Park, R. Heath, S. Nettles","doi":"10.1109/GLOCOM.2004.1378972","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378972","url":null,"abstract":"This paper presents a new MAC protocol, mitigating interference using multiple antennas with antenna selection (MIMA/AS-MAC), which uses multiple antennas to mitigate both interference from neighboring transmitters and fading. The proposed MIMA/AS-MAC protocol employs spatial multiplexing with antenna subset selection for data packet transmission, while using the Alamouti space-time code for control of packet transmission. To study its performance, the MIMA/AS-MAC was implemented in the ns-2 network simulator for a system with two antennas. The total network throughput and fairness between two traffic flows was measured. The results show that the MIMA/AS-MAC system outperforms the previously proposed MIMA-MAC scheme, which does not use an antenna selection scheme, as well as a hybrid of the IEEE 802.11 MAC protocol with Alamouti encoding.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117352561","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}
引用次数: 63
Opportunistic scheduling for streaming users in high-speed downlink packet access (HSDPA) 高速下行分组接入(HSDPA)中流用户的机会调度
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1379126
Arsalan Farrokh, V. Krishnamurthy
{"title":"Opportunistic scheduling for streaming users in high-speed downlink packet access (HSDPA)","authors":"Arsalan Farrokh, V. Krishnamurthy","doi":"10.1109/GLOCOM.2004.1379126","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1379126","url":null,"abstract":"High-speed downlink packet access (HSDPA) achieves high data rates and high spectral efficiency by using adaptive modulation and coding (AMC) schemes and employing multi-code operation of CDMA. In this paper we present opportunistic algorithms for scheduling HSDPA users and selecting modulation and coding schemes that exploit channel variations to increase the probability of an uninterrupted media play-out. First we introduce a discrete event model for HSDPA system to transform the scheduling problem for providing an uninterrupted play-out to a feasibility problem that considers short term and long term quality of service (QoS) constraints. A methodology for obtaining a feasible solution is then proposed by starting with a so called stable algorithm that satisfies the long term QoS constraints (if possible with any scheduling policy). Next, we present stochastic approximation algorithms that adapt the parameters of the stable algorithm in a way that a feasible point for the short term QoS is reached within the feasibility region of the long term QoS.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116043645","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}
引用次数: 21
Full-diversity STBCs for block-fading channels from cyclic codes 循环码分组衰落信道的全分集stbc
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378010
U. Sripati, B. Rajan, V. Shashidhar
{"title":"Full-diversity STBCs for block-fading channels from cyclic codes","authors":"U. Sripati, B. Rajan, V. Shashidhar","doi":"10.1109/GLOCOM.2004.1378010","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378010","url":null,"abstract":"Viewing an n-length vector over F(q/sup m/) (the finite field of q/sup m/ elements) as an m/spl times/n matrix over F/sub q/, by expanding each entry of the vector with respect to a basis of F(q/sup m/) over F/sub q/, the rank weight of the n-length vector over F(q/sup m/) is the rank of the corresponding m/spl times/n matrix over F/sub q/. Using the appropriate discrete Fourier transform (DFT), it is known that, under some conditions, n-length cyclic codes over F(q/sup m/), (n|q/sup m/-1 and m/spl les/n), have full-rank (=m). Using this result, we obtain designs for full-diversity space time block codes (STBCs) suitable for block-fading channels from n length cyclic codes over F(q/sup m/). These STBCs are suitable for m transmit antennas over signal sets matched to F/sub q/, where q=2 or q is a prime of the form 4k+1, (k=1, 2, ...). We also present simulation results which illustrate the performance of a few of these STBCs and show that our codes perform better than the well known codes for block-fading channels.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116367858","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}
引用次数: 11
Joint source-channel coding of scalable video 可扩展视频的联合源信道编码
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378475
G. Feideropoulou, B. Pesquet-Popescu, J. Belfiore
{"title":"Joint source-channel coding of scalable video","authors":"G. Feideropoulou, B. Pesquet-Popescu, J. Belfiore","doi":"10.1109/GLOCOM.2004.1378475","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378475","url":null,"abstract":"We present a joint source-channel coding scheme developed for transmitting scalable video over a noisy channel. This scheme is based on a 2D+t motion-compensated wavelet decomposition of the video sequence, on a vector quantization and on an optimal linear labelling. In P. Knagenhjelm and E. Agrell's work (IEEE Trans. Information Theory, vol. IT 42, pp. 1139-1151, 1996), it is shown that on binary discrete channels, the channel distortion is minimized by linear labelling. In this paper, we provide a vector quantization method dependent on a linear labelling which minimizes not only the channel distortion but at the same time the distortion of our video source. Moreover, by exploiting a statistical model of the spatio-temporal wavelet coefficients we adapt the vector quantizer to the non-stationarity of the source. Simulation results demonstrate the robustness of this scheme under noisy channel conditions.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116416323","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}
引用次数: 11
An Internet-worm early warning system 网络蠕虫早期预警系统
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378411
Shigang Chen, S. Ranka
{"title":"An Internet-worm early warning system","authors":"Shigang Chen, S. Ranka","doi":"10.1109/GLOCOM.2004.1378411","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378411","url":null,"abstract":"We propose an Internet-worm early warning system, which integrates a set of novel techniques that automatically detect the concerted scan activity of an on-going worm attack. It is able to issue warning at the early stage of worm propagation and to provide necessary information for security analysts to control the damage. The system monitors a \"used\" address space. Unlike the traditional approach that keeps track of SYN packets, it relies on RESET packets to find the scan sources, which has greater accuracy and less overhead. The system is resilient to anti-monitor measures. Particularly, a sophisticated protocol is designed to distinguish faked scan sources from real scan sources. We provide an analytical study on the properties and effectiveness of this early warning system, and back up our claims by numerical results.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116446690","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}
引用次数: 20
Experimentally derived interactions between TCP traffic and service quality over DOCSIS cable links 实验推导了TCP流量和服务质量在DOCSIS电缆链路上的相互作用
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378199
Thuy T. T. Nguyen, G. Armitage
{"title":"Experimentally derived interactions between TCP traffic and service quality over DOCSIS cable links","authors":"Thuy T. T. Nguyen, G. Armitage","doi":"10.1109/GLOCOM.2004.1378199","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378199","url":null,"abstract":"We study the effect of upstream (US) and downstream (DS) rate caps and DOCSIS media access on the end-to-end performance of broadband IP services that share a typical home-access 'cable Internet' link. Our experimental study measures the performance of actual DOCSIS equipment in a typical network configuration. We observe that modestly long lived data transfers in the DS direction can create substantial latency spikes (over 100 ms) in the shared DOCSIS segment, even when the DS rate cap is one or two megabits per second. Such spikes can have a big impact on delay-sensitive applications, such as voice over IP (VoIP), online games and interactive streaming video that may be sharing the DOCSIS link. We also experimentally characterize the impact of US and DS bandwidth asymmetry, MTU sizes, and TCP window sizes in achieving maximum performance over DOCSIS links.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123221366","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}
引用次数: 9
The effect of fading on the achievable rate of cooperative sensor networks with misinformed sensors 衰落对具有错误信息传感器的协同传感器网络可达速率的影响
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378852
Zhiyu Yang, L. Tong
{"title":"The effect of fading on the achievable rate of cooperative sensor networks with misinformed sensors","authors":"Zhiyu Yang, L. Tong","doi":"10.1109/GLOCOM.2004.1378852","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378852","url":null,"abstract":"Communication from a cooperative sensor network to a mobile access point is considered in this paper. Sensors are assumed to be informed with a global message and some nodes are misinformed with random messages. The multiple access channel is i.i.d. fading and the realization of the channel state is known to the access point only. An achievable rate is derived for the information retrieval process when multiple sensors are activated at a time. For a Gaussian multiple access channel under a total network power constraint, the optimal number of simultaneous transmissions is investigated under three fading scenarios: non-fading, unit-gain, and Rayleigh-fading. With Gaussian code books, the optimal number of simultaneous transmissions varies in the three fading environments.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123505827","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
Packing mechanisms for the IEEE 802.11n wireless LANs IEEE 802.11n无线局域网的封装机制
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378955
Yang Xiao
{"title":"Packing mechanisms for the IEEE 802.11n wireless LANs","authors":"Yang Xiao","doi":"10.1109/GLOCOM.2004.1378955","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378955","url":null,"abstract":"IEEE 802.11 WLAN products can provide up to 54 Mbps data rate, and the next generation WLAN will provide much higher data rates. However, the medium access control (MAC) was designed for lower data rates, such as 1-2 Mbps, and is not an efficient MAC. Furthermore, a theoretical throughput limit exists due to overhead and limitations of physical implementations, and therefore increasing transmission rate cannot help a lot. Designing efficient MAC strategies becomes critical and important. In this paper, we propose several MAC strategies, such as packing, concatenation, and multiple frame transmission, to overcome the fundamental overhead and to improve performance. The aim is to propose and introduce efficient new MAC not only for current IEEE 802.11 standards (.11a/.11b/.11g), but also for the next generation WLAN with higher speed and higher throughput, i.e., IEEE 802.11n.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"32 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123540437","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}
引用次数: 56
Battery-based intrusion detection 基于电池的入侵检测
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. Pub Date : 2004-11-29 DOI: 10.1109/GLOCOM.2004.1378409
G. A. Jacoby, IV NathanielJ.Davis
{"title":"Battery-based intrusion detection","authors":"G. A. Jacoby, IV NathanielJ.Davis","doi":"10.1109/GLOCOM.2004.1378409","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378409","url":null,"abstract":"This paper proposes an early warning system via a host-based form of intrusion detection that can alert security administrators to protect their corporate network(s). This innovative technique operates through the implementation of battery-based intrusion detection (B-bid) on mobile devices by correlating attacks with their impact on device power consumption using a rules-based host intrusion detection engine (HIDE). HIDE monitors power behavior to detect potential intrusions by noting irregularities of power consumption.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121913787","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}
引用次数: 74
首页 上一页 下一页 尾页
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学术官方微信