Server-centric data center architecture has been proposed to provide high throughput, scalable construction and error tolerance with commodity servers and switches for cloud data centers. To fully utilize those advantages of server-centric data center, an effective routing algorithm to find high quality multiple paths in Server-centric network is needed. However, current routing algorithms cann...

In this paper, we extend previous work on geographic random forwarding (GeRaF) by considering a more efficient paradigm whereby on/off cycles are exploited and every node can participate to packet relaying, as long as it wakes up during any handshake procedure. The protocol is fully distributed, as routing decisions are made hop by hop based on geographic metrics and using a joint channel acces...

This paper describes two novel techniques, information-driven sensor querying (IDSQ) and constrained anisotropic diffusion routing (CADR), for energy-efficient data querying and routing in ad hoc sensor networks for a range of collaborative signal processing tasks. The key idea is to introduce an information utility measure to select which sensors to query and to dynamically guide data routing....

Ad-hoc wireless sensor networks have been an active research topic for the last several years. Sensor networks are distinguished from traditional networks by characteristics such as deeply embedded routers, highly dynamic networks, resource-constrained nodes, and unreliable and asymmetric links. Ant routing has shown good performance for communication networks; in this paper, we show why the ex...

In this paper, we are interested in routing vehicles to minimize unmet demand under uncertainty. Such a problem arises in situations with large demand or tight deadlines, so that routes that satisfy all demand points are difficult or impossible to obtain. An important application is the distribution of medical supplies to respond to large-scale emergencies, such as natural disasters or terroris...

We propose CentRoute, a centralized on-demand tree-based routing protocol for resource constrained wireless sensor networks. CentRoute is a unicast routing protocol that utilizes source routing to form paths from a node to the sink and vice-versa. Each node in the network can connect to a single tree at a time which is controlled by a dynamically selected root (or sink). By centralizing routing...

By our analysis, the QoS routing is the optimization problem under the satisfaction of multiple QoS constraints. The Particles Swarm Optimization (PSO) is an optimization algorithm which has been applied to finding shortest path in the network. However, it might fall into local optimal solution, and is not able to solve the routing based on multiple constraints. To tackle this problem, we propo...

Mobile ad hoc networks represent a special class of dynamic networks. Here nodes act as both hosts and routers whereby the routing protocol forms the backbone of such networks. Mobile ad hoc networks are constrained by bandwidth, energy and ever changing topologies. Thus to conserve some of these scarce resources, a few nodes may stop cooperation. In this paper we model a dynamic noncooperative...

Routing algorithm plays a critical role in determining the performance and reliability of a satellite network. Since the resources in satellite networks are constrained, it is a big challenge to find paths that satisfy all QoS requirements in a low cost for satellite network users. In this paper, a novel routing scheme together with two multi objective optimization routing algorithms-prior orde...

Due to the constrained communication range and high density of sensor nodes in wireless sensor network, forwarding packets in sensor networks is a important field of research over the past decade. At present, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim...