5079 search results - page 343 / 1016 » Hidden-Action in Network Routing |
217
Voted
INFOCOM
1995
IEEE
15 years 11 months ago
1995
IEEE
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
207
click to vote
CN
2008
15 years 7 months ago
2008
We study the throughput of multi-hop routes and stability of forwarding queues in a wireless ad-hoc network with random access channel. We focus on a wireless network with static ...
227
Voted
WCNC
2008
IEEE
16 years 1 months ago
2008
IEEE
—The hot spot problem is a typical byproduct of the many-to-one traffic pattern that characterizes most wireless sensor networks: the nodes with the best channel to the sink are ...
242
click to vote
IPSN
2009
Springer
16 years 2 months ago
2009
Springer
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
183
Voted
NETCOOP
2007
Springer
16 years 1 months ago
2007
Springer
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...