An approximate analysis of TDMA out-of-slot random access protocols for microcellular mobile communications

In this paper, out-of-slot random access protocols for voice services that operate in microcellular environment are studied and simulated. The bearer service is assumed to be structured as time division multiple access/frequency division multiple access/frequency division duplex (TDMA/ FDMA/FDD). According to a stratification of information flow ascall, talkspurt, andpacket, the protocols are implemented at the talkspurt level. During a call, talkspurts generate a stream of packets. Each talkspurt has to reserve a voice time slot with a special control packet sent in a dedicate control slot (out of slot signaling). After a successful access, a voice slot is assigned for the duration of the talkspurt. This work concentrates on the out of slot random access method. When a transition from the idle state to the active state occurs, a voice terminal starts generating a talkspurt. Access for a voice slotV is then initiated via a dedicated control slotC. The time spent in gaining aV slot depends on the kind of random access protocol used in theC slots. Once the access reservation phase is successful, the talkspurt starts the second phase of information transmission in a freeV slot. If allV slots are occupied by other talkspurts, the new talkspurt is queued until aV slot becomes free. If the sum of the access and queueing times exceeds a thresh-old, a portion of the talkspurt is clipped. In our work we define an analytical model to evaluate the percentage of clipped voice packets. Simulations validate the analytical model.The second version of this work was rewritten while the author was a visiting scholar at WINLABThe IS-54 standard itself has the TDMA/FDMA structure. The ETDMA enhancement appears to be very much like what is described in this paper.     

An adaptive reservation scheme for VBR voice traffic in wireless ATM networks

A reservation scheme, named dynamic hybrid partitioning, is proposed for the Medium Access Control (MAC) protocol of wireless ATM (WATM) networks operating in Time Division Duplex (TDD) mode. The goal is to improve the performance of the real-time Variable Bit Rate (VBR) voice traffic in networks with mixed voice/data traffic. In most proposed MAC protocols for WATM networks, the reservation phase treats all traffic equally, whether delay-sensitive or not. Hence, delay-sensitive VBR traffic sources have to compete for reservation each time they wake up from idle mode. This causes large and variable channel access delays, and increases the delay and delay variation (jitter) experienced by ATM cells of VBR traffic. In the proposed scheme, the reservation phase of the MAC protocol is dynamically divided into a contention-free partition for delay-sensitive idle VBR traffic, and a contention partition for other traffic. Adaptive algorithms dynamically adjust the partition sizes to minimize the channel bandwidth overhead. Simulation results show that the delay performance of delay-sensitive VBR traffic is improved while minimizing the overhead.     

Relay selection for secrecy connectivity in random wireless networks

In the paper, we study the problem of secure connectivity for colluding eavesdroppers using relay selection in random wireless networks, where the relay nodes and eavesdroppers are all randomly distributed according to two independent Poisson point process. The decode‐and‐forward and randomize‐and‐forward two relay strategies are considered, and a new metric is defined for best relay selection and random relay selection. We derive closed‐form expressions for the secrecy outage probability for the two relay strategies. In particular, the effect of power allocation ratio and the maximum ratio combing at the destination node on the secrecy outage probability is demonstrated for the decode‐and‐forward relay strategy. Numerical results illustrate the secrecy performance gains with collaborative transmit diversity. © 2016 The Authors. Wireless Communications and Mobile Computing Published by John Wiley & Sons Ltd.     

Pervasive data access in wireless and mobile computing environments

The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. With wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey paper reviews important works in two important dimensions of pervasive data access: data broadcast and client caching. In addition, data access techniques aiming at various application requirements (such as time, location, semantics and reliability) are covered. Copyright © 2006 John Wiley & Sons, Ltd.     

Performance analysis of a multiple access protocol for voice and data support in multiuser broadband wireless LANs

