Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Most of the proposed MANET protocols do not address security issues. In MANETs routing algorithm is necessary to find specific routes between source and destination. The primary goal of any ad-hoc network routing prot...

Because of several constraints in ad hoc networks, an adaptive ad hoc routing protocol is increasingly required. In this paper, we propose a synopsis of an adaptation process for an adaptive ad hoc routing protocol. Next, we put into practice the analysis of the process of adaptation to mobility by realizing an adaptive routing protocol: CSR (Cluster Source Routing) which is an extension of a w...

The advantages of field-programmable gate arrays (FPGAs) are sometimes eclipsed by a substantial performance penalty due to signal delay through the programmable routing resources. W e propose Q new FPGA routing construction that directly minimizes source-sink signal propagation delay based on a graph generalization of rectilinear Steiner arborescences (i.e., shortest-paths trees with minimum w...

Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile hosts forming a temporary network without the aid of any stand-alone infrastructure or centralized administration. Most of the proposed MANET protocols do not address security issues. In MANETs routing algorithm is necessary to find specific routes between source and destination. The primary goal of any ad-hoc network routing prot...

Mobile Ad-hoc Network (MANET) is an infrastructure less and decentralized network which need a robust dynamic routing protocol. Many routing protocols for such networks have been proposed so far to find optimized routes from source to the destination and prominent among them are Dynamic Source Routing (DSR), Ad-hoc On Demand Distance Vector (AODV), and Destination-Sequenced Distance Vector (DSD...

This paper proposes a novel reactive power-based source routing (PBSR) protocol for wireless mobile Ad hoc communications. The routing scheme adjusts the node’s transmission power to keep the connectivity of the network topology and controls its components’ life times to follow the variation of the network conditions. PBSR is a source routing and is driven by events. In simulations, the compone...

In this paper we consider a multipath extension to the dynamic source routing (DSR) protocol proposed by Johnson and Maltz, an on-demand routing protocol for ad hoc wireless networks. This extension keeps two node disjoint paths between the source and the destination of a routing process without introducing extra overhead. Several optimization options are also considered. Simulation is conducte...

The performance of different routing protocols has been widely studied. Many routing protocols for Ad-hoc networks have been proposed till now. Amongst the most popular ones are Ad-hoc on demand Distance Vector Routing Protocol (AODV), Dynamic Source Routing Protocols (DSR), and Destination Sequenced Distance Vector (DSDV). We study the performance of routing protocols when particular applicati...

Geographic routing for wireless sensor networks requires a source that can encapsulate the location of a sink in each data packet. How a source can obtain the location of a sink with low overhead is a difficult issue. This letter proposes a Quorum Based Sink Location Service (QSLS) which can be exploited by most geographic routing protocols in arbitrary irregular wireless sensor networks. key w...

Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, trading scalability for availability among a relatively small set of hosts. This paper proposes a simple, scalable approach to recover from Internet path failures. Our contributions are threefold. First, we conduct a bro...