Sciweavers

669 search results - page 62 / 134
» Minimizing interference in ad hoc and sensor networks
Sort
View
GLOBECOM
2007
IEEE
14 years 3 months ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
SAINT
2008
IEEE
14 years 3 months ago
Matrix Routing -- An Interference Range Insensitive Routing Protocol for Wireless Sensor Networks
Interference ranges can dramatically affect the throughput in wireless sensor networks. While the transmission range defines the maximum physical range of a radio signal the inter...
Monty Beuster, Michael Beigl, Daniel Röhr, Ti...
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 3 months 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
ICC
2009
IEEE
201views Communications» more  ICC 2009»
13 years 6 months ago
Analyzing Selfish Topology Control in Multi-Radio Multi-Channel Multi-Hop Wireless Networks
Typically, topology control is perceived as a per-node transmit power control process that achieves certain networklevel objectives. We take an alternative approach of controlling ...
Ramakant S. Komali, Allen B. MacKenzie
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 2 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar