Wireless Routing Protocols Research Articles

Improvement and application of information communication technology in wireless routing protocol based on adaptive K-means clustering algorithm

Improvement and application of information communication technology in wireless routing protocol based on adaptive K-means clustering algorithm

Energy-Efficient Network Protocols and Resilient Data Transmission Schemes for Wireless Sensor Networks—An Experimental Survey

Wireless sensor networks (WSNs) are considerably used for various environmental sensing applications. The architecture and internal specifications of WSNs have been chosen based on the requirements of particular applications. On this basis, WSNs consist of resource (energy and memory)-limited wireless sensor nodes. WSNs initiate data communication from source to destination via physical layer management principles, channel slot scheduling principles (time division multiple access), wireless medium access control (WMAC) protocols, wireless routing protocols and application protocols. In this environment, the development of WMAC principles, routing protocols and channel allotment schemes play crucial roles in network communication phases. Consequently, these layering functions consume more energy at each sensor node, which leads to minimal network lifetime. Even though the channel management schemes, medium control protocols and routing protocols are functionally suitable, the excessive energy consumption affects the overall network performance. In this situation, energy optimization algorithms are advised to minimize the resource wastage of WSNs during regular operations (medium control and routing process). Many research works struggle to identify the optimal energy-efficient load balancing strategies to improve WSN functions. With this in mind, the proposed article has conducted a detailed literature review and notable experimental comparisons on energy-efficient MAC protocols, channel scheduling policies and energy-efficient routing protocols. To an extent, the detailed analysis over these wireless network operations helps to understand the benefits and limitations of recent research works. In the experimental section of this article, eight existing techniques are evaluated under energy optimization strategies (WMAC, channel allocation, sleep/wake protocols, integrated routing and WMAC policies, balanced routing and cooperative routing). The proposed review and the classified technical observations collected from notable recent works have been recognized as crucial contributions. The results infer the suggestions for feasible WSN communication strategies with optimal channel management policies and routing policies. Notably, the simulation results show that cross-layer or multi-layer energy optimization policies perform better than homogeneous energy optimization models.

The Optimal Path of College Art Teaching Based on Embedded Sensor Network

As a new type of intelligent network technology, sensor network has been widely used in recent years. This paper is aimed at studying the optimization path of art teaching in colleges and universities based on embedded sensor network, proposing methods such as ZigBee network, HRPTC, wireless routing protocol, and sensor technology, and carrying out experimental research on the application of embedded sensor network in the optimization path of college art teaching. The experimental results show that the embedded sensor network can promote well the development of the optimization path of art teaching in colleges and universities and promote the reform of art education teaching methods. At the same time, the education and teaching methods optimized based on sensor network technology can better play the role of education and teaching so that students’ learning enthusiasm has been improved by at least 10%.

Proposed emerged and enhanced routing protocols for wireless networks

The problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as DS-ZRP routing protocol. The third proposed routing protocol is designed based on using the advantaged of multipoint relays in OSLR protocol with the advantages of route cashing in DSR protocol, and we named it as OLS-DSR routing protocol. Then, some experimental tests are doing by demonstration case studies and the experimental results proved that our proposed routing protocols outperformed than current wireless routing protocols in terms of important network performance metrics such as periodical broadcast, network control overhead, bandwidth overhead, energy consumed and latency.

Efficient Routing Algorithm using MLP and RBX in a Four Model Neural Networks

Two important paradigms which are contradicting by nature namely: the efficient routing information diffusion and adaptability to dynamic network conditions using wireless routing protocols have been researched in recent years. One way of solving this issue is by using the past experiences of a node in network traffic condition through intelligent algorithm to predict the network traffic condition in the future. In this methodology we propose an algorithm which is used to to predict one hop delay per packet during routing process using neural networking. The one hop delay that is predicted is then further used by the participating nodes for information diffusion during routing. Experimental analysis indicate that using tapped delay line radial basis function and tapped delay line multilayer perceptron, it is possible to predict mean delays as a time series. The inputs used for prediction are mean delay time series with traffic loads and mean delay time series itself. The pros and cons of the proposed work are also present in this paper.

Enhancing the Performance of Wireless Routing Protocols of MANET using AI

Enhancing the Performance of Wireless Routing Protocols of MANET using AI

Optimization of the AODV-Based Packet Forwarding Mechanism for BLE Mesh Networks

