An efficient multi-path pipeline transmission for a bulk data transfer in IEEE 802.15.4 multi-hop networks

Wireless Networks - A pipeline transmission is the state-of-the-art approach to transmit large amounts of data over IEEE 802.15.4 multi-hop networks, but the performance of the pipeline...     

Quality-of-service provisioning and efficient resource utilization in CDMA cellular communications

One of the major challenges in supporting multimedia services over Internet protocol (IP)-based code-division multiple-access (CDMA) wireless networks is the quality-of-service (QoS) provisioning with efficient resource utilization. Compared with the circuit-switched voice service in the second-generation CDMA systems (i.e., IS-95), heterogeneous multimedia applications in future IP-based CDMA networks require more complex QoS provisioning and more sophisticated management of the scarce radio resources. This paper provides an overview of the CDMA-related QoS provisioning techniques in the avenues of packet scheduling, power allocation, and network coordination, summarizes state-of-the-art research results, and identifies further research issues.     

Partial relaying with layered encoding for efficient multi-hop transmission

Multi-hop transmission through wireless relays provides coverage extension and throughput enhancement. However, it may cause waste of bandwidth to meet half-duplex requirement of the relay. Motivated by this problem, we propose an efficient relaying scheme, referred to as partial relaying with layered encoding. In the proposed scheme, only partial information is transmitted via a relay, and a layered encoding is employed for the link between the source and relay for reliable delivery of the partial information. Simulation results confirm that the proposed scheme outperforms the conventional decode-and-forward relaying scheme, in terms of both the spectral efficiency and bit error rate.     

Optimal transmission methodology for QoS provision of multi-hop cellular network

In this paper, we present a framework of link capacity analysis for optimal transmission over uplink MCN (Multi-hop Cellular Network) environments. An overlaid architecture is employed as the network topology, i.e., single-hop transmission over the inner region and multi-hop transmission over the outer region. In particular, we analyzed the gain that accrued from grafting a relay method onto a conventional, SCN (Single-hop Cellular Network) and investigated the conditions for optimal performance through the numerical results. At high-user density, a MCN exhibits a much more reliable transmission than the SCN. For maximal link capacity, optimal region partitioning is approximately accomplished at the normalized cell radius of 0.6 in most of cases for region division. Finally, the link capacity can be improved 1.2–1.8 times better than the SCN when the number of relay hops is 1.6 and the half-duplex mechanism is used. In addition, the proposed MCN scheme demonstrates an effective reduction in transmission power relative to the SCN.     

Optimal transmission mode proportion for heterogeneous networks of cellular and device-to-device communications

This paper discusses about the optimal mode allocation for the heterogeneous networks, in which the network can schedule users working in the device-to-device （D2D） mode or cellular mode. The D2D user is allowed to reuse the uplink resource of cellular system and the problem is formed as a sum-capacity optimization issue with outage constraints for both cellular and D2D links. The method for the optimal user proration is proved to be divided into three cases according to the total user density： when the total user density is small, the optimal proration trends to all users utilizing one mode; when the total user density is large, the optimal proration is all of users choosing D2D mode; and when the total user density situates in the between, there is a unique optimal transmission mode proportion for the hybrid networks to maximize its sumcapacity. The simulation results demonstrate the validity of the conclusions in the analysis part.     

Mitigating location management traffic via aggregation in multi-hop cellular networks

In high mobility areas such as shopping malls and transportation stations, mobile users tend to move in and out in a bursty fashion, and hence location update (LU) and paging signaling cause substantial traffic burden to the cellular networks, leading to signaling congestion. This poses a great challenge to the system design for wireless cellular systems. Traditional cellular systems cannot cope with this situation very well. However, with the ad hoc operational mode recently introduced into the cellular systems, the added multi-hop relaying via mobile devices provides a new way to mitigate location management traffic. In this paper, based on this new architecture, we propose a novel scheme, called aggregative location management, which aggregates multiple location updates into group location updates. For the scenarios of high capacity transit (HCT) systems, we use this grouping scheme to alleviate the signaling traffic when mobile users in an HCT move into new location areas. For other scenarios with mass arrivals of LU requests, we develop a generic aggregative location management scheme in which LU requests can be first aggregated by designated mobile devices and then are periodically sent to the location registers. Performance evaluation is carried out and shows their significant effectiveness.     

Performance analysis in multi-hop radio networks with balanced fair resource sharing

Balanced fairness is a new resource sharing concept recently introduced by Bonald and Proutière. We extend the use of this notion to wireless multi-hop networks, e.g. ad hoc networks, where the link capacities at the flow level are not fixed but depend on lower layer issues such as scheduling and interference. Utilizing this extension we present the theoretical framework for flow level performance analysis of elastic traffic in the setting, assuming that the wireless bandwidth resources are subject to linear constraints. We discuss how different physical and access layer configurations can be described by the linear constraint model and devise an efficient computational scheme for solving the system. The concepts and the computational scheme are illustrated by a number of examples.     

