We present the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router n...

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

Analyses of routing protocols security are nearly always supported by simulations, which often evaluate the ability to deliver messages to a given destination. Several competing definitions for secure routing exist, but to our knowledge, they only address source routing protocols. In this paper, we propose the notion of corruptibility, a quantitative computational definition for routing securit...

DOI: 10.5281/zenodo.59957 ABSTRACT Mobile ad-hoc network has been used in various areas for data transmission over long distances. These nodes have been configured with different movable equipments. There are two types of routing protocols for data communication that are Proactive and Reactive protocol. Proactive protocols are table driven protocol that selects the route from the routing table ...

This paper evaluates three routing strategies for wireless sensor networks: source, shortest path, and hierarchical-geographical, which are the three most commonly employed by wireless ad-hoc and sensor networks algorithms. Source routing was selected because it does not require costly topology maintenance, while shortest path routing was chosen because of its simple discovery routing approach ...

One of the important research characteristic in the Mobile Ad hoc NETworks (MANETs) is routing. Development of efficient routing protocol is a necessity to improve the performance of routing. We propose an Efficient Interference Aware Multipath Dynamic Source Routing Protocol (EIAM-DSR) based on Dynamic Source Routing (DSR) protocol for MANETs. The main aim of the proposed routing protocol is t...

We present the source-tree adaptive routing (STAR) protocol and analyze its performance in wireless networks with broadcast radio links. Routers in STAR communicate to its neighbors their source routing trees either incrementally or in atomic updates. Source routing trees are specified by stating the link parameters of each link belonging to the paths used to reach every destination. Hence, a r...

We present a “clean-slate” design for a networklayer routing and forwarding system intended to address shortcomings of the current Internet Protocol. Our design separates routing from both forwarding and topology discovery; requires only a flat, topology-independent namespace; and allows for policies of both users and service providers to be supported. Channels serve as the primary abstraction,...