1494 search results - page 255 / 299 » Polynomial time algorithms for network information flow |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—Providing proper economic incentives is essential for the success of dynamic spectrum sharing. Cooperative spectrum sharing is one effective way to achieve this goal. In coopera...
JSAC
2007
13 years 8 months ago
2007
— In information theory, it has been shown that network coding can effectively improve the throughput of multicast communication sessions in directed acyclic graphs. More practic...
MOBIHOC
2005
ACM
14 years 8 months ago
2005
ACM
In this paper, we introduce a novel congestion control algorithm for TCP over multihop IEEE 802.11 wireless networks implementing rate-based scheduling of transmissions within the...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
— To share and exchange the files among Internet users, Peerto-Peer (P2P) applications build another layer of overlay networks on top of the Internet Infrastructure. In P2P fil...
WICON
2008
13 years 10 months ago
2008
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...