A Cross Layer Routing Protocol for Multihop Cellular Networks

We propose a cross-layer routing protocol for a Code Division Multiple Access (CDMA) Multihop Cellular Network (MCN). In designing the routing protocol for MCN, multiple constraints are imposed on intermediate relay node selection and end-to-end path selection. The constraints on relay nodes include willingness for cooperation, sufficient neighbourhood connectivity and the level of interference offered on the path. Path constraints include end-to-end throughput and end-to-end delay. A facile incentive mechanism is presented to motivate the cooperation between nodes in call forwarding. In addition, we present a route resilience scheme in the event of dynamic call dropping. In particular, a fast neighbour detection scheme for route resilience is proposed. Instead of using periodic HELLO messages as in traditional ad-hoc routing, the proposed neighbour detection scheme adopts an explicit handshake mechanism to reduce neighbour detection latency. We conclude the paper by demonstrating the superior performance of the proposed routing protocol compared with the other well known routing algorithms.     

A Virtual Topology Based Routing Protocol for Multihop Dynamic Wireless Networks

In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are intoduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully.     

BER Modified Decode-and-Forward Protocol for OFDM-Based Linear Multihop Networks

In orthogonal frequency division multiplexing （OFDM） based multihop communications, the conventional decodeand-forward （DF） relay scheme severely suffers from the error propagation problem. This drawback is serious in multihop networks as errors made by any relay node may fail the decoder at the destination in great chance. In this paper, we propose a bit error rate （BER） modified DF protocol （BMDF） which can be applied to systems where error correction channel coding and M-ary modulation are used. By modeling all links except the last one as a binary symmetric channel （BSC）, we derive a log likelihood ratio （LLR） modification function relying only on the accumulated BER of all previous links to be applied to the output of the soft demapper. Furthermore, to reduce the computational complexity and signaling overhead, the modification function is simplified from its original exponential expression and less BERs are delivered between nodes by making successive subcarriers share the same BER. In addition, for situations where the channel state information （CSI） of forward link is available, the proposed BMDF can be further enhanced by combining with subcarrier pairing （SP） and power allocation （PA）, where a sorted-channel gain SP scheme and a greedy PA algorithm are proposed. The simulation results verify thesignificant performance improvement to the conventional DF.     

A Leader Election Protocol for Cognitive Radio Networks

Wireless Personal Communications - Leader election is a fundamental problem of distributed computing systems. In cognitive radio network (CRN), the secondary users (SUs) are connected under the...     

Transmission Range Control in Multihop Packet Radio Networks

This paper presents a model for analyzing the performance of transmission strategies in a multihop packet radio network where each station has adjustable transmission radius. A larger transmission radius will increase the probability of finding a receiver in the desired direction and contribute bigger progress if the transmission is successful, but it also has a higher probability of collision with other transmissions. The converse is true for shorter transmission range. We illustrate our model by comparing three transmission strategies. Our results show that the network can achieve better performance by suitably controlling the transmission range. One of the transmission strategies, namely transmitting to the nearest forward neighbor by using adjustable transmission power, has desirable features in a high terminal density environment.     

Fair Algorithms for Maximal Link Activation in Multihop Radio Networks

We present a distributed algorithm for obtaining a fair time slot allocation for link activation in a multihop radio network. We introduce the concept of maximal fairness in which the termination of a fair allocation algorithm is related to maximal reuse of the channel under a given fairness metric. The fairness metric can be freely interpreted as the expected link traffic load demands, link priorities, etc. Since respective demands for time slot allocation will not necessarily be equal, we define fairness in terms of the closeness of allocation to respective link demands while preserving the collision free property. The algorithm can be used in conjunction with existing link activation algorithms to provide a fairer and fuller utilization of the channel.     

Throughput Analysis in Multihop CSMA Packet Radio Networks

In this paper, we use a Markov model to develop a product form solution to efficiently analyze the throughput of arbitrary topology multihop packet radio networks that employ a carrier sensing multiple access (CSMA) protocol with perfect capture. We consider both exponential and nonexponential packet length distributions. Our method preserves the dependence between nodes, characteristic of CSMA, and determines the joint probability that nodes are transmitting. The product form analysis provides the basis for an automated algorithm that determines the maximum throughput in networks of size up to 100 radio nodes. Numerical examples for several networks are presented. This model has led to many theoretical and practical extensions. These include determination of conditions for product form analysis to hold, extension to other access protocols, and consideration of acknowledgments.     

A MAC-Layer QoS Provisioning Protocol for Cognitive Radio Networks

