No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Highly dynamic destination-sequenced distance vector (DSDV) for mobile computers
... A ton of work has been carried out on routing protocols since they are basic to the working of impromptu networks. Different routing protocols have been proposed in the writing, for example, the Destination Sequenced Distance Vector (DSDV) [2], Ad-hoc On-interest Distance Vector (AODV) [3], Dynamic Source Routing (DSR) [4] and Signal Stability based Adaptive (SSA) Routing [5]. TCP/IP is the standard networking protocol on the web.It is the most generally utilized transport protocol for information transfer like document exchange, email and WWW program. ...
... In Destination Sequenced Distance Vector routing [2], every hub keeps up a routing table wherein the following bounce data for every reachable goal is kept up. Each hub in the system occasionally telecasts its routing table with monotonically expanding grouping numbers. ...
... We have utilized a solitary TCP activity source in every reproduction. The rendition of TCP utilized is TCP Tahoe with quick retransmit [1,2]. The hubs in the simulation move as indicated by the 'arbitrary waypoint' model. ...
TCP/IP is the main networking protocol on the web and is additionally the most broadly utilized. Because of these reasons, its utilization over Mobile Ad-Hoc networks is a conviction. Impromptu networks are inclined to Link disappointments because of versatility. TCP is not able to recognize failures because of route drops and congestion. Thus, throughput lowers essentially when hubs move. It is along these lines fundamental to study how TCP performs over specially appointed networks. We have utilized reproductions as a part of the CMU expansion to NS to break down the execution of TCP Tahoe over a set of routing protocols including the Signal Stability Adaptive routing protocol that we have simulated in NS-2. We recognize qualities in each of these routing protocols that focus the conduct of TCP over them.
... Our proposed protocol uses the OffSM and favors nodes with close offline social relationship as next forwarder nodes. Offline social CLWPR performance was evaluated against other routing protocols, including OLSR, 53 DSDV, 54 AODV, 55 and CLWPR, 5 and initial results acquired demonstrate improved performance in terms of packet delivery ratio and end to end delay. ...
... Throughput corresponds to the total number of data bits successfully delivered per unit time. In the following we compare the performance of SCALE routing protocol against topology based protocols (OLSR, 53 DSDV, 54 and AODV 55 ) and geographical protocols (GyTAR, 11 European Telecommunications Standards Institute [ETSI's] proposed greedy routing protocol ETSI-GF, 12 original CLWPR, 5 and enhanced (Offline) Social CLWPR 36 ). ...
Vehicular ad hoc networks (VANETs) are receiving increased attention, and several routing protocols have been proposed already by the research community. In such a framework, social aspects and human mobility are important performance enablers, which however are mostly overlooked. In this work, we propose the socially aware CLWPR (SCALE) protocol, significantly enhancing cross‐layer weighted position‐based routing (CLWPR), a routing protocol for urban VANET environments, combining social properties such as trust, influence, and users' individual mobility patterns to its core design in order to support an efficient content dissemination scheme. The design principles of SCALE that rely on both online and offline social metrics quantifying relationships on social networking platforms and opportunistic contacts of nodes due to physical proximity, respectively, are presented, while nodes with close online and offline social relationship are favored as next forwarder nodes. Subsequently we provide the performance evaluation of SCALE against other routing protocols in distributed vehicular networks, employing representative urban scenarios with synthetic and real traffic. It is shown that the proposed approach presents improved performance in terms of Packet Delivery Ratio (PDR) and throughput when compared with other similar protocols by an average of 37% in scenarios with synthetic dataset and 58% with real dataset for PDR and by an average of 45% in scenarios with synthetic dataset and 61% with real dataset for throughput.
... On the other hand, if routing fails, it sends back a route error to the source node with error message. In DSR, source node deletes path in cache and then store alternative path for destination [11]. ...
... A review of AODV and DSDV conventions by displaying their qualities, usefulness, advantages and restrictions and after that makes their similar investigation so to examine their execution. The goal is to mention objective facts on how the execution of this protocol is able to move forward [11]. ...
... Request permissions from permissions@acm.org. DroNet'18, June [10][11][12][13][14][15]2018 Loon project aimed at bringing service connectivity in difficult to reach areas through stratospheric balloons is one representative example [3]. Facebook's high altitude solar powered planes and the Amazon Prime Air system are other privately founded projects aimed at introducing UAV technology [4]. ...
... Drones start to move immediately and the first packet is sent after 5 s. In our tests we considered classic routing protocols for MANETs which are Ad-hoc On-demand Distance Vector routing (AODV) [13], Destination-Sequenced Distance-Vector routing (DSDV) [14], Dynamic Source routing (DSR) [15], and Optimized Link State Routing Protocol (OLSR) [16]. ...
Unmanned aerial vehicles (UAV), or commonly referred to as Drones, have captured our imagination bringing new and challenging service provisioning schemes into the networking scenario. We might indeed be reaching the day where communication-enabled drones might be employed in synergy with deployed public networks offering alternate service access means. In this context, we contribute with quantitative analysis of classic routing algorithms in a 3D mobile environment, shedding some light on their performance tradeoffs.
... DSDV [5] is a proactive routing protocol and it is based on the idea of Bellman-Ford Routing algorithm to calculate path. Each node maintains a routing table which contains the next hop, cost metrics to reach the destination. ...
... In ZRP, average end to end delay incrementally increases with increase in network densityV OPEN TECHNICAL ISSUESThe comparison of various routing protocols reveals that there are several major issues in routing protocol. In DSDV[5] protocol, incremental update strategy is used to avoid extra traffic. But bandwidth wastage and larger network overhead occurs when transferring periodic route update messages. ...
... Whereas these protocols can avoid network wide topology information flooding, they are usually subject to long latencies. In contrast, Proactive Routing Protocols (PRP) DSDV [4] and OLSR attempt at maintaining consistent and up-to-date routing information in every node by propagating updates throughout the network. Although a route to each other node is always available, such protocols introduce a major bandwidth overhead due to the broadcast nature of exchanging routing information over wireless media [6]. ...
Researchers has been developed various routing protocols for Mobile Ad-hoc Networks (MANETs). Each protocol proposed and designed so far has its own merits and demerits. Researchers are trying continuously to develop advance routing protocols that can route messages towards their destination in an efficient way while consuming minimum amount of bandwidth and battery. In this work we are considering two well known MANET routing protocols, (1) Ad-hoc On-demand Distance Vector routing protocol, (2) Optimized Link State Routing protocol, and we have combined their preferred properties to formulate a new Hybrid routing protocol. In this paper we have proposed a routing protocol in hybrid category with the target of increasing the packet delivery ratio (PDR), throughput and decreasing end-to-end delay. Our extensive simulation based experimental studies shows that the performance of proposed Hybrid Multipath Progressive Routing Protocol is better than the AODV, OLSR and ZRP on above and many other parameters. We have simulated the results on Exata Cyber 1.1.
... The protocols of routing in traditional network [16][17][18][19][20][21][22] have been failed in DTN scenario because the protocols supposed to always have a connectivity between nodes. Therefore, researchers invented protocols for DTNs which are divided into two parts. ...
Delay tolerant network (DTN) has attracted significant attention of the researchers due to its capability of delivering the message even in the situation where network connectivity is irregular. Irregular networks result in non‐delivery of data to user at right time, and the same is not possible with traditional algorithms due to requirement of end‐to‐end connectivity between nodes. DTN uses story–carry–forward technique to deliver a message in the environment of disconnection. Hence, for message transmission from source node to destination node, a relay node or forwarder node is required. The efficiency of the network is mainly dependent on the selection of forwarder node. Hence, forwarder node selection is very crucial in DTNs. The objective of this paper is to propose an efficient relay node selection technique integrated with fuzzy logic, based on four properties of node, namely, number of encounters, residual energy, buffer capacity, and speed so that performance metrics of the network can be improve. Proposed method uses fuzzy logic to decide which node should be selected as relay node in multi hop strategy. The study of simulation results indicate that proposed algorithm improves performance of the network with regards to delivery ratio, delay, hop count, and throughput. In this paper, a fuzzy logic‐based relay node selection technique is proposed, which includes four input parameters and a single output parameter (“Grade”). Fuzzy logic system calculates the value of “Grade” for each node, which comes in the communication range. At the source node, the node which has the highest value of “Grade” will be selected as relay node. Further, at intermediate node, the message will transfer only if the difference between “Grade” value is greater than or equal to 50%.
... As soon as a neighbor device receives the broadcasted routing message along with the current link cost to the device, it compares this value and the corresponding value is stored in its routing table. If changed, it updates the value and re-computes [25] the distance of the route i.e. the link in the routing table. Every node stores the next routing hop for every reachable destination in their routing table. ...
Several types of Routing Protocols for mobile ad hoc networks have been proposed recently for their application in various areas such as military, government and many other fields. In this paper, we have proposed a comparative study of various routing protocols for mobile ad-hoc networks particularly emphasizing on its security aspect. Furthermore, we have discussed the comparison among existing routing protocols for MANET. Main factor for comparison is routing methodologies and knowledge required to make routing decisions. The comparison is made on the basis of the following factors: integrity, confidentiality, authentication, nonrepudiation and availability. Analysis of the secured version of proposed routing method has been done on the basis of the five security requirements and the same has been shown in the comparison tables.
... As soon as a neighbor device receives the broadcasted routing message along with the current link cost to the device, it compares this value and the corresponding value is stored in its routing table. If changed, it updates the value and re-computes [25] the distance of the route i.e. the link in the routing table. Every node stores the next routing hop for every reachable destination in their routing table. ...
Several types of Routing Protocols for mobile ad hoc networks have been proposed recently for their application in various areas such as military, government and many other fields. In this paper, we have proposed a comparative study of various routing protocols for mobile ad-hoc networks particularly emphasizing on its security aspect. Furthermore, we have discussed the comparison among existing routing protocols for MANET. Main factor for comparison is routing methodologies and knowledge required to make routing decisions. The comparison is made on the basis of the following factors: integrity, confidentiality, authentication, nonrepudiation and availability. Analysis of the secured version of proposed routing method has been done on the basis of the five security requirements and the same has been shown in the comparison tables.
... They also added that most research is focused on the lower network layers, especially on the MAC layer and Physical layer. After benchmarking classical WSN protocols like AODV (Adhoc On-demand Distance Vector) [62,72,111], DSDV (Destination Sequenced Distance Vector) [112], and DSR (Dynamic Source Routing) [74], on WNSN, authors find out that AODV performs better in WNSNs. Their performance metrics criteria include packet delivery ratio, throughput (Kbps), average delay, packet drop rate, and energy consumption. ...
Without measurements, sustainable development effort can not progress in the right
direction. Wireless sensor networks are vital for monitoring in real time and making
accurate measurements for such an endeavor. However small energy storage in the
sensors can become a bottleneck if the wireless sensor network is not optimized at the
hardware and software level. Directional antennas are such optimization technologies
at the hardware level. They have advantages over the omnidirectional antennas, such
as high gain, less interference, longer transmission range, and less power consumption. In wireless sensor networks, most of the energy is consumed for communication.
Considering the limited energy in small scale batteries of the sensors, energy efficient
(aware) routing, is one of the most important software optimization techniques. The
main goal of the technique is to improve the lifetime of wireless sensor networks.
In the light of these observations, it is desirable to do a coupled design of directional
antennas with network software, for fully exploiting the advantages offered by directional antenna technology. In this thesis, the possibilities of doing such integrated
design are surveyed and improvements are suggested. The design of the proposed microstrip patch antenna array is discussed and the performance characteristics are assessed through simulations. In the benchmarks, the proposed routing method showed
improvements in energy usage compared to the existing approaches.
... OLSR protocol has better performance in a dense network environment and large data traffic, however, the limitation of OLSR is to occupy a lot of network resources. 2) Destination sequenced distance vector DSDV [35] is a proactive routing protocol that uses the hops number metric to select the route. The protocol is proposed to solve the loop-back problem by adding a sequential number field to the routing table. ...
Mobile Ad Hoc Networks (MANETs) are more and more popular and applied in a wide range of applications such as healthcare, traffic control, military, rescue, and smart cities. However, the real performance of MANETs is still far from our expectations. Hence, there exists a massive amount of works considering this problem. Due to the performance of MANETs mainly dependent on the routing protocol employed, in this paper, we review the proposed routing protocols for MANETs published on the IEEE digital library in the last decade to determine an overall purpose about research directions. Based on these results, we perform a comparison of the performance of four typical traditional routing protocols, namely AODV, DSR, OLSR, and DSDV. We first design and implement different simulations so that all necessary performance metrics can be observed and measured. Then, we give comparative analyses of the obtained numerical results. From insight experiments, we may conclude that, for light traffic and low mobility MANETs, OLSR and DSDV work well. However, for heavy traffic and high mobility MANETs, AODV and DSR are dominant. Thus, we believe that new routing protocols for MANETs must have the ability to work efficiently in both cases.
... Since our MANET swarm might involve high data rate transmission in camera surveillance, we adopt WiFi as the fundamental networking mechanism between MANET swarm nodes. To guarantee WiFi communication and connectivity in a likely infrastructure-free environment for hydropower plant mobile monitoring, the OS layer should VOLUME 7, 2019 also provide ad hoc routing protocols such as AODV [30], DSDV [31], DSR [32], OLSR [33], etc., for distributed data forwarding to construct the MANET underlay, detailed in Section III-B. In addition, virtualization capabilities are also needed in the OS layer to build an SDN overlay on top of the MANET underlay by means of SDN technologies. ...
The construction and running of hydropower plants does not merely involve hydropower generation itself but also facilities surveillance, water quality monitoring, harmful creatures tracking, etc., thus requiring mobile and collaborative monitoring capabilities. MANET (Mobile Ad Hoc Networks), with its mobility, flexibility, and robustness in volatile networking environment, is a competitive candidate to fulfill such tasks. Nevertheless its distributed structure prevents the effective collaboration between MANET nodes. SDN (Software-Defined Networking) provides the centralized control over the network underlay. This paper proposes the SDN-controlled IEEE 802.11 MANET swarm for mobile monitoring in hydropower plants. First, the MANET node is implemented by integrating Raspberry Pi with cameras, various sensors, etc., into the low-cost wheeled mobile hardware to enable sensibility and mobility. Then, multiple such MANET nodes are networked through ad hoc protocols, to construct a flexible and distributed MANET underlay; meanwhile, to implement centralized control over the MANET underlay, every MANET node is equipped with OpenFlow switch software (e.g., Open vSwitch) so that OpenFlow directives issued by the SDN controller can be understood and executed, hence the SDN overlay on top of the MANET underlay. Finally, OpenFlow is extended to offer physical actions such as mobility and sensibility manipulation, beyond pure data forwarding in traditional SDN applications, to achieve mobile monitoring in hydropower plants. The SDN-controlled MANET swarm features mobile and sensing capabilities, flexible networking through ad hoc protocols, and efficient and unified control by SDN. Experiment results prove the feasibility of this network architecture.
... Simulation models for the evaluation of wireless networks performance have been introduced by J. Broch et al. [21] members of the CMU monarch group. They considered three metrics (packet loss, routing overhead and route length) and focused their work on four routing protocols: The Dynamic Source Routing (DSR) [22], AODV, The Temporally-Ordered Routing Algorithm (TORA) [23], and the Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) [24]. Authors in [25] also compared the same routing protocols with a regard on energy consumption. ...
This paper evaluates the energy consumption of well-known routing protocols, along with other metrics such as throughput, packet delivery ratio (PDR), and delay in different scenarios. We consider two other metrics in order to capture the efficiency of the energy consumption: e-throughput which is the ratio between the consumed energy and the throughput; and the e-PDR which is the ratio between the consumed energy and the PDR. We compare four routing protocols: AODV, OLSR, and HWMP in Reactive and Proactive modes. The number of nodes is varying between 25 and 81 nodes, with different mobility models. Simulations are conducted using NS3 and the parameters of a real network interface card. From the results, AODV presents the lowest energy consumption and a better e-Throughput. OLSR provides a better e-PDR in mobile scenarios. With a smaller e-PDR and e-Throughput, the proactive mode of HWMP is more energy efficient than the reactive mode.
... The Destination-Sequenced Distance-Vector (DSDV) Routing Algorithm, the nodes periodically transmit their routing tables to their neighbor nodes and any updates according to time synchronization or event-driven [19]. ...
A few years ago, Automotive area in the IoT was seen as theoretical concept and today we are already seeing the possibilities of not only driverless cars, but applications of IoT in the intelligent vehicles including parking, maintaining environment, protecting lives and smoothing the flow vehicle movements. We have realized the urgent need of using simple and efficient secure protocol in Vehicular Ad Hoc Network (VANET) to be practical in the fast mobility of the network nodes, and taking advantage of the existence of base stations gateways along the road to inherit the protocol to different VANETs, this will reduce the initialization of communication overhead time and the security keys initialization each time a node passes to new base station zone. In this research, we applied security protocol used in sensor networks to achieve security in VANET, the simulation analysis shows that secure practical communication is achieved which can be inherited to other sub VANETs. The contribution of this article is enhancing proposed protocols with as less cryptography computation overhead as possible to make it applicable in the high mobility nature of VANET using security primitives; which guarantees security while allowing fast authenticating during vehicle passing one VANET to the next one depending on its direction in the transportation networks.
... The Destination-Sequenced Distance-Vector (DSDV) Routing Algorithm, the nodes periodically transmit their routing tables to their neighbor nodes and any updates according to time synchronization or event-driven [19]. ...
Abstract: A few years ago, Automotive area in the IoT was seen as theoretical concept and today we are already seeing the possibilities of not only driverless cars, but applications of IoT in the intelligent vehicles including parking, maintaining environment, protecting lives and smoothing the flow vehicle movements. We have realized the urgent need of using simple and efficient secure protocol in Vehicular Ad Hoc Network (VANET) to be practical in the fast mobility of the network nodes, and taking advantage of the existence of base stations gateways along the road to inherit the protocol to different VANETs, this will reduce the initialization of communication overhead time and the security keys initialization each time a node passes to new base station zone. In this research, we applied security protocol used in sensor networks to achieve security in VANET, the simulation analysis shows that secure practical communication is achieved which can be inherited to other sub VANETs. The contribution of this article is enhancing proposed protocols with as less cryptography computation overhead as possible to make it applicable in the high mobility nature of VANET using security primitives; which guarantees security while allowing fast authenticating during vehicle passing one VANET to the next one depending on its direction in the transportation networks.
... The first-type routing protocol constantly detects network topology and link quality changes. The routing table is updated according to the change, such as DSDV [2], WRP [3], [4] and CGSR [5]. Reactive routing is also called on-demand routing, for example, AODV [6], DSR [7], TORA [8]. ...
An improved dynamic load balancing routing protocol is proposed based on mesh networks. A cost-effective integrated link state routing algorithm is designed in this protocol, and the mechanism of real-time monitoring and adjustment is adopted in this algorithm for the link state. The source nodes with routing redundancy are notified actively, and the secondary routing is used or focused when the link changes greatly. Moreover, a real-time backoff algorithm is proposed in this protocol. The network fairness problem is solved when the multi-path task and the single-path task compete for the link. The simulation results show that the proposed protocol can effectively avoid the congestion of network nodes. Better dynamic load balancing effect can be achieved, and the utilization of network resources is improved.
... The main advantages of AODV routing protocol are broadcast find packets only when necessary, discriminate between local connectivity management (neighborhood detection) and general topology maintenance [21]. AODV avoids making temporary loop problem, for limitation of AODV requirement on broadcast between a nodes can detect each other broadcast, and the message can be misused for insider attacks contain route disruption, node separation and route invasion [17]. ...
Mobile ad hoc network (MANET) is a set of nodes, which communicates using wireless medium and forming an arbitrary and dynamic network. Data is transmitted by forwarding the data from one node to another. To achieve this, each MANET node must act as both a host and a routing node. Routing in MANET poses a challenge because of the frequent changes in network topology in addition to the limited resources available for each node. Many different routing protocols have developed for MANET but in general, they can be categorized into three categories, which are proactive, reactive, and hybrid routing protocols. Hybrid routing protocols are interesting because they combine the characteristics of both proactive and reactive routing protocols. In this paper, we study the characteristics of a hybrid routing protocol (ZRP) and then compare its performance with a proactive (FSRL) and reactive (AODV) routing protocols.
... The authors of [12] proposed a proactive protocol 'Destination-Sequenced Distance Vector (DSDV)' based on the design of traditional distance vector routing algorithm with specific changes, for example loop-free. Dynamic source routing (DSR) algorithm is proposed by the authors in [7] on the concept of source routing. ...
Multicast routing is emerging as a popular communication format for
networks where a sender sends the same data packet to multiple nodes in the network simultaneously. To support this, it is important to construct a multicast tree having minimal cost for every
communication session. But, because of dynamic and unpredictable environment of the network, multicast routing turns into a combinatorial issue to locate a best path connecting a source node and destination node having minimum distance, delay and congestion. To overcome this, various multicast conventions have been proposed. As of late, swarm and evolutionary techniques such as ant colony optimization (ACO), particle swarm optimization (PSO), artificial bee colony (ABC) and genetic algorithm (GA) have been adopted by the researchers for multicast routing. Out of these, ACO and GA are most
popular. This paper shows an important review of existing multicast routing techniques along with their advantages and limitations.
Keywords:- Multicast routing Ant colony optimization (ACO)
Particle swarm optimization (PSO) ⋅ Artificial bee colony (ABC)
Genetic algorithm (GA)
... Challenges to reliable routing design have been raised due to the dynamic evolution of underwater network topology, the low energy of nodes and the prolongation of transmission delay. The table-driven routing algorithm represented by Destination-Sequenced Distance Vector routing (DSDV) (Perkins and Bhagwat 1994;Al-khatib and Hassan 2017) in wireless sensor networks is oriented to a static topology and owns a large signaling overhead. For the network composed of nodes fixed in the near shore submarine area, the reliable and stable data transmission with DSDV can be achieved. ...
In Underwater Acoustic Sensor Network (UASN) based fog systems, the monitored messages are transmitted from the sensors deployed under the water to the surface sinks, which act as the fog nodes, for further processing. To ensure the reliability of the data transmission process, effective routing algorithms are necessary to reduce the packet loss rate as well as the transmission delay caused by potential traffic burst and hotspots. For this reason, a reliable routing protocol against hotspots and burst (RRAHB) is proposed in this paper. The fuzzy decision algorithm (FDA) for nodes path selecting is designed firstly. When the node chooses the next hop, the candidate nodes are evaluated by FDA. It eliminates the subjectivity of expert scoring and ensure fairness and effectiveness of the evaluated scores. But, FDA cannot solve the problems of hotspots and the load unbalance effectively, which are two important factors that cause data packets loss. Based on FDA, the random selection and hotspots avoidance mechanism are presented. The probability of the hotspots can be reduced by the random selection, and the hotspots effect is eliminated by the hotspots avoidance mechanism. In addition, in order to guarantee the network load balance, a priority-based traffic scheduling mechanism (PTSM) is proposed. It solves the traffic surge problem caused by emergency events and reduces the possibility of packets loss. The simulation results verify the effectiveness of RRAHB in the network with dynamic topology. Compared with the traditional routing algorithm, it has great advantages in improving network reliability and enhancing network performance.
... Dynamically changing topology and lack of centralized control make the design of an adaptive distributed routing protocol challenging. Many protocols have been proposed for mobile ad hoc networks; with the goal of making the route selection more efficient [6][7][8][9][10][11][12][13][14][15][16][17][18][19].The problem of designing an efficient routing protocol for wireless systems has been studied by many researchers. ...
... Another proactive proposal, based on distance-vector instead of link-state, is the Destination-Sequenced Distance-Vector (DSDV) routing protocol [66]. This protocol discovers a path between a source and a destination by exchanging control data between direct neighbors. ...
The space segment has been evolved from monolithic to distributed satellite systems. One of these distributed systems is called the Federated Satellite System (FSS) which aims at establishing a win-win collaboration between satellites to improve their mission performance by using the unused on-board resources. The FSS concept requires sporadic and direct communications between satellites, using Inter Satellite Links. However, this point-to-point communication is temporal and thus it can break existent federations. Therefore, the conception of a multi-hop scenario needs to be addressed. This is the goal of the Internet of Satellites (IoSat) paradigm which, as opposed to a common backbone, proposes the creation of a network using a peer-to-peer architecture. In particular, the same satellites take part of the network by establishing intermediate collaborations to deploy a FSS. This paradigm supposes a major challenge in terms of network definition and routing protocol. Therefore, the present work not only details the IoSat paradigm, but it also analyses the different satellite network models. Furthermore, it evaluates the routing protocol candidates that could be used to implement the IoSat paradigm. OAPA
... A forager is the bee agent that receives data packets from a packer and delivers them to their destination [4,5]. The authors show that BeeAdHoc consumes significantly less energy in comparison to DSR, AODV and DSDV [6]. ...
... A protocol is considered proactive when each node keeps an up-to-date information reflecting the state of the network and this information is used when a message should be sent. An example of proactive protocol is DSDV (Destination-Sequenced Distance-Vector) [27], based on the Bellman-Ford algorithm using an active and costly information update mechanism between nodes to discover and maintain the correct paths towards the destinations. A protocol is considered reactive when the routing path is created only when necessary; reactive protocols are generally preferred. ...
Scalable routing for wireless communication systems is a compelling and challenging task. To this aim, routing algorithms exploiting geographic information have been proposed. These algorithms refer to nodes by their location, rather than their address, and use those coordinates to route greedily towards a destination. With the advent of unmanned airborne vehicle (UAV) technology, a lot of research effort has been devoted to extend position-based packet routing proposals to three dimensional environments. In this context, Flying Ad-hoc Networks (FANETs), comprised of autonomous flying vehicles, pose several issues. This work focuses on the state-of-the-art, stateless geographic packet routing protocols conceived or adapted for three-dimensional network scenarios. Proposals are evaluated over a common scenario through a comprehensive comparative analysis.
... In a sensor network, in addition to the problem related to the distributed operation, the network nodes are in a high-energy constraint for running on batteries. Thereby the multihop routing protocols like AODV (Perkins, Belding-Royer, & Das 2003), DSR (Johnson, Hu, & Maltz, 2007), OLSR (Clausen, & Jacquet 2003) and DSDV (Perkins & Bhagwat 1994) already standardized by the IETF are not suitable because they cause high-energy consumption of the nodes. Primarily, the routing protocols in the limited Figure 3. TCP/IP model, a Wi-Fi stack example, and the 6loWPAN stack network resources should operate under a set of constraints that routing protocols dedicated to ad-hoc networks do not generally take into account. ...
To deliver security services (integrity, confidentiality, authentication, availability), it is necessary that the communicating nodes share cryptographic keys for encryption and authentication. However, it is well known that the encryption systems represent the first line of defense against all types of attacks. Furthermore, cryptographic techniques must be designed to detect the execution of the most dangerous attacks. In addition, these techniques must be small to fit the limited resources of the WSN. The aims of this chapter are to discuss the mechanisms used to secure communications. To show their main adaptations required for adoption in smart sensors, which are described in the literature, particularly in terms of key management and distribution. And finally to detail the different solutions proposed in the literature to secure the communication of smart and constrained sensor networks in the Internet of Things based on cryptography and intrusion detection systems.
... Dynamic routing mainly depends upon the state. Mobile ad hoc network present the dynamic routing [10]. These protocols can be divided into three classes" proactive class, reactive class and hybrid class as shown in figure 2. . ...
... Here we have studied the performance of PSR using simulation with Network Simulator 2.For evaluating the performance factors, here we have compared the PSR with other protocols AODV [5], DSDV [7], DSR [8] which are different in nature. Here, we first describe how the experiment scenarios are configured. ...
Most important thing in wireless network which has attracted many research communities is opportunistic data forwarding. Opportunistic data forwarding is used mainly for the stationary wireless network. Mobile ad hoc network is becoming a very popular and wider wireless network. Ad hoc network uses different network topologies which usually changes with time. Therefore there is a challenge to design a new protocol which can provide a better connectivity among ad hoc network. In this paper, therefore, we focus on the design of a new efficient source routing protocol which can give a better transportation with minimum overhead. But it has not been widely used in Mobile ad hoc Networks due to the absence of lightweight efficient proactive routing protocol. In this paper, here proposed proactive source routing scheme. Proactive source routing protocol (PSR) maintain more network topology compared to other distance vector routing algorithms with small overhead. PSR achieve better data transportation than other protocols.
... Proactive protocols are not recommended for large sized MANETs as there is a necessity to maintain node entries for each and every node of network, resulting in large volume of data at the routing table of every unit. Destination Sequenced Distance Vector (DSDV), Topology Broadcast based on Reverse Path Forwarding (TBRPF), Optimized Link State Routing (OLSR), Fisheye State Routing (FSR) and Wireless Routing Protocol (WRP) are dominantly referred proactive routing protocols [6][7][8][9][10]. ...
Effective routing protocol in ad hoc networks involves consideration of key factors like latency, mutual interference between on-going communication during route initiation, power consumption and effective re-routing process for unstable topology conditions in presence of node mobility. Recent ad hoc network applications involve quest for a high throughput, robustness and differentiated service awareness in the context of present 3G/4G and future 5G standards. This paper discusses the motivation for routing strategy with paradigm shift to meet the aspiration set forth under high traffic volume applications.
... The amount of information propagated each time is typically proportional to the scale of the MANET. Examples of proactive protocols include Wireless Routing Protocol (WRP) [18] and Destination Sequenced Distance Vector (DSDV) [22]. ...
... Several classifications of routing algorithms in wireless ad hoc network exist toward the specificities of wireless networks such as node mobility, devices' constraints and the application of the network. According to the architecture of the network flat or hierarchical, the used strategy [4](reactive or proactive) or the underlying technology the following classifications exist: 2.1 Proactive protocols: these routing algorithms such as OLSR (Optimized Link State Routing) [5] and DSDV (Dynamic Destination-Sequenced Distance-Vector) [6] are inspired from the wired routing in the way that each node over an ad hoc network saves the whole topology of the network in its routing table. Node mobility and topology changing are treated by periodic hello messages. ...
Similar to conventional wireless networks, WSNs are based on multi hop routing to ensure connectivity and data forwarding which makes the routing service a challenging task due to the nature of sensors usually limited in memory, battery and computing capacities as well as the nature of the environment which is hostile and unpredictable making the routing protocols developed for conventional wireless network useless for WSNs without modifications and adaptations for the new context of WSNs. Thus in this paper we present an optimized version of AODV protocol for WSNs which takes into consideration the traffic pattern of WSNs and sensors’ constraints. In the proposed protocol we affect the task of route discovery to the base station which periodically informs sensors about its location instead of letting this task to sensors which consumes the network resources due to the broadcasting nature of the route discovery. We have also proposed a key distribution scheme destined to establish a symmetric encrypting key between each sensor and the base station, the proposed key management scheme uses the underlying routing requests to execute handshakes and key update which have greatly saved the network resources and ensured a good threshold of security.
... There are mainly two different types of routing protocols which are proactive routing protocols and reactive main difference between these two types of protocols is how and when these two different types of protocols discovers and maintains routes. Proactive routing protocol keeps all routes from all the sources to the ges are occurred in the network periodic broadcasting updates all the necessary Example of proactive routing protocol is Vector Routing (DSDV) 3 . Reactive routing protocols find route only when necessary to communicate with a particular destination. ...
Mobile ad hoc network is a temporary wireless network consisting of mobile nodes. Frequent route breakage is a common event in Every node is equipped with battery energy. This form of energy is one of the scarce resources in MANET. This paper is focused on promiscuous mode to observe packets coming from the nodes within a direct transmission range. At the same time critical energy of a routing node is used to find the low energy node on an ongoing route. This low energy node will perform local route repairing scheme such as QLR-APM to find alternate node of low energy node which avoids route breakage in MANET. This approach prevents route breakage and the same time packet loss and retransmission of packets are reduced in MANET. Thus it is easily seen that QLR-APM incorporating this proposed approach outperforms than QLR-APM.Dhaka Univ. J. Sci. 64(1): 39-44, 2016 (January)
... Every node which is moving has a table where they store all destinations and information like next hop node, total number of hops towards destination, sequence number of the destination node etc. This protocol uses both periodic and triggering routing updates to create consistent table [10]. Advantage: ...
... The Destination-Sequenced Distance Vector [8] is proactive table driven routing protocol which is based on based on Bellman-Ford routing algorithm. Each node in the network maintains routing table which contains all available destinations with associated next hop towards destination, metric and destination sequence number. ...
... There are many routing protocols designed for MANET routing. All of these protocols can be categorised into three groups: proactive like DSDV [4], reactive like AODV [5] and DSR [6] and hybrid like ZRP [7]. Proactive routing protocol tries to maintain network state by exchange routing information and as a result not very scalable and suffer from heavy overhead. ...
... For example, the flooding of interest packets due to interest packet-forwarding policies, whereby packets are forwarded to all of a node's neighbors at every new hop, can cause a broadcast storm. Moreover, the CCN model uses data structures such as routing tables, and adopts algorithms such as the ad hoc on-demand distance vector (AODV) [21], dynamic source routing (DSR) [14], and greedy perimeter stateless routing (GPSR) [15]. These algorithms are vulnerable in highly dynamic vehicular environments because of the inherent path intermittence [29]. ...
In this study, we propose a variation of the RAdNet for vehicular environments (RAdNet-VE). The proposed scheme extends the message header, mechanism for registering interest, and message forwarding mechanism of RAdNet. To obtain results, we performed simulation experiments involving two use scenarios and communication protocols developed from the Veins framework. Based on results obtained from these experiments, we compare the performance of RAdNet-VE against that of RAdNet, a basic content-centric network (CCN) using reactive data routing, (CCN$_R$), and a basic CCN using proactive data routing, CCN$_P$. These CCNs provide non-cacheable data services. Moreover, the communication radio standards adopted in the scenarios 1 and 2 were respectively IEEE 802.11n and IEEE 802.11p. The results shown that the performance of the RAdNet-VE was superior to than those of RAdNet, CCN$_R$ and CCN$_P$. In this sense, RAdNet-VE protocol (RVEP) presented low communication latencies among nodes of just 20.4ms (scenario 1) and 2.87 ms (scenario 2). Our protocol also presented high data delivery rates, i.e, 83.05\% (scenario 1) and 88.05\% (scenario 2). Based on these and other results presented in this study, we argue that RAdNet-VE is a feasible alternative to CCNs as information-centric network (ICN) model for VANET, because the RVEP satisfies all of the necessary communication requirements.
A multicast tree with a minimum cost is required to improve the quality of service (QoS) constraints. Due to combinatorial issues, conventional approaches are not appropriate for more extensive and dynamic networks. Researchers have applied Swarm Intelligence (SI)-based techniques like Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO) and Evolutionary-based method like Genetic Algorithm (GA) to deal with the combinatorial problems. ACO is among the best choices for researchers to solve the multicast routing problem in modern communication networks. The novelty of the proposed Heuristic Initialization Based Modified ACO (HIMACO) is the use of safety features that mimics the behaviour of real ants and the use of heuristics-based initialization rather than random initialization.The simulation result shows the superiority of proposed HIMACO routing algorithm in context with runtime and packet loss as compared to other popular swarm and evolutionary based algorithms as well as conventional algorithms. The execution time of HIMACO has decreased by 72%, 65%, 56%, 40% and 35% as compared to Prim's Algorithm, Dijkstra's Algorithm, and conventional GA, PSO and ACO, respectively. The packet loss probability of HIMACO is also reduced by 56%, 54%, 46%, 37% and 33% than Prim's Algorithm, Dijkstra's Algorithm, and conventional GA, PSO and ACO, respectively. Also, we have presented the analysis of the parameters tuning for HIMACO in this paper.
A mobile ad hoc network (MANET) is an assortment of mobile nodes that exchange information with a non-mounted framework and centralized organization. All node behaves as a router when have to find out the routes from the source node to the destination node and maintain those routes within the communication network. But routing in MANETs becomes complex due to the dynamic environment of the network and bandwidth limitation. Swarm intelligence (SI) primarily nature-based algorithms have pulled in a great deal of consideration of the researchers to solve this problem. SI-based ant colony optimization (ACO) algorithms appeared to be fantastic for creating routes in a network due to the issue of finding the shortest paths by ant is similar to the issue of routing in networks. This paper shows an exhaustive review and evaluation of numerous ACO-based routing protocols in MANETs.
Wireless Mobile Ad-Hoc Networks (MANETs) are infrastructure-less networks commonly used for dynamic connection between nodes. These networks work without any external router for maintaining the connection and the nodes themselves behave like a router. Ad-Hoc On Demand Distance Vector (AODV) routing is a widely used protocol for managing communications between the mobile nodes. A blackhole attack is one in which the nodes create a false route through them and then perform malicious activities on the transmitted packets. This paper presents a modification of the existing AODV routing protocol to prevent blackhole attacks in MANETs in an erratic terrain with a high probability of packet loss. A mathematical proof is given to confirm the effectiveness of the proposed algorithm with respect to the previous solution in the literature.
In Mobile Ad Hoc Networks (MANETs), routing overhead is a major problem since a bandwidth and an energy of mobile node are limited. Due to node’s mobility and an unreliable wireless link, a path connecting between a source and a destination will break frequently. This causes a network-wide flooding of routing packets being invoked repeatedly, leading to high packet loss and network congestion, especially in a high mobility network. In this paper, we propose an efficient route repair method based on Query Localization technique. The routing packets, which propagate back to a source, are discarded to alleviate unnecessary rebroadcasting. Simulation results show that our proposed method can reduce routing overhead and MAC collision rate without sacrificing packet delivery ratio compared to existing protocols.
Routing in mobile ad hoc network was a subject of intense research during early 1990s to mid 2000. Ad hoc networks are relevant in research even today due to applications involving vehicle to vehicle communication and embedded processing involving IoTs. Routing in any network can be viewed abstractly as finding and maintaining shortest-path between communicating pairs of nodes in a weighted graph. Each node maintains a preferred neighbor, which is the next hop on the path to reach a destination. Two different classes of routing algorithms have been proposed in the literature, namely, proactive and reactive. In a proactive algorithm, each node maintains updated list of destinations and periodically advertises routing table to all the neighbors. This class of algorithms suffer from slow convergence. Reactive or on-demand routing algorithm, on the other hand, initiate a route discovery when a node does not have a fresh enough route to a destination it requires to reach. Flooding of route request queries can lead to congestion in network. The other problem is high latency in route discovery. In this chapter, we examine four selected and interesting variations of the routing schemes, viz., DSDV, DSR, AODV and ZRP. DSDV is a proactive algorithm and one of the earliest work in the area. DSR is a reactive routing protocol based on source initiated routing. AODV is again a reactive protocol, but it incorporates both unicast and multicast in a single protocol. ZRP is a zone based hybrid routing scheme. The scope of proactive scheme is restricted to a local neighborhood of each node called its zone. A route to a distant node is determined by querying a subset of nodes in the network.
Integration of mobile ad-hoc networks (MANETs) into infrastructure-based networks allows mobile users to access other networks. At a network boundary, some node with multiple interfaces plays an important role as a gateway. Gateway discovery mechanism is necessary for mobile nodes to discover nearby gateways but causes message exchange overhead. In order to control the overhead, we present a novel location-aided gateway discovery protocol with directional broadcast algorithm and Solicitation technique. Simulation results show that our proposed protocol can reduce the overhead, as compared to conventional protocols. Moreover, it improves packet delivery ratio, end-to-end delay, and gateway discovery time.
In this survey paper we will focus about existing routing protocols with their characteristics and performance. Mobile ad hoc network is a group of nodes connected through with no centralized medium and access point. This is self organizing and self configuring device. MANETs are very innovative and challenging areas of networking background. In few years a enormous research has been done on (MANETs). There are still some challenges and issues because of limited resources. Due to the reason of these limited resources to design an effective and intelligent routing approach is still a challenge in (MANETS). Mobile ad hoc network is very flexible and stable network. We can easily setup this type of network at anytime anywhere, but the main problem is topology changes rapidly. To overcome these types of problems numbers of routing protocols have been developed.
In this paper, we propose a variation of the RAdNet for vehicular environments (RAdNet-VE). The proposal extends the message header, mechanism for registering interest, and message forwarding mechanism of RAdNet. Based on results obtained from simumation experiments, we compare the performance of RAd-Net-VE against that of RAdNet, a basic content-centric (CCN) using re-active data routing, (CCN R), and a basic CCN using proactive data routing, (CCN P). These CCNs provide non-cacheable data services. The results shown that the performance of the RAdNet-VE was upper than those of the RAdNet, CCN R and CCN P. In this sense, RAdNet-VE protocol (RVEP) presented low latencies of communication among nodes, such as 20.4 ms using IEEE 802.11n radios in the scenario 1 and 2.87 ms using IEEE 802.11p radios in the scenario 2. Our network also presented high data delivery rates, i.e, 83.05% using IEEE 802.11n radios in the scenario 1 and 88.05% using IEEE 802.11p radios in the scenario 2. Resumo. Neste trabalho, ´ e proposta uma variaçvariaç˜variação da RAdNet para ambien-tes veiculares (RAdNet-VE). A proposta estende o cabeçalho de mensagens, o mecanismo para registrar interesses e o mecanismo para encaminhamento de mensagens da RAdNet. Com base nos resultados obtidos a partir de experi-mentos de simulaçsimulaç˜simulações, foi realizada uma comparaçcomparaç˜comparação entre os desempenhos da RAdNet-VE, RAdNet, uma rede centrada em conteúdos (CCN) básica usando roteamento reativo de dados (CCN R) e uma CCN básica usando roteamento proativo de dados (CCN P). Estas CCNs forneceram serviços dados sem cache. Os resultados mostraram que o desempenho da RAdNet-VE foi superior aos da RAdNet, CCN R e CCN P. Neste sentido, RAdNet-VE apresentou baixas latências de comunicaçcomunicaç˜comunicação entre nós, tais como 20.4 ms usando rádios IEEE 802.11n no cenário 1 e 2.87 ms usando rádios IEEE 802.11p no cenário 2. A RAdNet-VE também apresentou altas taxas de entrega, ou seja, 83.05% usando rádios IEEE 802.11n no cenário 1 e 88.05% usando rádios IEEE 802.11p no cenário 2.
Mobile ad hoc network (MANET) is the collection of mobile nodes that can communicate in limited area without any infrastructure. Every ad hoc network acts as router, to search the destination address that is not connected directly. Limited coverage area of the MANET creates a problem for node to communicate globally and with the nodes that are away from the area of MANET. The feature of MANET is utilized properly when nodes are able to connect with other networks. Mobile IP is a standard protocol which supports the mobility in wireless Internet environment to keep connected mobile host roam. Mobile IP provisioning to MANET nodes can play an important role in order to utilize foreign network’s resource. Different frameworks of integration are suggested by researchers.
A wireless mobile sensor network is a group of independent wireless mobile sensor nodes which forms a temporary network without the use of any centralized management or fixed infrastructure. Communication protocols are responsible for maintaining the routes in the network and guarantee reliable communication. On the other hand, appropriately adjusting the sensors transmission power is crucial for reducing network energy consumption. This paper proposes a comparison of routing strategies and the impact of variable transmission power for each mobile sensor node on the performance of these communication techniques for mobile wireless sensor networks with the aim of outlining design considerations of protocols for mobile environments. We analyze the performance of both reactive routing protocols Ad hoc On Demand Distance Vector protocol (AODV), Dynamic Source Routing (DSR) protocol and proactive protocol Destination-Sequenced Distance Vector routing protocol (DSDV) in different scenarios. The selected protocols are compared on the basis of various parameters, which include packet delivery ratio, total packet loss, network lifetime, and control overhead using variable number of nodes and speeds.
A wireless ad hoc network is formed by a set of mobile hosts that communicate over wireless medium such as radio. Due to ease of deployment, it has many mission-critical applications in military as well as in civilian environments. Those applications usually have strong requirements for data confidentiality and privacy. In this chapter, we address one of the most challenging confidentiality and privacy issue with wireless ad hoc networks: anonymity of communication. Communication anonymity entails the hiding of information that two hosts communicate with each other. In general, there are three ways of achieving this goal, i.e., hiding the source, hiding the destination, or hiding the source-destination combination of a communication [10]. In wireless ad hoc networks, all communications over a network are vulnerable to eavesdropping. A connection between two hosts can be exposed by the source and destination fields in the headers of data packets sent over the connection. As a solution, the two hosts can set up an anonymous connection between each other and encrypt each data packet in such a way that the two hosts never appear in the source and the destination fields of the packet header simultaneously [12]. However, this solution requires that all data packets of a connection follow the same and predetermined routing path for delivery, while in a wireless ad hoc network, there is no guarantee of a fixed routing path between any two hosts, due to node mobility and changing topology. To overcome this problem, a set of anonymous routing protocols were proposed recently in the literature [7, 3, 14]. ANODR [7] is an anonymous on-demand routing protocol for wireless ad hoc network. It has two functions. First, it discovers a route between two hosts on demand and sets up an anonymous connection. Second, when the route is broken, it repairs the route or discovers a new route and maintains the connection. On a multi-hop route, each hop is assigned a unique route pseudonym and each intermediate node stores the mapping between the route pseudonyms of its previous hop and its next hop in a forwarding table. When a data packet is sent, both its source and destination addresses are masked, and it is forwarded based on the route pseudonym it carries. In the beginning, it carries the route pseudonym of the first hop on its route. The source host then broadcasts the packet within its transmission range. After receiving the packet, the first node will look up its forwarding table, modify the packet to carry the route pseudonym of the next hop, and broadcast the packet. So after each transmission, the packet will carry a different route pseudonym. In addition, each intermediate node also changes the appearance of the packet (i.e., bit pattern) and uses mixing techniques [4] such as random delay to thwart all tracing attempts. From the above description, we see that ANODR utilizes the link-layer broadcast and link layer encryption mechanism during data forwarding process. In order to improve reliability of link layer broadcast, it uses a simple anonymous acknowledgment protocol. In the protocol, upon receipt of a data packet, the receiver node should locally broadcast an anonymous ACK packet. Obviously, there exists a timing link between a data packet and its triggered ACK packet, which can be utilized by an eavesdropper to deduce the intended receiver of a data packet. ANODR assumes that an eavesdropper can only learn the transmitting node of a packet from its MAC address and sets it to all-1's. Unfortunately, this is not a sound assumption. There are technologies for locating a transmitting node based on physical layer characteristics such as signal strength [1, 13]. In addition, the adversary can deploy many near-invisible sensors (e.g., camera) to locate and track all node movements in a particular area. In this situation, ANODR cannot meet its reliability requirements without compromising anonymity. In this chapter, we propose a MAC protocol to address the needs for anonymity and reliability with respect to link-layer broadcasts simultaneously. Our protocol is resistant against powerful eavesdroppers we described above, who can reveal the senders of all transmissions. In our protocol, each node broadcasts a batch of data packets, instead of one data packet, at a time. The packets in the batch may be addressed to different receivers. It is possible that some packets are lost due to collisions or interferences. In order to deliver as many packets as possible, the sender needs to query every receiver about their receiving status and decide which packets need to be retransmitted. This is achieved by a polling scheme. The sender selects a subset of neighbors and sends POLL messages to each of them individually. Each node being polled should send a REPLY message back. All messages are encrypted, which contain information such as the sequence numbers of received packets. The polling list is constructed independently from the list of receivers to which data packets have been sent. So the adversary cannot build strong links between the two lists. The rest of the chapter is organized as follows. In Sect. 2, we describe the details of the protocol design. In Sect. 3, we present a security analysis of the protocol. In Sect. 4, we show the performance evaluation results of the protocol obtained from ns-2 [2] simulations. Sect. 5 is a summary of the chapter.
Wireless mobile ad-hoc networks are characterized as networks without any physical connections. Multipath routing is a new extension to many traditional routing protocols in MANETs. Using multipath routing in MANETs can save energy, reduce frequent routing update, enhance data transmission rates, and increase wireless network bandwidth. There are numerous Multi-paths on-demand routing algorithms exist to discover several paths instead of one, once the routing is performed. In this paper a new Robust Fault Tolerant AOMDV (RFTA) algorithm is proposed to improve the fault tolerance and efficient routing in mobile adhoc network (MANET). The algorithm is compared with various multi path routing protocols like SMR, SMS and MDSR. The efficiency of the protocol has been evaluated on different scenarios using performance metrics such as packet delivery ratio and end-to-end delay.
ResearchGate has not been able to resolve any references for this publication.