QoS routing in ad hoc wireless networks

The emergence of nomadic applications have generated much interest in wireless network infrastructures that support real-time communications. We propose a bandwidth routing protocol for quality-of-service (QoS) support in a multihop mobile network. The QoS routing feature is important for a mobile network to interconnect wired networks with QoS support (e.g., ATM, Internet, etc.). The QoS routing protocol can also work in a stand-alone multihop mobile network for real-time applications. This QoS routing protocol contains end-to-end bandwidth calculation and bandwidth allocation. Under such a routing protocol, the source (or the ATM gateway) is informed of the bandwidth and QoS available to any destination in the mobile network. This knowledge enables the establishment of QoS connections within the mobile network and the efficient support of real-time applications. In addition, it enables more efficient call admission control. In the case of ATM interconnection, the bandwidth information can be used to carry out intelligent handoff between ATM gateways and/or to extend the ATM virtual circuit (VC) service to the mobile network with possible renegotiation of QoS parameters at the gateway. We examine the system performance in various QoS traffic flows and mobility environments via simulation. Simulation results suggest distinct performance advantages of our protocol that calculates the bandwidth information. It is particularly useful in call admission control. Furthermore, “standby” routing enhances the performance in the mobile environment. Simulation experiments show this improvement     

Multiconstrained QoS multipath routing in wireless sensor networks

Sensor nodes are densely deployed to accomplish various applications because of the inexpensive cost and small size. Depending on different applications, the traffic in the wireless sensor networks may be mixed with time-sensitive packets and reliability-demanding packets. Therefore, QoS routing is an important issue in wireless sensor networks. Our goal is to provide soft-QoS to different packets as path information is not readily available in wireless networks. In this paper, we utilize the multiple paths between the source and sink pairs for QoS provisioning. Unlike E2E QoS schemes, soft-QoS mapped into links on a path is provided based on local link state information. By the estimation and approximation of path quality, traditional NP-complete QoS problem can be transformed to a modest problem. The idea is to formulate the optimization problem as a probabilistic programming, then based on some approximation technique, we convert it into a deterministic linear programming, which is much easier and convenient to solve. More importantly, the resulting solution is also one to the original probabilistic programming. Simulation results demonstrate the effectiveness of our approach. This work was supported in part by the U.S. National Science Foundation under grant DBI-0529012, the National Science Foundation Faculty Early Career Development Award under grant ANI-0093241 and the Office of Naval Research under Young Investigator Award N000140210464. Xiaoxia Huang received her BS and MS in the Electrical Engineering from Huazhong University of Science and Technology in 2000 and 2002, respectively. She is completing her Ph.D. degree in the Department of Electrical and Computer Engineering at the University of Florida. Her research interests include mobile computing, QoS and routing in wireless ad hoc networks and wireless sensor networks. Yuguang Fang received a Ph.D. degree in Systems Engineering from Case Western Reserve University in January 1994 and a Ph.D degree in Electrical Engineering from Boston University in May 1997. He was an assistant professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology from July 1998 to May 2000. He then joined the Department of Electrical and Computer Engineering at University of Florida in May 2000 as an assistant professor, got an early promotion to an associate professor with tenure in August 2003 and to a full professor in August 2005. He holds a University of Florida Research Foundation (UFRF) Professorship from 2006 to 2009. He has published over 200 papers in refereed professional journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002. He has served on several editorial boards of technical journals including IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing and ACM Wireless Networks. He have also been activitely participating in professional conference organizations such as serving as The Steering Committee Co-Chair for QShine, the Technical Program Vice-Chair for IEEE INFOCOM’2005, Technical Program Symposium Co-Chair for IEEE Globecom’2004, and a member of Technical Program Committee for IEEE INFOCOM (1998, 2000, 2003–2007).     

Intelligent energy-aware and secured QoS routing protocol with dynamic mobility estimation for wireless sensor networks

Wireless Networks - In this work, a new protocol is proposed for sender-based responsive techniques on energy, mobility, and effective routing for Wireless Sensor Networks (WSNs). It addresses...     

QoS routing through alternate paths in wireless ad hoc networks

Quality of service (QoS) routing plays an important role in QoS provisioning for mobile ad hoc networks. This work studies the issue of route selection subject to QoS constraint(s). Our method searches for alternate routes with satisfied QoS requirement(s) to accommodate each communication request when the shortest path connecting the source–destination pair of the request is not qualified. In order to effectively reduce protocol overhead, a directed search mechanism is designed to limit the breadth of the searching scope, which aims at achieving a graceful tradeoff between the success probability in QoS route acquisition and communication overhead. Efficient hop‐by‐hop routing protocols are designed for route selection subject to delay and bandwidth constraint, respectively. Simulation results show that the designed protocols can achieve high performance in acquiring QoS paths and in efficient resource utilization with low control overhead. Copyright © 2004 John Wiley & Sons, Ltd.     

Architecture for mobility and QoS support in all-IP wireless networks

Mobility management and quality-of-service (QoS) provisioning are the important tasks on the future development of wireless networks. The high host mobility makes these tasks more challenging. In this paper, we propose an architecture which supports both mobility and QoS management in Internet protocol (IP)-based wireless networks. In mobility management, the fast handoff, which the packets are forwarded in advance to the neighboring locations where a mobile node (MN) may move to, is provided to reduce the service disruption. Also, the fast location lookup, which the routing information about a MN is replicated to some routers, is provided to avoid the triangular routing problem incurred by the protocol of mobile IP. In QoS provisioning, we enable the end-to-end QoS guarantee by using the resource reservation protocol (RSVP) signaling. In particular, the RSVP aggregation technique is used to avoid the scalability problem. Also, the technique of passive resource reservation is used to reduce the influence of host mobility on the resource reservation delay. We emphasize the integration of mobility and QoS management in the architecture design. A performance analysis is given to justify the benefits of our proposed architecture.     

Mobile flow-aware networks for mobility and QoS support in the IP-based wireless networks

As the volume of mobile traffic consisting of video, voice, and data is rapidly expanding, a challenge remains with the mobile transport network, which must deliver data traffic to mobile devices without degrading the service quality. Since every Internet service holds its own service quality requirements, the flow-aware traffic management in fine granularity has been widely investigated to guarantee Quality of Service (QoS) in the IP networks. However, the mobile flow-aware management has not been sufficiently developed yet because of the inherent constraints of flow routing in the mobile networks regarding flow-aware mobility and QoS support. In this paper, we propose a flow-aware mobility and QoS support scheme called mobile flow-aware network (MFAN) for IP-based wireless mobile networks. The proposed scheme consists of dynamic handoff mechanisms based on QoS requirements per flow to reduce the processing overhead of the flow router while ensuring QoS guarantee to mobile flows. The performance analyses of the proposed scheme demonstrate that MFAN successfully supports the mobile flow traffic delivery while satisfying the QoS requirement of flows in the wireless mobile IP networks.     

A ring-based multicast routing topology with QoS support in wireless mesh networks

Wireless mesh networking (WMN) is an emerging technology for future broadband wireless access. The proliferation of the mobile computing devices that are equipped with cameras and ad hoc communication mode creates the possibility of exchanging real-time data between mobile users in wireless mesh networks. In this paper, we argue for a ring-based multicast routing topology with support from infrastructure nodes for group communications in WMNs. We study the performance of multicast communication over a ring routing topology when 802.11 with RTS/CTS scheme is used at the MAC layer to enable reliable multicast services in WMNs. We propose an algorithm to enhance the IP multicast routing on the ring topology. We show that when mesh routers on a ring topology support group communications by employing our proposed algorithms, a significant performance enhancement is realized. We analytically compute the end-to-end delay on a ring multicast routing topology. Our results show that the end-to-end delay is reduced about 33 %, and the capacity of multicast network (i.e., maximum group size that the ring can serve with QoS guarantees) is increased about 50 % as compared to conventional schemes. We also use our analytical results to develop heuristic algorithms for constructing an efficient ring-based multicast routing topology with QoS guarantees. The proposed algorithms take into account all possible traffic interference when constructing the multicast ring topology. Thus, the constructed ring topology provides QoS guarantees for the multicast traffic and minimizes the cost of group communications in WMNs.     

Zone-based routing protocol with mobility consideration for wireless sensor networks

Hierarchical routing and clustering mechanisms in Wireless Sensor Networks (WSN) help to reduce the energy consumptions and the overhead created when all the sensor nodes in the network are sending information to the central data collection point. Most of the routing and clustering protocols proposed for WSN assume that the nodes are stationary. However, in applications like habitat monitoring or search and rescue, that assumption makes those clustering mechanisms invalid, since the static nature of sensors is not real. In this paper, we propose Zone-based Routing Protocol for Mobile Sensor Networks (ZoroMSN) that considers the design aspects such as mobility of sensors, zones and routes maintenance, information update and communication between sensor nodes. Simulation results show the effectiveness and strengths of the ZoroMSN protocol such as a low routing and mobility overhead, while achieving a good performance in WSN using small zone sizes and sensors with low speed. Simulation results also show that ZoroMSN outperforms existing LEACH-ME and LEACH-M protocols in terms of network lifetime and energy consumptions.     

