316 search results - page 3 / 64 » Oblivious interference scheduling |
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
FOAL
2007
ACM
15 years 1 months ago
2007
ACM
AspectJ aims at managing tangled concerns in Java systems. Crosscutting aspect definitions are woven into the Java bytecode at compile-time. Whether the better modularization intr...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
—In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...