— We consider the fundamental delay tradeoffs for minimizing energy expenditure in a multi-user wireless downlink with randomly varying channels. First, we extend the BerryGallag...
— The capacity problem in wireless mesh networks can be alleviated by equipping the mesh routers with multiple radios tuned to non-overlapping channels. However, channel assignme...
Krishna N. Ramachandran, Elizabeth M. Belding-Roye...
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
Sabyasachi Roy, Y. Charlie Hu, Dimitrios Peroulis,...
— Performance in multihop wireless networks is known to degrade with the number of hops for both TCP and UDP traffic. For VoIP, the wireless network presents additional challeng...
Dragor Niculescu, Samrat Ganguly, Kyungtae Kim, Ra...
— Unstructured p2p and overlay network applications often require that a random graph be constructed, and that some form of random node selection take place over that graph. A ke...
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...