The Experts below are selected from a list of 17046 Experts worldwide ranked by ideXlab platform
Himabindu Pucha - One of the best experts on this subject based on the ideXlab platform.
-
on optimal ttl sequence based Route Discovery in manets
International Conference on Distributed Computing Systems Workshops, 2005Co-Authors: Dimitrios Koutsonikolas, Saumitra Mohan Das, Himabindu PuchaAbstract:In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover Routes to a remote node via flooding of Route request messages. Historically, such floodings of requests have used a TTL (time-to-live) large enough to reach all nodes in the network to ensure successful Route Discovery in one round of flooding. Recently (N. Chang et al., 2004), it was shown that the generic minimal cost flooding search problem can be solved via a sequence of floodings with an optimally chosen set of TTLs. The theoretical result, when applied to DSR Route Discovery, does not take into account optimizations such as Route caching and overhearing, which can significantly reduce the frequency and the propagation range of Route Discovery operations. Equally importantly, the impact of using a sequence of floodings on the packet delivery delay is not clear. In this paper, we study the impact of using the optimal TTL sequence-based Route Discovery on DSR routing performance. Our results show when caching and overhearing are considered, the Route Discovery enhanced by an optimal TTL sequence has very similar overhead but higher delay than the basic Route Discovery mechanism.
-
ICDCS Workshops - On optimal TTL sequence-based Route Discovery in MANETs
25th IEEE International Conference on Distributed Computing Systems Workshops, 1Co-Authors: Dimitrios Koutsonikolas, Saumitra Mohan Das, Himabindu PuchaAbstract:In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover Routes to a remote node via flooding of Route request messages. Historically, such floodings of requests have used a TTL (time-to-live) large enough to reach all nodes in the network to ensure successful Route Discovery in one round of flooding. Recently (N. Chang et al., 2004), it was shown that the generic minimal cost flooding search problem can be solved via a sequence of floodings with an optimally chosen set of TTLs. The theoretical result, when applied to DSR Route Discovery, does not take into account optimizations such as Route caching and overhearing, which can significantly reduce the frequency and the propagation range of Route Discovery operations. Equally importantly, the impact of using a sequence of floodings on the packet delivery delay is not clear. In this paper, we study the impact of using the optimal TTL sequence-based Route Discovery on DSR routing performance. Our results show when caching and overhearing are considered, the Route Discovery enhanced by an optimal TTL sequence has very similar overhead but higher delay than the basic Route Discovery mechanism.
Dimitrios Koutsonikolas - One of the best experts on this subject based on the ideXlab platform.
-
on optimal ttl sequence based Route Discovery in manets
International Conference on Distributed Computing Systems Workshops, 2005Co-Authors: Dimitrios Koutsonikolas, Saumitra Mohan Das, Himabindu PuchaAbstract:In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover Routes to a remote node via flooding of Route request messages. Historically, such floodings of requests have used a TTL (time-to-live) large enough to reach all nodes in the network to ensure successful Route Discovery in one round of flooding. Recently (N. Chang et al., 2004), it was shown that the generic minimal cost flooding search problem can be solved via a sequence of floodings with an optimally chosen set of TTLs. The theoretical result, when applied to DSR Route Discovery, does not take into account optimizations such as Route caching and overhearing, which can significantly reduce the frequency and the propagation range of Route Discovery operations. Equally importantly, the impact of using a sequence of floodings on the packet delivery delay is not clear. In this paper, we study the impact of using the optimal TTL sequence-based Route Discovery on DSR routing performance. Our results show when caching and overhearing are considered, the Route Discovery enhanced by an optimal TTL sequence has very similar overhead but higher delay than the basic Route Discovery mechanism.
-
ICDCS Workshops - On optimal TTL sequence-based Route Discovery in MANETs
25th IEEE International Conference on Distributed Computing Systems Workshops, 1Co-Authors: Dimitrios Koutsonikolas, Saumitra Mohan Das, Himabindu PuchaAbstract:In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover Routes to a remote node via flooding of Route request messages. Historically, such floodings of requests have used a TTL (time-to-live) large enough to reach all nodes in the network to ensure successful Route Discovery in one round of flooding. Recently (N. Chang et al., 2004), it was shown that the generic minimal cost flooding search problem can be solved via a sequence of floodings with an optimally chosen set of TTLs. The theoretical result, when applied to DSR Route Discovery, does not take into account optimizations such as Route caching and overhearing, which can significantly reduce the frequency and the propagation range of Route Discovery operations. Equally importantly, the impact of using a sequence of floodings on the packet delivery delay is not clear. In this paper, we study the impact of using the optimal TTL sequence-based Route Discovery on DSR routing performance. Our results show when caching and overhearing are considered, the Route Discovery enhanced by an optimal TTL sequence has very similar overhead but higher delay than the basic Route Discovery mechanism.
Tadeusz A. Wysocki - One of the best experts on this subject based on the ideXlab platform.
-
On Optimising Route Discovery for Multi-interface and Power-Aware Nodes in Heterogeneous MANETs
2010 6th International Conference on Wireless and Mobile Communications, 2010Co-Authors: Huda Alaamri, Mehran Abolhasan, Tadeusz A. Wysocki, Justin LipmanAbstract:This paper presents a new routing Discovery strategy for heterogeneous MANETs. Node heterogeneity is modeled in terms of: types and number of different interfaces, power, and transmission ranges. Our proposed Route Discovery algorithm is implemented on the top of On-demand Tree-based Routing Protocol (OTRP) and hence it is called OTRP Heterogeneity-Aware (OTRP\_HA). OTRP\_HA utilizes node heterogeneity and optimizes Route Discovery to reduce overheads and ensures connectivities between different types of nodes with different interfaces. Each node makes its own decision to participate in the Route Discovery process according to its location, local density, and available resources. Simulation results show that OTRP\_HA outperforms OTRP and AODV and it reduces overheads as a number of nodes and traffic increase, while it also further prolongs the lifetime of battery-powered single-interface nodes when compared to AODV.
-
on optimising Route Discovery in absence of previous Route information in manets
Vehicular Technology Conference, 2009Co-Authors: Huda Alaamri, Mehran Abolhasan, Tadeusz A. WysockiAbstract:This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient Route Discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, Route Discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYMO, and OLSR and it reduces overheads as number of nodes and traffic increase.
-
VTC Spring - On Optimising Route Discovery in Absence of Previous Route Information in MANETs
VTC Spring 2009 - IEEE 69th Vehicular Technology Conference, 2009Co-Authors: Huda Alaamri, Mehran Abolhasan, Tadeusz A. WysockiAbstract:This paper present a new routing protocol for Ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing such as AODV with an efficient Route Discovery algorithm called Tree-based Optimized Flooding (TOF) to improve scalability of Ad hoc networks when there is no previous knowledge about the destination. To achieve this in OTRP, Route Discovery overheads are minimized by selectively flooding the network through a limited set of nodes, referred to as branching-nodes. The theoretical analysis and simulation results showed that OTRP outperforms AODV, DYMO, and OLSR and it reduces overheads as number of nodes and traffic increase.
-
Load-Balanced Route Discovery for Mobile Ad hoc Networks
Journal of telecommunications and information technology, 2004Co-Authors: Mehran Abolhasan, Justin Lipman, Tadeusz A. WysockiAbstract:This paper presents Flow-Aware Routing Protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks. FARP is a hop-by-hop routing protocol, which introduces a flow-aware Route Discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balance the network traffic. FARP was implemented in Glomosim and compared with AODV. To investigate the load distribution capability of FARP new performance metrics were introduced to measure the data packet flow distribution capability of the each routing protocol. The simulation results obtained illustrate that FARP achieves high levels of throughput, reduces the level of control overheads during Route Discovery and distributes the network load more evenly between nodes when compared to AODV. This paper also describes a number of Alternative strategies and improvements for the FARP. I. INTRODUCTION
Ashwani Kumar Ramani - One of the best experts on this subject based on the ideXlab platform.
-
Enhanced DSR for MANET with Improved Secured Route Discovery and QoS
International Journal of Network Security, 2007Co-Authors: Anil Rawat, Prakash D. Vyavahare, Ashwani Kumar RamaniAbstract:Mobile Ad hoc NETwork (MANET) comprises of nodes, which are free to move randomly, yet cooperate to forward packets between source and destination over a multi-hop wireless network. Due to absence of any fixed node, each node acts as a Router, providing routing capability for the MANET. Various protocols for Discovery of Routes between any two MANET nodes have been designed. These protocols are broadly categorized as on-demand protocols and table driven protocols. Dynamic Source Routing (DSR) and Ad-hoc On-Demand Distance Vector (AODV) are the two most matured on-demand routing protocols, while Optimized Link State Routing Protocol (OLSR) and Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) are the two most matured table driven routing protocols. This paper proposes enhancements in DSR to provide secured Route Discovery and improved QoS. The paper evaluates integration of Secured Routing Protocol (SRP) and Secured Message Transmission (SMT) with DSR to get Secured Dynamic Source Routing (S-DSR), which is capable of secured Route Discovery. The proposed extension also incorporates concurrent usage of multiple cached Routes for improved throughput and explores possible enrichment to Route cache management resulting in improved efficiency. A novel idea of proactive Route Discovery, particularly for high and sustained bandwidth dependent applications like video conference, voice over IP etc., has been proposed. The paper finally concludes with remarks on a possible comprehensive SDSR protocol, incorporating better Route cache maintenance scheme, proactive Route Discovery and integration of SRP/SMT features for secured Route Discovery and secured data transmission.
-
Enhanced DSR with secured multi-path Route Discovery and concurrent data transmission
2006 International Conference on Advanced Computing and Communications, 2006Co-Authors: Anil Rawat, Prakash D. Vyavahare, Ashwani Kumar RamaniAbstract:On-demand routing protocols for Mobile Ad-hoc Networks (MANET) include Dynamic Source Routing (DSR) [1], which is capable of discovering multiple Routes. Secured Routing Protocol (SRP) [2] on the other hand provides mechanism for secured Route Discovery, even under adversarial conditions. The paper proposes integration of SRP features in DSR to gain security features for MANET routing requirements for the Route Discovery phase. Concurrent use of multiple paths for data transmission phase and its implications on performance is also evaluated.
Gene Tsudik - One of the best experts on this subject based on the ideXlab platform.
-
srdp secure Route Discovery for dynamic source routing in manets
Ad Hoc Networks, 2009Co-Authors: Jihye Kim, Gene TsudikAbstract:Abstract Routing is a critical function in multi-hop mobile ad hoc networks (MANETs). A number of MANET-oriented routing protocols have been proposed, of which DSR is widely considered both the simplest and the most effective. At the same time, security in MANETs – especially, routing security – presents a number of new and interesting challenges. Many security techniques geared for MANETs have been developed, among which Ariadne is the flagship protocol for securing DSR. The focus of this work is on securing the Route Discovery process in DSR. Our goal is to explore a range of suitable cryptographic techniques with varying flavors of security, efficiency and robustness. The Ariadne approach (with TESLA), while very efficient, assumes loose time synchronization among MANET nodes and does not offer non-repudiation. If the former is not possible or the latter is desired, an alternative approach is necessary. To this end, we construct a secure Route Discovery protocol (SRDP) which allows the source to securely discover an authenticated Route to the destination using either aggregated message authentication codes (MACs) or multi-signatures. Several concrete techniques are presented and their efficiency and security are compared and evaluated.
-
srdp securing Route Discovery in dsr
International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2005Co-Authors: Jihye Kim, Gene TsudikAbstract:Routing is a critical function in multi-hop mobile ad hoc networks (MANETs). A number of MANET-oriented routing protocols have been proposed, of which DSR is widely considered both the simplest and the most effective. At the same time, security in MANETs-especially, routing security-presents a number of new and interesting challenges. Many security techniques geared for MANETs have been developed, among which Ariadne is the flagship protocol for securing DSR. The focus of this work is on securing the Route Discovery process in DSR. Our goal is to explore a range of suitable cryptographic techniques with varying flavors of security, efficiency and robustness. The Ariadne approach (with TESLA), while very efficient, assumes loose time synchronization among MANET nodes and does not offer non-repudiation. If the fanner is not possible or the latter is desired, an alternative approach is necessary. To this end, we construct a secure Route Discovery protocol (SRDP) which allows the source to securely discover an authenticated Route to the destination using either aggregated message authentication codes (MACs) or multi-signatures. Several concrete techniques are presented and their efficiency and security are compared and evaluated.
-
MobiQuitous - SRDP: securing Route Discovery in DSR
The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2005Co-Authors: Jihye Kim, Gene TsudikAbstract:Routing is a critical function in multi-hop mobile ad hoc networks (MANETs). A number of MANET-oriented routing protocols have been proposed, of which DSR is widely considered both the simplest and the most effective. At the same time, security in MANETs-especially, routing security-presents a number of new and interesting challenges. Many security techniques geared for MANETs have been developed, among which Ariadne is the flagship protocol for securing DSR. The focus of this work is on securing the Route Discovery process in DSR. Our goal is to explore a range of suitable cryptographic techniques with varying flavors of security, efficiency and robustness. The Ariadne approach (with TESLA), while very efficient, assumes loose time synchronization among MANET nodes and does not offer non-repudiation. If the fanner is not possible or the latter is desired, an alternative approach is necessary. To this end, we construct a secure Route Discovery protocol (SRDP) which allows the source to securely discover an authenticated Route to the destination using either aggregated message authentication codes (MACs) or multi-signatures. Several concrete techniques are presented and their efficiency and security are compared and evaluated.
