Pekka Savola · 2007
The Dynamic Source Routing Protocol (DSR) is an efficient routing protocol proposed and designed especially for multi-hop Wireless Mobile Ad-hoc Networks. The protocol automatically discovers ("Route Discovery ") and maintains ("Route Maintenance") the routing in the network by storing source routes, discovered dynamically only when necessary, thus requiring no administration from the network operator. All nodes in the network participate in the packet forwarding process, acting as routers on an ad-hoc basis. DSR embeds control information to normal packet flow by adding "DSR header" to regular IP packets; the header is modified constantly while the packet is being forwarded. The use of source routing guarantees loop-freeness in the network, and does not require any kind of periodic routing protocol exchanges, thus minimizing the overhead. All nodes cache source routes either when overhearing them or when forwarding the packets, reducing the need for route discoveries. DSR is a reactive protocol and is highly adaptive in the event of movement and node number changes. DSR applies to MANET's with up to 100 nodes and can cope with a reasonably high rates of node mobility. There is still further study and clarifications to be done, especially in the areas of security and reliability.
Cited by 0
Yong Cheng, Chuanhe Huang, Wenming Shi · 2007
In this paper, we design a novel secure routing protocol for mobile ad hoc networks (MANETs), called trusted dynamic source routing (TDSR) which extends the widely used DSR routing protocol and employs the idea of trust network connect (TNC) to protect routing behaviors. In the TDSR, trust among nodes is represented by trust score, which consists of direct trust and indirect trust. Trust relationships and routing decisions are based on experienced, observed, or reported routing and forwarding behavior of other nodes. The detailed implementation of TDSR assumes that the network layer is based on DSR. We present a performance analysis of DSR fortified by TDSR and compare it to regular defenseless DSR. It shows that a network with TDSR and up to 60% of misbehaving nodes behaves almost as well as a benign network. All simulations have been implemented and performed in NS2.
Cited by 22
Miguel A. Ortuño, Pérez Vicente, Matellán Olivera et al. · 2008
Current ad-hoc network protocols are designed for hosts similar to the ones that are used in fixed networks. These protocols are not suitable for some applications of ad-hoc networks, where resources are very scarce. One point is the size of the network addresses, which may be a critical issue, specially with the use of IPv6 in the DSR protocol. This is because this protocol uses source routing, and, therefore, each datagram must carry the addresses of all the machines in its path. In this paper a new protocol named ADSR is proposed to solve this problem. This new protocol is a modified version of DSR based on the use of abbreviated addresses. The abbreviation procedure can lead to two different nodes having the same address, which we will term collision. ADSR allows rather than averts collisions, as analysed in this paper. Some results on the performance of this new protocol are shown. These results have been obtained by simulations implemented on an ns-2 network simulator. 1. Ad-Hoc Networks Ad-hoc networks are computer networks that are set up when needed. These networks are composed of the hosts that happen to be in the right place at the right time, and have no fixed infrastructure, like, for instance, the Internet. Wireless links, battery power and the right algorithms free these networks from the need for wires, access points, routers or external power [12]. These networks are made up of similar nodes with no hierarchy. Each host is able to produce, route and consume data. Preferably they should not need the assistance of any user or human administrator either.
Cited by 0
Rakesh Kumar Jha, Pooja Kharga · 2016
Abstract—Due to frequent topology changes and routing overhead, selection of routing protocol in Mobile Ad-hoc Network (MANET) is a great challenge. A design issue for an efficient and effective routing protocol is to achieve optimum values of performance parameters under network scenarios. There are various routing protocols available for MANET. This paper involves study of four routing protocols (Ad-hoc On Demand
Cited by 0
Manish Chandra Bhatt · Indian Journal of Science and Technology · 2017
Cited by 3Open access
Manish Chandra Bhatt · Indian Journal of Science and Technology · 2017
Objectives: To propose the new improved energy efficient dynamic source routing protocol. Methods: We have used the concept of location based routing so that we can easily find the locations of the nodes. Each and every node can be traced by its GPS signal and we can get the appropriate location of each node, which helps in choosing the intermediate nodes between source and destination. Findings: The experimental results show that the proposed protocol has improved the individual node life time and so the whole network life span increases. Improvement: This paper offers enhanced energy conscious dynamic source routing for the wireless ad-hoc network. Keywords: ECDSR (Energy Conscious Dynamic Source Routing), LBR (Location based Routing), MANET (Mobile Ad Hoc Network), RREP (Route Reply), RREQ (Route Request), WRP (Wireless Routing Protocol)
Cited by 2Open access
Jüschke, Lara, Kügler, Lennart, Petersen, Torben et al. · Technische Universität Clausthal, Universitätsbibliothek · 2025
Industrial applications, such as process control and monitoring, are increasingly reliant on wireless communication, which in turn imposes stringent demands on network performance. Multiconnectivity (MC), which includes packet duplication, packet splitting, and load balancing, has been proposed to overcome limitations in wireless communication by leveraging multiple communication paths to enhance reliability, throughput, and latency performance. While extensive research has focused on singlehop multi-connectivity, research on MC in multi-hop networks is limited, despite its potential to exploit different diversity types for increased resilience and adaptation. Therefore, this work highlights the benefits and challenges of path discovery and selection for MC in wireless multi-hop networks and proposes a dynamic source routing-based MC protocol that incorporates all packet schemes. Additionally, two different orchestration modes are discussed: centralized and distributed orchestration of packet schemes and routes.
Cited by 0Open access
Ritu Aggarwal · 2015
Abstract-Security in mobile ad hoc networks (MANET) is difficult to achieve, notably because of the vulnerability of wireless links, the limited physical protection of nodes, the dynamically changing topology, the absence of a certification authority, and the lack of a centralized monitoring or management point. In this paper, we embed an efficient asymmetric encryption strategy to protect and ensure anonymity for source routes when employing a source routing protocol. The base protocol used for source routing is DSR and to prevent DoS attack which occurs by modifying source route an onion based asymmetric key approach is embedded.
Cited by 0
Yanjuan Cheng · 2004
Cited by 0Open access
K. Thamizhmaran · Zenodo (CERN European Organization for Nuclear Research) · 2025
As the nodes are mobile so topology changes frequently that leads to link failure and lack of infrastructure support and resource constraint is the key issue that causes dishonest and non co-operative nodes. As the nodes square measure mobile thus topology changes oft that ends up in link failure and lack of infrastructure support and resource constraint is that the key issue that causes dishonest and non co-operative nodes. There square measure finding a route to destination, new route discovery is initiated. The frequent discoveries result in a lot of network congestion. To avoid this multipath routing protocols are planned to seek out multiple routes to destination and put on to alternate secondary path just in case of route broken and its offer higher routing performance and security. In this developed research paper attempt to compare the performance of two reactive routing protocols for MANETs that is Secure Dynamic Source Routing (SDSR) and Dynamic Source Routing (DSR), on-demand gateway discovery protocol where a mobile device of MANET gets connected to gateway. SDSR using the Intrusion Detection system (IDS) and trust based routing, the performance results are analysed by varying simulation time. Furthermore, all the above mentioned protocols are compared based on several important performance metrics which are packet delivery ratio, end-to-end delay and average energy.
Cited by 0Open access
Yang Qin, Chia Yui Lee · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2004
A mobile ad hoc network (MANET) facilitates mobile hosts to communicate with one another based on wireless infrastructure. There are no base stations in ad hoc networks and the mobile hosts act as routers for data packets. Since the mobile hosts in a MANET keep moving, topological changes take place frequently in the network. This cause routing information kept by the nodes to get outdated easily. Effective ways of getting updated routing information is needed. This problem becomes more complex in wireless networks, where bandwidth is limited. This paper proposes an improved dynamic source routing (DSR) algorithm as a solution to this problem. The proposed algorithm, the Improved Dynamic Source Routing (I-DSR), has a hybrid feature, combined proactive and reactive, that enables all the hosts to get updated changing topology information with a low cost in communication instead of enabling only a few hosts to get the information when there is a route request for a new moved destination. In anticipation of the need of a route request to the new moved destination by other hosts, the operations in the algorithm are designed to eliminate these needs for route request flooding and eventually generate a small number of control packets. Through simulations, we demonstrate that I-DSR gives better network performance than the well-known on-demanding routing protocol, Dynamic Source Routing (DSR) Protocol. As it is improved from DSR, it just needs a few modification on DSR and is easy to implement.
Cited by 0
S.C. Dhull, Deepender Dhull, Swati Juneja · 2013
Abstract — Security has become one of the major issues for data communication over wired and wireless networks. To enhance the security of data transmission, existing system works on the cryptography based algorithms such as SSL, IPSec. Although IPSec and SSL accounts for great level of security, they introduce overheads. A mass of control messages exchanging also needed in order to adopt multiple path deliveries from source to destination. Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.
Cited by 0
S. Ghazizadeh, O. Ilghami, E. Sirin et al. · 2003
We present SADSR (security-aware adaptive DSR), a secure routing protocol for mobile ad hoc networks. SADSR authenticates the routing protocol messages using digital signatures based on asymmetric cryptography. The basic idea behind SADSR is to have multiple routes to each destination and store a local trust value for each node in the network. A trust value is assigned to each path based on trust values of the nodes which occur on that path. The paths with higher trust values are preferred for routing. We implemented our approach in ns2 simulator and compared the performance of SADSR and DSR. Our results show that in the presence of malicious nodes SADSR outperforms DSR in packet delivery ratio with an acceptable network load.
Cited by 39
Amer O. Abu Salem, Ghassan Samara, Tareq Alhmiedat · arXiv (Cornell University) · 2017
Dynamic Source Routing (DSR) is an efficient on-demand routing protocol for mobile ad-hoc networks (MANET). It depends on two main procedures: Route Discovery and Route Maintenance. Route discovery is the procedure used at the source of the packets to discover a route to the destination. Route Maintenance is the procedure that discovers link failures and repairs them. Route caching is the sub procedure serviceable to avoid the demand for discovering a route or to reduce route discovery delay before every data packet is sent. The goal of this paper is to evaluate the performance of DSR. Different performance expressions are investigated including, delivery ratio, end to-end delay, and throughput, depending on different cache sizes and different speeds. All of that as a study to develop a new caching strategy as a future work.
Cited by 27Open access
Zhongping Chen · SHILAP Revista de lepidopterología · 2019
A HWMP improved routing protocol (HWMMRP) is proposed in this paper. The protocol adopts the integrated link state routing criterion algorithm LCCM providing small overhead, with factors such as bandwidth, queue length and noise interference fully considered. In order to solve the problem of the tree routing mechanism being easily congested at the root node, a multi-path multi-gateway shunting mechanism is applied. A multipath routing mechanism is also incorporated in the reactive routing mode. Both the new criteria and the protocol are simulated in the NS-2 environment, and are compared with comparable protocols. The experimental results show that our protocol can effectively avoid node congestion, and provides a better dynamic load balancing capability as well as a better performance than the standard HWMP and AODV protocols.
Cited by 0Open access
Jaydip Sen · arXiv (Cornell University) · 2011
Dynamic Source Routing (DSR) is a well known source routing protocol for ad hoc networks. The algorithm depends on the cooperative participation of the nodes that enables route discovery from a source node to a destination node. However, if a group of nodes do not cooperate, the performance of the DSR protocol may be severely degraded. This paper presents a probabilistic attack model on the DSR protocol and analyses its effect on the routing performance. Simulations results of the model show that the effect of the attack is catastrophic only if a large number of nodes are compromised and there is no detection mechanism. As an interesting observation, the analysis also shows that the attack model can also be used to improve the performance of the DSR protocol.
Cited by 0Open access
Qiang Shen, Xuming Fang, S. Kim et al. · 2009
Routing in wireless mesh networks presents a great challenge due to unreliable wireless links and collisions. Recently, a new routing method, opportunistic routing (OR), is proposed to deal with them by exploiting broadcast nature of wireless networks. OR relies on the global knowledge of networks to select relays and determine priorities. In this paper, we propose a new routing scheme, OxDSR, which combines OR and dynamic source routing (DSR) and performs opportunistic transmissions with the help of the local information and the traditional route obtained by DSR. By taking the duplicates and additional wireless resource consumed by multiple ACK frames into consideration, we propose a new metric, equivalent data rate, to select and prioritize relays. Extensive simulation study shows that the proposed OxDSR is more resilient and achieves higher throughput than DSR based on the expected transmission count routing metric.
Cited by 3
Kavita Sharma, Vivek Sharma · International Journal of Computer Applications · 2013
Mobile Ad-hoc Networks (MANET) are consisting of nodes that have limited battery power so the energy efficiency is one of the primary metrics of interest. Energy efficient routing is a major issue in MANET. This paper proposed an Energy efficient power aware multipath dynamic source routing protocol by modifying one of the most popular routing protocols that is Dynamic Source Routing (DSR) protocol which is not at all concerned about power consumption. The proposed Dynamic source routing-Power Aware routing DSR-PSR uses the basic concept of traditional DSR and implements energy efficient routing through which it not only enhances the life time of the network but also increases the overall performance of the networks.
Cited by 4Open access
Samidha Shirke, Vitrag Shah, Tejas Ruikar et al. · Communications in computer and information science · 2016
A Wireless Ad-Hoc Network (WANET) is a group of wireless mobile nodes which are self creating, self organizing and self administering. In such networks, selection of routing protocols is an important concern as it affects the performance of ad-hoc networks in terms of average end-to-end delay, reduced packet processing etc. This paper proposes a Cluster Based Logical Hierarchical Addressing scheme for Dynamic Source Routing protocol (CBHDSR) which enhances DSR. This scheme reduces the flooding of RREQ packets in the network by searching a direct path based on the addressing scheme which results in the reduced congestion.
Cited by 3Open access
David B. Johnson, David A. Maltz · 1994
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host's wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
Cited by 15