Sciweavers

SPAA
2012
ACM
11 years 6 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
MOBIHOC
2012
ACM
11 years 6 months ago
Stability analyses of longest-queue-first link scheduling in MC-MR wireless networks
Longest-queue-first (LQF) link scheduling is a greedy link scheduling in multihop wireless networks. Its stability performance in single-channel single-radio (SC-SR) wireless net...
Peng-Jun Wan, XiaoHua Xu, Zhu Wang, ShaoJie Tang, ...