J. J. Garcia-Luna-Aceves
ABSTRACT
The protocols used in ad hoc networks today are based on the assumption that the best way to approach multiple access interference (MAI) is to avoid it. Unfortunately, as the seminal work by Gupta and Kumar has shown, this approach does not scale. Recently, Ahlswede, Ning, Li, and Yeung showed that network coding (NC) can attain the max-flow min-cut throughput for multicast applications in directed graphs with point-to-point links. Motivated by this result, many researchers have attempted to make ad hoc networks scale using NC. However, the work by Liu, Goeckel, and Towsley has shown that NC does not increase the order capacity of wireless ad hoc networks for multi-pair unicast applications. We demonstrate that protocol architectures that exploit multi-packet reception (MPR) do increase the order capacity of random wireless ad hoc networks by a factor Θ(log n) under the protocol model. We also show that MPR provides a better capacity improvement for ad hoc networks than NC when the network experiences a single-source multicast and multi-pair unicasts. Based on these results, we introduce design problems for channel access and routing based on MPR, such that nodes communicate with one another on a many-to-many basis, rather than one-to-one as it is done today, in order to make ad hoc networks truly scalable.
- P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388--404, 2000. Google Scholar
Digital Library
- M. Grossglauser and D. Tse, "Mobility increases the capacity of ad hoc wireless networks," in Proc. of IEEE INFOCOM 2001, Anchorage, Alaska, USA., April 22--26 2001.Google Scholar
- R. M. de Moraes, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "Throughput-delay analysis of mobile ad-hoc networks with a multicopy relaying strategy," in Proc. of IEEE SECON 2004, Santa Clara, CA, USA., October 4-7 2004.Google Scholar
- R. Ahlswede, C. Ning, S. Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204--1216, 2000. Google ScholarDigital Library
- S. katti, D. Katabi, W. Hu, H. Rahul, and M. Medard, "The importance of being opportunistic: Practical network coding for wireless environments," in Proc. of Allerton 2005, Allerton House, UIUC, Illinois, USA., Sep. 2005.Google Scholar
- J. Liu, D. Goeckel, and D. Towsley, "Bounds on the gain of network coding and broadcasting in wireless networks," in Proc. of IEEE INFOCOM 2007, Anchorage, Alaska, USA., May 6-12 2007.Google Scholar
- Z. Li and B. Li, "Network coding in undirected networks," in Proc. of CISS 2004, Princeton, NJ, USA., March 17-19 2004.Google Scholar
- S. Ghez, S. Verdu, and S. C. Schwartz, "Stability properties of slotted aloha with multipacket reception capability," IEEE Transaction on Automatic Control, vol. 33, no. 7, pp. 640--649, 1988.Google ScholarCross Ref
- -, "Optimal decentralized control in the random access multipacket channel," IEEE Transaction on Automatic Control, vol. 34, no. 11, pp. 1153--1163, 1989.Google ScholarCross Ref
- G. Mergen and L. Tong, "Stability and capacity of regular wireless networks," IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1938--1953, 2005. Google ScholarDigital Library
- P. Christina and D. S. Sergio, "On the maximum stable throughput problem in random networks with directional antennas," in Proc. of ACM MOBIHOC 2003, Annapolis, Maryland, USA., June 1-3 2003. Google ScholarDigital Library
- Y. Su, P. Ying, and K. Sivakumar, "On the capacity improvement of ad hoc wireless networks using directional antennas," in Proc. of ACM MOBIHOC 2003, Annapolis, Maryland, USA., June 1-3 2003. Google ScholarDigital Library
- S. Toumpis and A. J. Goldsmith, "Capacity regions for wireless ad hoc networks," IEEE Transactions on Wireless Communications, vol. 2, no. 4, pp. 736--748, 2003. Google ScholarDigital Library
- P. Gupta and P. R. Kumar, "Internets in the sky: The capacity of three dimensional wireless networks," Communications in Information and Systems, vol. 1, no. 1, pp. 39--49, 2001.Google ScholarCross Ref
- R. M. de Moraes, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "Many-to-many communication: A new approach for collaboration in manets," in Proc. of IEEE INFOCOM 2007, Anchorage, Alaska, USA., May 6-12 2007.Google Scholar
- A. Ozgur, O. Leveque, and D. Tse, "Hierarchical cooperation achieves linear capacity scaling in ad hoc networks," in Proc. of IEEE INFOCOM 2007, Anchorage , Alaska , USA., May 6-12 2007.Google Scholar
- M. Franceschetti, O. Dousse, D. N. Tse, and P. Thiran, "Closing the gap in the capacity of wireless networks via percolation theory," IEEE Transactions on Information Theory, vol. 53, no. 3, pp. 1009--1018, 2007. Google ScholarDigital Library
- R. Negi and A. Rajeswaran, "Capacity of power constrained ad-hoc networks," in Proc. of IEEE INFOCOM 2006, Barcelona, Spain, April 23--29 2006.Google Scholar
- H. Zhang and J. Hou, "Capacity of wireless ad-hoc networks under ultra wide band with power constraint," in Proc. of IEEE INFOCOM 2005, Miami, FL, USA., March 13-17 2005.Google Scholar
- R. S. Diggavi, M. Grossglauser, and D. Tse, "Even one-dimentional mobility increases ad hoc wireless capacity," in Proc. of IEEE ISIT 2001, Washington, D.C. USA., June 24-29 2002.Google Scholar
- R. M. de Moraes, H. R. Sadjadpour, and J. J. Garcia-Luna-Aceves, "Mobility-capacity-delay trade-off in wireless ad hoc networks," Ad Hoc Networks, vol. 4, no. 5, 2006.Google Scholar
- P. Jacquet and G. Rodolakis, "Multicast scaling properties in massively dense ad hoc networks," in IEEE ICPADS 2005, Fukuoka, Japan, July 20-22 2005. Google ScholarDigital Library
- S. Shakkottai, X. Liu, and R. Srikant, "The multicast capacity of wireless ad-hoc networks," in Proc. of ACM MOBIHOC 2007, Montreal, Canada, September 9-14 2007. Google ScholarDigital Library
- R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- Y. E. Sagduyu and A. Ephremides, "Joint scheduling and wireless network coding," in Proc. of NetCod 2005, Riva del Garda, Italy, Apr. 7 2005.Google Scholar
Index Terms
- Challenges: towards truly scalable ad hoc networks
Recommendations
Extending the capacity of ad hoc networks beyond network coding
IWCMC '07: Proceedings of the 2007 international conference on Wireless communications and mobile computingThe protocols used in ad hoc networks today are based on the assumption that the best way to approach multiple access interference (MAI) is to avoid it. Unfortunately, as the seminal work by Gupta and Kumar has shown, this approach does not scale. We ...
Broadcast capacity in multihop wireless networks
MobiCom '06: Proceedings of the 12th annual international conference on Mobile computing and networkingIn this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such that all nodes receive the packets successfully in a limited time. We employ ...
Phoenix: making cooperation more efficient through network coding in wireless networks
This paper introduces a novel MAC protocol for wireless networks, called Phoenix, that employs ideas from Network Coding to enhance decode and forward cooperation. A relay is allowed to code data of its own together with a corrupted packet during a ...
Comments