A Random Access Protocol for Pilot Allocation in Crowded Massive MIMO Systems

The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user equipments (UEs). These gains are only achieved in practice if many more UEs can connect efficiently to the network than today. As the number of UEs increases, while each UE intermittently accesses the network, the random access functionality becomes essential to share the limited number of pilots among the UEs. In this paper, we revisit the random access problem in the Massive MIMO context and develop a reengineered protocol, termed strongest-user collision resolution (SUCRe). An accessing UE asks for a dedicated pilot by sending an uncoordinated random access pilot, with a risk that other UEs send the same pilot. The favorable propagation of Massive MIMO channels is utilized to enable distributed collision detection at each UE, thereby determining the strength of the contenders' signals and deciding to repeat the pilot if the UE judges that its signal at the receiver is the strongest. The SUCRe protocol resolves the vast majority of all pilot collisions in crowded urban scenarios and continues to admit UEs efficiently in overloaded networks.Comment: To appear in IEEE Transactions on Wireless Communications, 16 pages, 10 figures. This is reproducible research with simulation code available at https://github.com/emilbjornson/sucre-protoco

Carrier Sense Random Packet CDMA Protocol in Dual-Channel Networks

Code resource wastage is caused by the reason that many hopping frequency (FH) sequences are unused, which occurs under the condition that the number of the actual subnets needed for the tactical network is far smaller than the networking capacity of code division net¬working. Dual-channel network (DCN), consisting of one single control channel and multiple data channels, can solve the code resource wastage effectively. To improve the anti-jamming capability of the control channel of DCN, code division multiple access (CDMA) technology was introduced, and a carrier sense random packet (CSRP) CDMA protocol based on random packet CDMA (RP-CDMA) was proposed. In CSRP-CDMA, we provide a carrier sensing random packet mechanism and a packet-segment acknowledgement policy. Furthermore, an analytical model was developed to evaluate the performance of CSRP-CDMA networks. In this model, the impacts of multi-access interference from both inter-clusters and intra-clusters were analyzed, and the mathematical expressions of packet transmission success probability, normalized network throughput and signal interference to noise ratio, were also derived. Analytical and simulation results demonstrate that the normalized network throughput of CSRP-CDMA outperforms traditional RP-CDMA by 10%, which can guarantee the resource utilization efficiency of the control channel in DCNs

Age-of-Information Dependent Random Access for Massive IoT Networks

As the most well-known application of the Internet of Things (IoT), remote monitoring is now pervasive. In these monitoring applications, information usually has a higher value when it is fresher. A new metric, termed the age of information (AoI), has recently been proposed to quantify the information freshness in various IoT applications. This paper concentrates on the design and analysis of age-oriented random access for massive IoT networks. Specifically, we devise a new stationary threshold-based age-dependent random access (ADRA) protocol, in which each IoT device accesses the channel with a certain probability only when its instantaneous AoI exceeds a predetermined threshold. We manage to evaluate the average AoI of the proposed ADRA protocol mathematically by decoupling the tangled AoI evolution of multiple IoT devices and modeling the decoupled AoI evolution of each device as a Discrete-Time Markov Chain. Simulation results validate our theoretical analysis and affirm the superior age performance of the proposed ADRA protocol over the state-of-the-art age-oriented random access schemes.Comment: Accepted to appear at INFOCOM 2020 Workshop on Age of Informatio

Wavelength and time division multiplexing with lightpath trespassing for all-optical star local area networks

Many medium access control protocols have been proposed for optical wavelength division multiplexing local area networks with a star topology. These protocols range from those based on the concept of fixed-assignment of communication subchannels, such as TDMA (Time Division Multiple Access); reservation of communication subchannels, such as DAS (Dynamic Allocation Scheme); or random-access to communication subchannels, such as DT-WDMA (Dynamic Time-Wavelength Division Multiple Access). In addition various hybrid protocols have been considered, for example, protocols incorporating both fixed-assignment and reservation rules, such as HTDM (Hybrid TDM). This thesis is on a novel hybrid protocol of fixed-assignment and random-access called "WTDMA with lightpath trespassing". This protocol combines the most desirable aspects of fixed-assignment and random-access protocols, while limiting their drawbacks. The performance of different versions of the protocol are analysed both mathematically and by stochastic simulation. The obtained results justify the introduction of the WTDMA with trespassing protocol, and indicate the situations where its use is advantageous

Performance analysis of feedback-free collision resolution NDMA protocol

To support communications of a large number of deployed devices while guaranteeing limited signaling load, low energy consumption, and high reliability, future cellular systems require efficient random access protocols. However, how to address the collision resolution at the receiver is still the main bottleneck of these protocols. The network-assisted diversity multiple access (NDMA) protocol solves the issue and attains the highest potential throughput at the cost of keeping devices active to acquire feedback and repeating transmissions until successful decoding. In contrast, another potential approach is the feedback-free NDMA (FF-NDMA) protocol, in which devices do repeat packets in a pre-defined number of consecutive time slots without waiting for feedback associated with repetitions. Here, we investigate the FF-NDMA protocol from a cellular network perspective in order to elucidate under what circumstances this scheme is more energy efficient than NDMA. We characterize analytically the FF-NDMA protocol along with the multipacket reception model and a finite Markov chain. Analytic expressions for throughput, delay, capture probability, energy, and energy efficiency are derived. Then, clues for system design are established according to the different trade-offs studied. Simulation results show that FF-NDMA is more energy efficient than classical NDMA and HARQ-NDMA at low signal-to-noise ratio (SNR) and at medium SNR when the load increases.Peer ReviewedPostprint (published version

CSMA/RN: A universal protocol for gigabit networks

Networks must provide intelligent access for nodes to share the communications resources. In the range of 100 Mbps to 1 Gbps, the demand access class of protocols were studied extensively. Many use some form of slot or reservation system and many the concept of attempt and defer to determine the presence or absence of incoming information. The random access class of protocols like shared channel systems (Ethernet), also use the concept of attempt and defer in the form of carrier sensing to alleviate the damaging effects of collisions. In CSMA/CD, the sensing of interference is on a global basis. All systems discussed above have one aspect in common, they examine activity on the network either locally or globally and react in an attempt and whatever mechanism. Of the attempt + mechanisms discussed, one is obviously missing; that is attempt and truncate. Attempt and truncate was studied in a ring configuration called the Carrier Sensed Multiple Access Ring Network (CSMA/RN). The system features of CSMA/RN are described including a discussion of the node operations for inserting and removing messages and for handling integrated traffic. The performance and operational features based on analytical and simulation studies which indicate that CSMA/RN is a useful and adaptable protocol over a wide range of network conditions are discussed. Finally, the research and development activities necessary to demonstrate and realize the potential of CSMA/RN as a universal, gigabit network protocol is outlined

Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite bad. On the other hand, although some simple heuristics (such as distributed approximations of greedy maximal scheduling) can yield much better delay performance for a large set of arrival rates, they may only achieve a fraction of the capacity region in general. In this paper, we propose a discrete-time version of the CSMA algorithm. Central to our results is a discrete-time distributed randomized algorithm which is based on a generalization of the so-called Glauber dynamics from statistical physics, where multiple links are allowed to update their states in a single time slot. The algorithm generates collision-free transmission schedules while explicitly taking collisions into account during the control phase of the protocol, thus relaxing the perfect CSMA assumption. More importantly, the algorithm allows us to incorporate mechanisms which lead to very good delay performance while retaining the throughput-optimality property. It also resolves the hidden and exposed terminal problems associated with wireless networks.Comment: 12 page

Efficient collision resolution protocol for highly populated wireless networks

An efficient Medium access control (MAC) protocol is an important part of every wireless system. It prevents multiple devices from accessing the channel at the same time by defining rules for orderly access. Due to the fact that wireless networks have received enormous popularity in the last 10 - 15 years, number of users in these networks increased dramatically. Thus, support of large user population for modern MAC protocol is not an option anymore but a necessity, especially for dense Wireless Sensor Networks (WSNs). This work proposes a novel random MAC protocol for wireless networks named BCSMA/CA that can provide high channel throughput for very large number of users. The main idea of the protocol is based on the absence of backoff intervals where the channel is idle and using this time for active collision resolving. By presented analytical model and means of simulation, performance of the proposed protocol itself as well as in the framework of 802.11 Distributed Coordination Function (DCF) is explored. Corresponding comparison shows that 802.11 under BCSMA/CA is more suitable for applications where number of users is large compared to the traditional DCF approach

QoS support with taguchi method in simulation modeling hybrid architecture of optical and multihop wireless ad hoc networks

Majority of the resource consumption is consumed for their operation in the access network of mobile wireless part because of its dynamic topology and limited range of each mobile host's wireless transmissions. This paper presents a technique using OMNeT++ software for building a design of experiment simulation model with Taguchi optimization method supported mobile circumstantial network (MANET) of AODVUU communication protocol to be apply into collaborate multiple layers framework of deploy over passive optical network (PON) referred to as the walk Mobile Hybrid optical wireless access network (erL-MMHOWAN). it's to guage the network quality of service effectively that take into account variety of nodes over that the Edouard Manet could operate. Its performance is examined on the known performance metrics just like the network capability and energy consumption. Simulation result shows for the random mobile property during this convergence of heterogeneous optical wireless network will perform higher with the optimized front-end wireless circumstantial

Opportunistic contention-based feedback protocol for downlink OFDMA systems with mixed traffic

An opportunistic feedback protocol is proposed for orthogonal frequency division multiple access (OFDMA) systems with mixed realtime (RT) and non-realtime (NRT) traffic. This protocol allocates a dedicated feedback channel for each RT user, while it allows all NRT users to compete to send feedback via a contention-based random access feedback channel. The proposed feedback protocol requires a fixed amount of resource to carry feedback from all RT users and some selected NRT users. The probability that NRT users attempt to send feedback is based on two parameters: a channel quality threshold, and the number of subcarriers (or clusters) whose channel quality is above the threshold. Simulation results demonstrate that allocating a dedicated feedback channel for RT user improves the achievable throughput significantly compared with allocating a dedicated traffic channel. For NRT users, the achievable sum rate of the proposed protocol when the number of users is moderate (20-50 users) approaches the ideal case when the channel quality of all users is known at the base station. The sum rate also is close to the ideal case when the number contention minislots per subcarrier is as low as 2 minislot per subcarrier. © 2009 Springer-Verlag Berlin Heidelberg