-
1
-
-
84947727275
-
A packet routing protocol for arbitrary networks
-
Mayr, E.W, Puech, C, eds, STACS 1995, Springer, Heidelberg
-
Meyer auf der Heide, F., Vöcking, B.: A packet routing protocol for arbitrary networks. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 291-302. Springer, Heidelberg (1995)
-
(1995)
LNCS
, vol.900
, pp. 291-302
-
-
Meyer auf der Heide, F.1
Vöcking, B.2
-
3
-
-
0042014445
-
Capacity, delay and mobility in wireless ad-hoc networks
-
INFOCOM
-
Bansal, N., Liu, Z.: Capacity, delay and mobility in wireless ad-hoc networks. In: Conference of the IEEE Communications Society (INFOCOM), vol. 2, pp. 1553-1563 (2003)
-
(2003)
Conference of the IEEE Communications Society
, vol.2
, pp. 1553-1563
-
-
Bansal, N.1
Liu, Z.2
-
4
-
-
37849000224
-
Cross-layer latency minimization in wireless networks with SINR constraints
-
Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-layer latency minimization in wireless networks with SINR constraints. In: Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 110-119 (2007)
-
(2007)
Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC)
, pp. 110-119
-
-
Chafekar, D.1
Anil Kumar, V.S.2
Marathe, M.V.3
Parthasarathy, S.4
Srinivasan, A.5
-
5
-
-
51349128273
-
Approximation algorithms for computing capacity of wireless networks with SINR constraints
-
INFOCOM, pp
-
Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: Proceedings of the 27th Conference of the IEEE Communications Society (INFOCOM), pp. 1166-1174 (2008)
-
(2008)
Proceedings of the 27th Conference of the IEEE Communications Society
, pp. 1166-1174
-
-
Chafekar, D.1
Anil Kumar, V.S.2
Marathe, M.V.3
Parthasarathy, S.4
Srinivasan, A.5
-
6
-
-
70350666356
-
Oblivious interference scheduling
-
submitted
-
Fanghänel, A., Keßelheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: PODC 2009 (submitted, 2009)
-
(2009)
PODC
-
-
Fanghänel, A.1
Keßelheim, T.2
Räcke, H.3
Vöcking, B.4
-
8
-
-
4344610803
-
The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks
-
Thite, S., Balakrishnan, H., Barrett, C.L., Kumar, V.S.A., Marathe, M.V.: The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications 22(6), 1069-1079 (2004)
-
(2004)
IEEE Journal on Selected Areas in Communications
, vol.22
, Issue.6
, pp. 1069-1079
-
-
Thite, S.1
Balakrishnan, H.2
Barrett, C.L.3
Kumar, V.S.A.4
Marathe, M.V.5
-
10
-
-
0035506896
-
Models and approximation algorithms for channel assignment in radio networks
-
Krumke, S.O., Marathe, M.V., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 7(6), 575-584 (2001)
-
(2001)
Wireless Networks
, vol.7
, Issue.6
, pp. 575-584
-
-
Krumke, S.O.1
Marathe, M.V.2
Ravi, S.S.3
-
11
-
-
0000668759
-
-
Journal of Algorithms
-
Leighton, F.T., Maggs, B.M., Ranade, A.G., Rao, S.B.: Randomized routing and sorting on fixed-connection networks. Journal of Algorithms (1994)
-
(1994)
Randomized routing and sorting on fixed-connection networks
-
-
Leighton, F.T.1
Maggs, B.M.2
Ranade, A.G.3
Rao, S.B.4
-
13
-
-
34548302059
-
-
Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In. In: Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM), pp. 1433-1441 (2007)
-
Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In. In: Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM), pp. 1433-1441 (2007)
-
-
-
-
15
-
-
33748084040
-
Topology control meets SINR: The scheduling complexity of arbitrary topologies
-
Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: The scheduling complexity of arbitrary topologies. In: Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 310-321 (2006)
-
(2006)
Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC)
, pp. 310-321
-
-
Moscibroda, T.1
Wattenhofer, R.2
Zollinger, A.3
-
16
-
-
51249173817
-
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
-
Raghavan, P., Tompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365-374 (1987)
-
(1987)
Combinatorica
, vol.7
, Issue.4
, pp. 365-374
-
-
Raghavan, P.1
Tompson, C.D.2
-
18
-
-
0030699602
-
A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria
-
New York, USA, pp
-
Srinivasan, A., Teo, C.-P.: A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, New York, USA, pp. 636-643 (1997)
-
(1997)
STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
, pp. 636-643
-
-
Srinivasan, A.1
Teo, C.-P.2
-
19
-
-
0036920297
-
Energy-efficient broadcast and multicast trees in wireless networks
-
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-efficient broadcast and multicast trees in wireless networks. Mobile Networks and Applications (MONET) 7(6), 481-492 (2002)
-
(2002)
Mobile Networks and Applications (MONET)
, vol.7
, Issue.6
, pp. 481-492
-
-
Wieselthier, J.E.1
Nguyen, G.D.2
Ephremides, A.3
|