Sciweavers

104 search results - page 10 / 21
» Comparative Graph Theoretical Characterization of Networks o...
Sort
View
MOBIHOC
2002
ACM
15 years 9 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
INFOCOM
2010
IEEE
14 years 6 months ago
A Greedy Link Scheduler for Wireless Networks with Gaussian Multiple Access and Broadcast Channels
Information theoretic Broadcast Channels (BC) and Multiple Access Channels (MAC) enable a single node to transmit data simultaneously to multiple nodes, and multiple nodes to trans...
Arun Sridharan, Can Emre Koksal, Elif Uysal-Biyiko...
WCNC
2010
IEEE
15 years 1 months ago
Throughput Analysis for Cooperation in Random Access Networks
—This paper aims at answering the questions of how to enable cooperative communications in random access networks. And, since cooperation introduces extra transmissions in the ch...
Amr El-Sherif, K. J. Ray Liu
90
Voted
ICDCS
2010
IEEE
14 years 11 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
SIGCOMM
2010
ACM
14 years 9 months ago
Unbiased sampling in directed social graph
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
Tianyi Wang, Yang Chen, Zengbin Zhang, Peng Sun, B...