A trustworthy and energy-aware routing protocol in software-defined wireless mesh networks

Software Defined Networking (SDN) brings unprecedented opportunities for facilitating the management of Wireless Mesh Networks (WMNs), particularly when handling network dynamics such as link/node failures. The inflexible destination-based routing and failure recovery of conventional WMN routing protocols are superseded by the efficient and highly flexible per-flow (re)routing in SDN-based networks. Most of the existing works focus on protection by pre-computing backup paths using OpenFlow fast failover groups to reroute the flows in case of channel re-assignment or a single link failure in software-defined WMNs. However, the limitations of failure detection using link monitoring for protection have not been studied. Moreover, the potentials of restoration-based failure recovery to handle single/multiple failure scenarios, have not been fully investigated. In this paper, we implement a prototype for reactive failure recovery in multi-radio multi-channel software-defined WMNs that provides a detailed performance and sensitivity analysis. The acquired results from the SDN-based scenarios outperform the most popular conventional WMN routing protocols in terms of recovery time while preserving the best achievable throughput even when the out-of-band control network is partially impaired. We also demonstrate the limitation of link monitoring, which mainly results from the shared nature of wireless medium, for protection-based mechanisms in software-defined WMNs.

This paper introduces a new IEEE standard, IEEE 802.15.5,which provides mesh capability for wireless personal area network (WPAN) devices. The standard provides an architectural framework enabling WPAN devices to promote interoperable, stable, and scalable wireless mesh topologies. It is composed of two parts: low-rate WPAN mesh and high-rate WPAN mesh. In this paper, we present only low-rate WPAN mesh because it is designed to support wireless sensor networks. IEEE 802.15.5 low-rate part is a light-weight scalable mesh routing protocol that caters well to the requirements of resource-constrained wireless sensor networks. By binding logical addresses to the network topology, IEEE 802.15.5 obviates the need for route discovery. This eliminates the initial route discovery latency, saves storage space and reduces the communication overhead and energy consumption. A distributed link state scheme is further built atop the block addressing scheme to improve the quality of routes, robustness, and load balancing. The routing scheme scales well with regard to various performance metrics. The standard also provides enhanced functions such as multicast, reliable broadcast, power saving, time synchronization, route tracing and portability. We also present the performance evaluation of major functions performed with a 50-nodes tested deployed over a whole floor (100 × 140 ft2) at CUNY Engineering building. The results testify that the IEEE 802.15.5 will serve well for wireless personal area networks and wireless sensor networks.

In recent years, Multi hop wireless networks have caught wide attention in the areas of high speed traffic and applications with high bandwidth requirement such as video and audio transmissions. Congestion is one of the major factors which degrade the system performance while we are working with high speed multi hop networks. Congestion control plays a vital role to improve the bandwidth utilization and system performance. In this project, an accurate measurement of the Available Bandwidth in a network is calculated and an enhanced congestion control mechanism for such paths in wireless mesh networks is proposed. The performance evaluation of the proposed model is simulated in NS-2 simulator and the results were compared with existing model.

Wireless mesh networks (WMNs) upraised as superior technology offering all aspects of services as compared to conventional networks. Due to the absence of centralised authority, WMNs suffers from both external and internal attacks, which decrease the overall performance of WMNs. In this study, the authors proposed an efficient handoff authentication protocol with privacy preservation of nonce and transfer ticket against external attacks during handoff and proposed round trip time (RTT)-based detection protocol to resist against internal attacks in WMNs. For privacy preservation of nonce and transfer ticket, encryption of the nonce and transfer ticket during handoff authentication process was considered. For detection, the calculation of RTT and processing time to identify the malicious nodes forming wormhole link were considered. The proposed work prevents the AODV routing protocol against the wormhole attack in WMNs. The simulation of the proposed work was done using NS-3 simulator, and the experimental results show that the performance of the proposed method prevents WMNs from both external and internal attacks.

The Wireless Mesh Network (WMN) is a cost-effective solution for backbone networks in both metropolitan and rural areas and can be used as temporary broadband access for emergent and tactic purposes. Without the need of wires, WMNs are easy to deploy and reconstruct to satisfy the dynamic needs. The IEEE 802.16 mesh CDS-mode network is a candidate of next-generation WMNs, which provides the “collision-free” property unique to traditional IEEE 802.11 based WMNs. In this dissertation, we propose several schemes for this new network to enhance its scheduling efficiency on the control plane and its QoS support on the data plane. In addition, we also point out the issues of network initialization of this network on random topologies and propose a scheme to solve these issues. The performances of our proposed schemes are evaluated using both analyses and simulations. Our analytical and numerical results show that our proposed schemes can significantly enhance the performance of the IEEE 802.16 mesh CDS-mode network and benefits upper-layer applications.

Cluster networks are seen as the future access networks for multimedia streaming, e-commerce, network storage, etc. For these applications, performance and high availability are particularly crucial. Regular topologies are preferred when performance is the primary concern. However, due to spatial constraints or fault-related issues, the network structure may become irregular, which makes more difficult to find deadlock-free minimal paths. Over the recent years, several solutions have been proposed. One of them is the LASH routing, which enables minimal routing by assigning paths to different virtual layers. In this paper, we propose an extension of LASH in order to reduce the number of required virtual layers by allowing transitions between virtual layers. Evaluation results show that the new routing scheme (LASH-TOR) is able to obtain full minimal routing with a reduced number of virtual channels. For torus and mesh networks, with only two virtual channels, LASH throughput is increased by an average factor of improvement of 3.30 for large networks. For regular networks with some unconnected (faulty) links, equal performance improvements are achieved. Even for highly irregular networks of size up to 128 switches the new routing scheme only needs three virtual channels for guaranteeing minimal routing. Besides, LASH-TOR performs well compared to dimension order routing for mesh and torus networks.

Wireless mesh networking has trans pired as a gifted technology for potentialbroadband wireless access. In a communication network, wireless mesh network plays a vital role in transmission and are structured in a mesh topology. The coordination of mesh routers and mesh clients forms the wi reless mesh networks which are routed through the gateways.Wireless mesh networks uses IEEE 802.11 standards and has its wide applications broadband home networking and enterprise networking deployment such as Microsoft wireless mesh and MIT etc. A profes sional Qos provisioning in intra cluster packet level resource allocation for WMN approach takes power allo cation, sub carrier allocation andpacket scheduling. This approach combines the merits of aKarush-Kuhn-Tucker (KKT) algorithm and a genetic algorithm (GA) based approach. The KKT algorithm uses uniform power allocation over all the subcarriers, based on the optimal allocation criterion. The genetic algorithm is used to generate useful solutions to optimization and search problems and it is also used for search problems. By combining the intrinsic worth of both the approaches, it facilitates effective QOS provisioning at the packet level. It is conclude d that, this approach achieves a preferred stability between system implementation and computational convolution.

Design and experimental performance analysis of a B.A.T.M.A.N.-based double Wi-Fi interface mesh network

Field Based Routing (FBR) is the next promising class of routing algorithms especially for wireless mesh networks. The inherent nature of shared medium wireless mesh networks, however, poses fundamental challenges to the design of effective routing policies that are optimal with respect to speed, time and resource utilization. In this paper, globally optimized routing algorithm for multiple subscribers in wireless mesh networks is proposed. Mesh network with multiple nodes will serve as an environment that optimizes some global utility function limited by the mobile nodes position in underlying MAC (Media Access Control) layer. By solving the optimization problem, the network is brought to a point of efficient operation with a certain routing policy for each node. This information will be the operating point that can be used to find better ways adaptive, which is able to steer the network towards the optimal routing. Global optimization of FBR is depicted through path estimation using PSO (Particle Swarm Optimization).

The IEEE Standard 802.16 supports for creating wireless mesh networks. The primary advantage of mesh networks is an improvement of capacity by concurrent transmission in the wireless environment. Therefore, the degree of spatial reuse is very crucial to realize the full potential of such wireless mesh networks. In this paper, we investigate the spatial reuse in IEEE 802.16 mesh networks. We propose a scheduling mechanism and a routing algorithm taking into account the interference in wireless environment to achieve maximum spatial reuse hence to increase the overall network throughput. The simulation results show that the proposed schemes achieve significant improvement and are more effective.

