多跳无线传感器网络的高效中继节点快速选择算法

针对多跳无线传感器网络数据收集协议中继转发节点选择算法效率不高的问题,提出了一种能量有效的中继节点快速选择 (EERNFS)算法.EERNFS算法利用分时共享信道的方法维护网络同步和更新节点的邻居信息,使节点在每个网络侦听/睡眠周期依赖一定的概率同步激活唤醒,确保了网络节点瞬时连通度的稳定和一致;基于网络节点的地理优先级、节点价值和链路质量的分布式估计,EERNFS算法采用竞争的方法选择中继转发节点, 使用乘性增加时间窗口的方法,分解候选中继节点间的竞争.理论分析和模拟实验结果表明,EERNFS算法在能效、数据传递的平均时延、分组到达率等网络性能指标上显著优于FFS和GeRaF算法,极大地延长了网络的寿命.     

中继网中基于QoS保证和比例公平的资源分配

中继系统下的众多资源分配策略很少同时考虑多用户情形下的子载波配对和不同用户需求。针对这一问题,提出了一种基于QoS(服务质量)保证和比例公平的多用户子载波配对和功率分配算法,该算法既能保证QoS用户的最小速率要求,又能满足BE(尽力而为)用户之间速率比例公平的准则。该算法首先根据不同用户需求分配第二跳的子载波,然后利用匈牙利配对算法得到两跳子载波的最佳配对,最后用类似注水算法进行功率分配。仿真结果表明,所提算法在满足用户QoS保证和比例公平准则的同时有效提升了系统的吞吐量。     

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.     

Channelization for dynamic multi-frequency, multi-hop wireless cellular networks

Multi-hop relaying in cellular networks can greatly increase capacity and performance by exploiting the best available links to a base station. We envision an environment in which relay networks are dynamically formed when performance on the radio access network is degraded and then dissolved when the performance improves or the radio spectrum on which the relay network is operating is reclaimed. Each relay network operates on a different frequency band. Likewise, a relay network may channelize its frequency band to offer non-interfering links among the mobile nodes within a single relay network. We propose a set of algorithms used to form such relay networks on-demand. Each algorithm provides a simple and distributed frequency assignment scheme. We also propose two enhancements to improve network throughput of resulting relay networks. We evaluate these algorithms in terms of the overhead of the relay network formation. The evaluation results show that having nodes outmost from the BS initiate route discovery first is the best approach for reducing the formation overhead. The results also show that there is a large increase in throughput when using multiple frequencies in a relay network. Further, the performance of the network using multiple frequencies based on our simple frequency assignment is very close to that of a network using optimal frequency assignment.     

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.     

An efficient UE cluster head selection algorithm in wireless sensor networks and cellular networks

Wireless Sensor Networks (WSNs) have been applied in many different areas. Energy efficient algorithms and protocols have become one of the most challenging issues for WSN. Many researchers focused on developing energy efficient clustering algorithms for WSN, but less research has been concerned in the mobile User Equipment (UE) acting as a Cluster Head (CH) for data transmission between cellular networks and WSNs. In this paper, we propose a cellular-assisted UE CH selection algorithm for the WSN, which considers several parameters to choose the optimal UE gateway CH. We analyze the energy cost of data transmission from a sensor node to the next node or gateway and calculate the whole system energy cost for a WSN. Simulation results show that better system performance, in terms of system energy cost and WSNs life time, can be achieved by using interactive optimization with cellular networks.     

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.     

车联网中基于动态传输距离的多跳稳定路由

数据传输是车联网(VANETs)实现交通安全的基础。然而,车辆的移动、信号传输的衰减以及彼此间的干扰对链路的可靠性均有影响。为此,提出基于动态传输距离的多跳稳定(DTMS)路由。DTMS路由在选择下一跳转发节点时,考虑到因衰减而导致的传输距离的变小,先估计车辆动态传输距离,再依据动态传输距离估计链路的连通时间以及距离因素,然后,计算邻居节点的权重,最后,基于节点权重值设置定时器,进而竞争产生下一跳转发节点。仿真结果表明,提出的DTMS路由有效地提高了数据包传输成功率。     

L-RUBI: An efficient load-based resource utilization algorithm for bi-partite scatternet in wireless personal area networks

Recently, much of the wireless personal area network (WPAN) research concerns network protocols, scheduling, and security challenges but the major issue of resource utilization has been very rarely investigated. The design of resource sharing in a network gets more attention when the number of users increases. While optimizing performance, resource utilization plays a critical role. In this paper, the numerical performance of a wireless resource utilization algorithm for a bi-partite scatternet is presented. This algorithm is focused to enhance the bandwidth allocation and power utilization of wireless scatternets. Every node can communicate with a single neighbor at a time with minimum resources. Finally, the performances of the RUBI algorithm are shown. This algorithm is compared with the existing algorithms such as the load adaptive scheduling algorithm and pseudorandom coordinated scheduling scheme in terms of various parametric metrics like reliability, throughput, collision probability, transmission probability, and signal-to-noise ratio (SINR). The proposed L-RUBI achieves 93.4% of reliability, 93.6% of transmission probability, 91.4% of throughput, 76.8% of collision performance, and 72.2% SINR.     

Quality of service aware antenna selection scheme for multi-hop relay networks

Multi input multi output (MIMO) based multi-hop relay (MHR) networks has become one of the promising technologies in improving the quality of wireless links. The optimal antenna selection is one of the suitable solutions to overcome the limitations of MIMO scheme. To attain the full benefits of transmitter antenna selection schemes, perfect channel quality information (CQI) is required at the transmitter. The time varying channel and the feedback delay make CQI at the transmitter outdated and also affect the antenna selection process. In this work, we have derived the symbol error probability (SEP) of M-ary quadrature amplitude modulation (QAM) for three different antenna selection schemes by considering the effect of delayed CQI. All these derived expressions are the function of correlation between CQI at the receiver and delayed CQI at the transmitter. The simulation results show that the antenna selection gain decreases with the decrease in correlation. It is also observed that scheme 1 based antenna selection is optimal for different constellations and more suited for MHR network.     

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.     

一种高效可靠的无人机自组网多跳TDMA协议

设计无人机自组网媒体接入控制(Medium Access Control,MAC)协议时,需要考虑其控制开销和数据传输的可靠性。鉴于此,结合现有无线自组网多跳时分多址接入(Time Division Multiple Access,TDMA)协议和无人机自组网特点,提出了一种高效可靠的无人机自组网多跳TDMA协议。首先采用高效负载均衡的时隙请求信息上传机制,选择一个负载较小的节点转发节点时隙请求信息;然后根据相互通信的父节点删除重复节点的时隙请求信息,减少相同节点的时隙请求信息转发次数;最后通过实时更新节点时隙请求信息机制,提高节点时隙请求信息传输的可靠性。仿真结果表明,该协议在数据传输成功率、平均时延、控制开销方面优于现有协议,可较好地应用在无人机自组网中。     

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.     

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.     

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...     

A virtualized resource management scheme for heterogeneous cellular networks

Because of random deployment patterns of femtocells, interference scenarios in a heterogeneous cellular network can be very complicated because of its changing network topology. Especially when each eNodeB occupies a fixed bandwidth, interference management becomes much more difficult. The benefit of dynamic management for local resource optimation is limited. Recently, resource virtualization has been proposed as a dynamic resource management scheme to optimize network performance. In fact, resource virtualization is viewed as a more flexible model, in which mobile network service providers can control physical resources in a global scope. This paper presents a joint resource virtualization and allocation scheme for its applications in heterogeneous macro‐femto‐cellular networks. The proposed scheme involves two major processes. First, it virtualizes physical resources as logical resources. Second, it carries out logical resource allocation optimization globally and aggregates logical and physical resources for resource allocation. The proposed scheme takes into account spectrum reuse and frequency domain interference jointly in order to achieve a high spectral efficiency and provide rate‐on‐demand services to all users. Simulation results demonstrate the effectiveness of the proposed scheme. Copyright © 2016 John Wiley & Sons, Ltd.