High-throughput time group access MCR-SS-CSMA/CA for wireless ad hoc networks with layered-tree topology

Multi-hop packet transmission error due to packet collision is a serious issue for realizing large-scale wireless ad hoc networks. In order to solve the issues, a multicode-reception spread-spectrum (MCR-SS)-CSMA/CA scheme is proposed as multiple access scheme for layered-tree networks. This scheme is further improved by adding a time group access (TGA) technique to gain higher interference reduction between nodes. The proposed TGA scheme divides the layered-tree network into upper subnets group and lower subnets group, thus reducing collision probability among subnets. Network throughput and data delivery ratio for the proposed scheme are analyzed by simulations based on the IEEE 802.15.4/ZigBee specification. Simulation results show that the proposed schemes can improve packet delivery ratio and network throughput remarkably.     

Design and performance analysis on adaptive reservation-assisted collision resolution protocol for WLANs

In conventional IEEE 802.11 medium access control protocol, the distributed coordination function is designed for the wireless stations (WSs) to perform channel contention within the wireless local area networks (WLANs). Packet collision is considered one of the major issues within this type of contention-based scheme, which can severely degrade network performance for the WLANs. Research work has been conducted to modify the random backoff mechanism in order to alleviate the packet collision problem while the WSs are contending for channel access. However, most of the existing work can only provide limited throughput enhancement under specific number of WSs within the network. In this paper, an adaptive reservation-assisted collision resolution (ARCR) protocol is proposed to improve packet collision resulting from the random access schemes. With its adaptable reservation period, the contention-based channel access can be adaptively transformed into a reservation-based system if there are pending packets required to be transmitted between the WSs and the access point. Analytical model is derived for the proposed ARCR scheme in order to evaluate and validate its throughput performance. It can be observed from both analytical and simulation results that the proposed protocol outperforms existing schemes with enhanced channel utilization and network throughput.     

Sensor networks with mobile access: optimal random access and coding

We consider random access and coding schemes for sensor networks with mobile access (SENMA). Using an orthogonal code-division multiple access (CDMA) as the physical layer, an opportunistic ALOHA (O-ALOHA) protocol that utilizes channel state information is proposed. Under the packet capture model and using the asymptotic throughput as the performance metric, we show that O-ALOHA approaches the throughput equal to the spreading gain with an arbitrarily small power at each sensor. This result implies that O-ALOHA is close to the optimal centralized scheduling scheme for the orthogonal CDMA networks. When side information such as location is available, the transmission control is modified to incorporate either the distribution or the actual realization of the side information. Convergence of the throughput with respect to the size of the network is analyzed. For networks allowing sensor collaborations, we combine coding with random access by proposing two coded random access schemes: spreading code dependent and independent transmissions. In the low rate regime, the spreading code independent transmission has a larger random coding exponent (therefore, faster decay of error probability) than that of the spreading code dependent transmission. On the other hand, the spreading code dependent transmission gives higher achievable rate.     

Random Signal Levels for Channel Access in Packet Broadcast Networks

In this paper, it is proposed to employ random multiple signal levels for channel access in packet broadcast networks. We present priority-free random access protocols that possess the advantage of capture effect. The presented schemes are applied to the slotted ALOHA, and the performance is analyzed based on a conservative capture model. Closed-form expressions for the system throughput are derived for a general two-signal level system and a generalm-signallevel system. It is shown that the maximum throughput for the twolevel system increases from 0.47 to 0.52 as the separation between the two levels increases. For them-level system, the maximum throughput increases from 0.52 to 0.66 asmincreases from three to infinity. Then a rotary-priority sure-capture random access scheme is presented, which can achieve perfect channel utilization. The time-delay characteristic and the throughput-delay tradeoff are analyzed for the simplest two-level system for which the higher level is double the lower level. The results compare favorably to those of the conventional slotted ALOHA system which employs a single signal level for packet transmission. A number of open problems are addressed.     

Performance analysis of multiple access protocols for multimediasatellite networks

In this paper, several TDMA-based packet multiple access protocols are studied and evaluated in the geostationary satellite environment. The distributed queueing random access protocol, DQRAP, originally proposed for HFC networks is adapted to the satellite environment. Another protocol, the announced retransmission random access protocol, ARRA, proposed for wireless networks is also studied. Both protocols are modeled and simulated in a VSAT network context. We then propose a new protocol which combines the advantages of both studied schemes and is more adapted to interactive multimedia applications over satellite uplinks. The generalized retransmission announcement protocol, GRAP, regroups the immediate access by contention at low loads, and the reservation access. At higher loads, to achieve a better channel efficiency. An analytical model is proposed to calculate the channel throughput obtained by GRAP under different loading conditions. Simulation results illustrate an improved throughput/delay characteristics and a higher protocol stability compared to both DQRAP and ARRA. Enhanced versions of the protocol are also proposed and evaluated to further improve its efficiency, with reasonable additional complexity     

A cross‐layer study for application‐aware multi‐hop cognitive radio networks

Satisfying the different requirements of applications is important in multi‐hop cognitive radio networks, because the spectrum resources change dynamically and the requirements for various applications could be very different. In this paper, we propose new schemes of channel allocation and route selection for real‐time and non‐real‐time applications to tackle this challenge. Our scheme is flexible so that it can adapt to the different application requirements, and it can provide enough throughput while maintaining the packet loss rate and transmission rate requirements. First, we give the network model in a cognitive radio network environment, and show how to calculate the capacity of the route in multi‐hop cognitive radio networks. Second, we formulate optimization problems to fulfill the rate requirements of different applications for each unicast session. We also consider the primary user activities, channel availability, interface and interference constraint. We propose the corresponding routing and channel allocation schemes for different application scenarios. Third, we propose an admission control scheme to study the impact of application requirements for multiple sessions in cognitive radio networks. Finally, we implement simulations to show the performance of our schemes and compare them with existing schemes. Copyright © 2014 John Wiley & Sons, Ltd.     

TCP Veno: TCP enhancement for transmission over wireless access networks

Wireless access networks in the form of wireless local area networks, home networks, and cellular networks are becoming an integral part of the Internet. Unlike wired networks, random packet loss due to bit errors is not negligible in wireless networks, and this causes significant performance degradation of transmission control protocol (TCP). We propose and study a novel end-to-end congestion control mechanism called TCP Veno that is simple and effective for dealing with random packet loss. A key ingredient of Veno is that it monitors the network congestion level and uses that information to decide whether packet losses are likely to be due to congestion or random bit errors. Specifically: (1) it refines the multiplicative decrease algorithm of TCP Reno-the most widely deployed TCP version in practice-by adjusting the slow-start threshold according to the perceived network congestion level rather than a fixed drop factor and (2) it refines the linear increase algorithm so that the connection can stay longer in an operating region in which the network bandwidth is fully utilized. Based on extensive network testbed experiments and live Internet measurements, we show that Veno can achieve significant throughput improvements without adversely affecting other concurrent TCP connections, including other concurrent Reno connections. In typical wireless access networks with 1% random packet loss rate, throughput improvement of up to 80% can be demonstrated. A salient feature of Veno is that it modifies only the sender-side protocol of Reno without changing the receiver-side protocol stack.     

Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks

The performance of frequency-hop transmission in a packet communication network is analyzed. Satellite multiple-access broadcast channels for packet switching and terrestrial packet radio networks are the primary examples of the type of network considered. An analysis of the effects of multiple-access interference in frequency-hop radio networks is presented. New measures of "local" performance are defined and evaluated for networks of this type, and new concepts that are important in the design of these networks are introduced. In particular, error probabilities and local throughput are evaluated for a frequency-hop radio network which incorporates the standard slotted and unslotted ALOHA channel-access protocols, asynchronous frequency hopping, and Reed-Solomon error-control coding. The performance of frequency-hop multiple access with error-control coding is compared with the performance of conventional ALOHA random access using narrow-band radios.     

