Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.最新文献_第3页

Achieving per-stream QoS with distributed airtime allocation and admission control in IEEE 802.11e wireless LANs 在IEEE 802.11e无线局域网中利用分布式通话时间分配和准入控制实现逐流QoS

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498441

Chun-Ting Chou, S. Shankar, K. Shin

{"title":"Achieving per-stream QoS with distributed airtime allocation and admission control in IEEE 802.11e wireless LANs","authors":"Chun-Ting Chou, S. Shankar, K. Shin","doi":"10.1109/INFCOM.2005.1498441","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498441","url":null,"abstract":"To support the transmission of (high-rate and oftenbursty) multimedia data with performance guarantees in an IEEE 802.11e wireless local area network (LAN), it is crucial to design judicious algorithms for admission control and resource allocation. The traffic specification element (TSPEC) of the new IEEE 802.11e standard is used to facilitate the design of the admission control. Based on the traffic profile given in the TSPEC and the dual-token bucket regulation, a guaranteed rate is derived for our airtime-based admission control. The admission control is integrated with the contention-based enhanced distributed channel access (EDCA), which together can provide so-called \"parameterized QoS\" - as in the polling-based HCF controlled channel access (HCCA) - via a new distributed, quantitative control of stations' airtime usage. We also extend the current QoS signaling of HCCA defined in IEEE 802.11e to perform admission control for this enhanced EDCA. Furthermore, we extend the integrated scheme for QoS provisioning in ad hoc wireless LANs and design appropriate signaling procedures. We evaluate via simulation the effectiveness of this parameterized QoS-capable EDCA scheme, and demonstrate its advantages over the centralized, polling-based HCCA scheme.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"19 1","pages":"1584-1595 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90176769","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}

引用次数: 73

Low-state fairness: lower bounds and practical enforcement 低状态公平:下限和实际执行

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498529

Abhimanyu Das, Debojyoti Dutta, A. Helmy, Ashish Goel, J. Heidemann

引用次数: 8

SICTA: a 0.693 contention tree algorithm using successive interference cancellation SICTA:使用连续干扰消除的0.693争用树算法

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498469

Yingqun Yu, G. Giannakis

引用次数: 73

A delay analysis for opportunistic transmission in fading broadcast channels 衰落广播信道中机会传输的延迟分析

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498555

M. Sharif, B. Hassibi