Wireless Local Area Networks (WLANs) is one of the most promising access technologies for the upcoming fourth-generation wireless communication systems. In the last few years, several research efforts have been devoted to investigate possible multiple access schemes capable of supporting real-time traffic as well as best-effort data transmissions. In particular, the use of suitable transmission schemes allows not only to achieve higher data-rates, but also to perform resource allocation in order to guarantee specific service requirements. In this paper we propose a medium access control (MAC) scheme for a WLAN supporting real-time (voice) and best-effort (data) services, based on Orthogonal Frequency Division Multiplexing (OFDM) technique. A suitable analytical approach is proposed in order to derive the performance of the proposed MAC scheme. In particular, it is shown in the paper that a high overall network capacity in terms of simultaneously active users is achieved by effectively exploiting the multiuser capabilities offered by OFDM, together with a proper service differentiation. Work partially supported by MIUR within the WOMEN project. Romano Fantacci, (M’87,SM’91, F’05) born in Pistoia, Italy, graduated from the Engineering School of the Universit di Firenze, Florence, Italy, with a degree in electronics in 1982. He received his Ph.D. degree in telecommunications in 1987. After joining the Dipartimento di Elettronica e Telecomunicazioni as an assistant professor, he was appointed associate professor in 1991 and full professor in 1999. His current research interests are digital communications, computer communications, queuing theory, satellite communication systems, wireless broadband communication networks, ad-hoc and sensor networks. He has been involved in several European Space Agency (ESA) and INTELSAT advanced research projects. He is the author of numerous articles published in prestigious communication science journals. He guest edited special issues in IEEE Journals and magazines and served as symposium chair of several IEEE conferences, including VTC, ICC and Globecom. Professor Fantacci received the IEE IERE Benefactor premium in 1990 and IEEE COMSOC Award Distinguished Contributions to Satellite Communications in 2002. He is currently serving as Editor for Telecommunication Systems, IEEE Trans. Commun. and IEEE Transactions on Wireless Communications. Gianluca Vannuccini born in Florence, Italy, graduated in Electronics Engineering in 1999. He received his Ph.D. degree in Telematics and Information Society in 2003 from the Electronics and Telecommunications Department of the University of Florence. During 2002 he was for six months in IBM Zurich Research Laboratory, Zurich, Switzerland, working in a research project on IEEE 802.11e performance evaluation. During the Ph.D. course, he has published on several IEEE conferences and served as reviewer for several journals on the telecommunications and telematics research area. He has been IEEE student member since 1999 and IEEE member since 2004. He is now with the IT department of the Florence local government organization, where he works as a program manager on data quality and integration and e-government IT projects. Gabriele Vestri was born in Florence (Italy) in November 1976. He received his degree in telecommunications from the Universit di Firenze, Florence, Italy, in March 2002. He has been research scientist for CSO Ophthalmic (Florence) since September 2002. His current research interests include ophthalmic instruments, contact lens design, image processing, the effects of optical aberrations and of retinal architecture of the eye on visual performance.     

A multiple access protocol with explicit and implicit reservation

A new version of a MAC‐level protocol is introduced and investigated, operating in a cellular environment, where a base station co‐ordinates mobile users within each cell. The channel multiplexing structure is based on time division, and the slots in each frame are dynamically assigned to the users and their service classes by the cell base station. Decisions are taken on the basis of binary channel feedback information (collision/no collision), by assuming independence in the presence of packets at the mobile stations, and aim at maximizing the one‐step throughput in the current frame. The frame is divided into two periods: the first (short) one contains a number of minislots, equal to the number of ‘real’ slots (i.e. those capable of containing a fixed size packet) of the second part. At the beginning of the frame, the access rights are computed and broadcast to the users; the enabled stations that have a packet to transmit respond, by sending a short burst that contains their ID in a minislot. This most recent feedback is used at the base station to update the parameters of the decision algorithm, which is then re‐applied to yield the final access rights for the second part of the frame. The performance of the scheme is analysed by simulation in the presence of mixed voice and data traffic, and compared with those of a reservation random access protocol using the same algorithm in a single‐phase fashion (RRA‐ISA) and PRMA. Copyright © 2001 John Wiley & Sons, Ltd.     

Low hitting time random walks in wireless networks

