The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Radio Access Network (RAN) costs savings are expected in future Cloud RAN (C-RAN). Differently from traditional distributed RAN architecture, in C-RAN Remote Radio Heads (RRH) from different sites can share baseband processing resources from virtualized Base Band Unit (BBU) pools placed in few central locations (CO). Due to the stringent requirements of the several interfaces needed in C-RAN, optical...
This paper, for the first time, presents the feasibility of employing the transmission of equally shaped pulses to accommodate both dimming and Visible Light Communication (VLC). Adjustment of the brightness experienced by the human eye is accomplished by varying the number of pulses within a set dimming frame. Duration of the pulses and dimming frames are such that the eye detects an average illumination...
The vast acceptance of OFDM technology is not limited to the radio domain, but is also among researchers for wireline and wireless optical communications. For indoor wireless optical communications, the use of OFDM faces a major challenge in reducing the average transmit optical power to cope with the eye safety problem. We propose the use of the selected mapping (SLM) technique to reduce the average...
Closed form mathematical expressions of network parameters such as the mean packet delay are useful for evaluating the communication network performance in the design process. This paper provides a derivation of a closed form expression of the mean packet delay for the limited service dynamic bandwidth allocation algorithm (DBAA) in an Ethernet Passive Optical Network (EPON). Using the queuing analysis...
In wireless multi-hop networks, the allocation of resources is influenced by mechanisms for medium access control (MAC), routing, congestion control, and flow control. Designing these mechanisms jointly can increase the capacity of wireless networks. We attempt to introduce routing into an existing framework for the joint design of flow control and MAC on random access multi-hop wireless networks...
Closed form mathematical expressions of network parameters such as the mean packet delay are useful for evaluating the communication network performance in the design process. This paper provides a simple derivation of a closed form expression of the mean packet delay for the gated service dynamic bandwidth allocation algorithm (DBAA) in an Ethernet Passive Optical Network (EPON). Using the queuing...
We consider the problem of dimensioning and expansion of wavelength division multiplexing (WDM) networks, taking in to account the fact that traffic demand is growing with time. It is known that such networks are operating in non-steady states, and absorption probabilities should be used to dimension the network instead of traditional blocking probabilities. In this paper, we first propose a numerical...
This paper proposes a two-level serial search-and-verification code acquisition algorithm for optical orthogonal codes (OOCs) in optical code division multiple access (O-CDMA) systems. We analyze the performance of the proposed algorithm using the Markov chain model. The results show that the proposed algorithm can reduce the mean acquisition time when compared with the existing two-level serial search...
This paper extends the existing static framework for joint flow control, routing and medium access control (MAC) in random access multi-hop wireless networks in to a dynamic framework where link capacities vary over time. The overall problem is formulated as a long term network utility maximization (NUM) problem (instead of the existing static NUM problem) that accounts for link capacity variation...
We investigate the problem of fair and robust joint transmitter and receiver power allocation for uplink multiple input multiple output (MIMO) transmissions. The channel model is assumed to have Rayleigh flat fading. For fairness, the objective of power allocation is to minimize the maximum MSE among all users each of which has limited transmit power. For robustness, we consider joint power allocation...
Dynamic environments pose a challenge to the read performances of current RFID systems. Moving tags on a conveyor belt affect the read performance of a static reader. This paper attempts to evaluate a static reader identifying moving tags on a conveyor belt. We propose an algorithm enabling the conveyor belt to dynamically adjust its speed for the RFID reader to reliably identify tags without prior...
In a power grid used to distribute electricity, optical fibers can be inserted inside overhead ground wires to form an optical network infrastructure for data communications. We consider the problem of topology design for such a network. To solve the problem, we modify existing methods for topology designs to take into account the topology limitation imposed by an existing power grid. For the design,...
DVTS (digital video transport system) is a high quality video transfer system that is suitable for high performance network environments. In order to transmit a DV stream in a narrow bandwidth environment, the existing approach allows the sender to reduce the frame rate to suit with the available bandwidth. However, one drawback of this method is that the frame rate is fixed for a single DV stream...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.