2011 International Conference on Communications, Computing and Control Applications (CCCA)最新文献_第7页

Investigating, modeling and evaluating the interface complexity of Web Services 调查、建模和评估Web服务的接口复杂性

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031227

Litao Deng, Ailin Zhou, Hongchen Guo, Peng Han

引用次数: 1

Byzantine-tolerant circle formation by oblivious mobile robots 由遗忘移动机器人形成的拜占庭容忍圈

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031485

S. Souissi, Taisuke Izumi, K. Wada

{"title":"Byzantine-tolerant circle formation by oblivious mobile robots","authors":"S. Souissi, Taisuke Izumi, K. Wada","doi":"10.1109/CCCA.2011.6031485","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031485","url":null,"abstract":"Consider a system that consists of a group of mobile robots roaming in the two-dimensional plane. Each robot occupies a point in the plane, and is equipped with sensors to observe the positions of the other robots. Each robot proceeds by repeatedly (1) observing the environment, (2) computing a destination based on the observed positions of robots, and (3) moving toward the computed destination. Robots are unable to communicate directly, and can only interact by observing each others' positions. In addition, all robots execute the same deterministic algorithm, however some of them can be Byzantine, and exhibit arbitrary behaviors that are not in accordance with their local algorithms. Finally, robots are oblivious (i.e., stateless), meaning that they can not remember their previous observations and actions. In this model, we address the problem of coordination between these robots from a computational viewpoint, and we focus on a basic coordination problem, namely the Byzantine-tolerant circle formation problem. In other words, we study the feasibility of positioning a group of mobile robots into forming a circle in Byzantine fault model. The contribution of this paper is as follows: Let N be the number of robots in the system, and let ƒ be the number of Byzantine robots. We first show that there exists no algorithm that solves the Byzantine-tolerant circle formation when N ≤ 2ƒ + 2 in a fully synchronous system. On the other hand, when N > 2ƒ + 2, we provide an algorithm in the fully synchronous model. Then, we show that when N ≤ 3ƒ + 2, the problem of Byzantine circle formation has no solution in the semi-synchronous model when robots' activations follow a k-bounded scheduler for k ≥ 2, that is while the slowest robot is activated once, the fastest robot is activated at most k times (k-bounded). Finally, we conjecture that the problem is impossible in general for any N when k ≥ 2 in the semi-synchronous model even for ƒ = 1.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129097919","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 sliding window method for subchannels gain computation in OFDMA wireless systems: Context IEEE 802.16m OFDMA无线系统中子信道增益计算的滑动窗口方法:背景IEEE 802.16m

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031434

Wafa Ben Hassen, Mériem Afif, Fakhreddine Khelifa, A. Samet

{"title":"A sliding window method for subchannels gain computation in OFDMA wireless systems: Context IEEE 802.16m","authors":"Wafa Ben Hassen, Mériem Afif, Fakhreddine Khelifa, A. Samet","doi":"10.1109/CCCA.2011.6031434","DOIUrl":"https://doi.org/10.1109/CCCA.2011.6031434","url":null,"abstract":"In the IEEE 802.16 recommendations family, the adjacent method for construction of the subchannel is adopted. In order to reduce the system complexity, the available subcarriers are grouped into equal groups of contiguous subcarriers, where each group is called a subchannel. The adaptive modulation and coding schema, AMC, is used in order to maximize the number of bit per symbol. In this case, subcarriers of subchannel present different SNR and the fundamental question is how to choose the best AMC for each subchannel. In this paper, an enhancement algorithm is proposed to response at this question in the context of Orthogonal Frequency Division Multiple Access, OFDMA, wireless systems in the downlink sense. The scheduler located at the base station computes subchannel gain based on the responses frequency dispersion, then the quality of the channel. This gain has a great importance in resource management. Numerical results show that the proposed algorithm outperforms an allocation scheme in terms of a lower BLOC Error Rate (BLER) and a higher system Capacity, compared to others methods.","PeriodicalId":259067,"journal":{"name":"2011 International Conference on Communications, Computing and Control Applications (CCCA)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127004490","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

Computation algorithm of the exact value of passive robustness in milk manufacturing workshop 牛奶生产车间被动鲁棒性精确值的计算算法

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031535

A. Mhalla, S. Collart Dutilleul, N. Jerbi, M. Benrejeb, E. Craye

引用次数: 0

Autonomous data gathering mechanism with transmission reduction for wireless sensor networks 无线传感器网络传输减少的自主数据采集机制

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031443

Y. Taniguchi, A. Kanzaki, N. Wakamiya, T. Hara

引用次数: 2

A new objective function for fuzzy c-regression model and its application to T-S fuzzy model identification 一种新的模糊c-回归模型目标函数及其在T-S模糊模型辨识中的应用

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031427

M. Soltani, A. Chaari, F. Benhmida, M. Gossa

引用次数: 5

Direct torque fuzzy controlled induction machine drive using an optimized extended Kalman filter 基于优化扩展卡尔曼滤波的直接转矩模糊控制感应电机驱动

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031399

M. Douiri, M. Cherkaoui, T. Nasser, A. Essadki

引用次数: 3

Chaos based spread spectrum watermarking algorithm 基于混沌的扩频水印算法

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031458

Kais Feltekh, Z. Jemaa

引用次数: 2

Compact dual-band microstrip antenna for universal 2.4 /5.2GHz WLAN applications 紧凑型双频微带天线，适用于通用2.4 /5.2GHz WLAN应用

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031481

Mehdi Ali, A. Kachouri, M. Samet

引用次数: 6

Sliding-mode cascade controller of induction motor 感应电动机滑模级联控制器

2011 International Conference on Communications, Computing and Control Applications (CCCA) Pub Date : 2011-03-03 DOI: 10.1109/CCCA.2011.6031456

M. Khalfa, A. Sellami, R. Andouisi

引用次数: 0