Sciweavers

2862 search results - page 64 / 573
» Bicriteria Network Design Problems
Sort
View
INFOCOM
2010
IEEE
14 years 8 months ago
Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments
—In this paper, we consider routing in multi-hop wireless mesh networks. We analyze three standardized and commonly deployed routing mechanisms that we term “nodepair discovery...
Stanislav Miskovic, Edward W. Knightly
ICC
2007
IEEE
102views Communications» more  ICC 2007»
15 years 4 months ago
M-gated Scheduling in Wireless Networks: Performance and Cross-layer Design
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
Yan Li, Guangxi Zhu
ISCAPDCS
2003
14 years 11 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
ANCS
2008
ACM
14 years 12 months ago
On design of bandwidth scheduling algorithms for multiple data transfers in dedicated networks
The significance of high-performance dedicated networks has been well recognized due to the rapidly increasing number of large-scale applications that require high-speed data tran...
Yunyue Lin, Qishi Wu
MOBIHOC
2009
ACM
15 years 10 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar