The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l最新文献

筛选
英文 中文
Interference Distribution in the Nakagami FadingWireless CDMA Ad Hoc Networks with Multi-Code Multi-Packet Transmission (MCMPT) 具有多码多包传输(MCMPT)的Nakagami FadingWireless CDMA自组网中的干扰分布
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.78
Lili Zhang, B. Soong
{"title":"Interference Distribution in the Nakagami FadingWireless CDMA Ad Hoc Networks with Multi-Code Multi-Packet Transmission (MCMPT)","authors":"Lili Zhang, B. Soong","doi":"10.1109/LCN.2005.78","DOIUrl":"https://doi.org/10.1109/LCN.2005.78","url":null,"abstract":"In this paper, we derive the distribution of multiple access interference (MAI) power for wireless code division multiple access (CDMA) ad hoc networks operating in a general Nakagami-m fading channel model. Furthermore, we propose a multi-code multi-packet transmission (MCMPT) scheme for it to increase the performance, in terms of the expected forward progress. Based on the instantaneous good channel conditions in a Nakagami-m fading channel, a node can initiate flexible number of parallel transmission of multiple packets on multiple codes. Numerical results show that adaptive MCMPT considering varying channel conditions not only outperforms the nonadaptive conventional packet transmission (CPT), but also achieves better progress improvement with the increasing values of parameter m in a slowly-varying Nakagami-m fading channel","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114141309","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}
引用次数: 6
A scalable overlay multicast congestion control for multimedia streaming 多媒体流的可扩展覆盖多播拥塞控制
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.17
Jun Lu, Q. Ruan, R. Ni
{"title":"A scalable overlay multicast congestion control for multimedia streaming","authors":"Jun Lu, Q. Ruan, R. Ni","doi":"10.1109/LCN.2005.17","DOIUrl":"https://doi.org/10.1109/LCN.2005.17","url":null,"abstract":"This paper presents a scalable overlay multicast congestion control scheme (overlayTFMRC) for multimedia streaming over Internet. The scheme seeks to extend multicast scalability within our previous TCP-friendly unicast congestion control scheme streamTFRC using multiple time-scale prediction for multimedia QoS transport. Besides efficient QoS transport support based on our previous work, overlayTFMRC implements multicast scalability design into session rate control, feedback compression and data forward respectively by fully considering overlay network characteristics. Compared with TFMCC, simulation experiments illustrate that our scheme achieves not only better session scalability performance in terms of session throughput and its smoothness, but also better TCP-friendly performance in terms of intra-protocol & inter-protocol fairness and smoothness","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114735444","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
Adaptive power control algorithm for ad hoc networks with short and long term packet correlations 具有短期和长期数据包关联的自适应功率控制算法
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.24
Jun Zhang, Z. Fang, B. Bensaou
{"title":"Adaptive power control algorithm for ad hoc networks with short and long term packet correlations","authors":"Jun Zhang, Z. Fang, B. Bensaou","doi":"10.1109/LCN.2005.24","DOIUrl":"https://doi.org/10.1109/LCN.2005.24","url":null,"abstract":"Power control is often invoked in mobile ad hoc networks to achieve one of two popular goals: i) increasing network throughput by mitigating the effects of mutual interference of nodes or; ii) ensuring minimal power consumption. This paper proposes a new adaptive power control algorithm for ad hoc networks to save energy while maintaining a similar throughput as that achieved by the IEEE 802.11 MAC protocol. The contributions of this proposed scheme are two fold. First, we define and invoke the concept of MAC packet delivery curve to guide the power control algorithm in the adaptation decision under different possible scenarios. In particular when choosing among different service profiles the packet curve can tell which is better in the long term. Then, the power control algorithm takes into consideration the short term correlations between transmit powers of RTS/CTS frames and those of DATA/ACKs frames, to ensure robustness","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132721780","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
Approximate coverage in wireless sensor networks 无线传感器网络的近似覆盖
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.32
Yuzhen Liu, W. Liang
{"title":"Approximate coverage in wireless sensor networks","authors":"Yuzhen Liu, W. Liang","doi":"10.1109/LCN.2005.32","DOIUrl":"https://doi.org/10.1109/LCN.2005.32","url":null,"abstract":"Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention due to their potential applications from civil to military domains. Since sensors in sensor networks are equipped with energy-limited batteries, energy conservation in such networks is of paramount importance in order to prolong the network lifetime. Sensing coverage and sensor connectivity in sensor networks are two fundamental issues, which have been extensively addressed in the literature, and most existing work on sensing coverage has focused on the (connected) full coverage problem that aims to cover the entire monitored region using the minimum number of sensors. However, in some application scenarios, full coverage is either impossible or unnecessary and a partial coverage with a certain degree guarantee is acceptable. In this paper, we study the connected coverage problem with a given coverage guarantee. We first introduce the partial coverage concept and analyze its properties for the first time in order to prolong the network lifetime. Due to NP-hardness of the concerned problem, we then present a heuristic algorithm which takes into account the partial coverage and sensor connectivity simultaneously. We finally conduct extensive experiments by simulations to evaluate the performance of the proposed algorithm","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121875679","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}
引用次数: 81
A novel tuneable low-intensity adversarial attack 一种新颖的可调谐低强度对抗性攻击
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.14
S. Kanhere, A. Naveed
{"title":"A novel tuneable low-intensity adversarial attack","authors":"S. Kanhere, A. Naveed","doi":"10.1109/LCN.2005.14","DOIUrl":"https://doi.org/10.1109/LCN.2005.14","url":null,"abstract":"Currently, denial of service (DoS) attacks remain amongst the most critical threats to Internet applications. The goal of the attacker in a DoS attack is to overwhelm a shared resource by sending a large amount of traffic thus, rendering the resource unavailable to other legitimate users. In this paper, we expose a novel contrasting category of attacks that is aimed at exploiting the adaptive behavior exhibited by several network and system protocols such as TCP. The goal of the attacker in this case is not to entirely disable the service but to inflict sufficient degradation to the service quality experienced by legitimate users. An important property of these attacks is the fact that the desired adversarial impact can be achieved by using an non-suspicious low-rate attack stream, which can easily evade detection. Further by tuning various parameters of the attack traffic stream, the attacker can inflict varying degrees of service degradation and at the same time making it extremely difficult for the victim to detect attacker presence. Our simulation based experiments validate our observations and demonstrate that an attacker can significantly degrade the performance of the TCP flows by inducing lowrate attack traffic which is co-ordinated to exploit the congestion control behavior of TCP","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123500427","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
Network management challenges for next generation networks 下一代网络面临的网络管理挑战
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.93
Mo Li, K. Sandrasegaran
{"title":"Network management challenges for next generation networks","authors":"Mo Li, K. Sandrasegaran","doi":"10.1109/LCN.2005.93","DOIUrl":"https://doi.org/10.1109/LCN.2005.93","url":null,"abstract":"Generally, current network management technologies follow two approaches: ITU-Ts recommendations for telecommunication management network (TMN) and IETF's Simple Network Management Protocol (SNMP) that favors IP networks. The applications based on these approaches are specifically targeted at a variety of independent networks including the standard public switched telephone network (PSTN), the public switched data network (PSDN), the public land mobile network (PLMN), and the wireless local area network (WLAN), etc., all of which will be integrated into a single IP-based infrastructure referred to as next generation networks (NGN) in the near future. The services, network architectures and traffic pattern in NGN will dramatically differ from the current networks. The heterogeneity and complexity of NGN bring a number of challenges to its network management. In this paper, we first introduce the current network management approaches and describe some deficiencies of current solutions. Then, the network management challenges in NGN are presented and discussed. Finally, some emerging approaches towards network management in NGN are illustrated","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125970307","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}
引用次数: 40
Disconnection-resilient file system for mobile clients 用于移动客户端的断开弹性文件系统
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.53
A. Boukerche, R. Al-Shaikh, B. Marleau
{"title":"Disconnection-resilient file system for mobile clients","authors":"A. Boukerche, R. Al-Shaikh, B. Marleau","doi":"10.1109/LCN.2005.53","DOIUrl":"https://doi.org/10.1109/LCN.2005.53","url":null,"abstract":"In this paper, we propose a novel mobile distributed file system design, which provides high available and reliable storage for files and guarantees that file operations are executed in spite of concurrency and failures. The design is intended to fit mobile clients' devices (e.g., PDAs and cell phones) that have limited storage space and cannot store all data they need, yet they require to access these data at all times. We adopt a server-side caching in order to guarantee sufficient caching space to all mobile clients, and ensure the availability of files in case of clients' failures. We present our algorithm, describe its implementation, and report on its performance evaluation using a cluster of workstations. Our results indicate clearly that our algorithm exhibits a significant degree of automation and conflict-free mobile file system","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127838306","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 novel pricing approach for QoS enabled 3G networks 支持QoS的3G网络的一种新的定价方法
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.13
Vitalis G. Ozianyi, N. Ventura
{"title":"A novel pricing approach for QoS enabled 3G networks","authors":"Vitalis G. Ozianyi, N. Ventura","doi":"10.1109/LCN.2005.13","DOIUrl":"https://doi.org/10.1109/LCN.2005.13","url":null,"abstract":"The prices used for the charging of data and multimedia services in communication networks depend on the profit maximization goals of the network operators and service providers, and the market forces affecting the industry. In many scenarios the tariff rates used increase with the speed of the access channel. Next generation networks will offer higher data rates. Users will not get incentives to utilise the extra capacity if current tariff structures are retained. In this paper, a novel, network congestion dependent dynamic billing scheme is proposed. Differentially priced network service profiles are introduced, and the use of DiffServ and connection admission control for QoS provisioning is explored. A hybrid billing scheme is designed. The implementation architecture is given, and a testbed for evaluating the scheme is built","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117167167","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
Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks Ad hoc网络中按需路由协议的高效和高可扩展路由发现
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.60
M. Abolhasan, J. Lipman
{"title":"Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks","authors":"M. Abolhasan, J. Lipman","doi":"10.1109/LCN.2005.60","DOIUrl":"https://doi.org/10.1109/LCN.2005.60","url":null,"abstract":"This paper presents a number of different route discovery strategies for on-demand routing protocols, which provide more control to each intermediate node make during the route discovery phase to make intelligent forwarding decisions. This is achieved through the idea of self-selection. In self-selecting route discovery each node independently makes route request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the routing packets. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing route discovery strategies used in AODV. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in throughput is achieved as the number nodes in the network is increased","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121273030","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
Cross Layer Design for IEEE 802.11 WLANs: Joint Rate Control and Packet Scheduling IEEE 802.11无线局域网的跨层设计:联合速率控制和分组调度
The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l Pub Date : 2005-11-15 DOI: 10.1109/LCN.2005.43
Qiuyan Xia, M. Hamdi
{"title":"Cross Layer Design for IEEE 802.11 WLANs: Joint Rate Control and Packet Scheduling","authors":"Qiuyan Xia, M. Hamdi","doi":"10.1109/LCN.2005.43","DOIUrl":"https://doi.org/10.1109/LCN.2005.43","url":null,"abstract":"IEEE 802.11 wireless local area networks (WLANs) are widely deployed nowadays. With traditional layered architecture, current WLAN adopts functional layer partitioning and aims at optimization in individual layers. However, in a highly dynamic and media sharing wireless environment, the capacity enhancement at physical layers may not necessarily benefit the overall system performance. Moreover, in a multiuser setting, throughput can be increased substantially if partial knowledge of the channel is known. In this paper, we address the issue of cross layer design in the proposed \"weighted fair scheduling based on adaptive rate control\" (WFS-ARC) framework, where the PHY layer knowledge is shared with the MAC/LLC layer. It can make good matching of instantaneous channel conditions of multiple users with resource allocation to each user","PeriodicalId":368269,"journal":{"name":"The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121514375","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}
引用次数: 22
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学术官方微信
小红书