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.
Network throughput of the best-effort networks as typified by the Internet and wireless networks is often insufficient for multimedia communication, and it spoils the quality of communication. Therefore, it is important to analyze a dynamic characteristics of the throughput when multimedia traffic is injected. We point out that the dynamics of the throughput has the viscosity and the elasticity because...
In wireless networks a packet can be lost due to numerous reasons, such as congestion, medium related errors, routing and mobility. In these scenarios, the real congestion status of the network is crucial to develop accurate and efficient congestion control protocols. Some of the most known and recent protocols developed to provide faster and lighter congestion control are the eXplicit Control Protocol...
Multi-Packet Reception (MPR) enables simultaneous receptions from different transmitters to a single receiver, which has been demonstrated to bring capacity improvement in wireless network. However, MPR does not improve the transmission capability of intermediate relay nodes in a multi-hop routing and thus these nodes may become the bottlenecks for increasing throughput despite of great reception...
Wireless links are often unreliable and prone to transmission error due to varying channel conditions. These can degrade the performance in wireless networks, particularly for applications with tight quality-of-service requirements. A common remedy is to use channel coding where the transmitter node adds redundant bits to the transmitted packets in order to reduce the error probability at the receiver...
Cognitive Radio (CR) networks are emerging as a viable candidate to resolve the conflict between increasing demand for spectrum and spectrum shortage. The essential purpose of a CR network is to improve the network spectrum efficiency, which, however, may not be achieved if a CR network is inappropriately configured. In decentralized overlaid networks, the throughput of the primary network will decrease...
Mesh Wireless Local Area Network (WLAN) is a promising access network to enhance channels utilization, extend access coverage with simple and cheap network components. Power management affects mesh WLAN network coverage, topology, throughput, traffic routing and end to end delay. In this paper, power management problem is formulated to show its impact on mesh WLAN network throughput. Then this formulation...
In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set of basic schedules, and chooses the max-weight basic schedule for transmission in each time slot. At the same time, the scheduler tries to update the set of basic...
The capacity of a wireless network could be considerably improved by employing directional antennas that are capable of illuminating multiple beams toward different directions. However, more beams from the same BS may lead to stronger inter-cell interference. In this paper, we consider coordinated beam scheduling schemes to mitigate the inter-cell interference. We first formulate this problem as a...
It is well known that links in CSMA wireless networks are prone to starvation. Prior works focused almost exclusively on equilibrium starvation. In this paper, we show that links in CSMA wireless networks are also susceptible to temporal starvation. Specifically, although some links have good equilibrium throughputs and do not suffer from equilibrium starvation, they can still have no throughput for...
We consider the greedy scheduling based on the physical model in wireless networks with successive interference cancellation (SIC). There are two major stages in a scheduling scheme, link selection (to decide which link is scheduled next) and time slot selection (to deciding which slot is allocated to a given link). Most available schemes take a first-fit policy in the latter and strive to achieve...
In this paper, we discuss the opportunistic multicast scheduling (OMS) in a wireless network using erasure codes. Originally proposed for channels with erasures such as internet, erasure codes are found useful in wireless multicast to achieve better tradeoff between multiuser diversity and the multicast gain. In this work we investigated how to design an opportunistic multicast scheduling scheme which...
In this paper, we study the cooperative network coding problem in relay-assisted wireless access networks. In such a network, each mobile station can choose different transmission schemes: directly transmitting to the base station, pure relaying by a relay station, or via cooperative network coding. We analyze the impact of the different schemes on the network throughput. We find the performance of...
Conventional design of wireless networks mainly focuses on system capacity and spectral efficiency (SE). As green radio (GR) becomes an inevitable trend, energy-efficient design in wireless networks is becoming more and more important. In this paper, the fundamental tradeoff relation between energy efficiency (EE) and SE in downlink orthogonal frequency division multiple access (OFDMA) networks is...
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.