An Improvement of Slotted CSMA/CA Algorithm in IEEE 802.15.4 Medium Access Layer

The standard of IEEE 802.15.4 is able to achieve low-power transmissions in low-rate and short-distance wireless personal area networks. It employs the slotted carrier sense multiple access with collision avoidance (CSMA/CA) for the contention mechanism. The blind backoff process in the slotted CSMA/CA will cause lower channel utilization. Sensor node performs backoff process immediately when the clear channel assessment (CCA) detecting busy channel. It may neglect the implicit information of CCA failed detection and further cause the redundant senses. This paper proposes an additional carrier sensing (ACS) algorithm based on IEEE 802.15.4 to enhance the carrier sensing mechanisms in original slotted CSMA/CA. An analytic model is developed to evaluate the performance of ACS algorithm. The analytical and simulation results demonstrate that the proposed scheme significantly improves the throughput, average medium access control delay and power consumption of CCA detecting.     

MC-LMAC: A multi-channel MAC protocol for wireless sensor networks

In traditional wireless sensor network (WSN) applications, energy efficiency may be considered to be the most important concern whereas utilizing bandwidth and maximizing throughput are of secondary importance. However, recent applications, such as structural health monitoring, require high amounts of data to be collected at a faster rate. We present a multi-channel MAC protocol, MC-LMAC, designed with the objective of maximizing the throughput of WSNs by coordinating transmissions over multiple frequency channels. MC-LMAC takes advantage of interference and contention-free parallel transmissions on different channels. It is based on scheduled access which eases the coordination of nodes, dynamically switching their interfaces between channels and makes the protocol operate effectively with no collisions during peak traffic. Time is slotted and each node is assigned the control over a time slot to transmit on a particular channel. We analyze the performance of MC-LMAC with extensive simulations in Glomosim. MC-LMAC exhibits significant bandwidth utilization and high throughput while ensuring an energy-efficient operation. Moreover, MC-LMAC outperforms the contention-based multi-channel MMSN protocol, a cluster-based channel assignment method, and the single-channel CSMA in terms of data delivery ratio and throughput for high data rate, moderate-size networks of 100 nodes at different densities.     

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.     

Traffic models for slotted optical packet switched networks

Optical packet switching (OPS) has emerged as a promising architecture for the future all-optical network scenario. In order to have a successful deployment of OPS networks, several networking issues must be resolved, e.g., how to resolve contentions and how to provide Quality-of-Service (QoS) differentiation. Such networking studies often rely on teletraffic analysis in order to quantify the performance of the OPS network. In this paper, we introduce new and review existing traffic models for slotted buffer-less OPS networks. In particular, we present a novel asymmetric traffic model, suitable for studying the effects of non-uniform traffic. Optical packet switches with and without wavelength conversion are studied. Numerical evaluations and a comparison study of the presented traffic models are reported. The main contributions of this paper are to advance the field of establishing a theoretical framework for slotted OPS networks and to act as a tutorial for teletraffic engineering in such networks. http://www.item.ntnu.no/~haraldov.     

Minimizing the Number of Multicast Transmissions in Single-Hop WDM Networks

The problem of minimizing the number of transmissions for a multicast transmission under the condition that the packet delay is minimum in single-hop wavelength division multiplexing (WDM) networks is studied in this paper. This problem is proved to be NP-complete. A heuristic multicast scheduling algorithm is proposed for this problem. Extensive simulations are performed to compare the performance of the proposed heuristic algorithm with two other multicast scheduling algorithms, namely, the greedy and no-partition scheduling algorithms. The greedy algorithm schedules as many destination nodes as possible in the earliest data slot. The no-partition algorithm schedules the destination nodes of a multicast packet to receive the packet in the same data slot without partitioning the multicast transmission into multiple unicast or multicast transmissions. Our simulation results show that (i) an algorithm which partitions a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than the no-partition algorithm when the number of data channels in the system is limited and (ii) the proposed heuristic algorithm always produces lower mean packet delay than the greedy and the no-partition algorithms because this algorithm not only partitions a multicast transmission into multiple unicast or multicast transmissions to keep the packet delay low but also reduces the number of transmissions to conserve resources.     

