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

Performance of a tree-based collision resolution algorithm in cellular systems with smart antennas

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2007年第3期6卷 1143-1151页

作者： Jin, Haipeng Acampora, Anthony Univ Calif San Diego Ctr Wireless Commun La Jolla CA 92097 USA

A smart antenna's ability to simultaneously resolve more than one user on the same channel is exploited to help expedite the process of random access, especially for the reverse channel. However, use of a smart antenna requires frequent array adaptation, a difficult task in a random access environment. In papers[1] and [2], we proposed and studied the SINR performance of a media access protocol intended for use with smart antennas. In this paper, we study the random access performance of the proposed protocol when a fast collision resolution algorithm is used. Found are the maximum achievable throughput and an upper bound on the expected delay. The impact of the number of antennas on the performance with both flat fading and frequency selective fading is studied. Typical results show significant improvement in throughput for systems with smart antennas. For example, when the fading is flat, the gain in maximum achievable throughput can be as large as 232 and 550% with four and eight antenna elements respectively. Even when severe frequency selective fading is present, there is a gain of 40% and 145% with four and eight antenna elements, respectively. We also show that dynamically adjusting the retransmission probability in the collision resolution process is not worthwhile since this extra complexity produces a gain of only about 6.2% in the best case.

关键词： collision resolution algorithm random access smart antenna

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison of collision resolution algorithms with Amount of Feedback Information

Performance Comparison of Collision Resolution Algorithms wi...

引用

International Symposium on Wireless and Pervasive Computing (ISWPC)

作者： Wattanamongkhol, Norrarat Burapha Univ Fac Engn Dept Elect Engn Chon Buri Thailand

ISBN: (纸本)9781479921850

This paper presents the performance comparison of eight collision resolution algorithms. It can be systematically applied for random access protocols under different feedback information which includes binary, ternary and feedback of the number of accessing packets. Each algorithm is derived from the combination of uniform selection algorithm and three effective strategies, including splitting, adaptive frame size, and skipped slot. This paper aims to investigate which one strategy in these three strategies is the best effective to improve the system performance. Based on simulation results, when the information about number of accessing packets is available, significant improvement in mean access delay can be achieved. We found that the splitting strategy is the most effective strategy, following by adaptive frame size and skipped slot.

关键词： collision resolution algorithm tree algorithm feedback information MAC protocol

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a collision resolution protocol with random packet sizes

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1996年第5期E79B卷 719-721页

作者： Chung, W Un, C KOREA ADV INST SCI & TECHNOL DEPT ELECT ENGN COMMUN RES LAB YUSUNG GU TAEJON 305701 SOUTH KOREA

In ths letter, we suggest a collision resolution algorithm when the packer length is random, and analyze its throughput and delay performance. Here, three different packet length distributions and two feedback schemes... 详细信息

关键词： multiple access protocol collision resolution algorithm

来源：评论

学校读者我要写书评

暂无评论

HIPERLAN/1 MAC protocol: Stability and performance analysis

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2000年第9期18卷 1787-1798页

作者： Anastasi, G Lenzini, L Mingozzi, E Univ Pisa Dept Informat Engn I-56126 Pisa Italy

HIPERLAN Type 1 is a standard for high-speed wireless local area networks, developed by the European Telecommunications Standards Institute (ETSI), It supports directed point-to-point communication based on ad hoc network topology at a data transfer rate on the air interface of 23.5 Mbit/s, The paper deals with an analytical and simulation analysis of the HIPFRLAN/1 MAC protocol. General closed formulas are derived for the major channel access performance indexes, which are used both to prove the operational stability of the MAC protocol, and to derive a figure for the maximum channel utilization achievable. A simulation analysis is then carried out, focusing both on the influence of traffic burstiness on protocol performance, and on the capability to manage traffic classes with different quality of service (QoS) requirements. Simulation results show that HIPERLAN/1 is well suited for managing the bursty traffic that is expected to be generated by wireless LAN applications. Furthermore, HIPERLAN/1 provides a good isolation of the delay-sensitive traffic from the best effort traffic.

关键词： collision resolution algorithm HIPERLAN quality of service wireless LAN

来源：评论

学校读者我要写书评

暂无评论

The space division multiple access protocol: asynchronous implementation and performance

引用

COMPUTER COMMUNICATIONS 1998年第3期21卷 227-242页

作者： Barnett, L Univ Richmond Dept Math & Comp Sci Richmond VA 23173 USA

Implementation of communication protocols based on collision resolution algorithms on broadcast bus networks requires a level of synchronization among participating stations such that idle steps in the algorithm can be globally and unambiguously detected. We present performance results for two collision resolution algorithms, the Capetanakis tree protocol and space division multiple access, a new algorithm, using a previously described asynchronous implementation technique. Two variants of space division multiple access are discussed. One variant improves upon the mechanism for implementing the necessary synchronization. The other relaxes the requirements for a station with a new packet joining the resolution algorithm. The performance effects of these variations are examined by simulating the behavior of the protocols. The variants are shown to improve the performance of the protocol under some traffic loads. In addition, one of the variants is shown to improve on the fairness of the original algorithm over a variety of offered loads and maximum data rates. (C) 1998 Elsevier Science B.V.

