Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

Perkins, Charles E.; Bhagwat, P.

doi:10.1145/190809.190336

Cited by 3,942 publications

(1,037 citation statements)

References 7 publications

Supporting

Mentioning

987

Contrasting

Unclassified

Order By: Relevance

“…Most well-known protocols are like DSR [50], DSDV [51], TORA [52] and AODV [53]. Both of Dynamic source routing (DSR) [50] and Ad-hoc on demand distance vector routing (AODV) [53] protocols flood the route request on-demand which help to save the bandwidth and also increase the battery power (not sending and receiving the message unnecessarily).…”

Section: Ad-hoc Routingsmentioning

confidence: 99%

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Kumar¹,

Shwe²,

Wong³

et al. 2017

WSN

View full text Add to dashboard Cite

Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.

show abstract

Section: Ad-hoc Routingsmentioning

confidence: 99%

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Kumar¹,

Shwe²,

Wong³

et al. 2017

WSN

View full text Add to dashboard Cite

show abstract

“…Routing protocols, like AODV (Perkins & Royer, 1999), DSR[ (Johnson & Maltz, 1996), DSDV (Perkins & Bhagwat, 1994), forward traffic flows towards destination based on minimum hop count where packets are likely to track the same route leading to more interference and congestion and thus severe devastated throughput.…”

Section: Hop Countmentioning

confidence: 99%

An Efficient Traffic-Load and Link-Interference Aware Routing Metric for Multi Radio Multi Channel Wireless Mesh Networks Based on Link’s Effective Capacity Estimation

Islam¹,

Rahman²,

Rashid³

2014

CIS

View full text Add to dashboard Cite

Routing metrics proposed for Wireless Mesh Networks (WMNs) has various concerns like hop count, packet transmission delay, power consumption, congestion control, load balance and message collision. The routing metric of expected effective capacity (EEC) proposed in this paper guarantees to a select a path providing maximum throughput and minimum delay. A forwarding link constituting routing path is characterized by its quality, capacity, traffic demand and the degree of intervention experienced due to inter-flow and intra-flow interference. Thus the bandwidth actually attainable on a link for a flow is affected by those link properties. Our proposed metric computes the attainable bandwidth for a flow over a path which actually reflects congestion, node delay and traffic pressure on the desired path. Experiments conducted on ns-2 simulations demonstrate that our proposed routing metric can achieve significant improvements in overall network throughput, minimize end-to-end delay and able to distribute network load.

show abstract

“…This paper to emphasis on multicost routing, a vector of cost parameters is consigned to each link and the cost vector of a path is well-defined based on the cost vectors of the links that embrace it. (Ephremides, 2002) (Perkins and Bhagwat, 1994) (Perkins and Royer, 1999) presented certain distinguished routing algorithms for wireless ad hoc networks where the metric enhanced are the hop count or end to end delay. (Johnson and Maltz, 1996) used the link quality as the cost metric for routing, (Karagiorgas, et al, 2010) used the ETX as metric which integrates the link loss proportions and the interference between successive links of a network path.…”

Section: Previous Workmentioning

confidence: 99%

Multicost Routing Approach in Wireless Ad hoc Networks

Kamal¹

2012

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:A Wireless ad hoc network is a collection of autonomous movable nodes that communicate with each other over wireless links without any static infrastructure. In these networks there is no fixed topology because of the mobility of nodes, interference, multipath propagation and path loss. A variety of routing protocols and algorithm with varying network settings are analyzed to link between the nodes and communicate packets to their destinations. Most of these algorithms are single cost, in the logic that they consign a scalar cost parameter to every link and compute the path that has minimum cost. Although multicost routing, a vector of cost parameters is consigned to each link and the cost vector of a path is well-defined based on the cost vectors of the links that embrace it. Adjustable transmission power control of the nodes with multi cost routing algorithm can support optimizeto acquire the reduced interference and improve the ad hoc network performance. Approach: The link and path of the wireless network is consigned with several cost parameters. Hop count, total interference, node link delay, residual energy of a node and the node transmission power are the cost parameters assigned for link and path of the ad hoc networks. Multicost parameters are combined in different optimization function with respect to various routing algorithm. Results: Simulation and optimization shows multicost SUM/MIN Energy-Interference algorithm with variable transmission power can lead to decrease the interference and improves the overall network performance. Conclusion: The function optimized for wireless ad hoc networks that the Multicost SUM/MIN Energy-Interference algorithm achieves improved performance over than the single cost algorithm.

show abstract

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

Cited by 3,942 publications

References 7 publications

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

Location-Based Routing Protocols for Wireless Sensor Networks: A Survey

An Efficient Traffic-Load and Link-Interference Aware Routing Metric for Multi Radio Multi Channel Wireless Mesh Networks Based on Link’s Effective Capacity Estimation

Multicost Routing Approach in Wireless Ad hoc Networks

Contact Info

Product

Resources

About