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

2007 15th IEEE International Conference on Networks最新文献

筛选
英文 中文
Idle Times Analysis in a CSMA/CA Network CSMA/CA网络的空闲时间分析
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444127
R. Bowden, A. Coyle
{"title":"Idle Times Analysis in a CSMA/CA Network","authors":"R. Bowden, A. Coyle","doi":"10.1109/ICON.2007.4444127","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444127","url":null,"abstract":"Carrier Sense Multiple Access with Collision avoidance (CSMA/CA) is a well known and distributed Medium Access Control (MAC) protocol that enables wireless stations to communicate with one another using a single medium. In this paper an analysis of the times between data transmission in this protocol has been performed and results obtained. Whilst neither analytically nor numerically complex these results lead to an insight of the behavior of a CSMA/CA system that enable a robust and efficient traffic analysis of these systems.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134243955","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
RAS: A Robust Authentication Scheme for Filtering False Data in Wireless Sensor Networks RAS:无线传感器网络中过滤假数据的鲁棒认证方案
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444086
Yupeng Hu, Yaping Lin, Yonghe Liu, Weini Zeng
{"title":"RAS: A Robust Authentication Scheme for Filtering False Data in Wireless Sensor Networks","authors":"Yupeng Hu, Yaping Lin, Yonghe Liu, Weini Zeng","doi":"10.1109/ICON.2007.4444086","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444086","url":null,"abstract":"False data injection attacks not only cause user to receive incorrect reports so that make wrong decisions, but also drain out the significant sensor network energy resources. Previous filtering schemes mainly relying on pairwise key based schemes for endorsing the report. In wireless sensor networks, sharing pairwise key with other sensor nodes may be vulnerable as an intermediate node can be compromised and hence keys will be disclosed. As a result, those compromised forwarding nodes can be easily manipulated to inject false data reports by the inside attacker. Based on a pre-designed partition-overlapping key pool scheme, we propose a new robust authentication scheme (RAS) for filtering false data. In RAS, each big event is divided into several small event chunks, every one of which is endorsed by witness nodes both with dynamic authentication tokens from one-way hash chain and their secret keys pre-loaded from the key pool. This way, compromised nodes, even in possession of all endorsement keys for the data reports, will not able to fabricate or modify the reports. Analytical and simulation results show that RAS can filter false reports earlier while maintaining stronger protection against various insider attacks.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114580121","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
Improving TCP Performance: Identifying Corruption Based Packet Loss 改进TCP性能:识别基于损坏的丢包
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444120
Joel Sing, B. Soh
{"title":"Improving TCP Performance: Identifying Corruption Based Packet Loss","authors":"Joel Sing, B. Soh","doi":"10.1109/ICON.2007.4444120","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444120","url":null,"abstract":"Most TCP variants suffer a decrease in performance when used over networks that exhibit a high bit error rate, such as those that utilise wireless or satellite links. This is primarily due to TCP's inability to distinguish between congestion and corruption based packet loss. Instead, Jacobson based TCP variants assume that all loss is due to congestion. When packet loss occurs due to corruption the transmission rate is reduced in order to avoid the falsely identified congestion, rather than simply retransmitting the corrupted packets. In this paper we detail research undertaken to model network state, packet state and packet loss, allowing us to identify loss that is due to corruption. Furthermore, we propose an algorithm to identify the cause of packet loss on a probabilistic basis.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114060890","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
Improving Congestion Window Growth in Large Bandwidth Delay Product Networks 改进大带宽延迟产品网络中的拥塞窗口增长
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444117
Joel Sing, B. Soh
{"title":"Improving Congestion Window Growth in Large Bandwidth Delay Product Networks","authors":"Joel Sing, B. Soh","doi":"10.1109/ICON.2007.4444117","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444117","url":null,"abstract":"TCP performance degrades significantly when used over networks with a large bandwidth delay product. This is primarily due to the exponential and linear congestion window growth algorithms employed by Jacobson based TCP variants. In this paper we present a logarithmic window growth algorithm that is based on bandwidth estimation, allowing it to perform well regardless of the network bandwidth delay product. Implementation details are presented for this algorithm, along with results achieved via simulation.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123532861","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
A Novel Collaborative Fault-Tolerance Mechanism for Metadata Server Cluster 一种元数据服务器集群协同容错机制
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444136
Z. X. Li, Q. Wei, Y. Wang
{"title":"A Novel Collaborative Fault-Tolerance Mechanism for Metadata Server Cluster","authors":"Z. X. Li, Q. Wei, Y. Wang","doi":"10.1109/ICON.2007.4444136","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444136","url":null,"abstract":"In object-based storage system, metadata residing in metadata server (MDS) is crucial to the survival of overall system. Keeping metadata always available is becoming one of the key issues to be addressed for object-based storage system design and implementation. This paper presents a novel cooperative fault-tolerance mechanism for metadata server cluster, called Co-MDS. The Co-MDS consolidates disk space of individual MDS into a global metadata storage space and provides high fault-tolerance by distributing metadata and its parity data across collaborative metadata server cluster environment. With this mechanism, metadata is still available even when a part of metadata servers fail. Our design is transparent for applications and complies with OSD T10 standard. The experiments demonstrate that the proposed collaborative mechanism can offer high fault-tolerance and significant performance.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123581466","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 Near Optimal Antenna Assignment for MIMO Systems with Low Complexity 低复杂度MIMO系统的近最优天线分配
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444109
M. Torabzadeh, Yusheng Ji
{"title":"A Near Optimal Antenna Assignment for MIMO Systems with Low Complexity","authors":"M. Torabzadeh, Yusheng Ji","doi":"10.1109/ICON.2007.4444109","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444109","url":null,"abstract":"High performance, low complexity schedulers are challenging to develop for the downlink of multiple-input multiple-output (MIMO) cellular systems. Selection among available channels between users and the base station in a centralized way makes the problem complex. An approach to solve this problem is combinatorial optimization algorithms. In this case, the scheduling can be done in two different phases. The first phase is the user selection in which the scheduler selects a group of users based on its own criterion. The assignment scheme assigns the selected users to the transmit antennas, taking into consideration the capacity maximization in the second phase of the scheduling. Considerations related to user satisfaction, fairness, physical layer parameters, and/or traffic arrival processes in this kind of scheduler can be implemented with low complexity. For the second phase, we propose a near-optimal, low-complexity, assignment scheme, called the max difference of top two (MDTT). An intensive simulation study taking into account the mobility of users shows the superior performance of our assignment scheme.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127942351","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
An Architecture for IEEE 802.16 MAC Scheduler Design 一种IEEE 802.16 MAC调度器的体系结构设计
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444067
Tze Wei Tang, David Philip Green, M. Rumsewicz, N. Bean
{"title":"An Architecture for IEEE 802.16 MAC Scheduler Design","authors":"Tze Wei Tang, David Philip Green, M. Rumsewicz, N. Bean","doi":"10.1109/ICON.2007.4444067","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444067","url":null,"abstract":"The scheduling algorithm for IEEE 802.16 broadband wireless access system has been left open in the standard. In this paper, we consider three criteria that we have identified as important criteria for an 802.16 scheduler: Service Type differentiation, dynamic sub-frame partition and Subscriber Station differentiation. We investigate the scheduler design from a general perspective, based on these three criteria.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130377497","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
A Study of the TKIP Cryptographic DoS Attack TKIP加密DoS攻击研究
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444062
Steve Glass, V. Muthukkumarasamy
{"title":"A Study of the TKIP Cryptographic DoS Attack","authors":"Steve Glass, V. Muthukkumarasamy","doi":"10.1109/ICON.2007.4444062","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444062","url":null,"abstract":"The contribution of the paper is to study the cryptographic DoS attack in a testbed environment. We have shown the correct mechanism for an 802.11 message modification attack, described the implementation of this attack using a middleperson approach and compared the TKIP and Harkins countermeasures in a controlled environment. The cryptographic DoS attack is demonstrated to be practical and can be mounted by a single adversary with limited resources. This attack requires very little work on behalf of a hostile adversary and will bring TKIP-protected traffic to a complete halt. The threat of this attack being used to accomplish a security-level rollback should not be underestimated. The Harkins countermeasures address this threat by reacting in a more measured manner to active key recovery attacks.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311042","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}
引用次数: 16
Escalating The War On SPAM Through Practical PoW Exchange 通过实际的战俘交换升级对垃圾邮件的战争
2007 15th IEEE International Conference on Networks Pub Date : 2007-10-28 DOI: 10.1109/ICON.2007.4444132
P. Gardner-Stephen
{"title":"Escalating The War On SPAM Through Practical PoW Exchange","authors":"P. Gardner-Stephen","doi":"10.1109/ICON.2007.4444132","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444132","url":null,"abstract":"Proof-of-work (PoW) schemes have been proposed in the past. One prominent system is HASHCASH which uses cryptographic puzzles. However, work by Laurie and Clayton (2004) has shown that for a uniform PoW scheme on email to have an impact on SPAM, it would also impact on senders of legitimate email. A targeted cost PoW scheme on email is proposed as a potential solution to this problem. By selectively applying the cost to SPAM it has the potential to limit SPAM, without unduly penalizing legitimate senders. Moreover, it is constructed using only current SPAM filter technology, and a small change to the SMTP (simple mail transfer protocol). Specifically, it is argued that such a system can make sending SPAM 1,000 times more expensive than sending legitimate email (so called HAM). Also, unlike the system proposed by Liu and Camp, it does not require the complications of maintaining a reputation system.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130233380","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
History-based route selection for reactive ad hoc routing protocols 基于历史的被动自组织路由选择协议
2007 15th IEEE International Conference on Networks Pub Date : 2007-05-03 DOI: 10.1117/12.719820
S. Medidi, Peter Cappetto
{"title":"History-based route selection for reactive ad hoc routing protocols","authors":"S. Medidi, Peter Cappetto","doi":"10.1117/12.719820","DOIUrl":"https://doi.org/10.1117/12.719820","url":null,"abstract":"Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122222082","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
首页 上一页 下一页 尾页
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学术官方微信