DYNAMIC ROUTING WITH CROSS-LAYER ADAPTATIONS FOR MULTI-HOP WIRELESS NETWORKS

In recent years there has been a proliferation of research on a number of wireless multi-hop networks that include mobile ad-hoc networks, wireless mesh networks, and wireless sensor networks (WSNs). Routing protocols in such networks are of- ten required to meet design objectives that include a combination of factors such as throughput, delay, energy consumption, network lifetime etc. In addition, many mod- ern wireless networks are equipped with multi-channel radios, where channel selection plays an important role in achieving the same design objectives. Consequently, ad- dressing the routing problem together with cross-layer adaptations such as channel selection is an important issue in such networks. In this work, we study the joint routing and channel selection problem that spans two domains of wireless networks. The first is a cost-effective and scalable wireless-optical access networks which is a combination of high-capacity optical access and unethered wireless access. The joint routing and channel selection problem in this case is addressed under an anycasting paradigm. In addition, we address two other problems in the context of wireless- optical access networks. The first is on optimal gateway placement and network planning for serving a given set of users. And the second is the development of an analytical model to evaluate the performance of the IEEE 802.11 DCF in radio-over- fiber wireless LANs. The second domain involves resource constrained WSNs where we focus on route and channel selection for network lifetime maximization. Here, the problem is further exacerbated by distributed power control, that introduces addi- tional design considerations. Both problems involve cross-layer adaptations that must be solved together with routing. Finally, we present an analytical model for lifetime calculation in multi-channel, asynchronous WSNs under optimal power control

A Routing Delay Predication Based on Packet Loss and Explicit Delay Acknowledgement for Congestion Control in MANET

In Mobile Ad hoc Networks congestion control and prevention are demanding because of network node mobility and dynamic topology. Congestion occurs primarily due to the large traffic volume in the case of data flow because the rate of inflow of data traffic is higher than the rate of data packets on the node. This alteration in sending rate results in routing delays and low throughput. The Rate control is a significant concern in streaming applications, especially in wireless networks. The TCP friendly rate control method is extensively recognized as a rate control mechanism for wired networks, which is effective in minimizing packet loss (PL) in the event of congestion. In this paper, we propose a routing delay prediction based on PL and Explicit Delay Acknowledgement (EDA) mechanism for data rate and congestion control in MANET to control data rate to minimize the loss of packets and improve the throughput. The experiment is performed over a reactive routing protocol to reduce the packet loss, jitter, and improvisation of throughput

Combined Banzhaf & Diversity Index (CBDI) for critical node detection

Critical node discovery plays a vital role in assessing the vulnerability of a computer network to malicious attacks and failures and provides a useful tool with which one can greatly improve network security and reliability. In this paper, we propose a new metric to characterize the criticality of a node in an arbitrary computer network which we refer to as the Combined Banzhaf & Diversity Index (CBDI). The metric utilizes a diversity index which is based on the variability of a node׳s attributes relative to its neighbours and the Banzhaf power index which characterizes the degree of participation of a node in forming shortest paths. The Banzhaf power index is inspired from the theory of voting games in game theory. The proposed metric is evaluated using analysis and simulations. The criticality of nodes in a network is assessed based on the degradation in network performance achieved when these nodes are removed. We use several performance metrics to evaluate network performance including the algebraic connectivity which is a spectral metric characterizing the connectivity robustness of the network. Extensive simulations in a number of network topologies indicate that the proposed CBDI index chooses more critical nodes which, when removed, degrade network performance to a greater extent than if critical nodes based on other criticality metrics were removed

USING NS-2 COMPARISON OF GEOGRAPHICAL AND TOPOLOGICAL MULTICAST ROUTING PROTOCOLS ON WIRELESS AD HOC NETWORKS

Performance evaluation of geographical and topological multicast routing algorithms for cellular Wi-Fi ad-hoc networks is offered. Flooding and On-call for Multicast Routing Protocol (ODMRP) are simulated and in comparison with novels protocols: Topological Multicast Routing (ToMuRo) and Geographical Multicast Routing (GeMuRo) in pedestrian and vehicular situations. The situations evaluated recollect one multicast transmitter and one, two and three multicast receivers under numerous mobility and transmission levels. The conduct of 150 nodes is evaluated in terms of cease to end postpone (EED), jitter, packet delivery ratio, and overhead. Consequences display that ToMuRo is suitable for pedestrian eventualities because of its tree-based structure and GeMuRo is right for vehicular situations because its miles based on a mesh topology