Exploiting cognitive wireless nodes for priority‐based data communication in terrestrial sensor networks

A priority‐based data communication approach, developed by employing cognitive radio capacity for sensor nodes in a wireless terrestrial sensor network (TSN), has been proposed. Data sensed by a sensor node—an unlicensed user—were prioritized, taking sensed data importance into account. For data of equal priority, a first come first serve algorithm was used. Non‐preemptive priority scheduling was adopted, in order not to interrupt any ongoing transmissions. Licensed users used a nonpersistent, slotted, carrier sense multiple access (CSMA) technique, while unlicensed sensor nodes used a nonpersistent CSMA technique for lossless data transmission, in an energy‐restricted, TSN environment. Depending on the analytical model, the proposed wireless TSN environment was simulated using Riverbed software, and to analyze sensor network performance, delay, energy, and throughput parameters were examined. Evaluating the proposed approach showed that the average delay for sensed, high priority data was significantly reduced, indicating that maximum throughput had been achieved using wireless sensor nodes with cognitive radio capacity.     

End-to-End Performance Analysis of Millimeter Wave Triple-Hop Backhaul Transmission Systems

Frequencies above 10 GHz nowadays may be employed either for backhaul networks of mobile communication access networks or for broadband fixed wireless access networks. Millimeter wave networks can afford large bandwidth by carrying the aggregate traffic through different network nodes. Consequently, many line-of-sight multi-hop transmissions may occur. At these frequency bands, rain attenuation is the dominant fading mechanism that aggravates the outage performance of these networks. The objective of this paper is the presentation of analytical models for the calculation of the end-to-end performance analysis of a triple-hop system with non-regenerative and regenerative relays using the trivariate lognormal distribution along with a physical model for the calculation of the correlation coefficients among the rain fading channels. Moreover, an accurate rain attenuation time series synthesizer based on multi-dimensional first order Stochastic Differential eqnarrays is employed in order to validate the analytical results. Finally, extended numerical results investigate the impact of various operational and geographical parameters, as well as the influence of the arbitrary position of the relays on the outage system performance.     

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     

Analysis of Channel-aware Multichannel ALOHA in OFDMA Wireless Networks

Orthogonal frequency division multiple access (OFDMA) systems provide multiple channels that can be accessed via random access schemes. In this paper a channel-aware multichannel random access, based on local channel state information (CSI), was investigated and a multichannel slotted ALOHA scheme was proposed accordingly. Also an analytical investigation of total system throughput and the queue state evolution of generic node in the network were present by assuming the channel has been modeled by means of a two state Markov chain. Through the theoretical model and simulation results, we confi rm that the proposed algorithm has the advantage of high throughput and low access delay.     

Performance Models for Multi-rate Circuits in Switched Multi-Channel Optical Networks

We consider optical networks with nodes interconnected by links comprising multiple channels. The blocking performance of such networks depends on the channel-switching capabilities of the nodes. In this paper, we focus on developing analytical models for evaluating the blocking performance in circuit-switched optical networks. Several architectures for channel-switching are presented. Multi-rate circuits may be established if different circuits are allocated different number of channels. Depending on how the network can assign the channels to circuits that request more than one channel, it is classified as a Data Splitting Network (DSN) or a non-DSN. We consider multi-rate circuits which require either a single channel or a given number of channels k (>1). Analytical models for computing blocking probabilities are developed for various channel-switching architectures at the nodes. The validity of the models is shown by comparing the analytical results with simulations. Numerical results in a single-fiber TDM wavelength-routing network suggest that limited channel-switching may be sufficient even for circuits that require more than one channel or slot. A comparison of DSN and non-DSN shows that data splitting can accommodate more multi-slot circuits at the expense of blocking more single-slot circuits.This work was supported in part by NSF Grants ANI-9973098 and ANI-9973111     

