Sciweavers

29 search results - page 6 / 6
» Characterization of Inaccessibility in Wireless Networks: A ...
Sort
View
INFOCOM
2010
IEEE
13 years 3 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
INFOCOM
2010
IEEE
13 years 3 months ago
Neighbor Discovery with Reception Status Feedback to Transmitters
—Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighb...
Ramin Khalili, Dennis Goeckel, Donald F. Towsley, ...
INFOCOM
2009
IEEE
13 years 11 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
INFOCOM
2010
IEEE
13 years 3 months ago
Maximizing the Contact Opportunity for Vehicular Internet Access
Abstract—With increasing popularity of media enabled handhelds, the need for high data-rate services for mobile users is evident. Large-scale Wireless LANs (WLANs) can provide su...
Zizhan Zheng, Zhixue Lu, Prasun Sinha, Santosh Kum...