We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets ...

Energy conservation is important for mobile ad hoc networks where devices are expected to work for longer periods of time without the need for charging their batteries. Therefore there is a need of an intelligent routing protocol that can minimize overhead and ensure the use of minimum energy routes. In Progressive Energy Efficient Routing, energy efficient shortest paths are selected with mini...

Mobile ad hoc network is a self-directed structure of mobile nodes connected by wireless links. All nodes operate not only as an end system, but also as work as a router to forward the packets. Ad hoc wireless networks are characterized by multi-hop wireless connectivity, infrastructure less and habitually changing topology. It may be necessary for one mobile node to schedule other hosts for fo...

Position-based routing protocols have become more popular in Mobile Ad hoc network (MANET) due to their advantages in using geographical position information of the nodes to route the data packet to the destination node. Each node periodically sends their geographical position information to its neighbors using beacon packets. Data packet routing in position-based routing protocol uses neighbor...

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...

In this paper, we present new routing technique called “Demand based routing” for mesh Networkon-Chip(NoC) which improves throughput in terms of tasks. We are proposing this because usually different nodes/tiles on NoC perform different tasks which intern may depend themselves. Various existing routing algorithms for Networkon-Chip(NoC) are improving throughput in terms of packets, global delay...

In this paper we present the multistage off-line method, a new and rather natural way to model off-line packet routing problems, which reduces the problem of off-line packet routing to that of finding edge disjoint paths on a multistage graph. The multistage off-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any proces...

Abstmct-We investigate packet loss in mobile ad hoc networks via simulation. Ad-hoc on-demand distance vector (AODV) and destination-sequenced distance vector (DSDV) are chosen as representatives of the on-demand and proactive routing protocols respectively. The effects of congestion and mobility in various network contexts are explored. The results indicate that DSDV loses 10% to 20% more pack...

Random 1/2-disk routing in wireless ad-hoc networks is a localized geometric routing scheme in which each node chooses the next relay randomly among the nodes within its transmission range and in the general direction of the destination. We introduce a notion of convergence for geometric routing schemes that not only considers the feasibility of packet delivery through possibly multi-hop relayi...