Fast restoring gigabit wireless networks using a directional mesh architecture

Authors:
Yiwen Wu;Joseph Hui;Hongxia Sun
Affiliations:
Department of Electrical Engineering, Arizona State University, Tempe, AZ 85287, USA;Department of Electrical Engineering, Arizona State University, Tempe, AZ 85287, USA;Department of Electrical Engineering, Arizona State University, Tempe, AZ 85287, USA
Venue:
Computer Communications
Year:
2003

Citing 6
Cited 1

New dynamic algorithms for shortest path tree computation

IEEE/ACM Transactions on Networking (TON)
IP Protection and Restoration

IEEE Internet Computing
Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information

IEEE/ACM Transactions on Networking (TON)
Finding the k shortest paths

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects

IEEE Communications Magazine
A highly efficient path-restoration protocol for management of optical network transport integrity

IEEE Journal on Selected Areas in Communications

Weather Disruption-Tolerant Self-Optimising Millimeter Mesh Networks

IWSOS '08 Proceedings of the 3rd International Workshop on Self-Organizing Systems

Quantified Score

Hi-index	0.24

Visualization

Abstract

Fourth Generation (4G) wireless networking may involve gigabit per second transmission based on a mesh network architecture. These networks may use Extremely High frequency or optical bands. The network is formed in an ad hoc manner. For this directional mesh network, we present a new restoration algorithm for broadband wireless optical networks. A special restoration strategy, called local recovery for local failure is applied in the proposed algorithm. Specifically, each node initializes the recovery process independently of other nodes in the network when the failed link is local to the node. This algorithm is a hybrid restoration scheme, consisting of a route pre-planning phase and a real-time rerouting phase. Transient link/node failure, lasting only a short duration is typical in wireless communications and specially handled in our algorithm. We explore the response times of the proposed restoration algorithm. Simulation results over typical network structures show that we could achieve a full recovery of single-link failure, nearly 100% recovery of single-node failure, as well as around 99.5% recovery of double-link failure.