The Experts below are selected from a list of 6894 Experts worldwide ranked by ideXlab platform
Chenna P Reddy - One of the best experts on this subject based on the ideXlab platform.
-
performance analysis of adhoc network Routing protocols
Ubiquitous Computing, 2006Co-Authors: Chenna P ReddyAbstract:Routing in adhoc networks is nontrivial due to highly dynamic nature of the nodes. In recent years several Routing protocols targeted at mobile adhoc networks are being proposed and prominent among them are DSDV, AODV, TORA, and DSR. This paper does the comprehensive performance analysis of the Routing protocols using ns2 simulator considering all the metrics as suggested by RFC 2501. Results indicate Reactive Routing protocols are more suitable for adhoc networks.
Thomas Clausen - One of the best experts on this subject based on the ideXlab platform.
-
the lightweight on demand ad hoc distance vector Routing protocol next generation loadng
2016Co-Authors: Axel Colin De Verdiere, Ulrich Herberg, Thomas Clausen, Yuichi Igarashi, Thierry Lys, Cedric Lavenu, Hiroki Satoh, Afshin Niktash, Justin W DeanAbstract:This document describes the Lightweight Ad hoc On-Demand - Next Generation (LOADng) distance vector Routing protocol, a Reactive Routing protocol intended for use in Mobile Ad hoc NETworks (MANETs).
-
collection tree extension of Reactive Routing protocol for low power and lossy networks
International Journal of Distributed Sensor Networks, 2014Co-Authors: Thomas ClausenAbstract:This paper proposes an extension to Reactive Routing protocol, for efficient construction of a collection tree for data acquisition in sensor networks. The Lightweight On-Demand Ad hoc Distance Vector Routing Protocol-Next Generation (LOADng) is a Reactive distance vector protocol which is intended for use in mobile ad hoc networks and low-power and lossy networks to build paths between source-destination pairs. In 2013, ITU-T has ratified the recommendation G.9903 Amendment 1, which includes LOADng in a specific normative annex for Routing protocol in smart grids. The extension uses the mechanisms from LOADng, imposes minimal overhead and complexity, and enables a deployment to efficiently support “sensor-to-root” traffic, avoiding complications of unidirectional links in the collection tree. The protocol complexity, security, and interoperability are examined in detail. The simulation results show that the extension can effectively improve the efficiency of data acquisition in the network.
-
the lln on demand ad hoc distance vector Routing protocol next generation loadng
2011Co-Authors: Thomas Clausen, Axel Colin De VerdiereAbstract:This document describes the LLN Ad hoc On-Demand (LOAD) distance vector Routing protocol - Next Generation, a Reactive Routing protocol intended for use in Low power Lossy Networks (LLN). The protocol is derived from AODV and extended for use in LLNs.
Ali Belmehdi - One of the best experts on this subject based on the ideXlab platform.
-
fighting against packet dropping misbehavior in multi hop wireless ad hoc networks
Journal of Network and Computer Applications, 2012Co-Authors: Abderrahmane Baadache, Ali BelmehdiAbstract:In multi-hop wireless ad hoc networks, the packets are forwarded through intermediate nodes along the source-destination path. Without having any control on packets forwarding, an intermediate node can behave selfishly or maliciously to drop packets going through it. The dropper motivation is the preservation of its resources, like its limited energy (selfish behavior) or the launch of denial of service attack (malicious behavior). In this paper, we propose an approach to verify the correct forwarding of packets by an intermediate node. The Merkle tree principle has been used for implementation in justification of our proposed approach. Through simulation, we have shown our approach efficiency, and we have evaluated its performance in both proactive and Reactive Routing protocol in ad hoc network. Also, we have compared our approach with the watchdog and the 2-hop ACK which are well-known approaches in the literature.
Axel Colin De Verdiere - One of the best experts on this subject based on the ideXlab platform.
-
the lightweight on demand ad hoc distance vector Routing protocol next generation loadng
2016Co-Authors: Axel Colin De Verdiere, Ulrich Herberg, Thomas Clausen, Yuichi Igarashi, Thierry Lys, Cedric Lavenu, Hiroki Satoh, Afshin Niktash, Justin W DeanAbstract:This document describes the Lightweight Ad hoc On-Demand - Next Generation (LOADng) distance vector Routing protocol, a Reactive Routing protocol intended for use in Mobile Ad hoc NETworks (MANETs).
-
the lln on demand ad hoc distance vector Routing protocol next generation loadng
2011Co-Authors: Thomas Clausen, Axel Colin De VerdiereAbstract:This document describes the LLN Ad hoc On-Demand (LOAD) distance vector Routing protocol - Next Generation, a Reactive Routing protocol intended for use in Low power Lossy Networks (LLN). The protocol is derived from AODV and extended for use in LLNs.
S V Rao - One of the best experts on this subject based on the ideXlab platform.
-
improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath Routing
IEEE Transactions on Mobile Computing, 2005Co-Authors: Alvin Valera, Winston K G Seah, S V RaoAbstract:A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive Routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new Routing protocol named CHAMP (caching and multiple path) Routing protocol. CHAMP uses cooperative packet caching and shortest multipath Routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and Routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.