QoS-guaranteed packet scheduling in wireless networks

To guarantee the quality of service (QoS) of a wireless network, a new packet scheduling algorithm using cross-layer design technique is proposed in this article. First, the demand of packet scheduling for multimedia transmission in wireless networks and the deficiency of the existing packet scheduling algorithms are analyzed. Then the model of the QoS-guaranteed packet scheduling (QPS) algorithm of high speed downlink packet access (HSDPA) and the cost function of packet transmission are designed. The calculation method of packet delay time for wireless channels is expounded in detail, and complete steps to realize the QPS algorithm are also given. The simulation results show that the QPS algorithm that provides the scheduling sequence of packets with calculated values can effectively improve the performance of delay and throughput.     

Dynamic joint resource allocation and relay selection for 5G multi-hop relay systems

LTE/LTE-A networks have become widely exploited to address the increasing demands of mobile traffic. Relay technologies have recently been introduced to fulfill such requirements. Currently, the LTE-A relay standard is restricted to two-hop relaying. This architecture minimizes system complexity, but multi-hop relay architecture could potentially provide greater capacity and coverage in the future. However, many complexities of the multi-hop relaying paradigm must be resolved. In this work, we focus on downlink resource allocation and relay selection, by which a user may be connected to a base station through a multi-hop relay and have several relay stations from which to choose within his range. To overcome the additional challenges introduced by multi-hop relay nodes, we propose a dynamic joint resource allocation and relay selection scheme. Numerical results are presented to demonstrate the validity of the proposed algorithm.     

Time-based resource allocation for downlink in heterogeneous wireless cellular networks

Telecommunication Systems - Heterogeneous Wireless Cellular Networks (HWCNs) are an essential part of current and future cellular networks as a result of several benefits they offer regarding the...     

An efficient resource management scheme in light-trail networks

Light-trail, a framework proposed in the past few years, is generalized from the concept of lightpath, and its distinguishing features include bandwidth sharing and efficient bandwidth utilization. Performance of light-trail networks depends on the routing algorithm and the dynamic bandwidth allocation (DBA) scheme, and the former issue has been discussed extensively. In this work, we aim at the design of an efficient DBA scheme, named Demand and Delay-latency Aware with Two-round Deliberation \((\hbox {D}^{2}\hbox {ATD})\), to allocate bandwidth more accurately and efficiently in light-trail networks. In addition to DBA issue, \(\hbox {D}^{2}\hbox {ATD}\) includes a light-trail setup/release mechanism as well. As expected, the simulation results reveal superiority of \(\hbox {D}^{2}\hbox {ATD}\) in both blocking performance and delay performance. Although \(\hbox {D}^{2}\hbox {ATD}\) pays a price of control overhead for performance gain, it is still reasonable since the amount of control messages does not exceed the capacity of the control channel. It verifies that \(\hbox {D}^{2}\hbox {ATD}\) can properly employ the control channel to achieve excellent performance.     

Dynamic resource allocation in mobile heterogeneous cellular networks

User mobility is a challenging issue in macro and femto cellular networks for the fifth-generation and newer mobile communications due to the time-varying interference and topology experienced. In this paper, we consider an OFDMA-based two-tier network with one macro cell and several femto cells, wherein each macro user and/or femto user can leave or enter its serving cell frequently, referred to as user mobility. A resource allocation problem with different rate requirements of mobile users is then formulated. Assuming well knowledge of the user locations and the channel state information, we propose a dynamic algorithm with static and dynamic parts for a better trade-of between computational complexity and system throughput. The static algorithm, named interference weighted cluster algorithm in this paper, is based on the graph theory to cluster the femtocells by minimizing the interference between clusters, while the dynamic algorithm is to deal with the user mobility by sharing the resource blocks under the constraints of rate requirements. Numerical results are demonstrated to show the effectiveness of the proposed dynamic resource allocation algorithm in terms of capacity, computational time, and outage probability.

     

Channel and queue aware joint relay selection and resource allocation for MISO-OFDMA based user-relay assisted cellular networks

User-relay assisted orthogonal frequency division multiple access (OFDMA) networks are cost-effective solutions to meet the growing capacity and coverage demands of the next generation cellular networks. These networks can be used with multiple antennas technology in order to obtain a diversity gain to combat signal fading and to obtain more capacity gain without increasing the bandwidth or transmit power. Efficient relay selection and resource allocation are crucial in such a multi-user, multi-relay and multi-antenna environment to fully exploit the benefits of the combination of user-relaying and multiple antennas technology. Thus, we propose a channel and queue aware joint relay selection and resource allocation algorithm for multiple-input single-output (MISO)-OFDMA based user-relay assisted downlink cellular networks. Since, the proposed algorithm is not only channel but also queue-aware, the system resources are allocated efficiently among the users. The proposed algorithm for the MISO-OFDMA based user-relay assisted scheme is compared to existing MISO-OFDMA based non-relaying and fixed relay assisted schemes and it is also compared with the existing single-input single-output (SISO)-OFDMA based user-relay assisted scheme. Simulation results revealed that the proposed scheme outperforms the existing schemes in terms of cell-edge users’ total data rate, average backlog and average delay.     

