Sciweavers

50 search results - page 8 / 10
» Fast topological design with simulated annealing for multica...
Sort
View
TON
2008
125views more  TON 2008»
13 years 6 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ICCCN
2007
IEEE
14 years 27 days ago
Optimization Models for Streaming in Multihop Wireless Networks
— Wireless spectrum is a scare resource, while media streaming usually requires high end-to-end bandwidth. Media streaming in wireless ad hoc networks is therefore a particularly...
Zongpeng Li, Baochun Li, Mea Wang
ICDCSW
2008
IEEE
14 years 1 months ago
Fast Link Assessment in Wireless Mesh Networks by Using Non-Constant Weight Code
Abstract— The wireless mesh network is experiencing tremendous growth with the standardization of IEEE 802.11 and IEEE 802.16 technologies. Compared to its wired counterpart, the...
Ravi Nelavelli, Rajesh Prasad, Hongyi Wu
INFOCOM
2008
IEEE
14 years 1 months ago
Fast and Distributed Computation of Schedules in Wireless Networks
—In a wireless network with node exclusive spectrum sharing, two popular schedules are maximum weight matching (MWM) schedule and maximum size matching (MSM) schedule. The former...
Supratim Deb, Karan Mangla, K. V. M. Naidu
IWCMC
2006
ACM
14 years 16 days ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras