http://ieeexplore.ieee.org TOC Alert for Publication# 7755 2012 February 10 11 3 c1 c1 341 11 3 c2 c2 344 11 3 353 366 1076 11 3 367 376 933 11 3 377 389 1030 11 3 390 401 1407 11 3 402 413 801 11 3 414 426 974 -2β(0≤ α ≤ β ≤1/2). All nodes can only move inside the cell which they are initially distributed in, and at the beginning of each time slot, every node moves from its current square to a uniformly chosen point in a uniformly chosen adjacent square. By proposing a new multihop relay scheme, we present smooth trade-offs between throughput and delay by controlling nodes' mobility. We also consider a network of area n^γ (0 ≤ γ ≤ 1) and find that network size does not affect the results obtained before.]]> 11 3 427 438 487 11 3 439 452 954 11 3 453 463 1237 11 3 464 477 2015 11 3 478 491 868 11 3 492 503 1041 11 3 504 517 734 11 3 518 528 1038 11 3 c3 c3 344 11 3 c4 c4 341