A distributed routing algorithm for mobile wireless networks

Corson, M. Scott; Ephremides, Anthony

doi:10.1007/bf01196259

Cited by 297 publications

(128 citation statements)

References 15 publications

Supporting

Mentioning

126

Contrasting

Unclassified

Order By: Relevance

“…Therefore in highly dynamic and large networks the overhead may consume most of the bandwidth. However, this protocol has a number of advantages over routing protocols such as AODV, LMR [7] and TORA [25], and in small to moderately size networks (perhaps up to a few hundred nodes), this protocol may perform better. An advantage of DSR is that nodes can store multiple routes in their route cache, which means that the source node can check its route cache for a valid route before initiating route discovery, and if a valid route is found there is no need for route discovery.…”

Section: Dynamic Source Routing (Dsr)mentioning

confidence: 99%

A review of routing protocols for mobile ad hoc networks

Abolhasan

Wysocki

Dutkiewicz³

2004

Ad Hoc Networks

989

589

View full text Add to dashboard Cite

The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking strategies to be implemented in order to provide efficient end-to-end communication. This, along with the diverse application of these networks in many different scenarios such as battlefield and disaster recovery, have seen MANETs being researched by many different organisations and institutes. MANETs employ the traditional TCP/IP structure to provide end-to-end communication between nodes. However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model require redefinition or modifications to function efficiently in MANETs. One interesting research area in MANET is routing. Routing in the MANETs is a challenging task and has received a tremendous amount of attention from researches. This has led to development of many different routing protocols for MANETs, and each author of each proposed protocol argues that the strategy proposed provides an improvement over a number of different strategies considered in the literature for a given network scenario. Therefore, it is quite difficult to determine which protocols may perform best under a number of different network scenarios, such as increasing node density and traffic. In this paper, we provide an overview of a wide range of routing protocols proposed in the literature. We also provide a performance comparison of all routing protocols and suggest which protocols may perform best in large networks. AbstractThe 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the

show abstract

Section: Dynamic Source Routing (Dsr)mentioning

confidence: 99%

A review of routing protocols for mobile ad hoc networks

Abolhasan

Wysocki

Dutkiewicz³

2004

Ad Hoc Networks

989

589

View full text Add to dashboard Cite

show abstract

“…One could resort to flooding as a viable alternative at high mobility (Corson & Ephremides, 1995). But, flooding of the data packets will prohibitively increase the energy consumption and congestion at the nodes.…”

Section: Algorithm For the Optimal Number Of Path Transitionsmentioning

confidence: 99%

Greedy Algorithms to Determine Stable Paths and Trees in Mobile Ad hoc Networks

Meghanathan¹

2008

Greedy Algorithms

View full text Add to dashboard Cite

“…Those algorithms are mainly focused on establishing routes, and maintaining these routes under frequent and unpredictable connectivity changes [2], [3]. The implicit assumption in most of the earlier work is that nodes' transmitted powers are fixed.…”

Section: Introductionmentioning

confidence: 99%

Power management for throughput enhancement in wireless ad-hoc networks

ElBatt

Krishnamurthy

Connors

et al.

2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record

141

View full text Add to dashboard Cite

Abstract-In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different transmit powers on the average power consumption and end-to-end network throughput in a wireless ad-hoc environment. This power management approach would help in reducing the system power consumption and hence prolonging the battery life of mobile nodes. Furthermore, it improves the end-to-end network throughput as compared to other ad-hoc networks in which all mobile nodes use the same transmit power. The improvement is due to the achievement of a tradeoff between minimizing interference ranges, reduction in the average number of hops to reach a destination, the probability of having isolated clusters, and the average number of transmissions (including retransmissions due to collisions). The protocols would first dynamically determine an optimal connectivity range wherein they adapt their transmit powers so as to only reach a subset of the nodes in the network. The connectivity range would then be dynamically changed in a distributed manner so as to achieve the near optimal throughput. Minimal power routing is used to further enhance performance. Simulation studies are carried out in order to investigate these design approaches. It is seen a network with such a power managed scheme would achieve a better throughput performance and lower transmit power than a network without such a scheme.

show abstract

A distributed routing algorithm for mobile wireless networks

Cited by 297 publications

References 15 publications

A review of routing protocols for mobile ad hoc networks

A review of routing protocols for mobile ad hoc networks

Greedy Algorithms to Determine Stable Paths and Trees in Mobile Ad hoc Networks

Power management for throughput enhancement in wireless ad-hoc networks

Contact Info

Product

Resources

About