Due to the proliferation of diverse network devices with multimedia capabilities, there is an increasing need for Quality of Service (QoS) provisioning in wireless networks. The MAC layer protocol with enhanced distributed channel access (EDCA) in the IEEE 802.11-2007 is able to provide differentiated QoS for different traffic types in wireless networks through varying the Arbitration Inter-Frame Spaces (AIFS) and contention window sizes. However, the performance of high priority traffic can be seriously degraded in the presence of strong noise over the wireless channels. Schemes utilizing adaptive modulation and coding (AMC) technique have also been proposed for the provisioning of QoS. They can provide limited protection in the presence of noise but are ineffective in a high noise scenario. Although multiple non-overlapped channels exist in the 2.4 and 5?GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel at anytime. As a result, these networks cannot fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. By identifying vacant channels through the use of cognitive radios technique, the noise problem can be mitigated by distributing network traffic across multiple vacant channels to reduce the node density per transmission channel. In this paper, we propose the MAC-Layer QoS Provisioning Protocol (MQPP) for 802.11-based cognitive radio networks (CRNs) which combines adaptive modulation and coding with dynamic spectrum access. Simulation results demonstrate that MQPP can achieve better performance in terms of lower delay and higher throughput.     

A Protocol for Preferred Access in Packet-Switching Radio Networks

A protocol that provides multiple access with two levels of priority to a common radio channel is described. A probabilistic model of the protocol is presented and its analysis yields the throughput-delay characteristics of the two classes of packets supported by that protocol, along with their interaction. The model is analyzed by a method similar to the one used in priority queues; this method allows consideration of each class separately, thus reducing the computational effort considerably.     

A Software Radio Implementation of Centralized MAC Protocol for Cognitive Radio Networks

In the past decade the cognitive radio paradigm has received great attention from academia and industry as a promising approach to solve the spectrum shortage problem. In spite of the intense research activity in the field of cognitive radio, we still register a limited number of network implementations based upon the cognitive radio principles. In this work we present the design and implementation of a proprietary medium access control protocol that we have conjectured using ECMA-392 standard as reference. In the proposed design, the network uses an out-of-band cognitive control channel (CCC) for network management operations. The main contributions of this paper are: (1) a working prototype of a centralized cognitive network implemented in the platform provided by the universal software radio peripheral and GNU Radio software; (2) the presentation of significant data acquired during the field test of our prototype such as average network reconfiguration delay when the CCC is jammed by the primary user and the capability of the cognitive network to reconstruct channel occupancy/vacancy by means of distributed spectrum sensing. The prototype has been designed to operate in the 375–445 MHz frequency bands for a potential application in public safety ad-hoc networks.     

Architectures and Performance of Multichannel Multihop Packet Radio Networks

Packet radio networks that employ several parallel multiple-access channels are considered. An architecture for such a network dictates the selection of channels for packet transmission. We propose and analyze two multichannel architectures. In the first, each node employs a single radio and is assigned a channel on which it listens when it does not transmit. To transmit a packet, the node tunes its radio to the channel of the intended receiver for that transmission only. The second architecture requires each radio to use a single channel for both transmission and reception, but provides some of the nodes with more than one radio each, allowing them to serve as bridges between channels. Within these architectures, one can further select the amount of routing information held by each node and the channel-access protocol, both of which greatly affect the network performance. To ascertain the effects of the various parameters, we calculate the throughput in both architectures. The channel-access protocols we consider are slotted ALOHA and CSMA with and without capture. We also evaluate the effect of increasing the amount of routing information held by the nodes.     

Throughput--Delay Characteristics of Some Slotted-ALOHA Multihop Packet Radio Networks

A Markovian model is formulated to find the throughputdelay performance for slotted-ALOHA multihop packet radio networks with a fixed configuration of packet radio units (terminals and repeaters) and fixed source-to-link paths for packets. Improvements in performance which are obtained by the adjustment of transmission parameters (suppression/acceleration) according to the states of nearby units and/or by having repeaters equipped with multiple buffers are demonstrated.     

适于多跳移动Ad Hoc网络的非对称双信道媒质接入控制协议

In order to resolve the hidden and exposed terminal problems and improve the probability of concurrent packet transmissions for multihop Mobile Ad Hoc Networks (MANETs), a novel slotted Asymmetric Dual-Channel Medium Access Control (ADC-MAC) protocol is proposed. It exploits simultaneous reservation with less collisions and collision-free data packet transmissions, and achieves optimal transmission balance on the Control Channel (CCH) and Data Channel (DCH) by adjusting the relationship between Reservation Slot (RS) on the CCH and the data packet Transmission Slot (TS) on the DCH. Transmission interferences can be avoided by only observing CCH for the transmission time of a data packet. The proposed RS and contention micro-slot backoff mechanisms also greatly improve channel access efficiency. Simulation results show that compared to IEEE 802.11 DCF and p-Mc protocols, the proposed protocol can achieve a throughput gain of 88% in single-hop networks and 151% in multihop networks at the same total data rate.     

On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. This paper presents the On-Demand Multicast Routing Protocol (ODMRP) for wireless mobile ad hoc networks. ODMRP is a mesh-based, rather than a conventional tree-based, multicast scheme and uses a forwarding group concept; only a subset of nodes forwards the multicast packets via scoped flooding. It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP performance with other multicast protocols proposed for ad hoc networks via extensive and detailed simulation.     