Novel velocity and call duration support for QoS provision in mobile wireless networks

This article presents a novel mobility-based resource reservation and call admission control scheme that is applicable to any real wireless multimedia network. The scheme exploits three key mobility parameters - the position, direction, and speed of a mobile unit - together with the duration of a particular call to accurately estimate the cell visiting probability in order to identify a shadow cluster of cells the unit is most likely to visit. Each cell in the cluster reserves resources for an estimated time interval, which is adapted depending on the aggregated probability of all active units visiting a particular cell. Simulation results confirm the superiority of the new scheme over the existing predictive mobility support scheme in terms of three QoS parameters: call blocking rate, call dropping rate, and channel utilization.     

Efficient on-demand routing for mobile ad hoc wireless access networks

In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the gateway via their neighboring nodes over multihop paths. On-demand routing schemes are appealing because of their low routing overhead in bandwidth restricted mobile ad hoc networks, however, their routing control overhead increases exponentially with node density in a given geographic area. To control the overhead of on-demand routing without sacrificing performance, we present a novel extension of the ad hoc on-demand distance vector (AODV) routing protocol, called LB-AODV, which incorporates the concept of load-balancing (LB). Simulation results show that as traffic increases, our proposed LB-AODV routing protocol has a significantly higher packet delivery fraction, a lower end-to-end delay and a reduced routing overhead when compared with both AODV and gossip-based routing protocols.     

QoS routing for wireless ad hoc networks: problems, algorithms, and protocols

QoS routing plays an important role for providing QoS in wireless ad hoc networks. The goals of QoS routing are in general twofold: selecting routes with satisfied QoS requirement(s), and achieving global efficiency in resource utilization. In this article we first discuss some key design considerations in providing QoS routing support, and present a review of previous work addressing the issue of route selection subject to QoS constraint(s). We then devise an on-demand delay-constrained unicast routing protocol. Various strategies are employed in the protocol to reduce the communication overhead in acquiring cost-effective delay-constrained routes. Simulation results are used to verify our expectation of the high performance of the devised protocol. Finally, we discuss some possible future directions for providing efficient QoS routing support in wireless ad hoc networks.     

A sustainable heuristic QoS routing algorithm for pervasive multi-layered satellite wireless networks

Due to the recent developments in wireless technology and electronics, it is feasible to develop pervasive algorithms for satellite environments. Multi-Layered Satellite Networks (MLSNs) that consist of low earth orbit and medium earth orbit satellites are becoming increasingly important since they have higher coverage and better service than single-layered satellite networks. One of the challenges in MLSNs is the development of specialized and efficient routing algorithms. In this paper, we improved the virtual topology strategy and import heuristic algorithm to satisfy the QoS requirements of the MLSN users. The QoS requirements include end to end delay; link utilization, bandwidth, and package loss rate are mainly focused in this paper. To satisfy the QoS requirements is a multi-parameter optimization problem, and it is convinced as a Non-deterministic Polynomial Complete problem already. As a solution, three typical heuristic algorithms—Ant Colony Algorithm, Taboo Search Algorithm and Genetic Algorithm are applied in the routing scheme in order to reduce package loss, link congestion and call blocking. Simulation results show that heuristic routing algorithm can provide more QoS guarantees than shortest path first algorithm on package loss rate, link congestion and call blocking.     

QoS routing granularity in MPLS networks

This study investigates how constraint-based routing decision granularity significantly affects the scalability and blocking performance of QoS routing in an MPLS network. Coarse granularity, such as per-destination, has lower storage and computational overheads but is only suitable for best effort traffic. On the other hand, fine granularity, such as per-flow, provides lower blocking probability for bandwidth requests, but requires a huge number of states and high computational cost. To achieve cost-effective scalability, this study proposes using hybrid granularity schemes. The overflowed cache of the per-pair/flow scheme adds a per-pair cache and a per-flow cache as the routing cache, and performs well in blocking probability. The per-pair/class scheme groups the flows into several paths using routing marks, thus allowing packets to be label-forwarded with a bounded cache     

Reliability constrained routing in QoS networks

The issue of handling network failures is becoming increasingly important. In this paper, we address the problem of constrained routing by treating reliability as one of the QoS requirements. The problem is to create a feasible path from a given node to the destination such that the bandwidth and reliability requirements of the path are satisfied and the cost of the path is minimized (Reliability Constrained Least Cost Routing Problem). To solve the problem, we propose an approach which employs a novel concept, called partial protection, wherein backup paths are created for a selected set of domains in the network so as to meet the reliability constraints. The Partial Protection Approach (PPA) has two steps: Primary Path Creation and Backup Path Creation if necessary. To implement PPA, we propose three scalable two-pass resource reservation schemes, viz., Conservative, Optimistic, and Hybrid schemes. These schemes differ depending on whether the backup paths are created during the forward pass, reverse pass, or both. We evaluate the performance of the proposed schemes for dynamic multicast groups with different bandwidth and reliability requirements using average call acceptance rate and average tree cost as performance metrics. Our studies show that group dynamics and reliability requirements have significant impact on the performance of the schemes.     

QoS multicast routing by using multiple paths/trees in wireless ad hoc networks

In this paper, we investigate the issues of QoS multicast routing in wireless ad hoc networks. Due to limited bandwidth of a wireless node, a QoS multicast call could often be blocked if there does not exist a single multicast tree that has the requested bandwidth, even though there is enough bandwidth in the system to support the call. In this paper, we propose a new multicast routing scheme by using multiple paths or multiple trees to meet the bandwidth requirement of a call. Three multicast routing strategies are studied, SPT (shortest path tree) based multiple-paths (SPTM), least cost tree based multiple-paths (LCTM) and multiple least cost trees (MLCT). The final routing tree(s) can meet the user’s QoS requirements such that the delay from the source to any destination node shall not exceed the required bound and the aggregate bandwidth of the paths or trees shall meet the bandwidth requirement of the call. Extensive simulations have been conducted to evaluate the performance of our three multicast routing strategies. The simulation results show that the new scheme improves the call success ratio and makes a better use of network resources.     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.     

A new QoS routing algorithm based on self-organizing maps for wireless sensor networks

For the past ten years, many authors have focused their investigations in wireless sensor networks. Different researching issues have been extensively developed: power consumption, MAC protocols, self-organizing network algorithms, data-aggregation schemes, routing protocols, QoS management, etc. Due to the constraints on data processing and power consumption, the use of artificial intelligence has been historically discarded. However, in some special scenarios the features of neural networks are appropriate to develop complex tasks such as path discovery. In this paper, we explore and compare the performance of two very well known routing paradigms, directed diffusion and Energy-Aware Routing, with our routing algorithm, named SIR, which has the novelty of being based on the introduction of neural networks in every sensor node. Extensive simulations over our wireless sensor network simulator, OLIMPO, have been carried out to study the efficiency of the introduction of neural networks. A comparison of the results obtained with every routing protocol is analyzed. This paper attempts to encourage the use of artificial intelligence techniques in wireless sensor nodes.     

认知无线Mesh网络中满足QoS的高吞吐量安全路由协议

提出了一种综合考虑链路安全、链路冲突、链路可靠度与链路可用带宽的路由判据SIEB。SIEB包括链路安全和链路性能2个方面,在SIEB的链路安全权值计算中,为了抵御各种洞攻击,提出了基于两跳邻居反馈的链路信任值计算方法。在此基础上,提出了链路安全权值计算算法LSWC和链路性能权值计算算法LSPC,提出了分布式满足QoS约束的路由协议SIEBP,SIEBP的目标是：构造安全的路由路径,并且最大化网络吞吐量。仿真结果表明,SIEBP能达到预定目标,构造的路径能抵御黑洞、灰洞、虫洞等攻击,并且获得了较高的网络吞吐量。     

Evolving access networks: a European perspective

The diversity of telecommunications markets and access network infrastructure among the countries of Europe is a complicating factor in the development of effective standards for Europe's future access networks. The need for evolving access networks to make efficient use of a wide variety of existing infrastructure may at times conflict with the long-term requirement for a stable platform of self-consistent standards which allow future-proof evolution. In light of these constraints, the authors summarize progress made in the European Telecommunications Standards Institute (ETSI) toward standards for future access networks     

QoS routing in networks with uncertain parameters

We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate. Such uncertainty about the actual state of a network component arises naturally in a number of different environments. The goal of the route selection process is then to identify a path that is most likely to satisfy the QoS requirements. For end-to-end delay guarantees, this problem is intractable. However, we show that by decomposing the end-to-end constraint into local delay constraints, efficient and tractable solutions can be established. Moreover, we argue that such decomposition better reflects the interoperability between the routing and reservation phases. We first consider the simpler problem of decomposing the end-to-end constraint into local constraints for a given path. We show that, for general distributions, this problem is also intractable. Nonetheless, by defining a certain class of probability distributions, which includes typical distributions, and restricting ourselves to that class, we are able to establish efficient and exact solutions. We then consider the general problem of combined path optimization and delay decomposition and present efficient solutions. Our findings are applicable also to a broader problem of finding a path that meets QoS requirements at minimal cost, where the cost of each link is some general increasing function of the QoS requirements from the link