Sciweavers

10044 search results - page 1857 / 2009
» Authentication in Wireless Networks
Sort
View
INFOCOM
2010
IEEE
15 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 ...
156
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...
Theus Hossmann, Thrasyvoulos Spyropoulos, Franck L...
MOBIHOC
2010
ACM
15 years 2 months ago
Barrier coverage with sensors of limited mobility
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
Anwar Saipulla, Benyuan Liu, Guoliang Xing, Xinwen...
MOBIHOC
2010
ACM
15 years 2 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
MST
2010
187views more  MST 2010»
14 years 11 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
« Prev « First page 1857 / 2009 Last » Next »