Cooperative Routing in Multi-Radio Multi-Hop Wireless Network

There are many recent interests on cooperative communication (CC) in wireless networks. Despite the large capacity gain of CC in small wireless networks, CC can result in severe interference in large networks and even degraded throughput. The aim of this chapter is to concurrently exploit multi-radio and multi-channel (MRMC) and CC technique to combat co-channel interference and improve the performance of multi-hop wireless network. Our proposed solution concurrently considers cooperative routing, channel assignment, and relay selection and takes advantage of both MRMC technique and spatial diversity to improve the throughput. We propose two important metrics, contention-aware channel utilization routing metric (CACU) to capture the interference cost from both direct and cooperative transmission, and traffic aware channel condition metric (TACC) to evaluate the channel load condition. Based on these metrics, we propose three algorithms for interference-aware cooperative routing, local channel adjustment, and local path and relay adaptation, respectively, to ensure high-performance communications in dynamic wireless networks. Our algorithms are fully distributed and can effectively mitigate co-channel interference and achieve cooperative diversity gain. To our best knowledge, this is the first distributed solution that supports CC in MRMC networks. Our performance studies demonstrate that our algorithms can significantly increase the aggregate throughput

Reducing overall delay in MULTI-RADIO WOBAN with least per node processing overhead on data packet

Wireless-Optical Broadband Access Network (WOBAN) is a hybrid network technology. The back-End of the WOBAN being optical has very high performance both in terms of speed and bandwidth. There has been lot of research and numbers of protocols were designed and numerous algorithms have been proposed to bring the performance of the Front-End at par with that of the optical part. So in this paper too, we propose a technique to upgrade the performance of the wireless part so that there may be lesser processing on the actual data packet and may move smoothly across the nodes in the wireless part of WOBAN. Also when the data packet reaches the Optical Network Unit (ONU), it may be forwarded as soon as it reaches the ONU without having to wait for the designated time slot. In this way, there will be no time slot synchronization delay at ONU

F3TM: flooding factor based trust management framework for secure data transmission in MANETs

Due to the absence of infrastructure support, secure data dissemination is a challenging task in scalable mobile ad hoc networks (MANETs) environment. In most of the traditional routing techniques for MANETs, either security has not been taken into account or only one aspect of security concern has been addressed without optimizing the routing performance. This paper proposes Flooding Factor based Framework for Trust Management (F3TM) in MANETs. True flooding approach is utilized to identify attacker nodes based on the calculation of trust value. Route Discovery Algorithm is developed to discover an efficient and secure path for data forwarding using Experimental Grey Wolf algorithm for validating network nodes. Enhanced Multi-Swarm Optimization is used to optimize the identified delivery path. Simulations are carried out in ns2 to assess and compare the performance of F3TM with the state-of-the-art frameworks: CORMAN and PRIME considering the metrics including delay, packet delivery ration, overhead and throughput. The performance assessment attests the reliable security of F3TM compared to the state-of-the-art frameworks

A Mobility-Aware Channel Allocation Strategy for Clustered Ad hoc Network

International audienceThis paper presents a mobility-aware channel allocation strategy for clustered ad hoc network. Our main novelty is to consider the user mobility associated with traffic history and node popularity to guide the channel allocation process, while quickly responding to changes in the network topology. In our performance evaluation and contrarily to related works, we use a realistic mobility model based on user behavior and consider channels with largest spectral distance as well as the smallest number of occurrences. Obtained results show that our strategy presents throughput 15,43 % and 17,74% higher when compared with RANDOM and LD algorithms respectively, and lower overhead when compared with TABU algorithm

Flow Allocation for Maximum Throughput and Bounded Delay on Multiple Disjoint Paths for Random Access Wireless Multihop Networks

In this paper, we consider random access, wireless, multi-hop networks, with multi-packet reception capabilities, where multiple flows are forwarded to the gateways through node disjoint paths. We explore the issue of allocating flow on multiple paths, exhibiting both intra- and inter-path interference, in order to maximize average aggregate flow throughput (AAT) and also provide bounded packet delay. A distributed flow allocation scheme is proposed where allocation of flow on paths is formulated as an optimization problem. Through an illustrative topology it is shown that the corresponding problem is non-convex. Furthermore, a simple, but accurate model is employed for the average aggregate throughput achieved by all flows, that captures both intra- and inter-path interference through the SINR model. The proposed scheme is evaluated through Ns2 simulations of several random wireless scenarios. Simulation results reveal that, the model employed, accurately captures the AAT observed in the simulated scenarios, even when the assumption of saturated queues is removed. Simulation results also show that the proposed scheme achieves significantly higher AAT, for the vast majority of the wireless scenarios explored, than the following flow allocation schemes: one that assigns flows on paths on a round-robin fashion, one that optimally utilizes the best path only, and another one that assigns the maximum possible flow on each path. Finally, a variant of the proposed scheme is explored, where interference for each link is approximated by considering its dominant interfering nodes only.Comment: IEEE Transactions on Vehicular Technolog