552 search results - page 9 / 111 » Routing complexity of faulty networks |
INFOCOM
1995
IEEE
13 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...
BIOSYSTEMS
2007
13 years 7 months ago
2007
Alternative pathways through a gene regulation network connect a regulatory molecule to its (indirect) regulatory target via different intermediate regulators. We here show for tw...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
CF
2010
ACM
14 years 17 days ago
2010
ACM
BIOADIT
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In mobile ad-hoc networks, nodes act both as terminals and information relays, and participate in a common routing protocol, such as Dynamic Source Routing (DSR). The net...