Performance analysis of a slotted CDMA ALOHA network

ALOHA is a simple and efficient way of allowing many machines with bursty data streams to communicate with a central computer. For cases where machines are equally likely to transmit to one another, CDMA ALOHA, which allows for full connectivity, may be a better multiple access protocol than slotted ALOHA through a central machine. This paper first describes a model for a fully connected, full duplex, and slotted CDMA ALOHA network where the receiver-based code access protocol is used. The stations can send data to, and receive data from, different stations simultaneously. The model is analyzed using discrete-time Markov chain, and some numerical results are presented. For a system with a large number of users where Markov analysis is impractical, equilibrium point analysis is used to predict the stability of the system and determine the throughput as well as the delay performance of the system when it is stable. It is shown that a CDMA slotted ALOHA network has a much better performance compared to simple slotted ALOHA networks.     

Performance comparison of a slotted ALOHA DS/SSMA network and amultichannel narrow-band slotted ALOHA network

Throughput, delay, and stability for two slotted ALOHA packet radio systems are compared. One system is a slotted direct-sequence spread-spectrum multiple-access (DS/SSMA) network where each user employs a newly chosen random signature sequence for each bit in a transmitted packet. The other system is a multiple-channel slotted narrow-band ALOHA network where each packet is transmitted over a randomly selected channel. Accurate packet success probabilities for the code-division multiple-access (CDMA) system are computed using an improved Gaussian approximation technique which accounts for bit-to-bit error dependencies. Average throughput and delay results are obtained for the multiple-channel slotted ALOHA system and CDMA systems with block error correction. The first exit time (FET) is computed for both systems and used as a measure of the network stability. The CDMA system is shown to have better performance than the multiple-channel ALOHA system in all three areas     

Pereormance analysis of slotted ALOHA for land mobile satellite networks

The ALOHA protocol has been proposed for accessing reservation channels in demand-assigned channel access protocols for land mobile satellite communications networks. This paper provides a rigorous performance analysis of both the slotted ALOHA protocol and two-packet replication ALOHA protocol taking into account the effects of the fading multipath communications environment. Throughput, delay and stability of these two protocols are determined using a Gilbert channel error model with memory. Comparison of slotted ALOHA and two-packet replication ALOHA shows that a smaller average delay can be achieved by replication. Moreover average throughput is improved in some cases. However replication reduces stability.     

Performance analysis of wireless multi-user VoIP system with adaptive modulation and coding

In this paper, we propose a new framework to analyze performance considering finite-length queuing and adaptive modulation and coding for multi-user Voice over IP (VoIP) services in wireless communication systems. We formulate an uplink VoIP system as a two-dimensional discrete-time Markov chain (DTMC) based on a Markov modulated Poisson process traffic model for VoIP services and modulation and coding scheme (MCS)-level set transition reflecting users’ channel variations. We extend the transition modeling of the MCS-level for a single-user to the transition modeling of the MCS-level set for multiple users. Since the users can have various MCS combinations in the case of a multi-user system, the MCS-level set transitions are more complicated than the MCS-level transitions of the single-user case. Throughout our DTMC formulation, we present various performance metrics, such as average queue-length, average throughput, packet dropping probability, packet loss probability, and so on. By using the results of the packet loss probability, we can find an optimum packet error rate value that minimizes the total packet loss probability.     

Throughput analysis of two-hop wireless networks with network coding

A Two-hop Wireless Network (TWN) is the basic topology structure that provides network coding opportunity for improving throughput. Network coding on a homogeneous TWN, in which all the data flows have the same packet size and all the links have the same transmission rate, has been extensively investigated. In this paper, network coding on more practical heterogeneous TWNs, featured by various packet sizes and transmission rates, is studied. Based on the Markov model, the throughput of the proposed network coding scheme, together with the throughput gain, is derived, which matches the simulation results very well. Numerical analyses indicate that, encoding the packets with close size and close transmission rate and enlarging buffer size at the relay node help in improving the throughput gain.     

Analysis of mobile radio slotted ALOHA networks

Given a mobile terminal transmitting a message to some receiver, the level at the receiver will be affected by path loss and by fading phenomena. Transmissions from different terminals will suffer different attenuations on their respective ways to the receiver and will therefore yield different levels at the receiver. Thanks to the capture effect, the receiver will now be able to read the message with the strongest signal, provided that it is sufficiently stronger than its contenders. In a mobile radio ALOHA network this means that a packet collision need not necessarily destroy all packets involved. A Markov model is developed for slotted ALOHA networks with capture and it is shown that the throughput in such a network can be markedly greater than the famous 1/e. Perhaps even more important is the result that such networks are very stable under overload.     

无线Ad Hoc网络中基于活跃节点数预测的时隙ALOHA算法

针对采用时隙ALOHA算法的无线Ad Hoc网络,考虑数据包到达的动态性与数据包传输的随机性,以最大化吞吐量为目标,同时满足数据队列稳定性,构建了关于接纳控制与竞争接入的随机优化问题。由于在时隙ALOHA算法中数据包传输的最优概率取决于无线Ad Hoc网络中数据队列非空的活跃节点数,提出了一种基于活跃节点数预测的时隙ALOHA算法。该算法要求无线Ad Hoc网络中的所有发送节点实时地侦听通信信道的忙闲状态,计算基于信道状态的活跃节点数条件期望,从而动态地预测无线Ad Hoc网络在不同时刻的活跃节点数,达到网络节点依据局部网络状态信息自适应地优化数据包传输概率的目的。仿真结果表明,所提算法能够有效估计无线Ad Hoc网络在每个时隙的活跃节点数,从而显著提升网络吞吐量并且降低数据包的平均排队时延。     

Performance analysis of DS-CDMA with slotted ALOHA random access for packet PCNs

In this paper, we present a discrete time Markov chain based analytical framework for the study of Direct-Sequence Code-Division-Multiple-Access (DS-CDMA) with slotted ALOHA random access protocols (DS-CDMA-S-ALOHA) for packet Personal Communications Networks (PCNs). It incorporates both the random access and the random errors associated with DS-CDMA-S-ALOHA protocols into a unified framework. The key feature is that it distinguishes between the two stages in the transmission process, namely the access stage and the reception stage, which characterize the random access and the random errors associated with DS-CDMA-S-ALOHA protocols respectively. Two DS-CDMA-S-ALOHA protocols are presented and analyzed. The performance of the protocols and the effects of the design parameters, namely the packet retransmission probability and the forward error correction code rate of the Bose-Chaudhuri-Hocquenghem (BCH) block codes are evaluated numerically and compared with a bandwidth equivalent conventional multi-channel slotted ALOHA system. The results show that, by proper design, the DS-CDMA-S-ALOHA protocols can double the throughput with respect to that of a bandwidth equivalent conventional multi-channel slotted ALOHA system.     

A batched network coding scheme for wireless networks

Several wireless network coding schemes apply either inter-flow traffic or intra-flow traffic, but not both. This paper proposes a novel batched network coding scheme to deal with both inter-flow and intra-flow traffics, which attempts to combine the advantages of both network coding approaches. Based on the idea in the well-known network coding scheme COPE, our batched network coding scheme allows each node to make use of intra-flow network coding technique to improve the transmission reliability in a lossy environment, consequently obtaining higher throughput. Moreover, we also utilize the multiple-path transmitting scheme to further increase the throughput of wireless networks with low link delivery probability. Finally, using a simplified network topology model, we show theoretically that our proposed scheme outperforms COPE significantly, particularly when the link quality is low.     

CLSP with channel clearance for spread slotted ALOHA network

A new CLSP with channel clearance (CLSP/CC) is proposed for obtaining better network performances in spread slotted ALOHA networks. This protocol can decrease wasteful channel usage by prohibiting continuous transmissions of packets already destroyed in previous slot, with little added network complexities. To validate the performance improvements of our protocol, both simulation and analysis are considered. As a result. The network using the proposed CLSP/CC is superior to that with CLSP, and also to the conventional one, especially when the system capacity is half of the offered load, and improves as the threshold for CLSP increases to network capacity     

Jamming in slotted ALOHA multihop packet radio networks

The properties of a packet radio network in the presence of active interference are discussed. Both the jammer and the network nodes are subject to an average power constraint. The network uses slotted ALOHA multiple access schemes and some simple fixed routing strategies with constant transmitter power. By using a game-theoretic approach the situation is considered as a two-person constant-sum game. The author defines network performance as the values of the game in terms of the expected forward progress of a packet. Both the performance and the optimum strategies for access and jamming are investigated     

Video-aware opportunistic network coding over wireless networks

In this paper, we study video streaming over wireless networks with network coding capabilities. We build upon recent work, which demonstrated that network coding can increase throughput over a broadcast medium, by mixing packets from different flows into a single packet, thus increasing the information content per transmission. Our key insight is that, when the transmitted flows are video streams, network codes should be selected so as to maximize not only the network throughput but also the video quality. We propose video-aware opportunistic network coding schemes that take into account both the decodability of network codes by several receivers and the importance and deadlines of video packets. Simulation results show that our schemes significantly improve both video quality and throughput. This work is a first step towards content-aware network coding.     

Performance evaluation of slotted ALOHA with generalizedretransmission backoff

An analytical investigation is presented of generalized retransmission backoff policies for slotted-ALOHA random-access channels. Backoff techniques, of which the well-known exponential backoff is a special case, are based on adaptation of average retransmission delay as a function of the number of collisions experienced by each message accessing the contention channel. An analytical model applicable to slotted-ALOHA channels using general backoff functions has been developed and used to assess the performance advantages offered by either exponential backoff or alternative policies motivated by heuristic considerations. Numerical results for a sample satellite channel scenario are presented, demonstrating that the use of appropriate backoff policies can result in significant improvements in stable throughput-delay characteristics relative to those of nonadaptive systems     

A hybrid network coding technique for single-hop wireless networks

In this paper, we investigate a hybrid network coding technique to be used at a wireless base station (BS) or access point (AP) to increase the throughput efficiency of single-hop wireless networks. Traditionally, to provide reliability, lost packets from different flows (applications) are retransmitted separately, leading to inefficient use of wireless bandwidth. Using the proposed hybrid network coding approach, the BS encodes these lost packets, possibly from different flows together before broadcasting them to all wireless users. In this way, multiple wireless receivers can recover their lost packets simultaneously with a single transmission from the BS. Furthermore, simulations and theoretical analysis showed that when used in conjunction with an appropriate channel coding technique under typical channel conditions, this approach can increase the throughput efficiency up to 3.5 times over the automatic repeat request (ARQ), and up to 1.5 times over the HARQ techniques.     

High throughput slotted ALOHA packet radio networks with adaptivearrays

The authors consider the use of a multiple-beam adaptive array (MBAA) in a packet radio system. In an MBAA, a given set of antenna elements is used to form several antenna patterns simultaneously. When it is used in a packet radio system, an MBAA can successfully receive two or more overlapping packets at the same time. Each beam captures a different packet by automatically pointing its pattern toward one packet while nulling other, contending packets. It is shown how an MBAA can be integrated into a single-hop slotted ALOHA packet radio system, and the resulting throughput is analyzed for both finite- and infinite-user populations     

A simple and versatile decentralized control for slotted ALOHA,reservation ALOHA, and local area networks

A simple, decentralized control for reducing the delays and stabilizing random-access channels is presented. The control, which is based on a computationally efficient recursive implementation of the minimum mean-squared error (MMSE) predictor of the channel backlog, applies to slotted ALOHA, to reservation ALOHA, and to local area networks (LANs) with carrier-sense multiple access (CSMA) or CSMA with collision detection (CSMA/CD) protocols. The MMSE predictor controller (MMSE-PC) can stabilize the slotted ALOHA for all traffic rates not exceeding e^-1, and it can achieve stable throughput arbitrarily close to one with finite delays in the reservation ALOHA and in LANs. Extensive simulation has shown that the MMSE-PC performs extremely well in all three random-access environments. For the implementation of the MMSE-PC in LANs, synchronization of transmissions is not required but it is required in slotted ALOHA and reservation ALOHA. The MMSE-PC has been implemented in hardware and tested in asynchronous LANs     

Optimized multipath network coding in lossy wireless networks

Network coding has been a prominent approach to a series of problems that used to be considered intractable with traditional transmission paradigms. Recent work on network coding includes a substantial number of optimization based protocols, but mostly for wireline multicast networks. In this paper, we consider maximizing the benefits of network coding for unicast sessions in lossy wireless environments. We propose Optimized Multipath Network Coding (OMNC), a rate control protocol that dramatically improves the throughput of lossy wireless networks. OMNC employs multiple paths to push coded packets to the destination, and uses the broadcast MAC to deliver packets between neighboring nodes. The coding and broadcast rate is allocated to transmitters by a distributed optimization algorithm that maximizes the advantage of network coding while avoiding congestion. With extensive experiments on an emulation testbed, we find that OMNC achieves more than two-fold throughput increase on average compared to traditional best path routing, and significant improvement over existing multipath routing protocols with network coding. The performance improvement is notable not only for one unicast session, but also when multiple concurrent unicast sessions coexist in the network.     

Compressive network coding for error control in wireless sensor networks

Since the observed signals of nearby sensors are known to be correlated, this paper firstly investigates the connection between network coding and compression concept of compressed sensing and then makes an in-depth combination between these two powerful concepts for error control in wireless sensor networks. Thus, a joint scheme is developed to achieve the maximum gain by exploiting the temporal and spatial correlations simultaneously. This scheme overcomes drawbacks of network coding theory by injecting the corresponding distributed compressed sensing concept into network coding, i.e., the scheme possesses good compression gain and graceful degradation of precision in the reconstruction process. Meanwhile, it can tolerate finite erasures and errors as well as reconstruct the original information as precise as possible when the rank of error matrix (induced by erasures and errors) doesn’t exceed the upper boundary. Finally, the reliability analysis and numeric results show that the compressive network coding scheme (i.e., the joint scheme) outperforms the conventional network coding scheme in robustness and performance.     

Efficient CQI feedback via network coding for wireless relay networks

For the efficacy of radio resource management in downlink wireless relay networks, the channel quality indicator (CQI) between a mobile station (MS) and a relay station (RS) should be fed back from the RS to its base station (BS), at the cost of additional feedback overhead. In this letter, we propose an efficient feedback scheme based on network coding between a pilot sequence and the CQI of MS-RS link, through which the BS can have both CQIs of MS-RS and RS-BS links without overhead. Numerical results reveal that the proposed CQI reporting scheme has as good feedback performance as conventional one which generally requires additional feedback burden.