Integrated Radio Resource Allocation for Multihop Cellular Networks With Fixed Relay Stations

Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheless, due to the inherent drawbacks of multihop relaying, e.g., the requirement for extra radio resources for relaying hops, and the sensitivity to the quality of relaying routes, multihop cellular networks (MCNs) require a well-designed radio resource allocation strategy in order to secure performance gains. In this paper, the optimal radio resource allocation problem in MCNs, with the objective of throughput maximization, is formulated mathematically and proven to be NP-hard. Considering the prohibitive complexity of finding the optimal solution for such an NP-hard problem, we propose an efficient heuristic algorithm, named integrated radio resource allocation (IRRA), to find suboptimal solutions. The IRRA is featured as a low-complexity algorithm that involves not only base station (BS) resource scheduling, but also routing and relay station (RS) load balancing. Specifically, a load-based scheme is developed for routing. A mode-aware BS resource-scheduling scheme is proposed for handling links in different transmission modes, i.e., direct or multihop. Moreover, a priority-based RS load balancing approach is presented for the prevention of the overloading of RSs. Within the framework of the IRRA, the above three functions operate periodically with coordinated interactions. To prove the effectiveness of the proposed IRRA algorithm, a case study was carried out based on enhanced uplink UMTS terrestrial radio access/frequency-division duplex with fixed RSs. The IRRA is evaluated through system level simulations, and compared with two other cases: 1) nonrelaying and 2) relaying with a benchmark approach. The results show that the proposed algorithm can ensure significant gains in terms of cell throughput     

A Cluster-Based MAC Protocol for Cognitive Radio Ad Hoc Networks

The cognitive radio (CR) technology is an efficient approach to share the spectrum. But how to access the idle channels effectively is a challenging problem. To solve this problem, we propose a MAC protocol for cluster-based CR ad hoc networks, with the aim of making cluster structure more robust to the primary users’ channel re-occupancy activities, so that the CR users can use the idle spectrum more efficiently. Under this framework, a cluster formation algorithm based on available channels, geographical position and experienced statistics is proposed to maximize the network throughput and maintain the cluster topology stability. The schemes for new CR user joining a cluster and cluster maintenance are also designed. An experience database is proposed to store the experienced statistics which are obtained from spectrum occupancy history. Such a database can be used to support the acts of nodes, such as neighbor discovery and cluster forming. Simulation results reveal that our proposed framework not only outperforms conventional CR MAC protocols in terms of throughput and packet delay, but also generates a smaller number of clusters and has more stable cluster structure with less reclustering time.     

A Markovian Approach to Radio Access Technology Selection in Heterogeneous Multiaccess/Multiservice Wireless Networks

This paper addresses the problem of Radio Access Technology (RAT) selection in heterogeneous multi-access/multi-service scenarios. For such purpose, a Markov model is proposed to compare the performance of various RAT selection policies within these scenarios. The novelty of the approach resides in the embedded definition of the aforementioned RAT selection policies within the Markov chain. In addition, the model also considers the constraints imposed by those users with terminals that only support a subset of all the available RATs (i.e. multi-mode terminal capabilities). Furthermore, several performance metrics may be measured to evaluate the behaviour of the proposed RAT selection policies under varying offered traffic conditions. In order to illustrate the validation and suitability of the proposed model, some examples of operative radio access networks are provided, including the GSM/EDGE Radio Access Network (GERAN) and the UMTS Radio Access Network (UTRAN), as well as several service-based, load-balancing and terminal-driven RAT selection strategies. The flexibility exhibited by the presented model enables to extend these RAT selection policies to others responding to diverse criteria. The model is successfully validated by means of comparing the Markov model results with those of system-level simulations.     

认知无线电网络的MAC协议机制

针对认知无线电网络可用信道资源随时间和空间环境变化的特点,分析了认知无线电网络MAC协议面临的问题,提出了一种基于全局控制信道的MAC协议方案,在此基础上阐述了两种接入方式及相应适用场合,实现了认知无线电节点对可用信道资源变化的感知,可为认知无线电MAC协议研究及应用提供参考.     

An Algorithm for Evaluation of Throughput in Multihop Packet Radio Networks with Complex Topologies

The problem of analyzing the thoughput of packet radio networks with realistic topologies is considered. We present an algorithm for the solution of this problem and show that both the memory requirements and running time of this algorithm in practice grow polynomially with the size of the problem. Although in theory both can grow exponentially in the worst case, we offer computational experience with the procedure and show that for realistic topologies where connectivity is related to distance, the rate of growth is quadratic in the number of links. Even for regular grids, which are pathological in their symmetry, the rate of growth is only cubic in the number of links. We thus conclude that the procedure is effective for realistic topologies with up to several hundred nodes.     

一种改进的认知无线网络路由算法

在SEARCH路由协议中,如果当前路由处于前向避免区域,会造成频谱切换,影响网络拓扑,增加端到端延迟和能量消耗。提出基于地理位置和前向反馈的认知路由算法来解决这一问题。通过信息反馈,该算法能可靠地选择最佳下一跳路由;同时提出认知网络路由算法的评估方案。仿真表明,所提路由选择算法可以很好地降低端到端的延迟和能量消耗。