关键词： local area network MAC protocol collision resolution algorithm

来源：评论

学校读者我要写书评

暂无评论

Scale-free, self-organizing very large sensor networks

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2010年第5期70卷 612-622页

作者： Marinescu, Dan C. Yu, Chen Marinescu, Gabriela M. Univ Cent Florida Sch Elect Engn & Comp Sci Orlando FL 32816 USA

In this paper we introduce SFSN, an algorithm for self-organization of Very Large Sensor Networks (VLSN). The 106 or more tiny and inexpensive sensors of a VLSN are indistinguishable from one another;they do not have either a physical or a logical address, as required by the traditional communication protocols. The self-organization scheme limits the number of partners each sensor collaborates with, thus, it limits the amount of communication and the complexity of coordination. The system is scalable, the amount of state information each node has to maintain is strictly limited regardless of the total number of sensors in the network. The systems we consider mimic biological systems where individual cells of the same type are indistinguishable. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Sensor networks Self-organization Anonymous nodes Multiple access collision resolution algorithm Event

来源：评论

学校读者我要写书评

暂无评论

Multiple access control with intelligent bandwidth allocation for wireless ATM networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2000年第9期18卷 1658-1669页

作者： Yuang, MC Tien, PL Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan

Two major challenges pertaining to wireless asynchronous transfer mode (ATM) networks are the design of multiple access control (MAC), and dynamic bandwidth allocation. While the former draws more attention, the latter has been considered nontrivial and remains mostly unresolved, In this paper, we propose a new intelligent multiple access control system (IMACS) which includes a versatile MAC scheme augmented with dynamic bandwidth allocation, for wireless ATM networks. IMACS supports four types of traffic-CBR, VER, ABR, and signaling control (SCR), It aims to efficiently satisfy their diverse quality-of-service (QoS) requirements while retaining maximal network throughput. IMACS is composed of three components: multiple access controller (MACER), traffic estimator/predictor (TEP), and intelligent bandwidth allocator (IBA), MACER employs a hybrid-mode TDMA scheme, in which its contention access is based on a new dynamic-tree-splitting (DTS) collision resolution algorithm parameterized by an optimal splitting depth (SD), TEP performs periodic estimation and on-line prediction of ABR self-similar traffic characteristics based on wavelet analysis and a neural-fuzzy technique. IBA is responsible for static bandwidth allocation for CBR/VBR traffic following a closed-form formula. In cooperation with TEP, IBA governs dynamic bandwidth allocation for ABR/SCR traffic through determining the optimal SD. The optimal SD's under various traffic conditions are postulated via experimental results, and then off-line constructed using a back propagation neural network (BPNN), being used on-line by IBA, Consequently, with dynamic bandwidth allocation, IMACS offers various QoS guarantees and maximizes network throughput irrelevant to traffic variation.

关键词： bandwidth allocation collision resolution algorithm multiple access control (MAC) neural-fuzzy technique quality-of-service (QoS) self-similar traffic wireless asynchronous transfer mode networks (WATM)

来源：评论

学校读者我要写书评

暂无评论

THROUGHPUT ANALYSIS OF BLOCKED ACCESS TREE algorithmS WITH MINI-SLOTS

COMPUTER NETWORKS AND ISDN SYSTEMS

引用

COMPUTER NETWORKS AND ISDN SYSTEMS 1989年第3期17卷 201-221页

作者： OIE, Y NISHIO, S HASEGAWA, T OSAKA UNIV FAC ENGN SCIDEPT INFORMAT & COMP SCITOYONAKAOSAKA 560JAPAN KYOTO UNIV FAC ENGNDEPT APPL MATH & PHYSKYOTO 606JAPAN SASEBO COLL TECHNOL DEPT ELECT ENGNSASEBO 85711JAPAN

The tree-based collision resolution algorithms have been extensively studied because of their stable behavior. Some of these studies have employed control mini-slots in order to improve the performance of tree-based algorithms. This paper analyzes the maximum stable throughput of two Q -ary blocked access tree algorithms with mini-slots: one (TA/M-BF) assumes that something/nothing binary feedback information is available in a mini-slot, and the other (TA/M-TF) assumes ternary feedback information in a mini-slot. Both algorithms allow all users having new packets to transmit them in the slot immediately after the previously collided packets are resolved (i.e., blocked access algorithms). The stability of these algorithms is affected by two critical values of the throughpuut; the lower critical value is called the maximum stable throughput. We offer a way to derived those values exactly. The effect of mini-slot length on the maximum stable throughput is also evaluated. Furthermore, the performance of the above two algorithms is compared on the basis of numerical results drawn from our analysis.

关键词： Random Access collision resolution algorithm Tree algorithm Stability Maximum Throughput Mini-slots

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：