#### DMCA

## Sensitivity analysis for an optimal routing policy in an ad hoc wireless network (2002)

### Cached

### Download Links

Venue: | in IEEE Vehicular Technology Conference 2002-Spring |

Citations: | 4 - 1 self |

### Citations

2201 | Data Networks
- Bertsekas, Gallager
- 1987
(Show Context)
Citation Context ...algorithms and it regularly communicates this estimate to its neighbors. To a great extent these algorithms are, in their information structure, similar to the Distributed Bellman-Ford algorithm (see =-=[12]-=-, [13]), and can be thought of the sample-path dependent extensions of the distributed Bellman-Ford algorithm. In all the distributed algorithms presented in [4] and [5], each node uses information on... |

746 |
Ad hoc Networking
- Perkins
- 2000
(Show Context)
Citation Context ...ody of work which addresses these issues in the context of networks with no central controller and unspecified connectivity topology, where each node can itself act as a store-and-forward router (see =-=[1]-=-). The general routing problem in an ad hoc network is to define a policy which, given the trajectory histories of all the messages, chooses the nodes to transmit the messages next. Such a policy must... |

458 | Stochastic Orders and Their Applications - Shaked, Shanthikumar - 1994 |

276 | Probability metrics and the stability of stochastic models - Rachev - 1991 |

167 |
Real Analysis
- Folland
- 1999
(Show Context)
Citation Context ...adcast model we first quantify this error by defining a distance measure between the true broadcast model P and the estimated model Q. We use the total variation metric for this purpose (see [6], and =-=[1]). The total variation distance bet-=-ween two local broadcast models, P and Q, describing the probabilities of transmission success for node i, is defined as σ � Pi¥ Qi��¢ sup � ∑ � S� A����� � A � � � ... |

132 | and A.Misra, “Minimum Energy Paths for Reliable Communication
- Banerjee
- 2002
(Show Context)
Citation Context ...here similar goals must be achieved with unreliable, time-varying channels, and where new concerns, such as energy consumption and channel interference impose additional constraints. It is shown (see =-=[2]-=- and [3]) that in wireless networks due to the unreliability of channels retransmission mechanisms have a non-negligible impact on the energy performance of routing protocols. In other words, the prop... |

79 | MRPC: Maximizing network lifetime for reliable routing in wireless environments."
- Misra, Banerjee
- 2002
(Show Context)
Citation Context ...ilar goals must be achieved with unreliable, time-varying channels, and where new concerns, such as energy consumption and channel interference impose additional constraints. It is shown (see [2] and =-=[3]-=-) that in wireless networks due to the unreliability of channels retransmission mechanisms have a non-negligible impact on the energy performance of routing protocols. In other words, the proposed rou... |

73 | A responsive distributed routing algorithm for computer networks
- Jaffe
- 1982
(Show Context)
Citation Context ...thms and it regularly communicates this estimate to its neighbors. To a great extent these algorithms are, in their information structure, similar to the Distributed Bellman-Ford algorithm (see [12], =-=[13]-=-), and can be thought of the sample-path dependent extensions of the distributed Bellman-Ford algorithm. In all the distributed algorithms presented in [4] and [5], each node uses information only abo... |

54 | Computer Networking,
- Kurose, Ross
- 2002
(Show Context)
Citation Context ... priority listing of nodes in when all the network parameters are known and available at the same location (this algorithm is similar in nature to standard Dijkstra in open shortest path first (OSPF) =-=[9]-=-). Furthermore, three distributed algorithms to compute the optimal priority listing of the neighbors at each node are proposed in [5]. Note that due to the nature of the optimal priority policy, ther... |

24 |
Data networks. Upper Saddle River
- Bertsekas, Gallager
- 1992
(Show Context)
Citation Context ... information in order to compute a local priority list of its neighbors. To a great extent these algorithms are, in their information structure, similar to the distributed Bellman–Ford algorithm (see =-=[13]-=- and [14]), and can be thought of the sample-path dependent extensions of the distributed Bellman–Ford algorithm. In all the distributed algorithms presented in [4] and [5], the priority list for each... |

16 |
PARO: A Power-Aware Routing Optimization Scheme for Mobile Ad hoc Networks”,
- Gomez, Campbell, et al.
- 2001
(Show Context)
Citation Context ... the actual route a message takes between source and destination is sample path dependent. This characteristic of the solution is distinctly different from that of other proposed algorithms (see [2], =-=[9]-=-, [8], [3], [1]). The above model and all proposed algorithms assume knowledge of the transmission probabilities . To actually implement the algorithms, methods to estimate these probabilities should ... |

10 | Stochastic routing in ad hoc wireless networks
- Lott, Teneketzis
- 2000
(Show Context)
Citation Context ...nt a sensitivity analysis of a known optimal (with respect to an energy consumption criterion) routing policy in a stochastic ad hoc network. Our analysis is based on the model and results of [5] and =-=[4]-=-. In [5], the authors investigate a time-invariant network routing problem where a probabilistic model for wireless local broadcasts is used (see Fig. 1). Under the assumption that the transmission pr... |

9 |
Decentralized stochastic control
- Varaiya, Walrand
- 1977
(Show Context)
Citation Context ...studied as a stochastic control problem with imperfect information. Stochastic control problems with imperfect information are dual control problems that address joint estimation and control problems =-=[3]-=-. The information state [3] for these problems lies in an infinite dimensional space even when the state space and action space are finite. This feature makes such dual control problems analytically a... |

9 |
How does the value function of a Markov decision process depend on the transition probabilities
- Müller
- 1997
(Show Context)
Citation Context ...true) broadcast model we first quantify this error by defining a distance measure between the true broadcast model P and the estimated model Q. We use the total variation metric for this purpose (see =-=[6], and [1]). The total variati-=-on distance between two local broadcast models, P and Q, describing the probabilities of transmission success for node i, is defined as σ � Pi¥ Qi��¢ sup � ∑ � S� A����� �... |

1 |
Sensitivity analysis for optimal routing in ad hoc wireless networks,” EECS
- Javidi, Teneketzis
- 1992
(Show Context)
Citation Context ...n the estimation of the quality of links connected to node i. Under the above assumption we prove the following theorem which summarizes the main result of this paper. For the proof of Theorem 1, see =-=[2]. Our approach is inspired by the general -=-framework proposed in [6]. Theorem 1: Under Assumption 1, we have where K ¢ ∑ N j� 1 dP � π¡ ¥ ˜π��� K max j σ � Pj¥ Q j��¥ Rmax� R j��� M j� 2� Rmax� c j ¦ I... |

1 |
Optimal routing algorithms in ad hoc wireless networks
- Lott, Teneketzis
(Show Context)
Citation Context ...nel quality and expected number of retransmissions, both functions of probability of successful transmission, in the definition of each link’s length or each node’s transmission cost. Furthermore, in =-=[4]-=-, [5], and [6] it is shown that the local broadcast nature of wireless transmission, which usually causes interference among neighboring nodes, can be used to our advantage. This can be done if succes... |