Research On Opportunistic Scheduling Mechanism And Routing Protocols For Wireless Multi-hop Networks

Abstract:With the popularity of wireless devices and a wide range of applications on wireless multi-hop networks, researchers devote to develop the knowledge on wireless multi-hop networks. In general wireless multi-hop networks include wireless adaptive networks, wireless mesh networks, wireless sensor networks. Wireless multi-hop network is aim to avoid the lack of a centralized network. The nodes in the network can be data transmission terminals, also can it be a routing node. Wireless link dynamic, time-varying and missing features make multi-hop wireless network be robust and easy to assemble. Currently, experts and scholars for study of wireless multi-hop network structure involve all areas of OSI. The paper studies the opportunistic scheduling mechanism for multi-hop wireless networks as well as classic routing protocols’improving.To research about opportunistic scheduling mechanism, the paper analysis the problem of different centralized and distributed scheduling mechanism, as well as distributed scheduling mechanism to study the advantages and disadvantages OSAR algorithm based on this paper. A combination of computer technology in page views LRU algorithm, which for wireless multi-hop networks appropriate improvements, simulation analysis and compare the advantages and disadvantages about the two algorithms. The results show that the improved LRU algorithm can ensure fair allocation of network resources. The network has a better network throughput and smaller end delay improve the network quality of service.To research network routing protocol for wireless multi-hop, The paper main analyze a variety of classic routing protocols, including AODV (Ad hoc On-demand Distance Vector), OLSR (Optimized Link State Routing), DSR (Dynamic Source Routing) and TBRPF (Topology Dissemination Based on Reserve-path Forwarding). Comparing advantages and disadvantages of various routing protocols, routing protocols currently proposed to be there to solve problems. Based on AODV solutions on a local wireless multi-hop network, the paper is optimized to fix the problem. Combined with on-demand routing and advanced repair methods to fix the route, the paper proposed a new CODA (Combined On-demand with Advance) method, comparative analysis performance simulation. The results show that the three methods, CODA basically close early restoration route network advantages, namely a better end to end delay and network throughput, while also addressing the early recovery may no longer be put to use to repair the route network risk. It has the advantages of on-demand repair and ensures the network connection interrupt repairable.