A NEW ANALYZING APPROACH TO MODELING SLOTTED MULTIPLE ACCESS SYSTEMS

In this paper, the analyzing approaches proposed by Zhao Dongfeng, et al.(1997) have been extensively studied. The average cyclic times of the slotted multiple access systems are analyzed by using the average cycle method. Analytic formulae for mean values of a successful period and a colliding period and an idle period are derived. The upper bounds of the system throughput with capture effect and collision resolution are provided. Finally, the simulation results of the slotted multiple access channels are given.     

Improving TDMA Channel Utilization in Random Access Cognitive Radio Networks by Exploiting Slotted CSMA

This paper aims to improve the spectrum efficiency of the licensed time division multiple access (TDMA) channel by exploiting the unused periods of primary users (PUs) in cognitive radio networks. A wireless network that consists of two classes of users, PUs and CR users, accessing a time slotted based common communication channel is considered. PUs employ TDMA and have always high priority over the CR users to access the channel. CR users utilize slotted Carrier Sense Multiple Access and can access the channel when it is not occupied by the PUs. New expressions for the throughput of both CR network and overall network have been derived in order to evaluate the channel utilization. Besides, an example network have been developed, modeled and simulated by using the OPNET Modeler simulation software with the purpose of verifying the analytical throughput results. The simulation results obtained under various network load conditions are consistent with the analytical results. This study has also proposed that the overall channel utilization can be improved by well exploiting the spectrum holes without interfering with the PU transmissions.     

Battery-Aware Routing for Streaming Data Transmissions in Wireless Sensor Networks

Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions. Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput. As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless networks as well.     

无线Ad hoc网络传输容量的性能分析

无线Ad hoc网络由于其具备自组织、自配置以及自适应等能力,被灵活地应用于各种无任何固定通信基础设施支撑的环境中。如何对网络容量性能进行评估,是目前无线Ad hoc网络研究的热点问题之一。该文依据随机几何理论以及泊松点过程建立了无线Ad hoc网络模型,基于不同的调制方式及纠错编码方案,并结合功率控制机制,分别分析了采用时隙ALOHA、非时隙ALOHA及CSMA协议时,无线Ad hoc网络的中断概率及传输容量的性能指标。数值仿真结果表明:在分组错误概率受限的条件下,对调制方式与编码方案选择与网络空间分组密度(即网络累积干扰)有关;根据不同的空间分组密度选取调制方式和编码方案,才能获取最佳的网络容量性能。     

Performance evaluation of channel-sensitive, stabilized multipleaccess schemes for land-mobile satellite services using a hybridsimulation tool

A hybrid simulation tool for real-time performance measurements of complete networks is presented. The simulation tool combines the advantages of software and hardware modules. Recorded channel data are included. They allow the reproduction of realistic situations in the laboratory. Synchronization problems and noise are considered. As an example, stabilized slotted ALOHA access protocols were implemented and investigated in land-mobile satellite environments. A slotted ALOHA-based modified channel access strategy for highly unreliable channels is proposed requiring all mobile stations to estimate the link quality before starting a transmission. The different strategies are analyzed by simulation as well as the analytical methods. Transmission parameters are determined and optimized using a combination of analysis and simulation. The results show the power of the simulation tool and the better performance of stabilized slotted ALOHA with link-quality estimation in city channels     

Wireless network coding in slotted aloha with two-hop unbalanced traffic

This paper deals with two representative unbalanced traffic cases for two-hop wireless relay access systems employing network coding and a slotted ALOHA protocol. Network coding is a recent and highly regarded technology for capacity enhancement with multiple unicast and multisource multicast networks. We have analyzed the performance of network coding on a two-hop wireless relay access system employing the slotted ALOHA under a balanced bidirectional traffic. The relay nodes will generally undergo this unbalanced multidirectional traffic but the impact of this unbalanced traffic on network coding has not been analyzed. This paper provides closed-form expressions for the throughput and packet delay for two-hop unbalanced bidirectional traffic cases both with and without network coding even if the buffers on nodes are unsaturated. The analytical results are mainly derived by solving queueing systems for the buffer behavior at the relay node. The results show that the transmission probability of the relay node is a design parameter that is crucial to maximizing the achievable throughput of wireless network coding in slotted ALOHA on two-hop unbalanced traffic cases. Furthermore, we show that the throughput is enhanced even if the traffic at the relay node is unbalanced.     

PROTON: a media access control protocol for optical networks withstar topology

A new multiple access protocol called PROTON (PROTocol for Optical Networks) is developed for optical local area networks based on a passive star topology. PROTON uses wavelength division multiplexing (WDM) and is highly bandwidth-efficient. One of the available wavelengths is used as a control channel. Time is divided into fixed-sized slots. The size of the slots is the same for the control and the data channels. Before transmitting a packet, a station must compete with others for a slot in a data wavelength, using a collision-free procedure. Transmitting stations and the corresponding wavelengths for their data transmissions are determined at each station by a simple arbitration scheme. The protocol is suitable for networks where the number of users can be much larger than the number of available data channels. In addition to propagation delays, it is considered that transmitter and receiver tuning times as well as the times required to process control packets are not negligible. Whenever possible, and to maximize the throughput of the network, tuning and processing times of transmitters and receivers are overlapped with each other and with data transmission times. Also, data slot requests and packet transmissions are scheduled in a pipeline fashion, thus reducing the detrimental effects on throughput and packet delay of long propagation delays. The paper includes an analysis of the maximum throughput characteristics of PROTON. An analytical model is developed, and several performance measures are obtained     

Burst transmission algorithm to improve packet level performance in contention-free slotted OBS networks

In contention-free slotted optical burst switching (SOBS) networks, controllers are utilized in order to manage the time-slot assignment, avoiding congestions among multiple burst transmissions. In this network, bursts are never lost at intermediate nodes but packets are lost at an ingress edge node due to a burst transmission algorithm. In addition, packet transmission delay increases depending on the algorithm. In order to improve packet level performance, in this paper, we propose a new burst transmission algorithm. In this method, two different thresholds are used; one is used to send a control packet to a controller and the other is used to assemble a burst. With these thresholds, a time slot can be assigned to a burst in advance and packet level performance can be improved. In order to evaluate its packet level performance and investigate the impact of thresholds, we also propose a queueing model of a finite buffer where a batch of packets are served in a slot of a constant length. Numerical results show that our proposed method can decrease packet loss probability and transmission delay with two thresholds. In addition, we show that our analysis results are effective to investigate the performance of the proposed method when the number of wavelengths is large.     

New cross-Layer design approach to ad hoc networks under Rayleigh fading

We propose a new cross-layer design employing the predictability of Rayleigh channels to improve the performance of ad hoc networks. In addition, we propose a Markov model for Rayleigh channels and an innovative Markov model for IEEE 802.11 distributed coordination function. By combining these two models, we derive the theoretical expressions for network throughput, packet processing rate, packet loss probability, and average packet delay under Rayleigh channels. The simulation of the proposed cross-layer design is also carried out. It is shown that the new approach improves the network throughput, reduces unnecessary packet transmissions and therefore reduces packets lost. We also show that there is a close match between the analytical and the simulation results which confirms the validity of the analytical models.     

Locally scheduled packet bursting for data collection in wireless sensor networks

In wireless sensor networks, the many-to-one data communication pattern induces high collision losses as multiple transmissions cause contention and interference along the paths from sources to the sink. This paper proposes a low-overhead MAC layer solution to address the high contention problem to improve system throughput and reduce energy consumption. Periods of burst transmissions with reduced contention from neighboring nodes are exploited to efficiently clear up backlogged queues and improve the performance of CSMA. Through analytical modeling we characterize the expected performance improvement. Using extensive simulations on ns-2 and experiments on the 49-node sensor network testbed (Kansei) running TinyOS, we show that the proposed scheme can increase the throughput by up to a factor of four.