592 search results - page 91 / 119 » Scalable ant-based routing algorithm for ad-hoc networks |
PET
2009
Springer
14 years 3 months ago
2009
Springer
The performance of an anonymous path can be described using many network metrics – e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have ...
SIGCOMM
2000
ACM
14 years 29 days ago
2000
ACM
As the number of hosts attached to a network increases beyond what can be connected by a single local area network (LAN), forwarding packets between hosts on different LANs become...
ITNG
2007
IEEE
14 years 2 months ago
2007
IEEE
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
IPPS
1998
IEEE
14 years 26 days ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
PPNA
2011
13 years 3 months ago
2011
The proliferation of novel wireless network technologies creates new opportunities for complex peerto-peer information dissemination systems. A key challenge that remains in this a...