Sciweavers

137 search results - page 16 / 28
» Optimising Node Coordinates for the Shortest Path Problem
Sort
View
INFOCOM
2002
IEEE
14 years 8 days ago
Energy Efficient Communications in Ad Hoc Networks Using Directional Antennas
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...
Akis Spyropoulos, Cauligi S. Raghavendra
NETWORKS
2006
13 years 7 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
INFOCOM
2007
IEEE
14 years 1 months ago
VoIP on Wireless Meshes: Models, Algorithms and Evaluation
—We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls...
Anand Kashyap, Samrat Ganguly, Samir R. Das, Suman...
INFOCOM
2010
IEEE
13 years 5 months ago
Green Wave: Latency and Capacity-Efficient Sleep Scheduling for Wireless Networks
While scheduling the nodes in a wireless network to sleep periodically can save energy, it also incurs higher latency and lower throughput. We consider the problem of designing op...
Saikat Guha, Chi-Kin Chau, Prithwish Basu
SDM
2012
SIAM
273views Data Mining» more  SDM 2012»
11 years 9 months ago
A Framework for the Evaluation and Management of Network Centrality
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...
Vatche Ishakian, Dóra Erdös, Evimaria ...