Applied optimization methods for wireless networks

Applied Optimization Methods for Wireless Networks

Volumn 9781107018808, Issue , 2010, Pages 1-330

  Hou, Y Thomas ^a   Shi, Yi ^a,b   Sherali, Hanif D ^a  

^a Virginia Polytechnic Institute and State University   (United States)

^b INTELLIGENT AUTOMATION INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; OPERATIONS RESEARCH; OPTIMIZATION; POWER CONTROL; STUDENTS; TEACHING; WIRELESS NETWORKS;

COMMUNICATIONS AND NETWORKINGS; COMPLEX PROBLEMS; CROSS LAYER OPTIMIZATION; GRADUATE STUDENTS; OPTIMIZATION METHOD; OPTIMIZATION MODELS; SCIENCE DISCIPLINES; STEP-BY-STEP INSTRUCTIONS;

NETWORK LAYERS;

EID: 84929662746     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9781139088466     Document Type: Book

References (181)

1. E. Aarts and J. Korst, Simulated Annealing and Boltzman Machines, New York, NY, John Wiley & Sons, 1989.
2. C. Ahn and R. Ramakrishna, “A genetic algorithm for shortest path routing problem and the sizing of populations,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 6, pp. 566–579, December 2002.
3. R.K. Ahuja, “Algorithms for the minimax transportation problem,” Naval Research Logistics Quarterly, vol. 33, pp. 725–739, 1986.
4. I.F. Akyildiz, W. Su, Y. Sankara subramaniam, and E. Cayirci, “Wireless sensor net works: a survey,” Computer Networks (Elsevier), vol. 38, no. 4, pp. 393–422, 2002.
5. I. Akyildiz and X. Wang, “A survey on wireless mesh networks,” IEEE Communications Magazine, vol. 43, no. 9, September 2005.
6. M. Alasti, K. Sayrafian-Pour, A. Ephremides, and N. Farvardin, “Multiple description coding in networks with congestion problem,” IEEE Transactions on Information Theory, vol. 47, no. 3, pp. 891–902, March 2001.
7. M. Alicherry, R. Bhatia, and L. Li, “Joint channel assignment and routing for through put optimization in multi-radio wireless mesh networks,” in Proc. ACM MobiCom, pp. 58–72, Cologne, Germany, August 28–September 2 2005.
8. J.G. Apostolopoulos, T. Wong, W. Tan, and S. Wee, “On multiple description streaming in content delivery networks,” in Proc. IEEE INFOCOM, pp. 1736–1745, New York, NY, June 2002.
9. T. Back, D. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation, New York, NY, Oxford University Press, 1997.
10. M.S. Bazaraa, J.J. Jarvis, and H.D. Sherali, Linear Programming and Network Flows, 4th edition, New York, NY, John Wiley & Sons Inc., 2010.
11. M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, 3rd edition, New York, John Wiley & Sons, 2006.
12. A.C. Begen, Y. Altunbasak, and O. Ergun, “Multi-path selection for multiple description encoded video streaming,” EURASIP Signal Processing: Image Communications, vol. 20, no. 1, pp. 39–60, January 2005.
13. A. Behzad and I. Rubin, “Impact of power control on the performance of ad hoc wireless networks,” in Proc. IEEE INFOCOM, pp. 102–113, Miami, FL, March 13–17, 2005.
14. D. Bertsekas and R. Gallager, Data Networks, Englewood Cliffs, NJ, Prentice Hall, 1992.
15. V. Bhandari and N.H. Vaidya, “Capacity of multi-channel wireless networks with ran dom (c, f) assignment,” in Proc. ACM Mobi Hoc, pp. 229–238, Montreal, QC, Canada, September 9–14, 2007.
16. R. Bhatia and M. Kodialam, “On power efficient communication over multi-hop wireless networks: joint routing, scheduling and power control,” in Proc. IEEE INFOCOM, pp. 1457–1466, Hong Kong, China, March 7–11, 2004.
17. E. Biglieri, R. Calderbank, A. Constantinides, A. Goldsmith, A. Paulraj, and H.V. Poor, MIMO Wireless Communications, Cambridge, Cambridge University Press, Jan uary 2007.
18. A. Bletsas, A. Khisti, D. Reed, and A. Lippman, “A simple cooperative diversity method based on network path selection,” IEEE Journal on Selected Areas in Communications, vol. 24, no. 3, pp. 659–672, March 2006.
19. C. Blum and A. Roli, “Metaheuristics in combinatorial optimization: overview and con ceptual comparison,” ACM Computing Surveys, vol. 35, no. 3, pp. 268–308, September 2003.
20. T.X. Brown, H.N. Gabow, and Q. Zhang, “Maximum flow-life curve for a wireless ad hoc network,” in Proc. ACM MobiHoc, pp. 128–136, Long Beach, CA, October 4–5, 2001.
21. N. Bulusu and S. Jha, Wireless Sensor Networks: A Systems Perspective, Nor wood, MA, Artech House, 2005.
22. J. Cai, S. Shen, J.W. Mark, and A.S. Alfa, “Semi-distributed user relaying algorithm for amplify-and-forward wireless relay networks,” IEEE Transactions on Wireless Communication, vol. 7, no. 4, pp. 1348–1357, April 2008.
23. J. Chakareski, S. Han, and B. Girod, “Layered coding vs. multiple descrip tions for video streaming over multiple paths,” in Proc. ACM Multimedia, pp. 422–431, Berkeley, CA, November 2003.
24. J.H. Chang and L. Tassiulas, “Maximum lifetime routing in wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 12, issue 4, pp. 609–619, August 2004.
25. P. Charnsethikul, “The constrained minimax linear assignment problem,” Optimization Methods and Software, vol. 14, issues 1 & 2, pp. 37–48, 2000.
26. C.C. Chen and D.S. Lee, “A joint design of distributed QoS scheduling and power control for wireless networks,” in Proc. IEEE INFOCOM, Barcelona, Catalunya, Spain, April 23–29, 2006.
27. L. Chen, S.H. Low, M. Chiang, and J.C. Doyle, “Cross-layer congestion control, rout ing and scheduling design in ad hoc wireless networks,” in Proc. IEEE INFOCOM, Barcelona, Catalunya, Spain, April 23–29, 2006.
28. Concorde TSP Solver, http://www.tsp.gatech.edu/concorde/.
29. N. Clemens and C. Rose, “Intelligent power allocation strategies in an unlicensed spec trum,” in Proc. IEEE DySPAN, pp. 37–42, Baltimore, MD, November 8–11, 2005.
30. T.J. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 2nd edition, The MIT Press, 2001.
31. IBM ILOG CPLEX Optimizer, http://www-01.ibm.com/software/integration/ optimization/cplex-optimizer/.
32. R.L. Cruz and A.V. Santhanam, “Optimal routing, link scheduling and power control in multi-hop wireless networks,” in Proc. IEEE INFOCOM, pp. 702–711, San Francisco, CA, March 30–April 3, 2003.
33. H. Dai, K. Ng, R.C. Wong, and M. Wu, “On the capacity of multi-channel wireless net works using directional antennas,” in Proc. IEEE INFOCOM, pp. 1301–1309, Phoenix, AZ, April 13–18, 2008.
34. I. Dietrich and F. Dressler, “On the lifetime of wireless sensor networks,” ACM Trans actions on Sensor Networks, vol. 5, no. 1, pp. 1–39, February 2009.
35. R. Draves, J. Padhye, and B. Zill, “Routing in multi-radio, multi-hop wireless mesh networks,” in Proc. ACM MobiCom, pp. 114–128, Philadelphia, PA, September 26– October 1, 2004.
36. J. Dreo, A. Petrowski, P. Siarry, and E. Taillard, Metaheuristics for Hard Optimization: Methods and Case Studies, New York, Springer-Verlag, 2006.
37. T. Elbatt and A. Ephremides, “Joint scheduling and power control for wireless ad-hoc networks,” in Proc. IEEE INFOCOM, pp. 976–984, New York, NY, June 23–27, 2002.
38. D. Eppstein, “Finding the k shortest paths,” SIAM Journal on Computing, vol. 28, no. 2, pp. 652–673, August 1999.
39. R. Etkin, A. Parekh, and D. Tse, “Spectrum sharing for unlicensed bands,” in Proc. IEEE DySPAN, pp. 251–258, Baltimore, MD, November 8–11, 2005.
40. FCC (Federal Communications Commission), “Facilitating opportunities for flexible, efficient, and reliable spectrum use employing cognitive radio technologies, notice of proposed rulemaking and order,” FCC 03-322.
41. G. J. Foschini and M. J. Gans, “On limits of wireless communications in a fading environment when using multiple antennas,” Wireless Personal Communications, vol. 6, pp. 311–355, March 1998.
42. M. Franceschetti, O. Dousse, D.N.C. Tse, and P. Thiran, “Closing the gap in the capacity of wireless networks via percolation theory,” IEEE Transaction on Information The ory, vol. 53, no. 3, pp. 1009–1018, March 2007.
43. D. Fritchman, “A binary channel characterization using partitioned markov chains,” IEEE Transactions on Information Theory, vol. 13, no. 2, pp. 221–227, April 1967.
44. A.E. Gamal, J. Mammen, B. Prabhakar, and D. Shah, “Throughput-delay trade-off in wireless networks,” in Proc. IEEE INFOCOM, pp. 464–475, Hong Kong, China, March 7–11, 2004.
45. G. Ganesan and Y.G. Li, “Cooperative spectrum sensing in cognitive radio networks,” in Proc. IEEE DySPAN, pp. 137–143, Baltimore, MD, November 8–11, 2005.
46. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, New York, NY, W.H. Freeman and Company, 1979.
47. A. Gashemi and E. Sousa, “Collaborative spectrum sensing for opportunistic access in fading environments,” in Proc. IEEE DySPAN, pp. 131–136, Baltimore, MD, Novem ber 8–11, 2005.
48. D. Gesbert, M. Shafi, D. Shiu, P. J. Smith, and A. Naguib, “From theory to practice: an overview of MIMO space-time coded wireless systems,” IEEE Journal on Select Areas in Communications, vol. 21, no. 3, pp. 281–302, April 2003.
49. E. Giler, “Eric Giler demos wireless electricity,” URL:http://www.ted.com/talks/eric giler demos wireless electricity.html.
50. A. Giridhar and P.R. Kumar, “Maximizing the functional lifetime of sensor networks,” in Proc. ACM/IEEE International Symposium on Information Processing in Sensor Net works, pp. 5–12, Los Angeles, CA, April 2005.
51. F. Glover and M. Laguna, Tabu Search. Boston, MA, Kluwer-Academic, 1997.
52. GNU Linear Programming Kit, http://www.gnu.org/software/glpk/.
53. N. Gogate, D. Chung, S.S. Panwar, and Y. Wang, “Supporting image/video applications in a multihop radio environment using route diversity and multiple description coding,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 12, no. 9, pp. 777–792, September 2002.
54. A.J. Goldsmith and S.-G. Chua, “Adaptive coded modulation for fading channels,” IEEE Transactions on Communications, vol. 46, no. 5, pp. 595–602, May 1998.
55. A. Goldsmith, S. A. Jafar, N. Jindal, and S. Vishwanath, “Capacity limits of MIMO channels,” IEEE Journal on Select Areas in Communications, vol. 21, no. 1, pp. 684–702, June 2003.
56. A. Goldsmith, Wireless Communications, Cambridge, Cambridge University Press, 2005.
57. V. Goyal, “Multiple description coding: Compression meets the network,” IEEE Signal Processing Magazine, vol. 18, pp. 74–93, September 2001.
58. G. Grimmett, Percolation, 2nd edition, New York, Springer-Verlag, 1999.
59. P. Gupta and P.R. Kumar, “Critical power for asymptotic connectivity in wireless net works,” in Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneany, G. Yin, and Q. Zhang (eds.), Boston, MA, Birkhauser, pp. 547–566, 1998.
60. P. Gupta and P.R. Kumar, “The capacity of wireless networks,” IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388–404, March 2000.
61. A. Keshavarz-Haddad, V. Ribeiro, and R. Riedi, “Broadcast capacity in multihop wireless networks,” in Proc. ACM MobiCom, pp. 239–250, Los Angeles, CA, September 23–26, 2006.
62. A. Keshavarz-Haddad and R. Riedi, “On the broadcast capacity of multihop wireless networks: interplay of power, density and interference,” in Proc. IEEE SECON, pp. 314–323, San Diego, CA, June 18–21, 2007.
63. A. Keshavarz-Haddad and R. Riedi, “Multicast capacity of large homogeneous multi-hop wireless networks,” in Proc. International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp. 116–124, Berlin, Germany, April 2008.
64. S. Haykin, Adaptive Filter Theory, Englewood Cliffs, NJ, Prentice-Hall, 1996.
65. S. Haykin, “Cognitive radio: brain-empowered wireless communications,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 2, pp. 201–220, February 2005.
66. S. He, J. Chen, F. Jiang, D.K.Y. Yau, G. Xing, and Y. Sun, “Energy provisioning in wireless rechargeable sensor networks,” in Proc. IEEE INFOCOM, pp. 2006–2014, Shanghai, China, April 2011.
67. W. Heinzelman, “Application-specific protocol architectures for wireless networks,” Ph.D. thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 2000.
68. J.-B. Hiriart-Urruty and C. Lemaréchal, Fundamentals of Convex Analysis, Berlin, Springer-Verlag, 2001.
69. Y.T. Hou, Y. Shi, and H.D. Sherali, “On node lifetime problem for energy-constrained wireless sensor networks,” ACM/Springer Mobile Networks and Applications, vol. 10, no. 6, pp. 865–878, December 2005.
70. Y.T. Hou and Y. Shi, “Variable bit rate flow routing in wireless sensor networks,” IEEE Transactions on Wireless Communications, vol. 56, no. 6, pp. 2140–2148, June 2007.
71. Y.T. Hou, Y. Shi, and H.D. Sherali, “Rate allocation and network lifetime problems for wireless sensor networks,” IEEE/ACM Transactions on Networking, vol. 16, no. 2, pp. 321–334, April 2008.
72. Y.-C. Hu and D. Johnson, “Design and demonstration of live audio and video over multihop wireless ad hoc networks,” in Proc. IEEE MILCOM, pp. 7–10, Anaheim, CA, October 2002.
73. J. Huang, R.A. Berry, and M.L. Honig, “Spectrum sharing with distributed interference compensation,” in Proc. IEEE DySPAN, pp. 88–93, Baltimore, MD, November 8–11, 2005.
74. O. Ileri, D. Samardzija, T. Sizer, and N.B. Mandayam, “Demand responsive pricing and competitive spectrum allocation via a spectrum server,” in Proc. IEEE DySPAN, pp. 194–202, Baltimore, MD, November 8–11, 2005.
75. S.-W. Jeon, N. Devroye, M. Vu, S.-Y. Chung, and V. Tarokh, “Cognitive networks achieve throughput scaling of a homogeneous network,” in Proc. ICST International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), Seoul, Korea, June 26–27, 2009.
76. X. Jiang, J. Polastre, and D. Culler, “Perpetual environmentally powered sensor net works,” in Proc. ACM/IEEE International Symposium on Information Processing in Sensor Networks, pp. 463–468, Los Angeles, CA, April 2005.
77. A. Kansal, J. Hsu, S. Zahedi, and M.B. Srivastava, “Power management in energy har vesting sensor networks,” ACM Transactions Embedded Computing Systems, vol. 6, no. 4, article 32, September 2007.
78. K. Kar, M. Kodialam, T.V. Lakshman, and L. Tassiulas, “Routing for network capacity maximization in energy-constrained ad-hoc networks,” in Proc. IEEE INFOCOM, pp. 673–681, March 30–April 3, 2003, San Francisco, CA.
79. F. Kelly, A. Maulloo, and D. Tan, “Rate control for communication networks: shadow prices, proportional fairness and stability,” in Journal of the Operational Research Society, vol. 49, no. 3, pp. 237–252, March 1998.
80. H. Kesten, Percolation Theory for Mathematicians, Boston, MA, Birkhauser, 1982.
81. J. Kleinberg and E. Tardos, Algorithm Design, Boston, MA, Addison-Wesley Longman Publishing, 2005.
82. M. Kodialam and T. Nandagopal, “Characterizing the capacity region in multi-radio multi-channel wireless mesh networks,” in Proc. ACM MobiCom, pp. 73–87, Cologne, Germany, August 28–September 2, 2005.
83. M. Kodialam and T. Nandagopal, “Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels,” IEEE/ACM Transactions on Network ing, vol. 13, no. 4, pp. 868–880, August 2005.
84. G. Kramer, I. Maric, and R.D. Yates, “Cooperative communications,” Foundations and Trends in Networking, Now Publishers, June 2007.
85. A. Kurs, A. Karalis, R. Moffatt, J.D. Joannopoulos, P. Fisher, and M. Soljacic, “Wireless power transfer via strongly coupled magnetic resonances,” Science, vol. 317, no. 5834, pp. 83–86, 2007.
86. P. Kyasanur and N.H. Vaidya, “Capacity of multi-channel wireless networks: impact of number of channels and interfaces,” in Proc. ACM MobiCom, pp. 43–57, Cologne, Germany, August 28–September 2, 2005.
87. J.N. Laneman, D.N.C. Tse, and G.W. Wornell, “Cooperative diversity in wireless net works: efficient protocols and outage behavior,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3062–3080, December 2004.
88. L. Lasdon, Optimization Theory for Large Scale Systems, New York, NY, Macmillan., 1970.
89. E. Lawler, Combinatorial Optimization: Networks and Matroids, Mineola, NY, Dover Publications Inc., 2001.
90. J.-W. Lee, M. Chiang, and R.A. Calder bank, “Price-based distributed algorithm for optimal rate-reliability tradeoff in network utility maximization,” IEEE Journal on Selected Areas in Communications, vol. 24, issue 5, pp. 962–976, May 2006.
91. X.-Y. Li, J.-Z. Zhao, Y.-W. Wu, S.-J. Tang, X.-H. Xu, and X.F. Mao, “Broadcast capac ity for wireless ad hoc networks,” in Proc. IEEE MASS, pp. 114–123, Atlanta, GA, September 29–October 2, 2008.
92. X.-Y. Li, “Multicast capacity of wireless ad hoc networks,” IEEE/ACM Transactions Networking, vol. 17, no. 3, pp. 950–961, June 2009.
93. Z. Li, Y. Peng, W. Zhang, and D. Qiao, “J-RoC: A joint routing and charging scheme to prolong sensor network lifetime,” in Proc. IEEE ICNP, pp. 373–382, Vancouver, Canada, October 17–20, 2011.
94. D. Linden and T.B. Reddy, Handbook of Batteries, 3rd edition, McGraw-Hill, 2002.
95. LINDO Systems–Optimization Software, http://www.lindo.com/.
96. X. Liu and W. Wang, “On the characteristics of spectrum-agile communication net works,” in Proc. IEEE DySPAN, pp. 214–223, Baltimore, MD, November 8–11, 2005.
97. J. Liu, D. Goeckel, and D. Towsley, “Bounds on the gain of network coding and broad casting in wireless networks,” in Proc. IEEE INFOCOM, pp. 724–732, Anchorage, AK, May 6–12, 2007.
98. S.H. Low, “A duality model of TCP and queue management algorithms,” IEEE/ACM Transactions on Networking, vol. 11, issue 4, pp. 525–536, August 2003.
99. H. Luss and D.R. Smith, “Resource allocation among competing activities: a lexico graphic minimax approach,” Operations Research Letters, vol. 5, no. 5, pp. 227–231, November 1986.
100. J. R. Magnus and H. Neudecker, Matrix Differential Calculus with Applications in Statistics and Economics, New York, NY, Wiley, 1999.
101. N. Malpani and J. Chen, “A note on practical construction of maximum bandwidth paths,” Information Processing Letters, vol. 83, pp. 175–180, August 2002.
102. S. Mao, S. Lin, S.S. Panwar, Y. Wang, and E. Celebi, “Video transport over ad hoc networks: multistream coding with multipath transport,” IEEE Journal on Select Areas in Communications, vol. 21, no. 10, pp. 1721–1737, December 2003.
103. S. Mao, S. Kompella, Y.T. Hou, H.D. Sherali, and S.F. Midkiff, “Routing for concur rent video sessions in ad hoc networks,” IEEE Transactions on Vehicular Technology, vol. 55, issue 1, pp. 317–327, January 2006.
104. S. Mao, Y.T. Hou, X. Cheng, H.D. Sherali, S.F. Midkiff, and Y.-Q. Zhang, “On routing for multiple description video over wireless ad hoc networks,” IEEE Transactions on Multimedia, vol. 8, issue 5, pp. 1063–1074, October 2006.
105. I. Maric and R.D. Yates, “Cooperative multihop broadcast for wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 22, issue 6, pp. 1080–1088, August 2004.
106. M. McHenry and D. McCloskey, “Spectrum occupancy measurements: Republican National Convention, New York, NY, August 30–September 3, 2004,” available at http://www.sharedspectrum.com/wp-content/uploads/4 NSF NYC Report.pdf.
107. R. Meester and R. Roy, Continuum Percolation, Cambridge, Cambridge University Press, 1996.
108. N. Megiddo, “Linear-time almorithm for linear programming in r3 and related prob lems,” SIAM Journal on Computing, vol. 12, pp. 759–776, 1983.
109. E.C. van der Meulen and P. Vanroose. “The capacity of a relay channel, both with and without delay,” IEEE Transactions on Information Theory, vol. 53, no. 10, pp. 3774–3776, October 2007.
110. Z. Michalewicz and D.B. Fogel, How to Solve It: Modern Heuristics, 2nd edition, New York, Springer-Verlag, 2004.
111. S.M. Mishra, A. Sahai, and R.W. Brodersen, “Cooperative sensing among cognitive radios,” in Proc. IEEE International Conference on Communications, pp. 1658–1663, Istanbul, Turkey, June 11–15, 2006.
112. J. Mitola III, Cognitive radio: an integrated agent architecture for software defined radio, Ph.D. thesis, KTH Royal Institute of Technology, 2000.
113. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, New York, NY, John Wiley & Sons, 1999.
114. A. Nemirovski, Interior Point Polynomial Time Methods in Convex Programming, 2004, available at http://www2.isye.gatech.edu/ñemirovs/Lect IPM.pdf.
115. N. Nie and C. Comaniciu, “Adaptive channel allocation spectrum etiquette for cognitive radio networks,” in Proc. IEEE DySPAN, pp. 269–278, Baltimore, MD, November 8– 11, 2005.
116. R. Ogier, F. Templin, and M. Lewis, “Topology dissemination based on reverse-path forwarding (TBRPF),” February 2004, IETF RFC 3684.
117. L. Ozarow, “On a source coding problem with two channels and three receivers,” Bell System Technical Journal, vol. 59, no. 10, pp. 84–91, December 1980.
118. A. Ö zgür, O. Lévêque, and D.N.C. Tse, “Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks,” IEEE Transaction on Information Theory, vol. 53, no. 10, pp. 3549–3572, October 2007.
119. M. Padberg and G. Rinaldi, “A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems,” SIAM Review, vol. 33, no. 1, pp. 60–100, 1991.
120. P. Papadimitratos, Z. Haas, and E. Sirer, “Path set selection in mobile ad hoc networks,” in Proc. ACM MobiHoc, pp. 1–11, Lausanne, Switzerland, June 2002.
121. G. Park, T. Rosing, M.D. Todd, C.R. Farrar, and W. Hodgkiss, “Energy harvesting for structural health monitoring sensor networks,” Journal of Infrastructure Systems, vol. 14, no. 1, pp. 64–79, March 2008.
122. A.J. Paulraj, D.A. Gore, R.U. Nabar, and H. Bolcskei, “An overview of MIMO com munications — a key to gigabit wireless,” Proceedings of the IEEE, vol. 92, no. 2, pp. 198–218, February 2004.
123. C. Peng, H. Zheng, and B.Y. Zhao, “Utilization and fairness in spectrum assignment for opportunistic spectrum access,” ACM/Springer Mobile Networks and Applications, vol. 11, issue 4, pp. 555–576, August 2006.
124. Y. Peng, Z. Li, W. Zhang, and D. Qiao, “Prolonging sensor network lifetime through wireless charging,” in Proc. IEEE RTSS, pp. 129–139, San Diego, CA, November 30– December 3, 2010.
125. Power Cast, http://www.powercastco.com.
126. A.P. Punnen and K.P.K. Nair, “Improved complexity bound for the maximum cardi nality bottleneck bipartite matching problem,” Elsevier Discrete Applied Mathematics, vol. 44, pp. 91–93, 1994.
127. R. Ramanathan and R. Rosales-Hain, “Topology control of multihop wireless networks using transmit power adjustment,” in Proc. IEEE INFOCOM, pp. 404–413, 2000, Tel Aviv, Israel, March 26–30.
128. A. Raniwala and T. Chiueh, “Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network,” in Proc. IEEE INFOCOM, pp. 2223–2234, Miami, FL, March 13–17, 2005.
129. T.S. Rappaport, Wireless Communications: Principles and Practice, Upper Saddle River, NJ, Prentice Hall, 1996.
130. J.H. Reed, Software Radio: A Modern Approach to Radio Engineering, Upper Saddle River, NJ, Prentice Hall, May 2002.
131. V. Rodoplu and T.H. Meng, “Minimum energy mobile wireless networks,” IEEE Jour nal on Selected Areas in Communications, vol. 17, no. 8, pp. 1333–1344, August 1999.
132. J. B. Rosen, “The gradient projection method for nonlinear programming, part I: linear constraints,” SIAM Journal on Applied Mathematics, vol. 8, pp. 181–217, 1960.
133. A. Sankar and Z. Liu, “Maximum lifetime routing in wireless ad-hoc networks,” in Proc. IEEE INFOCOM, pp. 1089–1097, Hong Kong, China, March 7–11, 2004.
134. Wireless Innovation Forum, http://www.sdrforum.org.
135. E. Setton, Y. Liang, and B. Girod, “Adaptive multiple description video streaming over multiple channels with active probing,” in Proc. IEEE ICME, Baltimore, MD, July 2003.
136. A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity–part I: system description,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1927–1938, November 2003.
137. A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity–part II: implementation aspects and performance analysis,” IEEE Transactions on Communications, vol. 51, no. 11, pp. 1939–1948, November 2003.
138. S. Shakkottai, X. Liu, and R. Srikant, “The multicast capacity of large multihop wireless networks,” in Proc. ACM MobiHoc, pp. 247–255, Montreal, Quebec, Canada, Septem ber 9–14, 2007.
139. S. Sharma, Y. Shi, Y.T. Hou, and S. Kompella, “An optimal algorithm for relay node assignment in cooperative ad hoc networks,” IEEE/ACM Transactions on Networking, vol. 19, issue 3, pp. 879–892, June 2011.
140. H.D. Sherali and W.P. Adams, “A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems,” SIAM Journal on Discrete Mathematics, vol. 3, no. 3, pp. 411–430, 1990.
141. H.D. Sherali and C.H. Tuncbilek, “A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique,” Journal of Global Optimization, vol. 2, pp. 101–112, 1992.
142. H.D. Sherali and W.P. Adams, “A hierarchy of relaxations and convex hull characteri zations for mixed-integer zero-one programming problems,” Discrete Applied Mathematics, vol. 52, pp. 83–106, 1994.
143. H.D. Sherali and C.H. Tuncbilek, “Comparison of two Reformulation-Linearization Technique based linear programming relaxations for polynomial programming problems,” Journal of Global Optimization, vol. 10, pp. 381–390, 1997.
144. H.D. Sherali, “Global optimization of non convex polynomial programming problems having rational exponents,” Journal of Global Optimization, vol. 12, no. 3, pp. 267–283, 1998.
145. H. Sherali, K. Ozbay, and S. Subramanian, “The time-dependent shortest pair of disjoint paths problem: complexity, models, and algorithms,” Networks, vol. 31, no. 4, pp. 259–272, December 1998.
146. H.D. Sherali and W.P. Adams, A Reformulation-Linearization Technique for Solving Discrete and Continuous Non convex Problems, Dordrecht/Boston/London, Kluwer Academic Publishers, 1999.
147. H.D. Sherali, “On mixed-integer zero-one representations for separable lower-semi continuous piecewise-linear functions,” Operations Research Letters, vol. 28, no. 4, pp. 155–160, 2001.
148. H.D. Sherali and L. Liberti, “Reformulation-Linearization Technique for global optimization,” in Encyclopedia of Optimization, 2nd edition, P. Pardalos and C. Floudas (eds.) Springer, Berlin, pp. 3263–3268, 2008.
149. H.D. Sherali, “Reformulation-Linearization Technique for MIPs,” in Wiley Encyclopedia of Operations Research and Management Science, Invited Advanced Topic paper, February 2011.
150. Y. Shi and Y.T. Hou, “Optimal power control for multi-hop software defined radio net works,” in Proc. IEEE INFOCOM, pp. 1694–1702, Anchorage, AL, May 6–12, 2007.
151. Y. Shi and Y.T. Hou, “Theoretical results on base station movement problem for sensor network,” in Proc. IEEE INFOCOM, pp. 376–384, Phoenix, AZ, April 14–17, 2008.
152. Y. Shi, Y.T. Hou, J. Liu, and S. Kompella, “Bridging the gap between protocol and phys ical models for wireless networks,” IEEE Transactions on Mobile Computing, 2012.
153. K. Sohrabi, J. Gao, V. Ailawadhi, and G. Pottie, “Protocols for self-organizing of a wireless sensor network,” IEEE Personal Communications Magazine, vol. 7, pp. 16–27, October 2000.
154. M.E. Steenstrup, “Opportunistic use of radio-frequency spectrum: a network perspective,” in Proc. IEEE DySPAN, pp. 638–641, Baltimore, MD, November 8–11, 2005.
155. I. E. Telatar, “Capacity of multi-antenna Gaussian channels,” European Transactions on Telecommunications, vol. 10, no. 6, pp. 585–596, November 1999.
156. N. Tesla, “Apparatus for transmitting electrical energy,” US patent number 1,119,732, issued in December 1914.
157. B. Tong, Z. Li, G. Wang, and W. Zhang, “How wireless power charging technology affects sensor network deployment and routing,” in Proc. IEEE ICDCS, pp. 438–447, Genoa, Italy, June 2010.
158. D. Ugarte and A.B. McDonald, “On the capacity of dynamic spectrum access enabled networks,” in Proc. IEEE DySPAN, pp. 630–633, Baltimore, MD, November 8–11, 2005.
159. T.A. Vanderelli, J.G. Shearer, and J.R. Shearer, “Method and apparatus for a wireless power supply,” US patent number 7,027,311, issued in April 2006.
160. E. Visostky, S. Kuffner, and R. Peterson, “On collaborative detection of TV transmissions in support of dynamic spectrum sharing,” in Proc. IEEE DySPAN, pp. 338–345, Baltimore, MD, November 8–11, 2005.
161. A. Volgenant and C.W. Duin, “Improved polynomial algorithms for robust bottleneck problems with interval data,” Elsevier Computers and Operations Research, vol. 37, issue 5, pp. 909–915, May, 2010.
162. M. Vu, N. Devroye, M. Sharif, and V. Tarokh, “Scaling laws of cognitive networks,” in Proc. ICST International Conference on Cognitive Radio Oriented Wireless Networks and Communications (Crown Com), pp. 2–8, Orlando, FL, July 31–August 3, 2007.
163. W. Wang, V. Srinivasan, and K.C. Chua, “Using mobile relays to prolong the lifetime of wireless sensor networks,” in Proc. ACM MobiCom, Cologne, pp. 270–283, Germany, August 2005.
164. W. Wang, V. Srinivasan, and K.C. Chua, “Extending the lifetime of wireless sensor net works through mobile relays,” IEEE/ACM Transactions on Networking, vol. 16, no. 5, pp. 1108–1120, October 2008.
165. Z. Wang, H.R. Sajadpour, and J.J. Garcia-Luna-Aceves, “The capacity and energy effi ciency of wireless ad hoc networks with multi-packet reception,” in Proc. ACM Mobi-Hoc, pp. 179–188, Hong Kong, China, May 26–30, 2008.
166. R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, “Distributed topology control for power efficient operation in multihop wireless ad hoc networks,” in Proc. IEEE INFOCOM, pp. 1388–1397, Anchorage, AK, April 22–26, 2001.
167. E. Welzl, “Smallest enclosing disks,” Lecture Notes in Computer Science (LNCS), vol. 555, pp. 359–370, 1991.
168. D.B. West, Introduction to Graph Theory, Upper Saddle River, NJ, Prentice Hall, 2001.
169. J. Winters, “On the capacity of radio communication systems with diversity in a Rayleigh fading environment,” IEEE Journal on Selected Areas in Communications, vol. 5, no. 5, pp. 871–878, June 1987.
170. J. H. Winters, “Smart antenna techniques and their application to wireless ad hoc networks,” IEEE Wireless Communications Magazine, vol. 13, no. 4, pp. 77–83, August 2006.
171. Wi Tricity Corp., http://www.witricity.com.
172. Wireless Power Consortium, http://www.wirelesspowerconsortium.com/.
173. A. Wyglinski, M. Nekovee, and Y.T. Hou, Cognitive Radio Communications and Networks: Principles and Practice, Elsevier, December 2009.
174. C. Xin, B. Xie, and C.-C. Shen, “A novel layered graph model for topology formation and routing in dynamic spectrum access networks,” in Proc. IEEE DySPAN, pp. 308–317, Baltimore, MD, November 8–11, 2005.
175. S. Ye and R. S. Blum, “Optimized signaling for MIMO interference systems with feedback,” IEEE Transactions on Signal Processing, vol. 51, no. 11, pp. 2839–2848, November 2003.
176. C. Yin, L. Gao, and S. Cui, “Scaling laws of overlaid wireless networks: a cognitive radio network vs. a primary network,” IEEE/ACM Transactions on Networking, vol. 18, no. 4, pp. 1317–1329, August 2010.
177. H. Zhang and J.C. Hou, “Capacity of wireless ad-hoc networks under ultra wide band with power constraint,” in Proc. IEEE INFOCOM, pp. 455–465, Miami, FL, March 13–17, 2005.
178. F. Zhang, X. Liu, S.A. Hackworth, R.J. Sclabassi, and M. Sun, “In vitro and in vivo studies on wireless powering of medical sensors and implantable devices,” in Proc. IEEE/NIH Life Science Systems and Applications Workshop (LiSSA), pp. 84–87, Bethesda, MD, April 2009.
179. J. Zhao, H. Zheng, and G. Yang, “Distributed coordination in dynamic spectrum allocation networks,” in Proc. IEEE DySPAN, pp. 259–268, Baltimore, MD, November 8–11, 2005.
180. Y. Zhao, R.S. Adve, and T.J. Lim, “Improving amplify-and-forward relay networks: optimal power allocation versus selection,” in Proc. IEEE International Symposium on Information Theory, pp. 1234–1238, Seattle, WA, July 9–14, 2006.
181. R. Zheng, “Information dissemination in power-constrained wireless network,” in Proc. IEEE INFOCOM, Barcelona, Catalunya, Spain, April 23–29, 2006.