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

Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)最新文献

筛选
英文 中文
Modeling energy consumption in single-hop IEEE 802.11 ad hoc networks 在单跳IEEE 802.11自组织网络中建模能耗
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401671
Marcelo M. Carvalho, C. Margi, K. Obraczka, J. Garcia-Luna-Aceves
{"title":"Modeling energy consumption in single-hop IEEE 802.11 ad hoc networks","authors":"Marcelo M. Carvalho, C. Margi, K. Obraczka, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2004.1401671","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401671","url":null,"abstract":"This paper presents an analytical model to predict energy consumption in saturated IEEE 802.11 single-hop ad hoc networks under ideal channel conditions. The model we introduce takes into account the different operational modes of the IEEE 802.11 DCF MAC, and is validated against packet-level simulations. In contrast to previous works that attempted to characterize the energy consumption of IEEE 802.11 cards in isolated, contention-free channels (i.e., single sender/receiver pair), this paper investigates the extreme opposite case, i.e., when nodes need to contend for channel access under saturation conditions. In such scenarios, our main findings include: (1) contrary to what most previous results indicate, the radio's transmit mode has marginal impact on overall energy consumption, while other modes (receive, idle, etc.) are responsible for most of the energy consumed; (2) the energy cost to transmit useful data increases almost linearly with the network size; and (3) transmitting large payloads is more energy efficient under saturation conditions","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115619926","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}
引用次数: 88
High-performance MAC for high-capacity wireless LANs 用于高容量无线局域网的高性能MAC
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401615
Yuan Yuan, Daqing Gu, W. Arbaugh, Jinyun Zhang
{"title":"High-performance MAC for high-capacity wireless LANs","authors":"Yuan Yuan, Daqing Gu, W. Arbaugh, Jinyun Zhang","doi":"10.1109/ICCCN.2004.1401615","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401615","url":null,"abstract":"The next-generation wireless technologies, e.g., 802.11n and 802.15.3a, offer a physical-layer speed at least an-order-of-magnitude higher than the current standards. However, direct application of current MACs leads to high protocol overhead and significant throughput degradation. In this paper, we propose ADCA, a high-performance MAC that works with high-capacity physical layer. ADCA exploits two ideas of adaptive batch transmission and opportunistic selection of high-rate hosts to simultaneously reduce the overhead and improve the aggregate throughput. It opportunistically favors high-rate hosts by providing higher access probability and more access time, while ensuring each low-rate host certain minimum amount of channel access time. Simulations show that the ADCA design increases the throughput by 112% and reduces the average delay by 55% compared with the legacy DCF. It delivers more than 100 Mbps MAC-layer throughput as compared with 35 Mbps offered by the legacy MAC","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123611530","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}
引用次数: 25
A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks 基于遗传算法的混合点对点网络邻居选择策略
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401710
Simon G. M. Koo, C.S.G. Lee, Karthik N. Kannan
{"title":"A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks","authors":"Simon G. M. Koo, C.S.G. Lee, Karthik N. Kannan","doi":"10.1109/ICCCN.2004.1401710","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401710","url":null,"abstract":"BitTorrent is a popular, open-source, hybrid peer-to-peer content distribution system that is conducive for distribution of large-volume contents. In this paper, we propose a genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks, which enhances the decision process performed at the tracker for transfer coordination. We also investigate how the strategy affects system throughput and distribution efficiency as well as peer contributions. We show through computer simulations that by increasing content availability to the clients from their immediate neighbors, it can significantly improve the system performance without trading off users' satisfaction. The proposed strategy can significantly improve the efficiency of distribution, especially for low-connectivity peers, and it is suitable to deploy for online decisions","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127499463","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}
引用次数: 51
AUM: auto-update micromobility for IPv6 networks AUM: IPv6网络的自动更新微移动性
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401734
Aurbind Sharma, A. Ananda
{"title":"AUM: auto-update micromobility for IPv6 networks","authors":"Aurbind Sharma, A. Ananda","doi":"10.1109/ICCCN.2004.1401734","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401734","url":null,"abstract":"Fast and seamless localized mobility management is one of the key challenges for future \"all IP\" based communication networks. Although several proposals for micromobility management have been made in the recent past, almost all of them propose a proxy based solution for location management. In this work, we present a novel approach for providing micromobility in IPv6 networks called auto-update micromobility (AUM). AUM exploits the IPv6 addressing structure to simplify location management and also provides full support for seamless, fast handoff","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130099631","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
Intelligent extensible routing for overlay networks with embedded constraint resource planning shell: a case study with deadline based packet forwarding 具有嵌入式约束资源规划外壳的覆盖网络的智能可扩展路由:基于截止日期的数据包转发案例研究
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401597
J. Khan, Nouman Bantan
{"title":"Intelligent extensible routing for overlay networks with embedded constraint resource planning shell: a case study with deadline based packet forwarding","authors":"J. Khan, Nouman Bantan","doi":"10.1109/ICCCN.2004.1401597","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401597","url":null,"abstract":"This paper presents a fast near linear run-time system for customizable criteria based packet forwarding and route lookup. It presents the case for deadline line based packet forwarding. This system has been designed after the constraint resource planning (CRP) methodology for algorithm designs. The resulting near-optimum algorithm operates within an extensible CRP shell and uses two pluggable scheduling and forwarding heuristics to produce near-optimal performance. In this paper, we present the shell architecture, the algorithm, and the simulation results of this system for dead-line based packet forwarding","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"15 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132462143","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
An empirical evaluation of landmark placement on Internet coordinate schemes 互联网坐标方案中地标放置的实证评价
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401661
Sridhar Srinivasan, E. Zegura
{"title":"An empirical evaluation of landmark placement on Internet coordinate schemes","authors":"Sridhar Srinivasan, E. Zegura","doi":"10.1109/ICCCN.2004.1401661","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401661","url":null,"abstract":"Many applications can benefit from knowledge of latency between hosts. Recently, there have been proposals such as global network positioning (GNP) (T. S. E. Ng et al., 2002) and Internet coordinate system (ICS) (H. Lim et al., 2003) that attempt to provide this for hosts on the Internet. The schemes work by using a small set of nodes called \"landmarks\" to compute the coordinates of other hosts. In this paper, we investigate the effect of placement of landmarks on the performance of these proposals. We show that with random placement, the estimation error of these schemes varies widely. We propose heuristics for placing landmarks that show good performance. We also investigate the behaviour of these schemes with measurement errors and show that GNP is less affected by measurement errors than ICS","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130977829","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}
引用次数: 4
Differentiated quality of service: slotted ALOHA 差异化服务品质:开槽式ALOHA
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401664
Douglas Dillon
{"title":"Differentiated quality of service: slotted ALOHA","authors":"Douglas Dillon","doi":"10.1109/ICCCN.2004.1401664","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401664","url":null,"abstract":"This paper shows how the diversity slotted ALOHA multiple access scheme can very simply be extended to offer a premium quality of service to a subset of users. Diversity slotted ALOHA is a generalization of the classic slotted ALOHA in which a user transmits multiple copies of the same message. Premium users obtain a better quality of service by utilizing higher diversity, that is, by transmitting more copies of their messages than basic users","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122194017","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
TKGS: verifiable threshold-based key generation scheme in open wireless ad hoc networks TKGS:开放无线自组网中基于可验证阈值的密钥生成方案
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401580
Mohammed A. Moharrum, R. Mukkamala, M. Eltoweissy
{"title":"TKGS: verifiable threshold-based key generation scheme in open wireless ad hoc networks","authors":"Mohammed A. Moharrum, R. Mukkamala, M. Eltoweissy","doi":"10.1109/ICCCN.2004.1401580","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401580","url":null,"abstract":"Secure group-based communication services are gaining momentum in wireless ad hoc networks (WAHNs). The efficiency and scalability of these services make them suitable for supporting the inherently collaborative computing and communications activities among peer WAHN nodes as well as the growing number of group-based WAHN applications. Key management, which is comprised of dynamic key generation, assignment, and distribution, is at the heart of secure group communications. This work proposes TKGS; an efficient threshold-based key generation scheme for open WAHNs based on collaborative reconstruction of key-generation keys. To mitigate node mal-behavior, a verifiable secret sharing technique is employed, where an (authenticated) dealer node is selected to collect a set number of valid shares and generate new administrative keys. While most existing key management schemes assume reliable and trusted nodes, TKGS provides a distributed solution that is resilient to node failure and mal-behavior. A major advantage of TKGS is its small overhead; collaborative key construction is done in less than two rounds with a very high probability of success.","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"15 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133575169","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
CWT: an efficient queue urgency metric with application to high-speed packet switching CWT:一种应用于高速分组交换的高效队列紧急度量
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401732
M. Kahane, U. Barzilai, I. Elhanany
{"title":"CWT: an efficient queue urgency metric with application to high-speed packet switching","authors":"M. Kahane, U. Barzilai, I. Elhanany","doi":"10.1109/ICCCN.2004.1401732","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401732","url":null,"abstract":"Determining queue urgency (or weight) is a fundamental challenge, particularly in the context of high-speed packet switching. Weighting schemes have significant impact on the decisions made by arbitration and/or scheduling mechanism, thus directly shaping the overall performance of the system. Various weight functions, including iterative longest-queue-first (iLQF) and iterative oldest-cell-first (iOCF) have been presented in the literature. However, existing schemes suffer from limited performance in the presence of non-ideal traffic patterns. In this paper, we introduce the cumulative waiting-time (CWT) queue-weighting scheme, which is a pragmatic mechanism for dynamically determining the queue weight based on its aggregated cells waiting time","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126979844","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
Exploiting autonomous system information in structured peer-to-peer networks 利用结构化点对点网络中的自治系统信息
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969) Pub Date : 2004-10-11 DOI: 10.1109/ICCCN.2004.1401686
Ji Li, K. Sollins
{"title":"Exploiting autonomous system information in structured peer-to-peer networks","authors":"Ji Li, K. Sollins","doi":"10.1109/ICCCN.2004.1401686","DOIUrl":"https://doi.org/10.1109/ICCCN.2004.1401686","url":null,"abstract":"With the rise of peer-to-peer networks, two problems have become prominent: (1) significant network traffic among peers, to probe the latency among those peers to improve lookup performance; (2) the need for increased information flow across protocol layer boundaries, to allow for cross-layer adaptations. The particular work here focuses on improvements in structured peer-to-peer networks based on autonomous system information. We find that by using autonomous system information effectively we can achieve lookup performance approaching that based on proximity neighbor selection, but with much less network traffic. We also demonstrate improvements in replication in structured peer-to-peer networks using AS topology and scoping information. Finally, we review this approach in the context of network architecture","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122693998","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}
引用次数: 27
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信