{"title":"A delay analysis for opportunistic transmission in fading broadcast channels","authors":"M. Sharif, B. Hassibi","doi":"10.1109/INFCOM.2005.1498555","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498555","url":null,"abstract":"We consider a single-antenna broadcast block fading channel (downlink scheduling) with n users where the transmission is packet-based and all users are backlogged. We define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. This is a more stringent notion of delay than average delay and is the worst case delay among the users. A delay optimal scheduling scheme, such as round-robin, achieves the delay of mn. In a heterogeneous network and for the optimal throughput strategy where the transmitter sends the packet to the user with the best channel conditions, we derive the moment generating-function of the delay for any m and n. For large n and in a homogeneous network, the expected delay in receiving one packet by all the receivers scales as n logn, as opposed to n for the round-robin scheduling. We also show that when m grows faster than (logn)/sup r/, for some r>1, then the expected value of delay scales like mn. This roughly determines the time-scale required for the system to behave fairly in a homogeneous network. We then propose a scheme to significantly reduce the delay at the expense of a small throughput hit. We further look into two generalizations of our work: i) the effect of temporal channel correlation and ii) the advantage of multiple transmit antennas on the delay. For a channel with memory of two, we prove that the delay scales again like n logn no matter how severe the correlation is. For a system with M transmit antennas, we prove that the expected delay in receiving one packet by all the users scales like n log n/(M+O(M/sup 2//n)) for large n when M is not growing faster than logn. Thus, when the temporal channel correlation is zero, multiple transmit antenna systems do not reduce the delay significantly. However, when channel correlation is present, they can lead to significant gains by \"decorrelating\" the effective channel through means such as random beamforming.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"126 1","pages":"2720-2730 vol. 4"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84767310","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}

引用次数: 33

Optimal peer selection for P2P downloading and streaming P2P下载和流媒体的最佳对等选择

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498437

M. Adler, Rakesh Kumar, K. Ross, D. Rubenstein, Torsten Suel, D. Yao

引用次数: 128

A dynamic adaptive acknowledgment strategy for TCP over multihop wireless networks 基于多跳无线网络的TCP动态自适应确认策略

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498465

R. Oliveira, T. Braun

{"title":"A dynamic adaptive acknowledgment strategy for TCP over multihop wireless networks","authors":"R. Oliveira, T. Braun","doi":"10.1109/INFCOM.2005.1498465","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498465","url":null,"abstract":"Multihop wireless networks based on the IEEE 802.11 MAC protocol are promising for ad hoc networks in small scale today. The 802.11 protocol minimizes the well-known hidden node problem but does not eliminate it completely. Consequently, the end-to-end bandwidth utilization may be quite poor if the involved protocols do not interact smoothly. In particular, the TCP protocol does not manage to obtain efficient bandwidth utilization because its congestion control mechanism is not tailored to such a complex environment. The main problems with TCP in such networks are the excessive amount of both spurious retransmissions and contention between data and acknowledgment (ACK) packets for the transmission medium. In this paper, we propose a dynamic adaptive strategy for minimizing the number of ACK packets in transit and mitigating spurious retransmissions. Using this strategy, the receiver adjusts itself to the wireless channel condition by delaying more ACK packets when the channel is in good condition and less otherwise. Our technique not only improves bandwidth utilization but also reduces power consumption by retransmitting much less than a regular TCP does. Extensive simulation evaluations show that our scheme provides very good enhancements in a variety of scenarios.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"16 1","pages":"1863-1874 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90632399","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}

引用次数: 108

BARD: Bayesian-assisted resource discovery in sensor networks 传感器网络中的贝叶斯辅助资源发现

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498317

Fred Stann, J. Heidemann

{"title":"BARD: Bayesian-assisted resource discovery in sensor networks","authors":"Fred Stann, J. Heidemann","doi":"10.1109/INFCOM.2005.1498317","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498317","url":null,"abstract":"Data dissemination in sensor networks requires four components: resource discovery, route establishment, packet forwarding, and route maintenance. Resource discovery can be the most costly aspect if meta-data does not exist to guide the search. Geographic routing can minimize search cost when resources are defined by location, and hash-based techniques like data-centric storage can make searching more efficient, subject to increased storage cost. In general, however, flooding is required to locate all resources matching a specification. In this paper, we propose BARD, Bayesian-assisted resource discovery, an approach that optimizes resource discovery in sensor networks by modeling search and routing as a stochastic process. BARD exploits the attribute structure of diffusion and prior routing history to avoid flooding for similar queries. BARD models attributes as random variables and finds routes to arbitrary value sets via Bayesian estimation. Results of occasional flooded queries establish a baseline probability distribution, which is used to focus additional queries. Since this process is probabilistic and approximate, even partial matches from prior searches can still reduce the scope of search. We evaluate the benefits of BARD by extending directed diffusion and examining control overhead with and without our Bayesian filter. These simulations demonstrate a 28% to 73% reduction in control traffic, depending on the number and locations of sources and sinks.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"15 1","pages":"866-877 vol. 2"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90687501","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

Non-pipelined relay improves throughput performance of wireless ad-hoc networks 非流水线中继提高了无线自组织网络的吞吐量性能

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/infcom.2005.1497916

Aravind Velayutham, K. Sundaresan, Raghupathy Sivakumar

{"title":"Non-pipelined relay improves throughput performance of wireless ad-hoc networks","authors":"Aravind Velayutham, K. Sundaresan, Raghupathy Sivakumar","doi":"10.1109/infcom.2005.1497916","DOIUrl":"https://doi.org/10.1109/infcom.2005.1497916","url":null,"abstract":"The communication model typically assumed in wireless ad-hoc networks is based on a traditional \"pipelined relay\" (PR} strategy. In PR, an end-to-end flow has multiple outstanding packets (or data units) along the path from the source to the destination. In this paper, we argue that due to several unique properties of wireless ad-hoc networks, PR can be fundamentally improved upon. We present a new non-pipelined relay (nPR) strategy, where end-to-end flows have exactly one outstanding packet (or data unit) along the end-to-end path. We show that nPR has the following properties: (i) under idealized network conditions, it provides performance improvement, in terms of end-to-end throughput capacity and network transport capacity over PR, and achieves proportional fairness; and (ii) under practical network conditions, it further increases the above performance improvements, both in terms of the throughput achieved, and in terms of the fairness between flows. Finally, we present a forwarding protocol that practically realizes nPR. Through analysis and ns2 based packet level simulations, we evaluate the performance of the proposed strategy, and that of the forwarding protocol.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"89 2 1","pages":"477-490 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90976786","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}

引用次数: 7

Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach 在传感器网络中过滤虚假数据的组重键:一种基于预分布和本地协作的方法

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1497918

Wensheng Zhang, G. Cao

{"title":"Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach","authors":"Wensheng Zhang, G. Cao","doi":"10.1109/INFCOM.2005.1497918","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1497918","url":null,"abstract":"When a sensor network is deployed in hostile environments, the adversary may compromise some sensor nodes, and use the compromised nodes to inject false sensing reports or modify the reports sent by other nodes. In order to defend against the attacks with low cost, researchers have proposed symmetric group key-based en-route filtering schemes, such as SEF [F. Ye et al., March 2004] and I-LHAP [S. Zhu et al., 2004]. However, if the adversary has compromised a large number of nodes, many group keys can be captured, and the filtering schemes may become ineffective or even useless. To deal with node compromise, the compromised nodes should be identified and the innocent nodes should update their group keys. Some existing intruder identification schemes can be used to identify the compromised nodes, but most existing group rekeying schemes are not suitable for sensor networks since they have large overhead and are not scalable. To address the problem, we propose a family of predistribution and local collaboration-based group rekeying (PCGR) schemes. These schemes are designed based on the ideas that future group keys can be preloaded to the sensor nodes before deployment, and neighbors can collaborate to protect and appropriately use the preloaded keys. Extensive analyses and simulations are conducted to evaluate the proposed schemes, and the results show that the proposed schemes can achieve a good level of security, outperform most previous group rekeying schemes, and significantly improve the effectiveness of filtering false data.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"23 1","pages":"503-514 vol. 1"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91365459","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}

引用次数: 181

Capacity of packetized voice services over time-shared wireless packet data channels 分时无线分组数据信道上的分组话音业务容量

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Pub Date : 2005-03-13 DOI: 10.1109/INFCOM.2005.1498480

Patrick Hosein

{"title":"Capacity of packetized voice services over time-shared wireless packet data channels","authors":"Patrick Hosein","doi":"10.1109/INFCOM.2005.1498480","DOIUrl":"https://doi.org/10.1109/INFCOM.2005.1498480","url":null,"abstract":"In traditional CDMA wireless networks, real-time services, such as circuit-switched voice, are transported over the air via synchronous channels because of their stringent delay requirements. In the third generation networks (3G), IxEV-DV [A.Soong et al., 2003] and HSDPA [E. Dahlman et al., 1998], an additional time shared channel was introduced on the forward link to support data services for which delay requirements are less stringent. The IxEV-DO [P. Bender et al., 2000] standard provides a single time-shared forward link channel and no synchronous channels since it was designed primarily for data services. It has recently been suggested that certain voice services (e.g.. Voice over IP (VoIP) and push-to-talk (PTT)), can be efficiently transported over such time-shared channels since they have less stringent delay requirements compared to circuit-switched voice. In this paper we investigate the capacity of VoIP users over these time-shared channels and investigate the sensitivity to various base station (BS) and mobile station (MS) design parameters, algorithms and features. Note that detailed simulations of each standard is not provided but rather a comparative approach is used whereby we investigate specific features of each standard. Our focus is on the forward channel since code division multiplexing is performed in the reverse link and hence comparable user capacities are achieved.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"9 1","pages":"2032-2043 vol. 3"},"PeriodicalIF":0.0,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80527983","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}

引用次数: 34