First International Conference on Broadband Networks最新文献

筛选
英文 中文
PRISM: an error-resilient video coding paradigm for wireless networks PRISM:用于无线网络的防错误视频编码范例
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.69
A. Majumdar, K. Ramchandran
{"title":"PRISM: an error-resilient video coding paradigm for wireless networks","authors":"A. Majumdar, K. Ramchandran","doi":"10.1109/BROADNETS.2004.69","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.69","url":null,"abstract":"We describe PRISM (power-efficient, robust, high-compression, syndrome-based multimedia coding), an error-resilient video-coding paradigm built on the principles of distributed source coding from multi-user information theory. PRISM represents a radical departure from the current state-of-the-art video coding architectures, like MPEG, that are based on a motion-compensated prediction framework. These are hampered by: (i) a rigid computational complexity partition between encoder (heavy) and decoder (light); and (U) high fragility to drift between encoder and decoder in the face of prediction mismatch due to channel loss. In contrast, PRISM's architectural goals are: (i) to have a channel-adaptive distribution of computational complexity between encoder and decoder; and (ii) to have built-in robustness to drift between encoder and decoder due to wireless channel loss. These features make PRISM ideally suited for low-latency multimedia transmission over wireless networks, particularly for uplink-rich applications.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128665834","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}
引用次数: 17
Efficient OVSF codes assignment strategy and management architecture in wideband CDMA 宽带CDMA中高效的OVSF码分配策略与管理架构
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.38
Min-Xiou Chen, Ren-Hung Hwang
{"title":"Efficient OVSF codes assignment strategy and management architecture in wideband CDMA","authors":"Min-Xiou Chen, Ren-Hung Hwang","doi":"10.1109/BROADNETS.2004.38","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.38","url":null,"abstract":"This paper presents an integrated solution to the code management and assignment problem in the UMTS system. We propose a new architecture for code management, and based upon this new architecture, a new code assignment strategy, referred to as 'crowded-group first strategy'. Our system architecture and code assignment strategy represent significant improvements in the time complexity and in the complexity of the storage operation. Moreover, the code blocking probability of the crowded-group first strategy can be as good as that of the crowded-first strategy. In order to systematically analyze the performance of the code assignment strategies, we implement a simulator to analyze the code selection behavior of each strategy, and the performance of the code blocking can be anticipated based on the analysis. We also propose a new performance metric, named 'weighted code blocking', in order to precisely measure the performance obtained by different strategies. From the simulation results, we show that our strategy efficiently utilizes the OVSF codes with the low computation overhead.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125402318","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 distributed mobile backbone formation algorithm for wireless ad hoc networks 一种用于无线自组网的分布式移动主干网形成算法
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.4
L. H. Ju, I. Rubin, Kevin Ni, Christopher Wu
{"title":"A distributed mobile backbone formation algorithm for wireless ad hoc networks","authors":"L. H. Ju, I. Rubin, Kevin Ni, Christopher Wu","doi":"10.1109/BROADNETS.2004.4","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.4","url":null,"abstract":"In this paper, we present a novel fully distributed version of a mobile backbone network topology synthesis algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone in mobile wireless ad hoc networks. The following features induce the key advantages offered by the algorithm: a) the MBN-TSA algorithm is designed to work with the unreliable natural of wireless environment; b) the backbone layout is dynamically formed and locally modified in response to communications link quality fluctuations, nodal failures and nodal mobility; c) a control mechanism employing the BN/spl I.bar/neighbor/spl I.bar/limit threshold as a key parameter, is introduced to control the size of the backbone network (BNet) and improve stability; d) analytical results show that the MBN-TSA has very little control overhead: time complexity in the order of O(l) and message complexity in the order of O(l) per node. In addition, we present an on-demand routing protocol that makes use of the underlying dynamically self-configured MBN network infrastructure. By carrying out extensive simulations, we demonstrate the performance advantages when compared to a non backbone oriented on-demand ad hoc routing protocol such as AODV.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124460517","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}
引用次数: 29
Meeting optical QoS requirements with reduced complexity in dynamic wavelength assignment 在降低动态波长分配复杂度的同时满足光学QoS需求
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.45
I. Fonseca, R. C. Almeida, H. Waldman, M. Ribeiro
{"title":"Meeting optical QoS requirements with reduced complexity in dynamic wavelength assignment","authors":"I. Fonseca, R. C. Almeida, H. Waldman, M. Ribeiro","doi":"10.1109/BROADNETS.2004.45","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.45","url":null,"abstract":"Physical layer impairments may require highly complex implementations of the control plane in dynamic networks with quality of service (QoS) constraints. In order to alleviate this problem, we propose that dynamic wavelength assignment should be based on the elementary first-fit (FF) algorithm using off-line optimized priority lists. It is shown that this may significantly reduce the effects of physical impairments with no additional computational cost for the control of dynamic networks. A simple metric is proposed to evaluate optical QoS taking the performance of the network as a whole. Different heuristics are presented and evaluated. Results show that there are particular lists capable of reducing in four orders of magnitude the probability of FWM impacting network performance.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117087678","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}
引用次数: 19
Science of continuous media application design in wireless networks of mobile devices 移动设备无线网络中连续媒体应用设计科学
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.76
Shahram Ghandeharizadeh
{"title":"Science of continuous media application design in wireless networks of mobile devices","authors":"Shahram Ghandeharizadeh","doi":"10.1109/BROADNETS.2004.76","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.76","url":null,"abstract":"Display of continuous media using self-organizing ad hoc networks of wireless communication systems are potentially used in a variety of applications. Example deployments might include disaster relief missions, conferences, and university campuses to name a few. Challenges of these environments include their mobility, and unpredictable network bandwidth and loss characteristics. This paper explores a three step science of design for applications that manipulate continuous media. This science strives to satisfy the requirements of an application. It consists of a number of principles that impact the design of algorithms. These principles guide a system designer towards parameterized algorithms that treat network bandwidth and storage as one.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116316980","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
Design and analysis of a fast local clustering service for wireless sensor networks 无线传感器网络快速局部聚类服务的设计与分析
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.30
M. Demirbas, A. Arora, Vineet Mittal, V. Kulathumani
{"title":"Design and analysis of a fast local clustering service for wireless sensor networks","authors":"M. Demirbas, A. Arora, Vineet Mittal, V. Kulathumani","doi":"10.1109/BROADNETS.2004.30","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.30","url":null,"abstract":"We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sited clusters. Each cluster has a clusterhead such that all nodes within unit distance of the clusterhead belong to the cluster but no node beyond distance m from the clusterhead belongs to the cluster. By asserting m /spl ges/ 2, FLOC achieves locality: effects of cluster formation and faults/changes at any part of the network are contained within most m units. By taking unit distance to be the reliable communication radius and m to be the maximum communication radius, FLOC exploits the double-band nature of wireless radio-model and achieves clustering in constant time regardless of the network size. Through simulations and experiments with actual deployments, we analyze the tradeoffs between clustering time and the quality of clustering, and suggest suitable parameters for FLOC to achieve a fast completion time without compromising the quality of the resulting clustering.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125786246","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
On optimal placement of intrusion detection modules in sensor networks 传感器网络中入侵检测模块的优化配置
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.52
F. Anjum, Dhanant Subhadrabandhu, S. Sarkar, Rahul Shetty
{"title":"On optimal placement of intrusion detection modules in sensor networks","authors":"F. Anjum, Dhanant Subhadrabandhu, S. Sarkar, Rahul Shetty","doi":"10.1109/BROADNETS.2004.52","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.52","url":null,"abstract":"Sensor networks have increasingly become the subject of intense scientific interest over the past few years. In this work, we focus on intrusion detection in sensor networks. The intrusion detection community has been focusing mainly on wired networks. But techniques geared towards wire line networks would not suffice for a sensor environment because of the constraints associated with such networks. In this paper, we consider the arbitrary sized sensor networks and propose algorithms to improve the detection rates by intelligently enabling the intrusion detection functionality on particular sensor nodes. The proposed algorithms, based on the concepts of minimum cut-set and minimum dominating set, allow for a distributed implementation. The performance of the algorithms in identifying intrusions using signature based detection techniques is studied via simulations.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127404810","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}
引用次数: 65
Performance analysis of a low-complexity and efficient QoS differentiation algorithm for bufferless optical packet switches with shared wavelength converters in asynchronous operation 一种低复杂度、高效的共享波长转换器无缓冲光分组交换机异步性能分析
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.58
M. Nord
{"title":"Performance analysis of a low-complexity and efficient QoS differentiation algorithm for bufferless optical packet switches with shared wavelength converters in asynchronous operation","authors":"M. Nord","doi":"10.1109/BROADNETS.2004.58","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.58","url":null,"abstract":"This paper presents a simulation study of a low-complexity optical packet switching quality of service differentiation scheme, aiming at minimising the penalty of offering packet loss rate isolation in an optical packet switch with a wavelength converter pool. Special emphasis is given to potential improvements, impact of node dimensions and overload situations.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132796579","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
Exact calculation of blocking probabilities for bufferless optical burst switched links with partial wavelength conversion 部分波长转换无缓冲光突发交换链路阻塞概率的精确计算
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.40
N. Akar, Ezhan Karasan
{"title":"Exact calculation of blocking probabilities for bufferless optical burst switched links with partial wavelength conversion","authors":"N. Akar, Ezhan Karasan","doi":"10.1109/BROADNETS.2004.40","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.40","url":null,"abstract":"In this paper, we study the blocking probabilities in a wavelength division multiplexing-based asynchronous bufferless optical burst switch equipped with a bank of tuneable wavelength converters that is shared per output link. The site of this bank is generally chosen to be less than the number of wavelengths on the link because of the relatively high cost of wavelength converters using current technologies; this case is referred to as partial wavelength conversion in the literature. We present a probabilistic framework for exactly calculating the blocking probabilities. Burst durations are assumed to be exponentially distributed. Burst arrivals are first assumed to be Poisson and later generalized to the more general phase-type distribution. Unlike existing literature based on approximations and/or simulations, we formulate the problem as one of finding the steady-state solution of a continuous-time Markov chain with a block tridiagonal infinitesimal generator. We propose a numerically efficient and stable solution technique based on block tridiagonal LU factorizations. We show that blocking probabilities can exactly and efficiently be found even for very large systems and rare blocking probabilities. Based on the results of this solution technique, we also show how this analysis can be used for provisioning wavelength channels and converters.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129402901","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
Multiple channel scheduling in UWB based IEEE 802.15.3 networks 基于IEEE 802.15.3超宽带网络的多信道调度
First International Conference on Broadband Networks Pub Date : 2004-10-25 DOI: 10.1109/BROADNETS.2004.49
Aniruddha Rangnekar, K. Sivalingam
{"title":"Multiple channel scheduling in UWB based IEEE 802.15.3 networks","authors":"Aniruddha Rangnekar, K. Sivalingam","doi":"10.1109/BROADNETS.2004.49","DOIUrl":"https://doi.org/10.1109/BROADNETS.2004.49","url":null,"abstract":"Recent approval by the Federal Communications Commission (FCC) has led to considerable interest in exploiting ultra wideband (UWB) access on an unlicensed basis in the 3.1-10.6 GHz band. Currently, the IEEE TG802.15.3a standards group is in the process of developing an alternative high-speed link layer design conformable with the IEEE 802.15.3 wireless personal area network (WPAN) multiple access (MAC) protocol. One of the proposals, based on the concept of orthogonal frequency division multiplexing (OFDM), divides the spectrum into multiple bands and achieves channelization through the use of different time-frequency codes. These multiple channels can help satisfy the increasing demand for higher bandwidth in order to support high data rate multimedia applications. In this paper, we present a multi-channel scheduling algorithm that simultaneously utilizes the various channels available in the UWB network.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115303964","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}
引用次数: 17
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学术官方微信