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

Flying Ad hoc Networks (FANETs) has developed as an innovative technology for access places without permanent infrastructure. This emerging form of networking is construct of flying nodes known as unmanned aerial vehicles (UAVs) that fly at a fast rate of speed, causing frequent changes in the network topology and connection failures. As a result, there is no dedicated FANET routing protocol that enables effective communication between these devices. The purpose of this paper is to evaluate the performance of the category of topology-based routing protocols in the FANET. In a surveillance system involving video traffic, four routing protocols with varying routing mechanisms were examined. Additionally, simulation experiments conduct

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

Routing is the process of delivering a packet from a source to a destination in the network using a routing algorithm that tries to create an efficient path. The path should be created with minimum overhead and bandwidth consumption. In literature, routing protocols in VANET were categorized in many ways, according to different aspects. In the present study, we prefer the classification based on the number of hops to reach the destination node. In literature, these are single-hop and multi-hops protocols. We first discuss the two types and then compare the MDDV (multi-hops protocol) with VADD (single-hop protocol). The comparison is theoretically and experimentally implemented by providing a network environment consisting of SUMO, VIENS and

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In