The standard Bluetooth Low-Energy mesh networks assume the use of flooding for multihop communications. The flooding approach causes network overheads and delays due to continuous message broadcasting in the absence of a routing mechanism. Among the routing protocols, AODV is one of the most popular and robust routing protocol for wireless ad hoc networks. In this paper, we optimized the AODV protocol for Bluetooth Low-Energy communication to make it more efficient in comparison to the mesh protocol. With the proposed protocol (Optimized AODV (O-AODV)), we were able to achieve lower overheads, end-to-end delay, and average per-hop one-way delay in comparison to the BLE mesh (flooding) protocol and AODV protocol for all three scenarios (linear topology with ten nodes, multipath topology with six and ten nodes). In addition, the proposed protocol exhibited practically constant route requests and route reply setup times. Furthermore, the proposed protocol demonstrated a better Packet Delivery Ratio (PDR) for O-AODV (84%) in comparison to AODV (71%), but lower than the PDR of the mesh (flooding) protocol with 93%.

Buffer occupancy and link state opportunistic routing for wireless mesh networks

Providing a high level of Quality of Service is essential for future wireless networks. This article presents a new multihop wireless routing protocol that opportunistically takes profit from variations of radio conditions in terms of path loss, shadowing and multipath fading to maximize the system capacity. However, guaranteeing high system capacity should not evade the packet delay minimization objective. Consequently, the best path should not only be considered as the path with best throughput but a combination of a good link throughput and, in addition, low router buffer occupancy load. Taking into account the available router buffer occupancy in its path selection, our proposal uses queuing theory information in order to also provide an efficient load balancing solution that adequately distributes the traffic load in the whole network. Exploiting this information, our solution dynamically adapts the selected path across time avoiding overexploited efficient links as well as low throughput link usage. This adaptation is performed considering each link state and the amount of channel information available. This improves the throughput and delay with only small marginal overhead cost. Our proposal applies to all wireless multihop networks, with increased benefit for extending cell coverage. We demonstrate through our simulation study that our solution raises the system capacity by more than 50% in several scenarii as well as reduces packet delays compared to state-of-the-art protocols such as Ad-hoc On-demand Distance Vector, Optimized Link State Routing and Link State Opportunistic Routing.

Routing Protocol in Underwater Wireless Acoustic Communication Using Non Orthogonal Multiple Access

Routing Protocol in Underwater Wireless Acoustic Communication Using Non Orthogonal Multiple Access

Optimization of Sports Event Management System Based on Wireless Sensor Network

In recent years, wireless sensor network technology has developed rapidly and its role in managing systems for sports events has been widely used. Wireless sensor networks not only have low wiring cost, high monitoring accuracy, and good fault tolerance but also can be monitored remotely and have outstanding advantages in fault diagnosis and safety monitoring. In this paper, firstly, the wireless sensor network hierarchical routing protocol is studied and its network model and workflow are analyzed; according to the energy consumption of the wireless sensor network, the selection method of the optimal number of cluster heads is proposed to analyze the advantages and disadvantages existing in the protocol. Secondly, the improvement of the routing protocol is proposed to address the problems of uneven distribution of cluster heads and cluster head election without considering the residual energy of nodes in the protocol. When dividing clusters, the number of neighboring nodes is considered so that cluster heads are distributed more evenly in the network; when electing cluster heads, the residual energy of nodes in the cluster is considered to balance the whole network load, and when electing cluster heads, the residual energy of nodes in the cluster is considered to balance the whole network load. Finally, simulation experiments are conducted in this paper using simulation software, and the simulation results show that the data fusion algorithm is more effective than the protocol in reducing the average energy consumption of nodes and extending the network lifetime; these features make wireless sensors more beneficial for better management of sporting events as well as better optimization.

주기적 Q-table 업데이트를 활용한 무선 라우팅 프로토콜

주기적 Q-table 업데이트를 활용한 무선 라우팅 프로토콜

Energy efficient multipath ant colony based routing algorithm for mobile ad hoc networks

This paper describes the novel wireless routing protocol made for mobile ad hoc networks or wireless sensor networks using the bio-inspired technique. Bio-inspired algorithms include the routing capabilities taken from the social behavior of ant colonies, bird flocking, honey bee dancing, etc and promises to be capable of catering to the challenges posed by wireless sensors. Some of the challenges of wireless sensor networks are limited bandwidth, limited battery life, low memory, etc. An energy-efficient multipath routing algorithm based on the foraging nature of ants is proposed including many meta-heuristic impact factors to provide good robust paths from source to destination to overcome the challenges faced by resource-constrained sensors. Analysis of individual impact factor is represented which justifies their importance in routing performance. The multi-path routing feature is claimed by showing energy analysis as well as statistical analysis in-depth to the readers. The proposed routing algorithm is analyzed by considering various performance metrics such as throughput, delay, packet loss, network lifetime, etc. Finally, the comparison is done against AODV routing protocol by considering performance metrics where the proposed routing algorithm shows a 49% improvement in network lifetime.

Implementation and Evaluation of Opportunistic Routing Protocols for Wireless and New Generation Communication Networks

Current wireless networks are based on unicast routing protocol derived from wired networks. The purpose of this paper is to implement and to evaluate opportunistic routing protocols in new generation’s wireless network. This is a comparative study between two opportunistic protocols, which are extremely opportunistic routing protocol and simple opportunistic adaptive routing protocol. The main goal of this survey is to show the benefits required by using opportunistic approach to optimize the new generation’s wireless networks operations and implemented the most used protocols under MATLAB framework.

Improving the Performance of Antnet Protocol using Performance Measures Modeling in Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) forms self-autonomous networks which mean nodes are communicated without the aid of any access point. This network forms an ad hoc (provisional) network which is node are random moves in the simulation area. AntNet is a bio-inspired routing protocol based on real Ant behaviour. Nowadays, Swarm Intelligence (SI) techniques are widely used in various domains. In mobility, nodes are taken seldom position and moving randomly. In this work, we have used standard mobility models like Random Way Point (RWP) model. Also, AntNet routing protocol has been used with well-known wireless routing protocols such as Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR). The Performance measures modeling (PMM) used to increase the QoS (Quality of Service) results. Therefore, the performance results of the proposed AntNet-PMM model revealed that better results when compared with other models. The Simulation work was made in Network Simulator (NS2). The obtained NS2 output will be given input to Curve fitting tool in MATLAB. In this work, Packet Delivery Ratio (PDR), Average Delay and Throughput are considered as QoS parameters. Moreover, curve fitting expressions are used to enhance better accuracy such as polynomial expression, rational expression, and power expression.

Performance Assessment and Comparison of Efficient Ad Hoc Reactive and Proactive Network Routing Protocols

The research on mobile ad hoc networks is intensively attracted by the research community due to their good characteristic of multi-hop wireless connectivity and energetically altering network topology. It collects infra-structure less mobile nodes building a temporary network without any centralized administration. So far, numbers of ad hoc routing protocols were developed and executed. The simulation work has been performed to access the performance of ad hoc on-demand distance vector routing (AODV), dynamic source routing (DSR) and wireless routing protocol (WRP). Hence, GloMoSim simulator was used to perform the simulations. The author adopted two dissimilar scenarios, namely, 50 and 100 nodes, with rectangular area sizes of 1500 × 1000 and 2000 × 1500 m2, respectively, to estimate the impact of network size on the performances. Simulation findings demonstrated that for definite differentials, WRP shows an enhanced performance than the other two protocols such as DSR and AODV.

Link state opportunistic routing for multihop wireless networks

Enhancing the quality of service is the crucial issue of future wireless networks. In this paper, we propose a new multihop wireless routing protocol inspired by opportunistic resource allocation strategies that take into account the variability of the radio conditions due to path loss, shadowing and multipath fading. Thanks to this knowledge, our proposition dynamically adapts the selected path accross time. The adaptation is function of each link state and the amount of channel information available. This allows to improve system performance in terms of delay and throughput. This solution can be used in all multihop wireless contexts but can have a special interest in wireless coverage zone extension context. Simulation results will show that the proposed routing protocol greatly outperforms the other existing protocols such as ad-hoc on-demand distance vector, optimized link state routing and extremely opportunistic routing protocols reducing mean packet delays by more than 50% in several scenarii.

ANALYSIS OF IGRP PERFORMANCE IN WDS MESH TOPOLOGY BASED ON IEEE 802.11 STANDARDS

