Figure 6 - uploaded by Bin Hu
Content may be subject to copyright.
Source publication
A directional routing approach for multihop ad-hoc networks, is presented which has been applied to two on-demand routing protocols: namely dynamic source routing (DSR) and ad-hoc on-demand distance vector routing (AODV). Both DSR-based and AODV-based directional routing protocols are designed to balance the tradeoff between co-channel interference...
Similar publications
Simulation and comparison of the routing protocols for network topology hold a significant position in the performance evaluation of wireless networks. This paper, discusses performance evaluation of Ad-hoc on demand Distance Vector (AODV) and Dynamic Source Routing (DSR), routing protocols for static WSN using NS-2. Energy efficiency, latency, thr...
In this paper, we simulate three ad hoc network routing protocols namely DSDV(Destination Sequenced Distance Vector), DSR(Dynamic Source Routing) and AODV(Ad Hoc On Demand Distance Vector) and simulation carries out using network simulator version 2. Furthermore, end-to-end delay, normalized routing load, packet delivery ratio, throughput and jit-t...
An ad-hoc network is self-organizing and adaptive. Networks are formed on-the-fly, devices can leave and join the network during its lifetime, devices can be mobile within the network, the network as a whole may be mobile and the network can be deformed on-the-fly.Devices in mobile ad-hoc networks should be able to detect the presence of other devi...
![Figure 1. Illustration of normal ECG [4].](publication/373722574/figure/fig1/AS:11431281186945812@1694090049716/Illustration-of-normal-ECG-4_Q320.jpg)
Cardiac disorders are a leading cause of global casualties, emphasizing the need for the initial diagnosis and prevention of cardiovascular diseases (CVDs). Electrocardiogram (ECG) procedures are highly recommended as they provide crucial cardiology information. Telemedicine offers an opportunity to provide low-cost tools and widespread availabilit...
Mobile Ad-hoc Network (MANET) is a continuously self-configuring, infrastructure-less network. Each device in MANET moves independently and frequently, where the links between the devices are changeable and the whole topology of network is uncertain. To improve the feasibility of such network, a great deal of network-layer protocols has been design...
Citations
... Much research has been done on bandwidth-limited wireless ad hoc networks to minimize the number of routing protocol control messages or reduce their broadcast scope [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. Doing so improves the bandwidth utilization efficiency; a smaller fraction of messages propagating in the network is occupied by control messages, and a good fraction goes to data delivery instead. ...
... Doing so improves the bandwidth utilization efficiency; a smaller fraction of messages propagating in the network is occupied by control messages, and a good fraction goes to data delivery instead. For this paper, the different bandwidthefficient protocols have been divided into 2 main classifications; Those that channel/direct control and data messages between sources and destinations [1][2][3][4][5][6][7][8][9] and those that do not have directional forwarding [10][11][12][13][14][15][16]. From these studies, there appears to be a gap in directional routing protocols that do not use Global Positioning System (GPS) or complex directional antennas, which is the inspiration behind this paper. ...
... Some protocols take advantage of devices that have sophisticated directional antennas, beam forming and Multiple-Input-Multiple-Output (MIMO) capabilities [1][2][3][4]. Directional antennas concentrate their radiation pattern over a smaller angle, unlike omnidirectional antennas, which ideally have a uniform radiation pattern in all directions [1,30]. The ability to cast a message in a specific direction while avoiding other areas around the node is quite a bandwidth efficient. ...
... This will further enhance the achievable end-to-end throughput in multihop communication with efficient spatial reuse and reduced node power consumption. In other words, directional cognitive control and IoT application transmission will help to attain the increased end-to-end throughput by reducing the interference through directional antennas [21][22][23][24][25]. State-of-the-art routing protocols in "cognitive radio-based IoT networks" use omnidirectional transmission for application data (DATA/ACK) and cognitive control message exchange. ...
Dynamic opportunistic channel access with software-defined radio at a network layer in distributed cognitive IoT introduces a concurrent channel selection along with end-to-end route selection for application data transmission. State-of-the-art cognitive IoT big data-based routing protocols are not explored in terms of how the spectrum management is being coordinated with the network layer for concurrent channel route selection during end-to-end channel route discovery for data transmission of IoT and big data applications. In this paper, a reactive big data-based “cognitive dynamic source routing protocol” is proposed for cognitive-based IoT networks to concurrently select the channel route at the network layer from source to destination. Experimental results show that the proposed protocol cognitive DSR with concurrent channel route selection criteria is outperformed. This will happen when it is compared with the existing distributed cognitive DSR with independent channel route application data transmission.
... Our claim is established through performance analysis and simulation using OMNeT??. We also compare our proposed algorithm with two other routing algorithms for WSNs that are based on limited broadcasting with nodes having a 3-sector antenna [12] and the load gradient of the sensor nodes [33]. It is shown that the overall usage of nodes in our algorithm is lower than that of the other algorithms, and as such, no routing loop is formed. ...
... These algorithms have better node utilizations than that of the conventional routing. The authors in [12] proposed a modified version of AODV and DSR, where directional antennas were used to broadcast the data in a limited zone and were found to be energy efficient. We consider the routing algorithm [33] as well as the limited broadcast-based routing algorithm [12] for comparison with our proposed routing algorithm. ...
... The authors in [12] proposed a modified version of AODV and DSR, where directional antennas were used to broadcast the data in a limited zone and were found to be energy efficient. We consider the routing algorithm [33] as well as the limited broadcast-based routing algorithm [12] for comparison with our proposed routing algorithm. The performance of the proposed protocol is better than that of the existing two protocols with respect to the energy consumption, overhead, node usage and throughput. ...
An efficient routing protocol for a wireless sensor network (WSN) with multiple sinks is proposed. Sensor nodes containing three-sector antennas are deployed randomly in a monitoring area. All sensors discover and record their neighbors’ locations, including those of the sink(s), with minimal control overhead. In routing, sensor nodes forward their data to a sink either directly by at most two hops or through a number of intermediate nodes, using their alternative sectors. The sensor nodes that are one or two hops away from a sink may follow the first route, and a major portion of the remaining sensors follow the second route. Each sensor in this case forwards the sensed data to a neighbor through one of the sectors, and the data are further forwarded by alternative sectors of the successive nodes until reaching a sink. An analysis for the proposed routing is provided, focusing on the second routing mechanism, where the success of data reaching a sink with different sector orientations of the sensor nodes is shown. An in-depth analysis of the proposed WSN and simulation using OMNeT++ are performed, and satisfactory results are found.
... Several research works have utilized the concept of direction-based in forwarding strategy for VANET as in [62,[79][80][81][82]. Directional Greedy forwarding strategy uses two forwarding strategies; position -based forwarding to determine nodes which are close to the packet's destination; in addition, directional-based forwarding aims to determine the nodes that are moving toward the packet's destination. ...
Vehicular Ad-hoc Network (VANET) is gaining more attention from academia and industries sectors due to its ability to enhance the road safety and improve the mobility and green environment. VANET networks do not depend on a fixed structure where vehicles moving very fast, which can result in frequent link breakages. Thus, routing protocols must be efficient and reliable to ensure data delivery, indeed, forwarding strategy is considered the core part of routing protocol where it is responsible for path selection. In literature, several works have been proposed to improve the performance of routing and forwarding strategies over vehicular networks. The main problem of current works is that they did not consider the main impact factors such as relative velocity between two connected vehicles, vehicle density, and channel condition. Therefore, this paper presents a review of the most related work in the field of forwarding strategy over VANET. A new classification of forwarding strategy is presented in this paper based on the selection parameters. Each classification presents a comprehensive review to identify the weaknesses and strengths points using examples.
... As the name implies, Directional Dynamic Source Routing (DDSR) [21] is the original DSR over directional antennas. The best route from the source node to the destination node is selected according to hop count, power budget and overlap count. ...
... In DAODV [21], positional information of the current node will be inserted into the RREQ and RREP. As shown in Figure 1, the source node A initiates the route discovery process to destination node J by broadcasting RREQ to its neighbor nodes. ...
Directional antennas have the potential to provide a fundamental breakthrough in ad hoc network capacity. Omni-directional nature of transmission restricts the network capacity, where distribution of energy in all directions other than the intended direction of the destination node not only generated unnecessary interference to other neighboring nodes but also decreases the potential range of transmission. Directional antenna systems are increasingly being recognized as a powerful way of increasing the capacity, connectivity, and covertness of MANETs. In this paper, we survey the state-of-the-art routing protocols and give a comparison result of them with respect to the important challenging issues. We study the advantages and disadvantages of the routing protocols using directional antenna and also highlight performance issues of each routing technique. At the end, an explicit comparison table is presented and discussed.
... ARC-AODV [51] is a directional AODV (Ad Hoc On Demand Vector) protocol with adaptive range control. DAODV [82] is another version of directional AODV. In both ARC-AODV and DAODV, route requests (RREQs) are broadcast and flooded in the entire network when the route between the source and the destination is still unknown. ...
Compared with omni-directional antennas, directional antennas have many merits, such as lower interference, better spatial reuse, longer transmission range and the improved network capacity. Directional antennas enable numerous emerging outdoor and indoor applications, which have been addressed in many recent studies. Despite the advances in wireless networks with directional antennas (DAWNs), there are many research challenges in all layers of DAWNs. This paper presents a detailed study on recent advances and open research issues on DAWNs. Firstly, we briefly introduce the classification of directional antennas, antenna radiation patterns, antenna modes as well as the challenges in the physical layer of DAWNs. Then, we present research issues on the MAC layer, followed by the current solutions as well as open research problems. We also discuss the research issues on the routing layer, the transport layer and the performance evaluation of DAWNs. A brief introduction of indoor DAWNs is given in this paper as well.
... ARC-AODV [51] is a directional ad hoc on-demand vector (AODV) protocol with adaptive range control. DAODV [82] is another version of directional AODV. In both ARC-AODV and DAODV, RREQs are broadcast and flooded in the entire network when the route between the source and the destination is still unknown. ...
Compared with omni-directional antennas, directional antennas have many merits, such as lower interfer-ence, better spatial reuse, longer transmission range, and improved network capacity. Directional antennas enable numerous emerging outdoor and indoor applications, which have been addressed in many recent stud-ies. Despite the advances in wireless networks with directional antennas (DAWNs), there are many research challenges in all layers of DAWNs. This paper presents a detailed study on recent advances and open research issues on DAWNs. Firstly, we briefly introduce the classification of directional antennas, antenna radiation patterns, antenna modes, and the challenges in the physical layer of DAWNs. We then present research issues on the medium access control (MAC) layer, followed by the current solutions as well as open research prob-lems on the MAC layer of DAWNs. In addition, we also discuss the research issues on the routing layer and the transport layer. Moreover, other research challenges on the performance evaluation of DAWNs and a brief introduction of indoor DAWNs are given in this paper as well. In conclusion, we summarize the current research issues on DAWNs as well as prospects in the future.
... B. Hu H. Gharavi [15] proposed a directional routing approach for two multi hop ad hoc networks namely AODV and DSR. It considers hop count, power budget and overlaps between adjacent beams for route discovery process. ...
A mobile ad hoc network is networks which utilizes multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Efficient dynamic routing is a challenge in such a network. On-demand routing protocol is widely developed in ad hoc networks because of its effectiveness and efficiency. In this paper, the significance of Ad hoc On-Demand Distance Vector (AODV) routing protocol, Load Balancing AODV, Modified AODV, Adaptive Secure AODV have been reviewed. The simulated parameters such as packet delivery ratio, throughput, end to end delay, routing overload and energy were taken in to consideration. The simulated results showed that the AODV protocol enhances the packet delivery ratio, throughput, decreases the routing overload and end to end delay. Keywords: Load Balancing(LB) AODV , Vector Routing Protocol (VRP), Ad Hoc On-Demand Trusted-Path Distance Vector (AOTDV) Routing Protocol.
... In basic DSR protocol, the route discovery phase is initiated to find a path between source and destination with minimum number of hops (Hu and Gharavi, 2007). However, another metric for the route establishment process is introduced here. ...
... In reactive ad hoc routing protocol DSR (Hu and Gharavi, 2007), two major phases are incorporated for successful multi-hop routing: route discovery and route maintenance. Furthermore, the phase of route discovery is split into two sub phases: RQ and RR. ...
Efficiency of mobile ad hoc networks (MANETs) primarily rely on a set of quality of service (QoS) parameters such as bandwidth, delay, battery power etc. be guaranteed during the life time of application of the network. The support of these parameters can be more efficient with a cross-layer approach to design and implementation of routing protocols for MANETs. In fact, access mechanisms of radio channels significantly affect the QoS support and improvement of application performance. In this paper, we cross-layer routing issues and present an ad hoc routing protocol called CLDE, which incorporates the on-demand dynamic source routing (DSR) protocol in coordination with IEEE 802.11e MAC protocol (EDCA). The aim of this protocol is to find a path for a flow with lowest possible delay. In this approach, each node needs to estimate periodically the average transmission delay for delay-sensitive applications. This information is incorporated in routing control packets of DSR during route discovery. In order to address transient network characteristics due to new applications admitted to the network, we develop a buffer management scheme for the audio packets as per their end-to-end transfer delay and the current expiration delay. Simulation results depict the improved performance of our proposal for delay-sensitive applications.
... Interference between base stations is a major factor limiting the achievable throughput capacity in such networks. Most previously proposed multi-hop greedy routing algorithms, suggest using directional antennas [1] or power control mechanisms [2] to mitigate the effects of interference. Others take a centralized approach to routing thus rendering them impractical for large scale ad-hoc networks [3], [4]. ...
... However the algorithm only considers the use of omni-directional antennas. Although the algorithm proposed by [1] considers directional routing protocols, it takes a centralized approach like [3], [4] while minimizing the number of beam overlaps, power budget and the hop count among all paths between the source and the destination thus rendering it inefficient for large networks. ...
... However the algorithm only considers the use of omni-directional antennas. Although the algorithm proposed by [1] considers directional routing protocols, it takes a centralized approach like [3], [4] while minimizing the number of beam overlaps, power budget and the hop count among all paths between the source and the destination thus rendering it inefficient for large networks. The GLIF algorithm is scalable since it allows the ABS's to make localized greedy routing decisions using minimal topological information. ...
Cellular ad-hoc networks facilitate rapid deployment of familiar communication technology in hostile battlefield environments. They are comprised of randomly organized portable base stations that share the same frequency spectrum and cooperatively relay each other's traffic to centralized base stations. Such portable base stations have limited battery power and processing capabilities. Owing to its simplicity and minimal requirements, Geographic Greedy Forwarding (GGF) algorithms are generally well suited for cellular ad-hoc networks. But GGF algorithms are not interference aware. Interference between base stations is a major factor limiting the achievable throughput capacity in such networks. Most previously proposed multi-hop greedy routing algorithms, suggest using directional antennas or power control mechanisms to mitigate the effects of interference. Others take a centralized approach to routing thus rendering them impractical for large scale ad-hoc networks. In this paper we propose a Greedy Least Interference Forwarding (GLIF) algorithm that proactively avoids interference while using minimal network topology information. Simulations have shown that GLIF achieves throughput improvements over basic GGF algorithms that use directional antennas and power control mechanisms alone to avoid interference.
