Sciweavers

2362 search results - page 248 / 473
» The wireless network jamming problem
Sort
View
ICC
2008
IEEE
130views Communications» more  ICC 2008»
16 years 28 days ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
JSAC
2011
176views more  JSAC 2011»
15 years 1 months ago
Cross-Layer Routing Using Cooperative Transmission in Vehicular Ad-hoc Networks
Wireless vehicular ad hoc networks are characterized by multi-hop transmission, where a key problem is the design of routing, e.g., how to efficiently direct the information flo...
Zhiguo Ding, Kin K. Leung
INFOCOM
2003
IEEE
15 years 11 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
MOBIHOC
2008
ACM
16 years 6 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp...
ICDCN
2011
Springer
14 years 10 months ago
Deterministic Dominating Set Construction in Networks with Bounded Degree
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
Roy Friedman, Alex Kogan