Redundancy and robustness are the most common problems in a wireless network distribution system , network system problems that are not able to handle coverage areas in a large / wide coverage, so that the network users are easily disconnected from the connection and out of the server radius. These problems are caused by topology and wireless network distribution methods that are not in accordance with the needs and coverage of its users. However, adding a number of access points en masse to expand the network without being based on appropriate applied methods, is not necessarily able to minimize complaints from network users. Starting from the problems described in the previous paragraph, in this study a wireless distribution mesh system topology (WDS mesh) will be built to improve utility and network usage in the area / radius of the area between access points using wireless lines and minimize cable requirements which are generally the main constraints in network deployment and installation to areas that are difficult to reach. The topology built in this research will implement the wireless routing protocol that results from the analysis and observation process to expand the expansion of service areas to places that are difficult to reach. The wireless routing protocol method used in this study is the Made Mesh Easy (MME) method which is one of the developments of the Interior Gateway Routing Protocol (IGRP) method. Evaluation of the wireless routing protocol in the WDS mesh network topology will be carried out periodically to obtain the results of the analysis that will be used to re-configuring and re-routing to maintain the quality of the network remains realiable. Mesh clients will give feedback on the quality of service obtained based on observations according to IEEE 802.11 standardization. The parameters used are: Througput, Packet Loss Ratio, Latency, Jitter, MOS, Post Dial Delay and Echo Cancelation (EC)

Multicast routing for mesh-based using DSR in wireless sensor network

Multicast routing is helpful to establish group communication for sharing, transmitting the data or message from one stream to another stream within a network. The Multicasting Routing protocol is a vast challenging research area. Different routing algorithms erect based upon various domain or various applications. Some common on-demand multicasting routing algorithms are DSR, DSDV and Wireless Routing Protocol (WRP). The usage of multicasting in DSR has many advantages. It can reduce the cost of transmission and improves efficiency when transmitting information between wireless networks. The major complexity for designing a routing protocol in network is the dynamic change in the topology, due to random movement of nodes. When large number of nodes is deployed over a network, we use multicast approach to find the optimal path to the multiple destinations. In this paper, using MATLAB tool, find the parameters like time and energy consumed for mesh network using DSR mesh-based routing protocol and find optimal path using energy efficient multicast approach.

A Smart Collaborative Routing Protocol for Reliable Data Diffusion in IoT Scenarios.

It is knotty for current routing protocols to meet the needs of reliable data diffusion during the Internet of Things (IoT) deployments. Due to the random placement, limited resources and unattended features of existing sensor nodes, the wireless transmissions are easily exposed to unauthorized users, which becomes a vulnerable area for various malicious attacks, such as wormhole and Sybil attacks. However, the scheme based on geographic location is a suitable candidate to defend against them. This paper is inspired to propose a smart collaborative routing protocol, Geographic energy aware routing and Inspecting Node (GIN), for guaranteeing the reliability of data exchanging. The proposed protocol integrates the directed diffusion routing, Greedy Perimeter Stateless Routing (GPSR), and the inspecting node mechanism. We first discuss current wireless routing protocols from three diverse perspectives (improving transmission rate, shortening transmission range and reducing transmission consumption). Then, the details of GIN, including the model establishment and implementation processes, are presented by means of the theoretical analysis. Through leveraging the game theory, the inspecting node is elected to monitor the network behaviors. Thirdly, we evaluate the network performances, in terms of transmission delay, packet loss ratio, and throughput, between GIN and three traditional schemes (i.e., Flooding, GPSR, and GEAR). The simulation results illustrate that the proposed protocol is able to outperform the others.

Survey on Efficient Use of Spatial Reusability in Multhop Wireless Network

The present wireless routing protocols does not increase the end-to-end throughput by reducing the number of hops to deliver a single packet from a source to a destination node. To maintain the proper link among the nodes in multihop wireless ad-hoc networks, the medium access control (MAC) protocol plays a vital role. The spatial reuse and throughput of a multihop network is greatly affected in assessing the level of interference, channel sharing was not expeditiously utilized by the prevailing methodology of the IEEE 802.11.Routing protocols are generally depends on transmission cost, minimizing routing metrics. But they fail to give assurance for increasing end-to-end throughput. The existing protocols don't take spatial reusability of the remote correspondence media into account. This paper overviews numerous techniques to upgrade the effective channel use by enhancing the spatial reuse.