Energy-efficient inter-RAN cooperation for non-collocated cell sites with base station selection and user association policies

Wireless Networks - Conventional planning and optimization of cellular mobile networks for supporting the peak-time user demand leads to substantial wastage of electrical energy. Infrastructure...     

基于非对称信道状态信息的协作通信：一种契约理论建模方法

In relay-assisted cooperative com-munication, relay nodes help forwarding the information of a source node in case of link failure between the source and a destination. Although user cooperation improves the over-all efficiency of the network, it requires incen-tive to stimulate potential relay nodes to assist the source by forwarding its data to the desti-nation. Moreover, the potential relays are bet-ter informed than the source about their chan-nel conditions to destination, which results in asymmetric information between the source and the relays. In this paper, we study the problem of lack of forwarding incentive in cooperative communication when channel state information of relays is private infor-mation and not known by the source. To tackle this problem, we apply the principle of contract theory to a cooperative wireless system. Source first designs incentive compatible and individually rational contract, consisting of a set of power-credit pairs. Then it broadcasts contract items to nearby nodes. Once the source node receives reply messages from the volunteer relays, it chooses one or more relays based on its re-quirements and communication starts. Simulation results show how credit assignment works in order to stimulate relays to cooperate and prevents relays from cheating behavior.     

Protocols for reliable data transport in space internet

A variety of protocols have been proposed for reliable data transport in space Internet and similar network environments. It is necessary to conduct a survey on these protocols to investigate and compare among them. In this article, we present a survey on the protocols proposed for reliable data transport in space Internet, with a focus on the latest developments. The survey includes the following contents: (1) Classification of these protocols into different approaches; (2) Discussions and comments on the design and operation methods of the protocols; and (3) Comparisons and comments on the main techniques and performance of the protocols.     

Accuracy,latency, and energy cross‐optimization in wireless sensor networks through infection spreading

In this paper, cross‐optimization of accuracy, latency, and energy in wireless sensor networks (WSNs) through infection spreading is investigated. Our solution is based on a dual‐layer architecture for efficient data harvesting in a WSN, in which, the lower layer sensors are equipped with a novel adaptive data propagation method inspired by infection spreading and the upper layer consists of randomly roaming data harvesting agents. The proposed infection spreading mechanisms, namely random infection (RI) and linear infection (LI), are implemented at the lower layer. The entire sensor field is dynamically separated into several busy areas (BA) and quiet areas (QA). According to the BA or QA classification, the level of importance is defined, on which, the optimal number of infections for a particular observation is evaluated. Therefore, the accessed probability for observations with a relatively higher importance level is adaptively increased. The proposed mechanisms add further value to the data harvesting operation by compensating for its potential lack of coverage due to random mobility and tolerable delay, thus a relatively higher accuracy and latency requirements can be guaranteed for the optimization of energy consumption in a dynamically changing environment. Further, with the cost of processing simple location information, LI is proved to outperform RI. Copyright © 2010 John Wiley & Sons, Ltd.     

Service based CAC with QoS guarantee in mobile wireless cellular networks

The increasing variety and complexity of traffic in today's mobile wireless networks means that there are more restrictions placed on a network in order to guarantee the individual requirements of the different traffic types and users. Call admission control (CAC) plays a vital role in achieving this. In this paper, we propose a CAC scheme for multiple service systems where the predicted call usage of each service is used to make the admission decision. Our scheme enables real‐time traffic to be transmitted using shared bandwidth without quality of service (QoS) requirements being exceeded. This ensures that the utilization of the available wireless bandwidth is maximized. Information about the channel usage of each service is used to estimate the capacity of the cell in terms of the number of users that can achieve a certain bit error rate (BER). Priorities assigned to each service are used to allocate the network capacity. An expression for the handoff dropping probability is derived, and the maximum acceptance rate for each service that results in the estimated dropping probability not exceeding its QoS requirements is calculated. Each call is then accepted with equal probability throughout the duration of a control period. Achieved QoS during the previous control period is used to update the new call acceptance rates thus ensuring the dropping probability remains below the specified threshold. Simulations conducted in a wideband CDMA environment with conversational, streaming, interactive and background sources show that the proposed CAC can successfully meet the hard restraint on the dropping probability and guarantee the required BER for multiple services. Copyright © 2005 John Wiley & Sons, Ltd.     

Packet admission control in a direct-sequence spread-spectrum LEOsatellite communications network

The effect of multiple-access interference on the throughput performance of a direct-sequence spread-spectrum low-Earth-orbiting satellite communications network is discussed. To recognize the effect of interference when their sources are either inside or outside the service area of a satellite, we develop a stochastic model for the location of users. We show that the effect of interference on the performance degradation from users with large propagation distance to their connecting satellites is the dominant factor. Hence, to improve the performance of the system, we propose a method in which the transmissions of packets are controlled according to their distances to connecting satellites as well as the traffic distribution     

An optimized forwarding protocol for lifetime extension of wireless sensor networks

Optimized routing (from source to sink) in wireless sensor networks (WSN) constitutes one of the key design issues in prolonging the lifetime of battery‐limited sensor nodes. In this paper, we explore this optimization problem by considering different cost functions such as distance, remaining battery power, and link usage in selecting the next hop node among multiple candidates. Optimized selection is carried out through fuzzy inference system (FIS). Two differing algorithms are presented, namely optimized forwarding by fuzzy inference systems (OFFIS), and two‐layer OFFIS (2L‐OFFIS), that have been developed for flat and hierarchical networks, respectively. The proposed algorithms are compared with popular routing protocols that are considered as the closest counterparts such as minimum transmit energy (MTE) and low energy adaptive clustering hierarchy (LEACH). Simulation results demonstrate the superiority of the proposed algorithms in extending the WSN lifetime. Copyright © 2008 John Wiley & Sons, Ltd.     

ECaD: Energy‐efficient routing in flying ad hoc networks

Much progress can be expected in the domain of unmanned aerial vehicle (UAV) communication by the next decade. The cooperation between multiple UAVs in the air exchanging data among themselves can naturally form a flying ad hoc network (FANET). Such networks can be the key support to accomplish several kinds of missions while providing the required assistance to terrestrial networks. However, they are confronted with many challenges and difficulties, which are due to the high mobility of UAVs, the frequent packet losses, and the weak links between UAVs, all affecting the reliability of the data delivery. Furthermore, the unbalanced energy consumption may result in earlier UAV failure and consequently accelerate the decrease of the network lifetime, thus disrupting the overall network. This paper supports the use of the movement information and the residual energy level of each UAV to guarantee a high level of communication stability while predicting a sudden link breakage prior to its occurrence. A robust route discovery process is used to explore routing paths where the balanced energy consumption, the link breakage prediction, and the connectivity degree of the discovered paths are all considered. The performance of the scheme is evaluated through a series of simulations. The outcomes demonstrate the benefits of the proposed scheme in terms of increasing the lifetime of the network, minimizing the number of path failures, and decreasing the packet losses.     

Measurement‐based admission control scheme with priority and service classes for application in wireless IP networks

Wireless IP networks will provide voice and data services using IP protocols over the wireless channel. But current IP is unsuitable to provide delay or loss bounds and insufficient to support diverse quality of service, both required by real‐time applications. In order to support real‐time applications in wireless IP networks, in this paper a measurement‐based admission control (MBAC) with priority criteria and service classes is considered. First we have shown the suitability of MBAC in wireless IP networks by comparing its performance with a parameter‐based scheme. Next, we have investigated the performance of strictly policy‐based MBAC and policy plus traffic characteristic‐based MBAC schemes in terms of (1) increasing the user mobility, (2) changing traffic parameters and (3) the presence of greedy users. The efficiency and fairness of each scheme are measured in terms of lower class new and handoff traffic performance. Copyright © 2003 John Wiley & Sons, Ltd.