Random walks can be conveniently exploited for implementing probabilistic algorithms to solve many searching problems arised by distributed applications, for example, service discovery, p2p file sharing, etc. In this paper we consider random walks executed on uniform wireless networks and study how to reduce the expected number of walk steps required to reach a target, namely the hitting time. The latter is the main search performance metric of a random walk based algorithm, since it determines the average response to a search as well as its cost; thus, the actual convenience of using random walks compared to other solutions depends on achieving a low hitting time. We show how in uniform wireless networks, the natural implementation of a random walk which selects the next node to visit at random among all neighbors is not a good choice, since it has a strong negative effect on the hitting time. This paper studies such a negative effect analytically and proposes two neighbor selection rules aiming at reducing the hitting time. A simulation study confirms the benefits of the proposed solutions. Copyright © 2008 John Wiley & Sons, Ltd.     

基于信息覆盖的无线传感器网络访问控制机制

通过周期性地信息扩散,设计THC(two-hop cover)算法,使传感器节点能够在用户移动过程中及时得到用户的认证信息.基于THC算法,引入Merkle散列树和单向链等安全机制,采用分布式的访问控制模式,提出了适用于随机移动用户的传感器网络访问控制机制.分析和实验表明,本机制既适用移动用户,也适用静止用户,计算、通信、存储开销低,能够抵制节点捕获、重放、DoS等攻击.     

A network‐centric approach for access and interface selection in heterogeneous wireless environments

In this paper, we introduce a network‐based approach for access and interface selection (AIS) in the context of resource management in heterogeneous wireless environments (UMTS, WLAN and DVB‐T). We focus on the optimization of resource utilization, while ensuring acceptable quality of service (QoS) provision to the end users. Our objective is to optimally manage the overall system resources and minimize the possibility of QoS handovers (non‐mobility handovers). The adopted architecture applies to typical heterogeneous environments and network entities (Access Routers) are enhanced with extra functionalities. We propose an AIS algorithm that exploits the multihoming concept and globally manages network resources at both radio access and IP backbone networks. The algorithm can estimate near‐optimal solutions in real time and we also introduce a novel triggering policy. We present simulation results of typical scenarios that demonstrate the advantages of our approach. System performance metrics, derived from the simulations, show minimum degradations in high load and congestion situations. Copyright © 2007 John Wiley & Sons, Ltd.     

Tiered bandwidth reservation scheme for multimedia wireless networks

It is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier‐based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright © 2008 John Wiley & Sons, Ltd.     

基于图转换的无线接入点关联优化算法

无线接入点关联是 Wi-Fi 系统中的一个基础问题。已有的研究主要集中在考虑带宽容量约束条件下的各种AP关联问题。这些研究没有从用户的角度考虑带宽需求,从用户的带宽需求出发,以最多带宽分配的AP关联为优化目标,考虑混合型网络架构下的Wi-Fi系统的无线接入点关联优化问题。与已有研究方法不同,通过图转换技术,并将问题转化为流图上的优化问题,提出基于网络流的优化求解算法,并从理论上证明算法的最优性。最后,通过对比实验进一步证明了算法的优越性。     

一种有线无线一体化的集团用户接入系统及其实现

有线无线一体化技术是通讯网的发展趋势。介绍了如何对现有的有线接入系统进行改进,并增加对无线业务的处理,从而实现了针对集团用户的有线无线一体化的综合接入系统。     

无线接入新技术应用研究

简要介绍超宽带、无线保真及全球微波接入互通等无线接入技术,着重讨论无线保真与全球微波接入互通宽带无线接入技术的技术特点、发展现状及其应用情况,分析了“无线城市”与城域宽带无线网络的应用前景,举例说明“无线城市”的通信模型,最后,展望无线接入新技术的发展前景。     

无冲突话音/数据综合业务分组预约多址(CF-IPRMA)协议及其性能

本文提出了无冲突话音／数据综合业务的ＰＲＭＡ协议：ＣＦ－ＩＰＲＭＡ协议,并利用马尔可夫链模型法,对ＣＦ－ＩＰＲＭＡ协议中的数据通信性能进行了分析;分析结果表明,该协议在保证话音通信质量的前提下,具有较高的数据业务通过率。     

一种固定位置MTC设备的随机接入改进算法

