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

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

筛选
英文 中文
Multi-Rate Multicast Congestion Control by Explicit Rate Adjustment and Multicast-encouraging TCP-friendliness 基于显式速率调整和组播鼓励tcp友好的多速率组播拥塞控制
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444069
S. Puangpronpitag
{"title":"Multi-Rate Multicast Congestion Control by Explicit Rate Adjustment and Multicast-encouraging TCP-friendliness","authors":"S. Puangpronpitag","doi":"10.1109/ICON.2007.4444069","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444069","url":null,"abstract":"Strict TCP-friendliness is a problematic issue that discourages multicast deployment on the Internet. In this paper, we therefore propose a new design of multi-rate multicast congestion control (MR-MCC) by revising our previous proposed MR-MCC protocol, namely explicit rate adjustment (ERA). In the new design, a multicast-supportive TCP-friendliness bandwidth allocation is used at intermediate nodes (routers) to motivate multicast deployment by giving more bandwidth to ERA without starving TCP. At the end node, an explicit reception rate adjustment algorithm is used. The receiver adjusts its reception rates according to the network conditions using packet-pair probe (PP). The implementation of our new ERA is done on the network simulator 2 (ns2). We demonstrate via simulations that the new ERA could provide responsiveness, fairness and the motivation for multicast deployment.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"50 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":"133153147","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}
引用次数: 3
A Hybrid Wakeup Signalling Mechanism for Periodic-Listening MAC Algorithms 周期性监听MAC算法的混合唤醒信令机制
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444131
K. Wong, D. Arvind
{"title":"A Hybrid Wakeup Signalling Mechanism for Periodic-Listening MAC Algorithms","authors":"K. Wong, D. Arvind","doi":"10.1109/ICON.2007.4444131","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444131","url":null,"abstract":"The SpeckMAC class of MAC algorithms uses periodic listening on the radio channel for duty-cycling the radio onboard the sensor nodes in order to save energy. There are currently two variants of SpeckMAC: SpeckMAC-B uses wakeup frames as the mechanism for signalling, whereas SpeckMAC-D retransmits data packets. This paper presents a novel hybrid protocol, SpeckMAC-H, which adopts an adaptive approach to improving energy efficiency by selecting the wakeup signalling mechanism depending on the type of packet to be transmitted. The performance of such an approach is evaluated on the Qualnet simulator. The data for the simulation models were derived from experiments on the ProSpeckz hardware prototype. The simulation results for Dynamic Source Routing (DSR) and Ad-hoc On-Demand Vector Routing (AODV) routing algorithms has demonstrated that SpeckMAC-H does indeed achieve higher energy-efficiency than either SpeckMAC-B and SpeckMAC-D in a majority of the simulated scenarios.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1 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":"132067522","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 New Codebook Design Scheme Based on Ant Colony Clustering 一种新的基于蚁群聚类的码本设计方案
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444111
Enqing Dong, Hongmei Hu
{"title":"A New Codebook Design Scheme Based on Ant Colony Clustering","authors":"Enqing Dong, Hongmei Hu","doi":"10.1109/ICON.2007.4444111","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444111","url":null,"abstract":"A new improved ant colony codebook design scheme is proposed by adopting frequency sensitivity measure in an original basic ant colony algorithm. The LBG (Linde-Buzo-Gray) codebook design optimization rule is adopted in the new scheme. Since the scheme decreases the probability of choosing the same cell by increasing the distortion measure, the randomization of choosing a cell is increased. The scheme can avoid achieving a local optimization solution and enhance the global search ability. The experiment result shows that the new scheme is more valuable and effective than other schemes in the convergence of codebook design and the performance of codebook.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"262 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":"132317683","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
Analysis of Generalized Optical Orthogonal Codes in Wireless Optical Networks Using BPPM 基于BPPM的无线光网络广义光正交码分析
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444081
S. Khazraei, Mohammadreza Pakravan
{"title":"Analysis of Generalized Optical Orthogonal Codes in Wireless Optical Networks Using BPPM","authors":"S. Khazraei, Mohammadreza Pakravan","doi":"10.1109/ICON.2007.4444081","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444081","url":null,"abstract":"This paper analyzes the performance of generalized optical orthogonal codes (OOC) in a wireless infrared system using code division multiple access (CDMA) technique. Since the emergence of generalized OOC s, they have been analyzed in optical fiber media, in which noise can be ignored with good approximation. But in an optical wireless system which inherently suffers from intense noise sources, generalized OOC behaves differently. The main issues of an optical wireless system are intense noise sources which degrades system performance and limited available bandwidth which is caused by multipath distortion in the channel. We believe that these analyses will help the designer of an optical wireless system, to select the best code family which satisfies the desired condition on bit error rate (BER) or required bandwidth.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"2 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":"124195530","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
A Framework for Performance Evaluation of Wireless Ad-hoc and Sensor Networks 无线自组网和传感器网络性能评估框架
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444122
R. Hekmat, Xueli An
{"title":"A Framework for Performance Evaluation of Wireless Ad-hoc and Sensor Networks","authors":"R. Hekmat, Xueli An","doi":"10.1109/ICON.2007.4444122","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444122","url":null,"abstract":"In this paper we provide a comprehensive mathematical framework for performance evaluation in ad-hoc and sensor networks. This framework can be used to compute interference, capacity, delay and energy consumption. The novelty of our work is that we address, to the best of our knowledge for the first time, all major factors that collectively affect each performance metric. Consequently, our framework can be considered as accurate and reliable. Our approach provides valuable new insights into capabilities and limitations of multi-hop point-to-point networks; and helps to mitigate some misconceptions regrading the performance of these network types. For example, we demonstrate clearly that optimizing network topologies to reduce interference does not necessarily produce the best Carrier-to-interference ratio (C/I) or the highest capacity. Also, optimum C/I is no guarantee for maximum throughput. Further we show that low energy consumption and high capacity are not incompatible properties. Our framework can be used to design ad-hoc and sensor networks with a balanced combination of performance characteristics for different application types.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"48 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":"115573506","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}
引用次数: 12
Process/Processor Mapping Based on Similarity Analysis in Heterogeneous Grid Computing Environment 异构网格计算环境下基于相似度分析的进程/处理器映射
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444075
Sugang Xu, H. Harai
{"title":"Process/Processor Mapping Based on Similarity Analysis in Heterogeneous Grid Computing Environment","authors":"Sugang Xu, H. Harai","doi":"10.1109/ICON.2007.4444075","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444075","url":null,"abstract":"This paper presents a direct approach to partitioning for resolving process/processor mapping problems in a heterogeneous grid environment. It employs a scheme of analyzing similarities in graphs to cluster processes and select processors. Based on a phase for pre-analyzing the underlying network topology, it takes the information on the underlying network topology into account to select processors during the process-partitioning procedure. During the refinement phase to add certain capabilities for jumping out of the local optima and satisfying the requirements for steady performance, we used a two-stage Kernighan-Lin (KL)-like approach in our current study without introducing any randomness. Experiments were done to assess the performance of this algorithm, and compare it to the popular KL-like algorithm with a sequential-mapping approach and a greedy-based approach to search for the initial solution. The new proposal is capable of finding better solutions than these other two approaches in most cases.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"26 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":"125115145","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}
引用次数: 3
The Capacity of MIMO-based Wireless Mesh Networks 基于mimo的无线网状网络容量
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444096
Wael Jaafar, W. Ajib, S. Tabbane
{"title":"The Capacity of MIMO-based Wireless Mesh Networks","authors":"Wael Jaafar, W. Ajib, S. Tabbane","doi":"10.1109/ICON.2007.4444096","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444096","url":null,"abstract":"Data transmission in wireless mesh networks (WMNs) has a multi-hop nature where data is originated/destinated to one source/sink node. Therefore, the transmission capacity at the physical layer depends on multiple factors such as the network topology, the access policy, and the transmission configuration. When multiple input multiple output (MIMO) technology is used at the physical layer of each node, the nodes that are geographically in the same transmission range, can transmit simultaneously. The different transmissions can be separated spatially using one of the decoding MIMO methods. In this paper, we investigate the per-node capacity in a WMN using MIMO links. We introduce the problem of the transmission configuration in WMNs, defined as the number of transmit antennas used at each node, and its effect on the network capacity. The goal of this study is to provide ideas for network architects about how to dimension wireless mesh networks in order to have an optimal capacity with minimal equipment requirements.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"67 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":"134233913","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}
引用次数: 18
An Architecture for Distributed Content Delivery Network 分布式内容交付网络的体系结构
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444113
J. Mulerikkal, I. Khalil
{"title":"An Architecture for Distributed Content Delivery Network","authors":"J. Mulerikkal, I. Khalil","doi":"10.1109/ICON.2007.4444113","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444113","url":null,"abstract":"Commercial Content Delivery Networks create their own network of servers around the globe to effectively deliver Web content to the end-users. The peering of Content Delivery Networks (CDN) would increase the efficiency of commercial CDNs. But still the high rental rates resulting from huge infrastructure cost make it inaccessible to medium and low profile clients . Academic models of peer-to-peer CDNs aim to reduce the financial cost of content distribution by forming volunteer group of servers around the globe. But their efficiency is at the mercy of the volunteer peers whose commitment is not ensured in their design. We propose a new architecture that will make use of the existing resources of common Internet users in terms of storage space, bandwidth and Internet connectivity to create a Distributed Content Delivery Network (DCDN). The profit pool generated by the infrastructure savings will be shared among the participating nodes (DCDN surrogates) which will function as an incentive for them to support DCDN. Since the system uses the limited computing resources of common internet users, we also propose a suitable load balancing (LB) algorithm so that DCDN surrogates are not burdened with heavy load and requests are fairly assigned to them. Simulations have been carried out and the results show that the proposed architecture (with LB) can offer same or even better performance as that of commercial CDN.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"38 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":"132822708","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}
引用次数: 45
On Diverse Routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks 光网状网络中共享风险链路组(SRLGs)的不同路由
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444092
Viet Q. Phung, D. Habibi, H. Nguyen
{"title":"On Diverse Routing for Shared Risk Link Groups (SRLGs) in Optical Mesh Networks","authors":"Viet Q. Phung, D. Habibi, H. Nguyen","doi":"10.1109/ICON.2007.4444092","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444092","url":null,"abstract":"We study the diverse routing problem in optical mesh networks under shared risk link groups (SRLGs) constraints. We first generalize the diverse routing formulation in [1] for finding two disjoint paths into K shortest span-disjoint paths. We then propose three integer linear programming (ILP) models for finding K shortest span-disjoint paths (KSDP), maximum span-disjoint paths (MSDP) and K least-coupled paths (KLCP) in SRLG networks. The complexity analysis and the simulation results show that the complexity of our proposed models are not dependent on the number of disjoint paths required, but a polynomial time algorithm. In addition, the proposed models are still solvable for most optical mesh networks which have up to a few hundred nodes and spans.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"1 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":"128692388","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
Adding Support for Satellite Interfaces to 802.21 Media Independent Handover 增加卫星接口对802.21媒体独立切换的支持
2007 15th IEEE International Conference on Networks Pub Date : 2007-11-01 DOI: 10.1109/ICON.2007.4444144
R. Qureshi, A. Dadej
{"title":"Adding Support for Satellite Interfaces to 802.21 Media Independent Handover","authors":"R. Qureshi, A. Dadej","doi":"10.1109/ICON.2007.4444144","DOIUrl":"https://doi.org/10.1109/ICON.2007.4444144","url":null,"abstract":"Mobile devices are now equipped with a broad range of wireless interfaces to connect to various access networks. Different terrestrial and satellite access networks are needed to ensure ubiquitous internet connectivity across all possible locations of mobile terminals. To support uninterrupted communications for mobile terminals in a heterogeneous wireless access environment, the IEEE 802.21 Media Independent Handover framework has been defined. This framework, however, does not include support for satellite networks, one of the key technologies in providing wireless data connectivity where wireless access infrastructure is not available (e.g. sparsely populated remote areas, see and air travel). In this work, we define and propose a reference model that allows link layer information from satellite interfaces to be presented to upper layers much like link layer information from other terrestrial interfaces supported by IEEE 802.21. Our proposal facilitates efficient Media Independent Handovers in heterogeneous access environments involving satellite networks. The satellite interface model used in this work is based on the IP-based satellite network architecture defined by ETSI, however it can be extended to cover other satellite link interface models as required.","PeriodicalId":131548,"journal":{"name":"2007 15th IEEE International Conference on Networks","volume":"2 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":"134557100","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
首页 上一页 下一页 尾页
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学术官方微信