Energy efficient transmission scheduling for delay constrained wireless networks

In this paper, we address the problem of energy efficient packet scheduling in a wireless environment. We consider a wireless transmitter which is limited by its finite battery resource. Our objective is to design a transmission schedule that maximizes battery lifetime subject to some delay constraints. To achieve this, we exploit two previously unconnected ideas: (i) channel coding can be used to conserve energy by transmitting at reduced power levels over longer durations; (ii) electro-chemical mechanisms in batteries allow them to recover energy during idle periods. While the first idea favors extending transmission durations, the second idea requires the transmitter to be idle to allow for recovery. In other words, bursty packet transmissions interspersed with idle periods extend battery life. Therefore, a strategy which is based entirely on either one or the other idea is not optimal. We provide a framework to merge the two ideas. We consider two kinds of delay constraints, one a deadline constraint and the other an average delay constraint and show that energy aware scheduling strategies for both these scenarios can result in significant energy savings.     

Relay selection schemes for secure transmission in cognitive radio networks

The security in cognitive radio networks (CRNs) has been attracting continuously growing attention due to the open and dynamic nature of cognitive radio architecture. In this paper, we propose new relay selection schemes to improve the physical layer security in CRNs. A trusted decode-and-forward relay is selected to help the secondary user (SU) transmission and improve the secrecy rate in the presence of multiple eavesdroppers and multiple primary users (PUs). The secrecy rate of the SU is characterized under both its own transmit power constraint as well as a set of interference power constraints imposed at each PU, in order to preserve its quality of service. The performance of the proposed schemes is analyzed in terms of the achievable secrecy rate and the intercept probability. Closed form expressions for the asymptotic intercept probability at high source-relays channel variances are also derived. Moreover, new derivations of some existing traditional schemes are presented and compared. The performance comparison of the proposed schemes with the schemes proposed in the literature reveals the superior of the proposed schemes.     

Proxy-assisted routing for efficient data transmission in mobile ad hoc networks

While on-demand routing protocols have been optimized to use the aid of proxy nodes by considering the possibility of long-lived partitions due to intermittent connectivity, they do not consider the chances of using a proxy for a long distance between a pair of source and destination. In this paper, we introduce a Proxy-Assisted Routing (PART) for efficient data transmission by selecting a proxy node for every path length that is longer than the predefined value between a source and destination. Whenever route errors occur between a source node and proxy node, or a proxy node and destination node, the proxy node repairs a broken route locally by redirecting a new route to the source or destination node. To reduce routing overhead, we delineate a broadcasting zone, where nodes are only allowed to broadcast request packets within the predefined zone to the proxy. Furthermore, unicast transmission is used for the proxy selection process using IP address information at the MAC layer. When we evaluate the performance metrics through simulations, PART significantly reduces the normalized routing load by almost 55% and the packet losses by almost 30%, and increases throughput almost 70% if compared to the traditional routing protocols.     

An efficient fault-tolerant distributed channel allocation algorithm for cellular networks

A channel allocation algorithm in a cellular network consists of two parts: a channel acquisition algorithm and a channel selection algorithm. Some of the previous works in this field focused on centralized approaches to allocating channels. But, centralized approaches are neither scalable nor reliable. Recently, distributed dynamic channel allocation algorithms have been proposed, and they have gained a lot of attention due to their high reliability and scalability. But, in most of the algorithms, the cell that wants to borrow a channel has to wait for replies from all its interference neighbors and, hence, is not fault-tolerant. In this paper, we propose a new algorithm that is fault-tolerant and makes full use of the available channels. It can tolerate the failure of mobile nodes as well as static nodes without any significant degradation in service.     

Access probability optimization for streaming media transmission in heterogeneous cellular networks

FemtoCaching technology, aiming at maximizing the access probability of streaming media transmission in heterogeneous cellular networks, is investigated in this paper. Firstly, five kinds of streaming media deployment schemes are proposed based on the network topology and the relationship between users and streaming media. Secondly, a matching algorithm for adaptive streaming media deployment is proposed, where the FemtoCaching can be adjusted dynamically. Thirdly, a joint problem is formulated combined with the channel assignment, the power allocation, and the caching deployment. To address this problem, we propose a joint optimization algorithm combining matching algorithm and genetic algorithm to maximize the access probability of streaming media transmission. Simulation experiments demonstrate that: (1) the average access probability of all users accessing streaming media in the network based on the proposed algorithm compared with recent works can be greatly improved, and (2) the performance increases with increasing the number of channels and the storage capacity of micro base stations, but decreases with increasing the number of users.