Improved channel assignment scheme with access control for thecommon packet channel in WCDMA systems

We propose a channel assignment scheme with access control for obtaining better system performance within the common packet channel (CPCH) access procedure of wideband code-division multiple-access (WCDMA) systems. The proposed scheme is analyzed taking multiple access interference into consideration and is compared with other schemes in the 3rd Generation Partnership Project (3GPP): the basic scheme, the channel monitoring scheme, and the channel assignment scheme without access control. The results show that the proposed scheme provides high throughput, even under high-loading conditions, since the access control algorithm based on channel load prohibits excessive interference     

Adaptive Retransmission Diversity with Packet Combining for Slotted DS/CDMA Packet Radio Networks

A time diversity automatic repeat-request (ARQ) scheme is investigated for slotted random access direct-sequence code-division multiaccess (DS/CDMA ALOHA) wireless packet radio networks on multipath Rayleigh fading channels. The receiver retains and processes all the retransmissions of a single data block (packet) using predetection diversity combining, instead of discarding those which are detected in error. This effectively improves the system throughput and delay characteristics especially at small values of signal-to-noise ratio (SNR) per bit. A simple and practical selection combining rule is proposed, which lends itself to a low-complexity receiver structure and specifically suitable for high data rate transmissions. Owing to the stochastic nature of the multiple access interference, the new maximum output selection diversity (MO/SD) system yields superior performance in comparison to the traditional maximum SNR selection diversity (SNR/SD) model. The bit error rate performance, throughput and the average number of transmissions required to transmit a packet successfully with and without forward error correction (FEC) are evaluated. Numerical results reveal that the proposed adaptive retransmission diversity with packet combining provides a considerable advantage over the conventional slotted DS/CDMA ALOHA without incurring a substantial penalty in terms of cost or complexity.     

Wavelength reuse for efficient packet-switched transport in an AWG-based metro WDM network

Metro wavelength-division multiplexed (WDM) networks play an important role in the emerging Internet hierarchy; they interconnect the backbone WDM networks and the local-access networks. The current circuit-switched SONET/synchronous digital hierarchy (SDH)-over-WDM-ring metro networks are expected to become a serious bottleneck-the so-called metro gap-as they are faced with an increasing amount of bursty packet data traffic and quickly increasing bandwidths in the backbone networks and access networks. Innovative metro WDM networks that are highly efficient and able to handle variable-size packets are needed to alleviate the metro gap. In this paper, we study an arrayed-waveguide grating (AWG)-based single-hop WDM metro network. We analyze the photonic switching of variable-size packets with spatial wavelength reuse. We derive computationally efficient and accurate expressions for the network throughput and delay. Our extensive numerical investigations-based on our analytical results and simulations-reveal that spatial wavelength reuse is crucial for efficient photonic packet switching. In typical scenarios, spatial wavelength reuse increases the throughput by 60% while reducing the delay by 40%. Also, the throughput of our AWG-based network with spatial wavelength reuse is roughly 70% larger than the throughput of a comparable single-hop WDM network based on a passive star coupler (PSC).     

A taxonomy of rerouting in circuit-switched networks

In circuit-switched networks it is well known that dynamic routing can provide significant throughput gain over fixed routing. Rerouting is the practice of routing calls currently on alternate paths to direct paths or other less congested alternate paths. Previous studies have shown that rerouting can not only increase the throughput of dynamic routing, but also maintain network stability without the need for trunk reservation. This article presents a taxonomy of rerouting in circuit-switched networks showing the various ways rerouting can be designed. In addition, a comparative study on a number of rerouting schemes are performed in a uniformly loaded, fully connected circuit-switched network     

Operation, administration, and maintenance in MPLS networks

The boundaries between packet and circuit networks have long disappeared, with many traditional circuit-switched applications such as voice and video now being carried over packet-switched IP/MPLS or Ethernet networks. However, this transition has happened so fast that many OAM functions supported by circuit-switched networks such as SONET/SDH are still unmatched in packet networks. In order to match the quality sustained by circuit-switched networks, OAM functions must also be developed for such packet networks. A number of recent efforts have started to address OAM functions for IP/MPLS and Ethernet packet technologies. Service providers and carriers alike are the driving force behind the work, as there is general recognition that to generate sustained revenues, services must be efficiently managed. In this article we discuss issues in providing OAM features and capabilities for MPLS-based packet networks.     

Interference management using basestation coordination in broadband wireless access networks

This paper proposes a transmission‐scheduling algorithm for interference management in broadband wireless access networks. The algorithm aims to minimize the cochannel interference using basestation coordination while still maintaining the other quality of service (QoS) requirements such as packet delay, throughput and packet loss. The interference reduction is achieved by avoiding (or minimizing) concurrent transmission of potential dominant interferers. Dynamic slot allocation based on traffic information in other cells/sectors is employed. In order to implement the algorithm in a distributed manner, basestations (BSs) have to exchange traffic information. Both real‐time and non‐real‐time services are considered in this work. Results show that significant reduction in the packet error rate can be achieved without increasing the packet delay at low to medium loading values and with a higher but acceptable packet delay at high loading values. Since ARQ schemes can also be used for packet error rate reduction, we compare the performance of the proposed scheme with that of ARQ. Results indicate that although ARQ is more effective in reducing packet error rate, the proposed algorithm incurs much less packet delay particularly at medium to high loading. Copyright © 2006 John Wiley & Sons, Ltd.     

非时隙CDMA分组网络吞吐量性能分析:统一的方法

CDMA分组网络性能主要受限于信道中同时传输的其它分组的干扰.与时隙CDMA分组网络相比,非时隙CDMA分组网络所受到的干扰情况更加复杂.本文提出了一种非时隙CDMA分组网络的干扰分析模型,并采用递归方式建立了网络吞吐量性能分析的统一方法.在此基础上,分析了网络节点突发固定长度分组和突发可变长度分组两种情况下的网络吞吐量性能,并讨论了扩频增益和分组传输方式对网络性能的影响,给出了相应的数值结果.文章最后进一步讨论了吞吐量的上下界问题.与前人提出的马尔可夫模型相比,采用本文提出的方法可以得到更为准确的吞吐量性能.     

A two‐way relay framework based on interference cancellation in wireless networks

The two‐way relay (TWR) protocols are efficient in providing appreciable throughput gains in wireless networks through the use of network coding to combine packets from multiple channels. The key determinant factor in driving the throughput improvement is the degree of simultaneity achieved in the relay scheme. In this paper, we propose a new TWR protocol named interference cancellation TWR (IC‐TWR), which combines network coding, spatial diversity, and IC techniques to arrive at high degree of simultaneity and in the meanwhile to relax the requirement on channel state information as compared with TWR schemes based on amplify‐and‐forward. Numerical analysis shows that the proposed IC‐TWR is uniformly advantageous over the traditional decode‐and‐forward scheme in terms of system throughput and end‐to‐end delay. The proposed scheme may be useful for system designers of high‐speed multimedia applications in wireless mobile networks, wireless cellular networks, wireless sensor networks, and so on. Copyright © 2015 John Wiley & Sons, Ltd.     

Adaptive Fair Subcarrier/Rate Allocation in Multirate OFDMA Networks: Radio Link Level Queuing Performance Analysis

This paper presents a semi-analytical methodology for radio link level performance analysis in a multirate "orthogonal frequency-division multiple-access" (OFDMA) network with adaptive fair rate allocation. Multirate transmission is assumed to be achieved through adaptive modulation, and fair rate allocation is based on the principle of generalized processor sharing to allocate the subcarriers adaptively among the users. The fair rate allocation problem is formulated as an optimization problem with the objective of maximizing system throughput while maintaining fairness (in terms of transmission rate) among the users. The "optimal" fair rate allocation is obtained by using the "Hungarian method." A heuristic-based approach, namely the "iterative approach," that is more implementation friendly is also presented. The throughput performance of the iterative fair rate allocation is observed to be as good as that of optimal fair rate allocation and is better than that of the static subcarrier allocation scheme. Also, the iterative fair allocation provides better fairness compared to that for each of the optimal and the static subcarrier allocation schemes. To this end, a queuing model is formulated to analyze radio link level performance measures such as packet dropping probability and packet transmission delay under the above rate allocation schemes. In this formulation, packet arrivals are modeled by the discrete Markov modulated Poisson process, which is flexible to model different types of traffic arrival patterns. The proposed framework for radio link level performance analysis of multirate OFDMA networks is validated by extensive simulations. Also, examples on the application of the proposed model for connection admission control and quality-of-service provisioning are illustrated     

Delay and throughput for three transmission schemes in packet radionetworks

The results of a simulation of a fully connect packet communication network are presented. The network employs the slotted ALOHA channel access protocol, and Reed-Solomon coding is used to correct errors and erasures in the received packets. The network has a fixed number of channels available for packet transmissions. In two of the transmission schemes considered, a given packet transmission occurs on a single channel only. One of these employs fixed assignment of terminals to the channels, and the other employs random assignment. A third method permits each transmitter to hop randomly over the set of channels during the transmission of a packet. The terminal transmits on one channel at a time, and it transmits a fixed number of symbols during each dwell interval. Delay and throughput are evaluated for all three transmission methods. The effects of code rate on the performance of the channel-hopping scheme are explored, and the improvement that can be obtained for the channel-hopping scheme by use of incremental-redundancy transmission is examined     

Stable‐path multi‐channel routing with extended level channel assignment

Wireless mesh networks (WMNs) have gained considerable popularity in recent times thanks to their self‐healing, self‐organizing, and self‐configuring nature. Because of their ability to provide high throughput and minimum packet delay, WMNs are considered to be favorable for broadband applications. For such applications, WMNs employ multiple channels, which give rise to issues like channel assignment, load balancing, and interference avoidance. Most of these issues fall into two broad categories, namely routing and channel assignment. For routing, we propose a novel proactive protocol, the stable‐path multi‐channel routing protocol (SMRP). Our proposed solution, to address channel assignment, is the extended level‐based channel assignment (ELCA) scheme. SMRP is designed to work in combination with ELCA in order to minimize interference and balance the load among the underlying nodes. Simulation results show enhanced throughput and minimal packet delay as compared with the contemporary schemes. Copyright © 2011 John Wiley & Sons, Ltd.     

Joint interference coordination approach in femtocell networks for QoS performance optimization

Future heterogeneous networks with dense cell deployment may cause high intercell interference. A number of interference coordination (IC) approaches have been proposed to reduce intercell interference. For dense small‐cell deployment with high intercell interference between cells, traditional forward link IC approaches intended to improve edge user throughput for best effort traffic (ie, file transfer protocol download), may not necessarily improve quality of service performance for delay‐sensitive traffic such as voice over long‐term evolution traffic. This study proposes a dynamic, centralized joint IC approach to improve forward link performance for delay‐sensitive traffic on densely deployed enterprise‐wide long‐term evolution femtocell networks. This approach uses a 2‐level scheme: central and femtocell. At the central level, the algorithm aims to maximize network utility (the utility‐based approach) and minimize network outage (the graphic‐based approach) by partitioning the network into clusters and conducting an exhaustive search for optimized resource allocation solutions among femtocells (femto access points) within each cluster. At the femtocell level, in contrast, the algorithm uses existing static approaches, such as conventional frequency reuse (ReUse3) or soft frequency reuse (SFR) to further improve user equipment quality of service performance. This combined approach uses utility‐ and graphic‐based SFR and ReUse3 (USFR/GSFR and UReUse3/GReUse3, respectively). The cell and edge user throughput of best effort traffic and the packet loss rate of voice over long‐term evolution traffic have been characterized and compared using both the proposed and traditional IC approaches.