Packet voice/data in local broadcast networks

A local area network that can support both voice and data packets offers economic advantages due to the use of only a single network for both types of traffic, greater flexibility to changing user demands, and it also enables efficient use to be made of the transmission capacity. The latter aspect is very important in local broadcast networks where the capacity is a scarce resource, for example mobile radio. This research has examined two types of local broadcast network, these being the Ethernet-type bus local area network and a mobile radio network with a central base station. With such contention networks, medium access control (MAC) protocols are required to gain access to the channel. MAC protocols must provide efficient scheduling on the channel between the distributed population of stations who want to transmit. No access scheme can exceed the performance of a single server queue, due to the spatial distribution of the stations. Stations cannot in general form a queue without using part of the channel capacity to exchange protocol information. In this research, several medium access protocols have been examined and developed in order to increase the channel throughput compared to existing protocols. However, the established performance measures of average packet time delay and throughput cannot adequately characterise protocol performance for packet voice. Rather, the percentage of bits delivered within a given time bound becomes the relevant performance measure. Performance evaluation of the protocols has been examined using discrete event simulation and in some cases also by mathematical modelling. All the protocols use either implicit or explicit reservation schemes, with their efficiency dependent on the fact that many voice packets are generated periodically within a talkspurt. Two of the protocols are based on the existing 'Reservation Virtual Time CSMA/CD' protocol, which forms a distributed queue through implicit reservations. This protocol has been improved firstly by utilising two channels, a packet transmission channel and a packet contention channel. Packet contention is then performed in parallel with a packet transmission to increase throughput. The second protocol uses variable length packets to reduce the contention time between transmissions on a single channel. A third protocol developed, is based on contention for explicit reservations. Once a station has achieved a reservation, it maintains this effective queue position for the remainder of the talkspurt and transmits after it has sensed the transmission from the preceeding station within the queue. In the mobile radio environment, adaptions to the protocols were necessary in order that their operation was robust to signal fading. This was achieved through centralised control at a base station, unlike the local area network versions where the control was distributed at the stations. The results show an improvement in throughput compared to some previous protocols. Further work includes subjective testing to validate the protocols' effectiveness.

Autonomic and embedded wireless sensor protocols for critical infrastructures

The tragic events of September 11th ushered a new era of unprecedented challenges. Our nation has to be protected from the alarming threats of adversaries. These threats exploit the nation's critical infrastructures affecting all sectors of the economy. There is the need for pervasive monitoring and decentralized control of the nation's critical infrastructures. The communications needs of monitoring and control of critical infrastructures was traditionally catered for by wired communication systems. These technologies ensured high reliability and bandwidth but are however very expensive, inflexible and do not support mobility and pervasive monitoring. The communication protocols are Ethernet-based that used contention access protocols which results in high unsuccessful transmission and delay. An emerging class of wireless networks, named embedded wireless sensor and actuator networks has potential benefits for real-time monitoring and control of critical infrastructures. The use of embedded wireless networks for monitoring and control of critical infrastructures requires secure, reliable and timely exchange of information among controllers, distributed sensors and actuators. The exchange of information is over shared wireless media. However, wireless media is highly unpredictable due to path loss, shadow fading and ambient noise. Monitoring and control applications have stringent requirements on reliability, delay and security. The primary issue addressed in this dissertation is the impact of wireless media in harsh industrial environment on the reliable and timely delivery of critical data. In the first part of the dissertation, a combined networking and information theoretic approach was adopted to determine the transmit power required to maintain a minimum wireless channel capacity for reliable data transmission. The second part described a channel-aware scheduling scheme that ensured efficient utilization of the wireless link and guaranteed delay. Various analytical evaluations and simulations are used to evaluate and validate the feasibility of the methodologies and demonstrate that the protocols achieved reliable and real-time data delivery in wireless industrial networks.

Sistemas de cálculo, análise e operação virtual: interferências de campos elétricos e magnéticos produzidas por estações radio base de acesso múltiplo por divisão de código em banda larga - WCDMA

In this work it was developed mathematical resolutions taking as parameter maximum intensity values for the interference analysis of electric and magnetic fields and was given two virtual computer system that supports families of CDMA and WCDMA technologies. The first family were developed computational resources to solve electric and magnetic field calculations and power densities in Radio Base stations , with the use of CDMA technology in the 800 MHz band , taking into account the permissible values referenced by the Commission International Protection on non-Ionizing Radiation . The first family is divided into two segments of calculation carried out in virtual operation. In the first segment to compute the interference field radiated by the base station with input information such as radio channel power; Gain antenna; Radio channel number; Operating frequency; Losses in the cable; Attenuation of direction; Minimum Distance; Reflections. Said computing system allows to quickly and without the need of implementing instruments for measurements, meet the following calculated values: Effective Radiated Power; Sector Power Density; Electric field in the sector; Magnetic field in the sector; Magnetic flux density; point of maximum permissible exposure of electric field and power density. The results are shown in charts for clarity of view of power density in the industry, as well as the coverage area definition. The computer module also includes folders specifications antennas, cables and towers used in cellular telephony, the following manufacturers: RFS World, Andrew, Karthein and BRASILSAT. Many are presented "links" network access "Internet" to supplement the cable specifications, antennas, etc. . In the second segment of the first family work with more variables , seeking to perform calculations quickly and safely assisting in obtaining results of radio signal loss produced by ERB . This module displays screens representing propagation systems denominated "A" and "B". By propagating "A" are obtained radio signal attenuation calculations in areas of urban models , dense urban , suburban , and rural open . In reflection calculations are present the reflection coefficients , the standing wave ratio , return loss , the reflected power ratio , as well as the loss of the signal by mismatch impedance. With the spread " B" seek radio signal losses in the survey line and not targeted , the effective area , the power density , the received power , the coverage radius , the conversion levels and the gain conversion systems radiant . The second family of virtual computing system consists of 7 modules of which 5 are geared towards the design of WCDMA and 2 technology for calculation of telephone traffic serving CDMA and WCDMA . It includes a portfolio of radiant systems used on the site. In the virtual operation of the module 1 is compute-: distance frequency reuse, channel capacity with noise and without noise, Doppler frequency, modulation rate and channel efficiency; Module 2 includes computes the cell area, thermal noise, noise power (dB), noise figure, signal to noise ratio, bit of power (dBm); with the module 3 reaches the calculation: breakpoint, processing gain (dB) loss in the space of BTS, noise power (w), chip period and frequency reuse factor. Module 4 scales effective radiated power, sectorization gain, voice activity and load effect. The module 5 performs the calculation processing gain (Hz / bps) bit time, bit energy (Ws). Module 6 deals with the telephone traffic and scales 1: traffic volume, occupancy intensity, average time of occupancy, traffic intensity, calls completed, congestion. Module 7 deals with two telephone traffic and allows calculating call completion and not completed in HMM. Tests were performed on the mobile network performance field for the calculation of data relating to: CINP , CPI , RSRP , RSRQ , EARFCN , Drop Call , Block Call , Pilot , Data Bler , RSCP , Short Call, Long Call and Data Call ; ECIO - Short Call and Long Call , Data Call Troughput . As survey were conducted surveys of electric and magnetic field in an ERB , trying to observe the degree of exposure to non-ionizing radiation they are exposed to the general public and occupational element. The results were compared to permissible values for health endorsed by the ICNIRP and the CENELEC .

Impact of scatterer density on the performances of double-scattering MIMO channels

We investigate a MIMO double-scattering model with both local and remote scatterers, aiming to investigate the effect of scatterer density on channel performances, such as capacity, correlation, and the condition number of the channel matrix in flat and frequency-selective fading channels. The investigations are carried out in terms of scatterer density. It is shown that in flat fading channels the scatterer density has a marginal effect on channel performances when the area of the two scatterer zones is fixed, while a significant impact is observed when the area of the scatterer zones is allowed to change. In frequency-selective fading channels, no matter the area of the scatterer zones is fixed or not, scatterer density can affect the channel capacity to a certain degree that depends on the length of the coding block of the transmitted signals. © 2010 IEEE.

Bull's eye leaky wave antenna for terrestrial and space applications

This work presents the study of Bull's eye antenna designs, a type of leaky wave antenna (LWA), operating in the 60 GHz band. This band emerged as a new standard for specific terrestrial and space applications because the radio spectrumbecomes more congested up to the millimetre-wave band, starting at 30 GHz. Built on existing Bull's eye antenna designs, novel structures were simulated, fabricated and measured, so as to provide more exibility in the implementation of wireless solutions at this frequency. Firstly, the study of a 60 GHz Bull's eye antenna for straightforward integration onto a CubeSat is presented. An investigation of the design is carried out, from the description of the radiation mechanism supported by simulation results, to the radiation pattern measurement of a prototype which provides a gain of 19.1 dBi at boresight. Another design, based on a modified feed structure, uses a microstrip to waveguide transition to provide easier and inexpensive integration of a Bull's eye antenna onto a planar circuit. Secondly, the design of Bull's eye antennas capable of creating beam deflection and multi-beam is presented. In particular, a detail study of the deflection mechanism is proposed, followed by the demonstration of a Bull's eye antenna generating two separate beams at ±16° away from the boresight. In addition, a novel mechanically steerable Bull's eye antenna, based on the division of the corrugated area in paired sectors is presented. A prototype was fabricated and measured. It generated double beams at ±8° and ±15° from the boresight, and a single boresight beam. Thirdly, a Bull's eye antenna capable of generating two simultaneous orbital angular momentum (OAM) modes l = 3 is proposed. The design is based on a circular travelling wave resonator and would allow channel capacity increase through OAM multiplexing. An improved design based on two stacked OAM Bull's eye antennas capable of producing four orthogonal OAM modes l = (±3,±13) simultaneously is presented. A novel receiving scheme based on discretely sampled partial aperture receivers (DSPAR) is then introduced. This solution could provide a lower windage and a lower cost of implementation than current whole or partial continuous aperture.

A truthful double auction for device-to-device communications in cellular networks

Data traffic in cellular networks has dramatically increased in recent years as the emergence of various new wireless applications, which imposes an immediate requirement for large network capacity. Although many efforts have been made to enhance wireless channel capacity, they are far from solving the network capacity enhancement problem. Device-to-Device (D2D) communication is recently proposed as a promising technique to increase network capacity. However, most existing work on D2D communications focuses on optimizing throughput or energy efficiency, without considering economic issues. In this paper, we propose a truthful double auction for D2D communications (TAD) in multi-cell cellular networks for trading resources in frequencytime domain, where cellular users with D2D communication capability act as sellers, and other users waiting to access the network act as buyers. Both intra-cell and inter-cell D2D sellers are accommodated in TAD while the competitive space in each cell is extensively exploited to achieve a high auction efficiency. With a sophisticated seller-buyer matching, winner determination and pricing, TAD guarantees individual rationality, budget balance, and truthfulness. Furthermore, we extend our TAD design to handle a more general case that each seller and buyer ask/bid multiple resource units. Extensive simulation results show that TAD can achieve truthfulness as well as high performance in terms of seller/buyer sanctification ratio, auctioneer profit and network throughput.

Ergodic capacity of the exponentially correlated slotted amplify and forward relay channel

In this paper we analyze the performance degradation of slotted amplify-and-forward protocol in wireless environments with high node density where the number of relays grows asymptotically large. Channel gains between source-destination pairs in such networks can no longer be independent. We analyze the degradation of performance in such wireless environments where channel gains are exponentially correlated by looking at the capacity per channel use. Theoretical results for eigenvalue distribution and the capacity are derived and compared with the simulation results. Both analytical and simulated results show that the capacity given by the asymptotic mutual information decreases with the network density.

Ergodic capacity of the slotted amplify and forward relay channel with finite relays

Abstract—In this paper we investigate the capacity of a general class of the slotted amplify and forward (SAF) relaying protocol where multiple, though a finite number of relays may transmit in a given cooperative slot and the relay terminals being half-duplex have a finite slot memory capacity. We derive an expression for the capacity per channel use of this generalized SAF channel assuming all source to relay, relay to destination and source to destination channel gains are independent and modeled as complex Gaussian. We show through the analysis of eigenvalue distributions that the increase in limiting capacity per channel use is marginal with the increase of relay terminals.

Shear capacity of lipped channel beams with web openings : design rules and improvements

Cold-formed steel Lipped Channel Beams (LCB) with web openings are commonly used as floor joists and bearers in building structures. Shear behaviour of these beams is more complicated and their shear capacities are considerably reduced by the presence of web openings. Hence detailed numerical and experimental studies of simply supported LCBs under a mid-span load with aspect ratios of 1.0 and 1.5 were undertaken to investigate the shear behaviour and strength of LCBs with web openings. Experimental and numerical results showed that the current design rules in cold-formed steel structures design codes are very conservative. Improved design equations were therefore proposed for the shear strength of LCBs with web openings based on both experimental and numerical results. This research showed a significant reduction in shear capacities of LCBs when large web openings are included for the purpose of locating building services. A cost effective method of eliminating such detrimental effects of large circular web openings was also therefore investigated using experimental and numerical studies. For this purpose LCBS were reinforced using plate, stud, transverse and sleeve stiffeners with varying sizes and thicknesses that were welded and screw-fastened to the web of LCBs. These studies showed that plate stiffeners were the most suitable. Suitable screw-fastened plate stiffener arrangements with optimum thicknesses were then proposed for LCBs with web openings to restore their original shear capacities. This paper presents the details of finite element analyses and experiments of LCBs with web openings in shear, and the development of improved shear design rules. It then describes the experimental and numerical studies to determine the optimum plate stiffener arrangements and the results. The proposed shear design rules in this paper can be considered for inclusion in the future versions of cold-formed steel design codes.

Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel

The capacity region of a two-user Gaussian Multiple Access Channel (GMAC) with complex finite input alphabets and continuous output alphabet is studied. When both the users are equipped with the same code alphabet, it is shown that, rotation of one of the user’s alphabets by an appropriate angle can make the new pair of alphabets not only uniquely decodable, but will result in enlargement of the capacity region. For this set-up, we identify the primary problem to be finding appropriate angle(s) of rotation between the alphabets such that the capacity region is maximally enlarged. It is shown that the angle of rotation which provides maximum enlargement of the capacity region also minimizes the union bound on the probability of error of the sumalphabet and vice-verse. The optimum angle(s) of rotation varies with the SNR. Through simulations, optimal angle(s) of rotation that gives maximum enlargement of the capacity region of GMAC with some well known alphabets such as M-QAM and M-PSK for some M are presented for several values of SNR. It is shown that for large number of points in the alphabets, capacity gains due to rotations progressively reduce. As the number of points N tends to infinity, our results match the results in the literature wherein the capacity region of the Gaussian code alphabet doesn’t change with rotation for any SNR.

Capacity of fading gaussian channel with an energy harvesting sensor node

Network life time maximization is becoming an important design goal in wireless sensor networks. Energy harvesting has recently become a preferred choice for achieving this goal as it provides near perpetual operation. We study such a sensor node with an energy harvesting source and compare various architectures by which the harvested energy is used. We find its Shannon capacity when it is transmitting its observations over a fading AWGN channel with perfect/no channel state information provided at the transmitter. We obtain an achievable rate when there are inefficiencies in energy storage and the capacity when energy is spent in activities other than transmission.

Capacity bounds for the Gaussian X channel

We consider bounds for the capacity region of the Gaussian X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. We first classify the XC into two classes, the strong XC and the mixed XC. In the strong XC, either the direct channels are stronger than the cross channels or vice-versa, whereas in the mixed XC, one of the direct channels is stronger than the corresponding cross channel and vice-versa. After this classification, we give outer bounds on the capacity region for each of the two classes. This is based on the idea that when one of the messages is eliminated from the XC, the rate region of the remaining three messages are enlarged. We make use of the Z channel, a system obtained by eliminating one message and its corresponding channel from the X channel, to bound the rate region of the remaining messages. The outer bound to the rate region of the remaining messages defines a subspace in R-+(4) and forms an outer bound to the capacity region of the XC. Thus, the outer bound to the capacity region of the XC is obtained as the intersection of the outer bounds to the four combinations of the rate triplets of the XC. Using these outer bounds on the capacity region of the XC, we derive new sum-rate outer bounds for both strong and mixed Gaussian XCs and compare them with those existing in literature. We show that the sum-rate outer bound for strong XC gives the sum-rate capacity in three out of the four sub-regions of the strong Gaussian XC capacity region. In case of mixed Gaussian XC, we recover the recent results in 11] which showed that the sum-rate capacity is achieved in two out of the three sub-regions of the mixed XC capacity region and give a simple alternate proof of the same.

Bounds on the sum-rate capacity of the Gaussian MIMO X channel

We consider the MIMO X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. Both the transmitters and receivers are equipped with multiple antennas. First, we derive an upper bound on the sum-rate capacity of the MIMO XC under individual power constraint at each transmitter. The sum-rate capacity of the two-user multiple access channel (MAC) that results when receiver cooperation is assumed forms an upper bound on the sum-rate capacity of the MIMO XC. We tighten this bound by considering noise correlation between the receivers and deriving the worst noise covariance matrix. It is shown that the worst noise covariance matrix is a saddle-point of a zero-sum, two-player convex-concave game, which is solved through a primal-dual interior point method that solves the maximization and the minimization parts of the problem simultaneously. Next, we propose an achievable scheme which employs dirty paper coding at the transmitters and successive decoding at the receivers. We show that the derived upper bound is close to the achievable region of the proposed scheme at low to medium SNRs.

The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint

The input-constrained erasure channel with feedback is considered, where the binary input sequence contains no consecutive ones, i.e., it satisfies the (1, infinity)-RLL constraint. We derive the capacity for this setting, which can be expressed as C-is an element of = max(0 <= p <= 0.5) (1-is an element of) H-b (p)/1+(1-is an element of) p, where is an element of is the erasure probability and Hb(.) is the binary entropy function. Moreover, we prove that a priori knowledge of the erasure at the encoder does not increase the feedback capacity. The feedback capacity was calculated using an equivalent dynamic programming (DP) formulation with an optimal average-reward that is equal to the capacity. Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting. DP is, thus, shown to be a tool not only for solving optimization problems, such as capacity calculation, but also for constructing optimal coding schemes. The derived capacity expression also serves as the only non-trivial upper bound known on the capacity of the input-constrained erasure channel without feedback, a problem that is still open.