A novel framework, Medium-Term Disruption Tolerant Software Defined Network (MDT-SDN), is proposed to handle medium-term disruptions of the order 10 seconds to 6 minutes. Such medium-term disruptions are crucial for the next generation wireless networks that use TCP/IP protocol stack, where the existing disruption tolerant approaches may under-perform due to resource constraints. MDT-SDN enables network control with an additional STORE action which exploits the nodes' memory for buffering packets within the TCP/IP stack during link disruptions and forwards them as the links become alive. First, we model the network with medium-term disruptions using temporal graphs and design an Earliest Arrival Path with Minimal Storage Time (EAPMST) controller algorithm to demonstrate the MDT-SDN framework. The framework is realized in a software defined wireless mesh network testbed, using in-band control, involving mobile nodes with three mobility models: (i) stationary nodes, (ii) group mobility, and (iii) random mobility. Experimental results with four application protocols justify the efficacy of MDT-SDN in providing storage control and additional performance benefits. MDT-SDN along with EAPMST improves the throughput beyond 25% with random mobility model and is capable of carrying packets and maintaining sessions during medium-term disruptions using the existing TCP/IP stack. The use of EAPMST reduces packets' buffering time by 24.45% in group mobility while the buffering time increases in random mobility by 5.82%. However, EAPMST significantly reduces the buffer occupancy by 60.28% and 44.49% for group and random mobility, respectively.

Due to their adaptable deployment options and complementary communication features, Wireless Mesh Networks (WMNs) have experienced an exponential rise in popularity in recent years. WMNs, a crucial component of next-generation wireless networking, have great promise for both the academic and commercial worlds. However, the best routing protocols are lacking in the present WMNs. Instead, a lot of WMNs use ad hoc network routing methods, which have various network characteristics as a result, routing is now the most pressing issue that must be addressed as soon as possible. The proposed model used the Ant-In-Mesh routing algorithm and its upgraded version is being developed in this paper to deal with the demanding traffic needs of WMNs. This algorithm was influenced by the conventional Ant Colony Optimization (ACO) approach, which provides an optimum path for best routing in dynamic networks by using Ant colony optimization and improves network performance by removing and reconnecting dead paths in mesh networks.

Intrusion Detection Systems(IDSs) are widely used to detect both known attacks and unknown attacks performed by internal and external attackers in wireless networks. However, challenging issues for developing IDSs in Wireless Mesh Networks (WMNs) are 1) supporting interoperability and 2) handling volatile parameters. In addition, security standards for WMN are still in draft stage, and to protect the WMN, IDSs of similar wireless networks such as wireless sensor, Ad-Hoc, MANET can be adopted, but the best performance is not guaranteed. In this paper, we have classified the existing IDSs for wireless networks into four categories namely single layer IDS, cross-layer IDS, reputation-based IDS, reputation based cross-layer IDS, and analyzed the performance of these IDSs with core-layer attacks and detection methodology. Based on our analysis, we address the loopholes in existing IDSs and specify research directions for strengthening the existing IDSs and for developing new efficient IDSs with respect to backbone mesh and client mesh networks.

This paper considers the problem of self-diagnosis of wireless mesh networks (WMNs) and mobile ad-hoc networks (MANETs) using the comparison approach. In this approach, the network consists of a collection of n independent heterogeneous mobile or stationary hosts interconnected via wireless links, and it is assumed that at most sigma of these hosts are faulty. In order to diagnose the state of the wireless mesh and ad-hoc network, tasks are assigned to pairs of hosts and the outcomes of these tasks are compared. The agreements and disagreements among hosts are the basis for identifying the faulty ones. We develop a new distributed self-diagnosis protocol, called adaptive-DSDP, for MANETs and WMNs that identifies both hard and soft faults in a finite amount of time. We analyze the time and communication complexities of our protocol and compare it to existing self-diagnosis protocols

While traditional routing protocols try to minimize the end-to-end delay or maximize the throughput, most energy-aware routing protocols for wireless sensor networks try to extend the life time of the network by minimizing the energy consumption sacrificing other performance metrics. We introduce a new energy-aware routing protocol that tries to minimize the energy consumption and, at the same time, maintain good end-to-end delay and throughput performance. The new algorithm is based on a constrained shortest-path algorithm. We compare the new algorithm with some traditional routing and energy-aware routing algorithms. The results show that the new algorithm performance is acceptable under all performance metrics and presents a performance balance between the traditional routing algorithms and the energy-aware routing algorithms. The constraint value can be chosen to achieve different performance objectives for different sensor network missions.