检索结果-内蒙古大学图书馆

collision resolution ALGORITHM FOR M-PRIORITY USERS

IEE PROCEEDINGS-COMMUNICATIONS 1995年第3期142卷 151-157页

作者： CHUNG, WS UN, CK Dept. of Electr. Eng. Korea Adv. Inst. of Sci. & Technol. Taejon South Korea

The authors propose and analyse a collision resolution algorithm (CRA) with M (greater than or equal to 2) priority classes in random access communication systems. When it is applied to the clipped binary-tree protocol, it is stable if the total traffic is below 0.473 packets per slot regardless of the value of M. Its maximum throughput is higher than those obtained previously. When the algorithm is applied to the tree protocol with collision detection (Tree/CD) where the length of a packet is longer than one slot, the throughput performance can be enhanced by as much as one. Using the modified M/D/1 priority model, the delay characteristic is evaluated and confirmed by simulations. The proposed priority CRA has advantages in the capability of supporting various priority traffics with high throughput.

关键词： collision resolution algorithms COMMUNICATIONS SYSTEMS

来源：评论

学校读者我要写书评

暂无评论

Formal analysis of an energy-aware collision resolution protocol for wireless sensor networks

Formal analysis of an energy-aware collision resolution prot...

引用

16th Annual International Conference on Computational Science (ICCS)

作者： Ruiz, M. C. Macia, H. Mateo, J. A. Calleja, J. Univ Castilla La Mancha Escuela Super Ingn Informat Albacete Spain Univ Castilla La Mancha Inst Invest Informat Albacete Spain

This paper provides a comprehensive and rigorous study of a novel collision resolution algorithm for wireless sensor networks: 2CS-WSN. It is specifically designed to be used during the contention phase of IEEE 802.15.4. This algorithm has been modelled in terms of discrete time Markov chains (DTMCs) and, using the probabilistic symbolic model checker PRISM, correctness properties and different operation modes of the algorithm have been studied. Moreover, different model abstractions have been used in order to identify any inconsistencies or ambiguities, and to prove interesting properties for non-trivial, practical and relevant scenarios. Finally, since the biggest source of energy waste is the collision, this paper conducts a wide study of energy saving in this algorithm.

关键词： Modelling and simulation Probabilistic model checking Markov chains Performance Evaluation Wireless Sensor Networks collision resolution algorithms

来源：评论

学校读者我要写书评

暂无评论

A multiple-channel free-access collision resolution algorithm based connection request procedure for land mobile satellite networks

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS 1996年第4期14卷 313-325页

作者： Tan, HH Yan, TY Elec. and Comp. Eng. Department University of California Irvine Irvine CA 92717 United States Commun. System Research Section Jet Propulsion Laboratories Pasadena CA 91109 4800 Oak Grove Drive United States

A new binary feedback multiple-channel free-access (MCFA) collision resolution algorithm (CRA) based random-access protocol (RAP) is devised to implement the connection request procedure for demand-assigned channel access protocols in land mobile satellite communications networks. The maximum stable throughput of this protocol is derived and is shown to be superior to a previously devised multiple-channel obvious blocked-access CRA based RAP as well as to slotted ALOHA. The throughput performance is also superior to the previously devised multiple-channel window blocked-access CRA based RAP for four or more channels. An exact analysis of the average packet delay for this MCFA CRA based RAP is given and shown to be in excellent agreement with computer simulation results, The protocol is shown to have smaller average delays than the best single-channel free access CRA based RAPs over a wide range of practically usable throughput rates with reasonable delays. This MCFA CRA based RAP was implemented on a channel request protocol test-bed simulator which incorporates the physical link characteristics of the MSAT-X land mobile satellite system. These testbed simulation results also demonstrate the superiority of this protocol over slotted ALOHA for both error-free channel and mobile facing channel scenarios.

关键词： mobile satellite networks demand assigned protocols collision resolution algorithms

来源：评论

学校读者我要写书评

暂无评论

Formal Analysis of an Energy-aware collision resolution Protocol for Wireless Sensor Networks

引用

Procedia Computer Science 2016年 80卷 1191-1201页

作者： M.C. Ruiz H. Macià J.A. Mateo J. Calleja Escuela Superior de Ingeniería Informática Universidad de Castilla-La Mancha Albacete Spain Instituto de Investigación en Informática Universidad de Castilla-La Mancha Albacete Spain

关键词： Modelling and simulation Probabilistic model checking Markov chains Performance Evaluation Wireless Sensor Networks collision resolution algorithms

来源：评论

学校读者我要写书评

暂无评论

THE ANALYSIS OF THE EXPECTED SUCCESSFUL OPERATION TIME OF SLOTTED ALOHA

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1993年第5期39卷 1567-1577页

作者： DRMOTA, M SCHMID, U TECH UNIV VIENNA DEPT AUTOMATA-1040 VIENNAAUSTRIA

