87 search results - page 9 / 18 » Maximal independent sets in radio networks |
AHSWN
2010
13 years 7 months ago
2010
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
IJCNN
2006
IEEE
14 years 1 months ago
2006
IEEE
—In this paper we propose a new graph-based feature splitting algorithm maxInd, which creates a balanced split maximizing the independence between the two feature sets. We study ...
SPAA
2010
ACM
14 years 10 days ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
TIT
2011
13 years 2 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
MOBIHOC
2004
ACM
14 years 7 months ago
2004
ACM
Caching Internet based services is a potentially important application for MANETs, as it can improve mobile users' perceived quality of service, reduce their energy consumpti...