Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks

@incollection{citeulike:2423391, abstract = {Interference is a fundamental limiting factor in wireless networks. Due to interaction among transmissions of neighboring nodes and need for multi-hop routing in large networks, it is a non-trivial problem to estimate how much throughput a network can deliver. In an important piece of work, Gupta and Kumar\ [3] showed that in a random model, where n identical nodes are distributed uniformly in a unit square and each node is communicating with a random destination, the capacity of the network as measured in bit-meters/sec is . This result articulates the packing constraint of the n paths: on average each path is hops long, and thus in the space of size O(n), only paths can be accommodated.}, author = {Buragohain, Chiranjeeb and Suri, Subhash and T\'{o}th, Csaba and Zhou, Yunhong }, citeulike-article-id = {2423391}, doi = {10.1007/978-3-540-73545-8\_22}, journal = {Computing and Combinatorics}, keywords = {disjoint, interference, paths, s-t, throughput, wireless}, pages = {210--221}, posted-at = {2008-02-24 20:23:11}, priority = {3}, title = {Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks}, url = {http://dx.doi.org/10.1007/978-3-540-73545-8\_22}, year = {2007} }

TY - CHAP ID - citeulike:2423391 L3 - citeulike-article-id:2423391 TI - Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks JF - Computing and Combinatorics SP - 210 EP - 221 N2 - Interference is a fundamental limiting factor in wireless networks. Due to interaction among transmissions of neighboring nodes and need for multi-hop routing in large networks, it is a non-trivial problem to estimate how much throughput a network can deliver. In an important piece of work, Gupta and Kumar [3] showed that in a random model, where n identical nodes are distributed uniformly in a unit square and each node is communicating with a random destination, the capacity of the network as measured in bit-meters/sec is . This result articulates the packing constraint of the n paths: on average each path is hops long, and thus in the space of size O(n), only paths can be accommodated. KW - disjoint KW - interference KW - paths KW - s-t KW - throughput KW - wireless AU - Buragohain, Chiranjeeb AU - Suri, Subhash AU - Tóth, Csaba AU - Zhou, Yunhong PY - 2007/// UR - http://dx.doi.org/10.1007/978-3-540-73545-8_22 ER -