It has been well-known for nearly 20 years that the bistable behavior of infinite population slotted ALOHA networks causes the unpleasant effect of eventually reaching an overloaded state, where the number of backlogged stations becomes larger and larger and the useful throughput reduces to zero. The detailed analysis reveals that this statement is true for any average offered load lambda > 0, regardless of the retransmission probability p. A challenging, and to the best of the authors' knowledge, not sufficiently solved problem within this context concerns the time until this destabilization occurs. This question is successfully answered based on the fact that the operation of the system may be viewed as a sequence of consecutive busy periods, each starting from backlog 0 and return to backlog 0. It turns out that the whole period of successful operation S Consists of a finite sequence of busy periods of finite lengths, which is ''terminated'' by an infinite busy period (which never returns to backlog 0). Further analysis of this simple renewal process leads to an infinite dimensional system of linear equations, which is shown to have only one meaningful solution. A pair of upper and lower asymptotic bounds for that solution eventually provide the key to the major result, an asymptotic formula for the average number of slots up to the beginning of the infinite busy period, uniformly for p --> 0 and lambda --> 0.

关键词： collision resolution algorithms SLOTTED ALOHA TRANSIENT MARKOV CHAINS BUSY PERIODS ASYMPTOTIC ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

New Proposals to Improve a MAC Layer Protocol in Wireless Sensor Networks

引用

INFORMATICA 2019年第1期30卷 91-116页

作者： Carmen Ruiz, M. Macia, Hermenegilda Calleja, Javier Univ Castilla La Mancha Sch Comp Sci Campus Univ S-N Albacete 02071 Spain

The evolution of Wireless Sensor Networks has led to the development of protocols that must comply with their new restrictions while being efficient in terms of energy consumption and time. We focus on a collision resolution protocol, the so-called Two Cell Sorted (2CS-WSN). We propose three different ways to improve its performance by minimizing the collision resolution time or the energy consumption. After evaluating these proposals and carrying out the comparison with the original protocol, we recommend an improvement to the protocol which reduces the elapsed time by early 8% and the number of retries and conflicts more than 40%.

关键词： formal modelling discrete time Markov chain probabilistic model checking wireless sensor networks collision resolution algorithms performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Proposal and performance analysis of a multiple-access protocol for high-speed wireless LANs

引用

COMPUTER NETWORKS AND ISDN SYSTEMS 1996年第3期28卷 283-305页

作者： Sobrinho, JL Brazio, JM Univ Tecn Lisboa CTR ANALISE & PROCESSAMENTO SINAIS INST SUPER TECN LISBON PORTUGAL

Multiple access schemes are an important component in the development of evolving wireless LANs (WLANs). In this paper, a centralized multiple access protocol is presented for communication among a set of portables and a base station inside a cell of a WLAN. The portables compete for the uplink access to the transmission channel with minipackets in response to controlling commands issued by the base station. The real-time exchange of minipackets and controlling commands allows for the implementation of stable collision resolution algorithms to improve the delay properties of uplink data packets. The proposed protocol is further developed to allow both downlink and uplink traffic directions to time-share a common transmission channel without mutual contention. In the analysis, the operation of the protocol is modeled by a single server queue with two classes of customers having distinct arrival and service characteristics. Stability conditions are derived together with tight upper and lower bounds on the average delays of downlink and uplink data packets. The numerical examples show protocol capacities in excess of 0.85 and 0.70 for nominal channel bit rates of 5 Mbps and 50 Mbps, respectively.

关键词： wireless LANs wireless data communications bi-directional multiple access multiple access protocols collision resolution algorithms queues with distinct arrival streams

来源：评论

学校读者我要写书评

暂无评论

A MULTIPLE-CHANNEL FREE-ACCESS collision resolution ALGORITHM BASED CONNECTION REQUEST PROCEDURE FOR LAND MOBILE SATELLITE NETWORKS

引用

International Journal of Satellite Communications and Networking 1996年第4期14卷

作者： HARRY H. TAN TSUN-YEE YAN Electrical and Computer Engineering Department University of California Irvine Irvine CA 92717 U.S.A Communications System Research Section Jet Propulsion Laboratories 4800 Oak Grove Drive Pasadena CA 91109 U.S.A.

A new binary feedback multiple-channel free-access (MCFA) collision resolution algorithm (CRA) based random-access protocol (RAP) is devised to implement the connection request procedure for demand-assigned channel access protocols in land mobile satellite communications networks. The maximum stable throughput of this protocol is derived and is shown to be superior to a previously devised multiple-channel obvious blocked-access CRA based RAP as well as to slotted ALOHA. The throughput performance is also superior to the previously devised multiple-channel window blocked-access CRA based RAP for four or more channels. An exact analysis of the average packet delay for this MCFA CRA based RAP is given and shown to be in excellent agreement with computer simulation results. The protocol is shown to have smaller average delays than the best single-channel free access CRA based RAPs over a wide range of practically usable throughput rates with reasonable delays. This MCFA CRA based RAP was implemented on a channel request protocol test-bed simulator which incorporates the physical link characteristics of the MSAT-X land mobile satellite system. These test-bed simulation results also demonstrate the superiority of this protocol over slotted ALOHA for both error-free channel and mobile facing channel scenarios.

关键词： mobile satellite networks demand assigned protocols collision resolution algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：