2008 IEEE Symposium on Computers and Communications最新文献

Flooding Zone Initialization Protocol (FZIP): Enabling efficient multimedia diffusion for multi-hop wireless networks FZIP (Flooding Zone Initialization Protocol):用于多跳无线网络的高效多媒体扩散

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625729

Tarik Elamsy, R. El-Marakby

引用次数: 3

Blind MIMO deconvolution of any source distributions via high-order spectra 通过高阶谱对任意源分布进行盲MIMO反卷积

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625691

M. Taoufiki, A. Adib, D. Aboutajdine, S. Biaz

引用次数: 1

Using the maximum Mutual Information criterion to textural Feature Selection for satellite image classification 基于最大互信息准则的纹理特征选择用于卫星图像分类

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625678

M. A. Kerroum, A. Hammouch, D. Aboutajdine, A. Bellaachia

引用次数: 5

Uplink call admission control in multi-services W-CDMA network 多业务W-CDMA网络中的上行呼叫准入控制

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625630

Khalil Ibrahimi, R. E. Azouzi, E. Bouyakhf

{"title":"Uplink call admission control in multi-services W-CDMA network","authors":"Khalil Ibrahimi, R. E. Azouzi, E. Bouyakhf","doi":"10.1109/ISCC.2008.4625630","DOIUrl":"https://doi.org/10.1109/ISCC.2008.4625630","url":null,"abstract":"The capacity of CDMA wireless network is usually studied considering two classes of services: real-time and best-effort. In this paper, we are interested in analyzing sharing between three classes of services: real-time (RT), non-real-time (NRT) and best-effort (BE). A classical approach which is widely used in wireless networks is based on adaptively deciding how many channels to allocate to calls of a given class. The rational behind our idea is that the NRT class (e.g. FTP) requires a minimum transmission rate. The capacity allocated to NRT traffic includes a fixed portion of bandwidth as well as a dynamic part which is shared with RT service. In contrast, BE applications can adapt their transmission rate to the networkpsilas available resources. Hence, the best-effort applications can use only the unused resources of the NRT band. Using a spectral analysis approach, we compute the steady-state distribution of the calls number for those different classes which allows us to provide explicitly the performance measure. The QoS parameters of interest are primarily the blocking probability for both RT calls and NRT calls, and expected sojourn times for both NRT calls and BE calls. We finally provide numerical study to show the benefit of our capacity allocation method by providing a desired quality level of service for NRT services, and we propose some CAC policies for NRT and BE services.","PeriodicalId":156879,"journal":{"name":"2008 IEEE Symposium on Computers and Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122062475","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 robust digital image watermarking method using Dual Tree Complex Wavelet Transform 基于对偶树复小波变换的鲁棒数字图像水印方法

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625651

S. Mabtoul, E. I. Elhaj, D. Aboutajdine

引用次数: 11

Pitfalls and tradeoffs on dealing with handoff management in bluetooth-based WPANs for real-time applications 实时应用中基于蓝牙的无线局域网切换管理的缺陷和权衡

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625664

L. Oliveira, K. Gorgônio, A. Perkusich, Leandro Dias da Silva

{"title":"Pitfalls and tradeoffs on dealing with handoff management in bluetooth-based WPANs for real-time applications","authors":"L. Oliveira, K. Gorgônio, A. Perkusich, Leandro Dias da Silva","doi":"10.1109/ISCC.2008.4625664","DOIUrl":"https://doi.org/10.1109/ISCC.2008.4625664","url":null,"abstract":"In this work, the problems and respective solutions for dealing with two of the most basic questions regarding handoff management are presented: to avoid total loss of connectivity; and to reduce overall time of the handoff procedure. The focus of this research is on handoff in WPANs for real-time applications. Therefore, Bluetooth stands out as the ideal technology for case study due to its particular alignment with the behavior and requirements of the WPANpsilas network model. Bluetoothpsilas inquiry and paging operations may be calibrated for achieving fast discoveries and connections while scatternets may be used to avoid total loss of connectivity. However, the usage of scatternets and calibration of inquiry and paging unveil a series of challenging aspects when applied along with real-time applications. Such challenges are the priority of inquiry and paging data traffic over userspsila applications and unpredictability of scatternet behavior. The key point to overwhelm these difficulties is to understand how they affect the real-time data transfers. In this article a set of discussions and experiments that demonstrate how inquiries, pagings and scatternets can aid achieving the goals of fast and uninterrupted handoffs, as well as the tenuous traps and tradeoffs behind such operations and configurations over real-time applications performance are presented.","PeriodicalId":156879,"journal":{"name":"2008 IEEE Symposium on Computers and Communications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117093343","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

Distributed Quality-of-Service routing of best constrained shortest paths. 最佳约束最短路径的分布式服务质量路由。

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625670

A. Mellouk, S. Hoceini, F. Baguenine, M. Cheurfa

{"title":"Distributed Quality-of-Service routing of best constrained shortest paths.","authors":"A. Mellouk, S. Hoceini, F. Baguenine, M. Cheurfa","doi":"10.1109/ISCC.2008.4625670","DOIUrl":"https://doi.org/10.1109/ISCC.2008.4625670","url":null,"abstract":"High speed modern communication networks are required to integrate and support multimedia application which requires differentiated quality-of-service (QoS) guarantees. Routing mechanism is a key to success of future communication networking. However, it is often complicated by the notion of guaranteed QoS, which can either be related to time, cost, packet loss or bandwidth requirements. Communication network requires that as the load levels, traffic patterns and topology of the network change, the routing policy also adapts. In this paper, we present a QoS based routing to construct dynamic state-dependent routing policies. The proposed algorithm used a reinforcement learning paradigm to optimize two QoS criteria: cumulative cost path based on hop count and end-to-end delay. Multiple paths are searched in parallel to find the N best qualified ones. In order to improve the overall network performance, a load balancing policy is defined and depends on a dynamical traffic path probability distribution function. The performance of our algorithm for different levels of trafficpsilas load is compared experimentally with standard optimal path routing algorithms for the same problem.","PeriodicalId":156879,"journal":{"name":"2008 IEEE Symposium on Computers and Communications","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604923","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 reliable synchronous transport protocol for wireless image sensor networks 无线图像传感器网络的可靠同步传输协议

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625679

A. Boukerche, Yan Du, Jingwen Feng, R. Pazzi

引用次数: 39

End-to-end shared restoration algorithms in multi-domain mesh networks 多域网状网络的端到端共享恢复算法

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625731

Zhiying Gao, H. Naser

引用次数: 3

A sybilproof distributed identity management for P2P networks 面向P2P网络的无符号分布式身份管理

2008 IEEE Symposium on Computers and Communications Pub Date : 2008-07-06 DOI: 10.1109/ISCC.2008.4625694

François Lesueur, L. Mé, Valérie Viet Triem Tong

引用次数: 19