343 search results - page 68 / 69 » A Routing Metric and Algorithm for IEEE802.16 Mesh Networks |
TON
2002
13 years 4 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
PIMRC
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
WPES
2006
ACM
13 years 11 months ago
2006
ACM
Many applications of mix networks such as anonymous Web browsing require relationship anonymity: it should be hard for the attacker to determine who is communicating with whom. Co...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
An important problem for wireless ad hoc networks has been to design overlay networks that allow time- and energy-efficient routing. Many local-control strategies for maintaining...
MP
1998
13 years 5 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...