CIIT
2004
13 years 6 months ago
2004
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
CIIT
2004
13 years 6 months ago
2004
This paper presents a novel swarm intelligence inspired routing algorithm (EARA) for mobile ad hoc networks. Based on the understanding of the evolutionary cooperation in the biol...
MASCOTS
2010
13 years 6 months ago
2010
In this paper, we address the problem of low-latency routing in a vehicular highway network. To cover long highways while minimizing the number of required roadside access points,...
AINA
2007
IEEE
13 years 6 months ago
2007
IEEE
Abstract— We propose a unified cross layer routing protocol with multiple constraints for CDMA multihop cellular networks (MCN). Multiple constraints are imposed on intermediate...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
Multi-agent systems benefit greatly from an organization design that guides agents in determining when to communicate, how often, with whom, with what priority, and so on. However...
WSC
2008
13 years 6 months ago
2008
Traditionally call centres were based on circuit-switched systems. But with the advancement of communication technologies, call centres have shifted to packet-switched systems. Th...
LCN
2000
IEEE
13 years 8 months ago
2000
IEEE
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
CNSR
2004
IEEE
13 years 8 months ago
2004
IEEE
An ad-hoc network is formed when a group of wireless nodes pledge to help each other in passing packets based upon a pre-agreed protocol. Temporally Ordered Routing Algorithm (TOR...
ICC
2007
IEEE
13 years 8 months ago
2007
IEEE
Abstract-- Hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future network operations. Recently, the wireless part of WOBAN has been gaining...
SC
1993
ACM
13 years 8 months ago
1993
ACM
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of t...