针对海量机器类通信(Massive Machine Type Communications, mMTC)场景下传统随机接入存在大量前导碰撞问题,提出了一种对终端侧和基站侧的接入改进算法,利用前导标记序列和固定位置随机接入终端的定时提前(Timing Advance, TA)信息,使得基站能合理地确定应该向哪些终端回复随机接入响应消息,避免碰撞终端占用资源发送消息3(Message 3,Msg3),实现前导高效利用。仿真表明,该算法在均匀分布和Beta分布接入模型下均能有效降低前导碰撞概率,提高终端的接入成功率,并且拥有合理的平均接入时延。     

多信道多点分配系统-一种新的宽带固定无线接人技术

多信道多点分配系统（Multichannel Multipoint Distribution System MMDS）是近几年刚刚兴起和获得商业应用的宽带固定无线接入技术，它具有中宽带、中等数据传输速率以及应用灵活、设备安装速度快、投资少，收益大等特点，可以为中小企业提供各种宽带交互式数据，话音和视频传输业务，成为宽带接入技术中不可忽视的重要组成部分。     

An overview of using directional antennas in wireless networks

Compared with omni‐directional antennas, directional antennas have many merits, such as lower interference, better spatial reuse, longer transmission range, and improved network capacity. Directional antennas enable numerous emerging outdoor and indoor applications, which have been addressed in many recent studies. Despite the advances in wireless networks with directional antennas (DAWNs), there are many research challenges in all layers of DAWNs. This paper presents a detailed study on recent advances and open research issues on DAWNs. Firstly, we briefly introduce the classification of directional antennas, antenna radiation patterns, antenna modes, and the challenges in the physical layer of DAWNs. We then present research issues on the medium access control (MAC) layer, followed by the current solutions as well as open research problems on the MAC layer of DAWNs. In addition, we also discuss the research issues on the routing layer and the transport layer. Moreover, other research challenges on the performance evaluation of DAWNs and a brief introduction of indoor DAWNs are given in this paper as well. In conclusion, we summarize the current research issues on DAWNs as well as prospects in the future. Copyright © 2011 John Wiley & Sons, Ltd.     

60 GHz超高速无线网络接入机制研究

首先介绍了工作在60 GHz频段、支持1 Gbit/s以上数据速率的IEEE 802.15.3c标准和IEEE 802.11ad标准草案规定的无线接入机制的基本原理,然后对它们的特点和性能进行了详细的对比分析。研究结果显示:2种无线接入机制都采用了TDMA+CSMA/CA的混合机制,但各有所长;IEEE 802.11ad接入机制兼容性更好,能达到更高的数据速率,然而原理更复杂;IEEE 802.15.3c接入机制实现相对简单,同样也能达到Gbit/s级别的数据速率。最后,对全文进行总结并指出了未来的研究方向。     

面向mMIMO系统的模式分割随机接入方案

为提升海量机器类通信（massive machine-type communication,m MTC）设备的随机接入（random access,RA）性能,提出一种面向大规模多输入多输出（massive multiple-input multiple-output,m MIMO）系统的模式分割随机接入（pattern division random access,PDRA）方案。该方案将导频竞争空间扩展到模式域,通过叠加同一ZC(Zadoff-Chu）根序列的L个不同循环移位序列,设计基于“图样叠加”的模式域导频,在不增加物理资源的前提下扩大导频集合。仿真结果表明,在不影响信道估计和数据检测性能的前提下,与传统RA方案相比,PDRA方案能够显著降低导频碰撞概率,提高接入成功率。     

Deep and robust resource allocation for random access network based with imperfect CSI

A deep and robust resource allocation framework was proposed for the random access based wireless networks,where both the communication channel state information (C-CSI) and the interference channel state information (I-CSI) were uncertain.The proposed resource allocation framework considered the optimization objective of wireless networks as a learning problem and employs deep neural network (DNN) to approximate optimal resource allocation policy through unsupervised manner.By modeling the uncertainties of CSI as ellipsoid sets,two concatenated DNN units were proposed,where the first was uncertain CSI processing unit and the second was the power control unit.Then,an alternating iterative training algorithm was developed to jointly train the two concatenated DNN units.Finally,the simulations verify the effectiveness of the proposed robust leaning approach over the nonrobust one.