Wireless Network Design: Optimization Models and Solution ...

10 Integer Programming Models for Power-optimal Trees in Wireless Networks 245
17. Calinescu, G., Kapoor, S., Sarwat, M.: Bounded-hops power assignment in ad hoc wireless
networks. Discrete Applied Mathematics 154, 1358–1371 (2006).
18. Chu, T., Nikoladis, I.: Energy efficient broadcast in mobile ad hoc networks. In: Proceedings
of the 1st International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW), pp.
177–190 (2002).
19. Clementi, A., Penna, P., Silvestri, R.: Hardness results for the power range assignment problem
in packet radio networks. In: Lecture Notes in Computer Science 1671, pp. 197–208.
Springer (1999).
20. Clementi, A., Penna, P., Silvestri, R.: The power range assignment problem in radio networks
on the plane. In: Lecture Notes in Computer Science 1770, pp. 651–660. Springer (2000).
21. Clementi, A., Ianni, M.D., Silvestri, R.: The minimum broadcast range assignment problem
on linear multi-hop wireless networks. Theoretical Computer Science 299, 751–761 (2003).
22. Clementi, A., Penna, P., Silvestri, R.: On the power assignment problem in radio networks.
Mobile Networks and Applications 9 125–140 (2004).
23. Conti, M., Giordano, S.: Multi-hop ad hoc Networking: the reality. IEEE Communications
Magazine 45 88–95 (2007).
24. Conti, M., Crowcroft, J., Passarella, A.: Multi-Hop Ad Hoc Networks from Theory to Reality.
Nova Science Publishers (2007).
25. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C. Introduction to Algorithms, 2nd Edition.
MIT Press and McGraw-Hill (2001).
26. Das, G.K., Das, S., Nandy, S.C.: Range assignment for energy efficient broadcasting in linear
radio networks. Theoretical Computer Science 352, 332–341 (2006).
27. Das, G.K., Ghosh, S., Nandy, S.C.: An efficient heuristic algorithm for 2D h-hops range
assignment problem. In: Proceedings of IEEE GLOBECOM ’04, pp. 1051–1055 (2004).
28. Das, A.K., Marks, R.J., El-Sharkawi, E., Arabshahi, P., Gray, A.: Minimum power broadcast
trees for wireless networks: integer programming formulations. In: Proceedings of IEEE
INFOCOM ’03, pp. 1001–1110 (2003).
29. Das, A.K., Marks, R.J., El-Sharkawi, E., Arabshahi, P., Gray, A.: Optimization methods for
minimum power bidirectional topology construction in wireless networks with sectored antennas.
In: Proceedings of IEEE GLOBECOM ’05, pp. 3962–3968 (2005).
30. Das, A.K., Marks, R.J., El-Sharkawi, E., Arabshahi, P., Gray, A.: r-shrink: a heuristic for
improving minimum power broadcast trees in wireless networks. In: Proceedings of IEEE
GLOBECOM ’03, pp. 523–527 (2003).
31. Fortnow, L.: The Status of the P Versus NP Problem. Communications of the ACM 52(9),
78–86 (2009).
32. ILOG CPLEX 10.0, Users’ Manual, 2006.
33. Kang, I., Poovendran, R.: Iterated local optimization for minimum energy broadcast. In: Proceedings
of the 3rd IEEE International Symposium on Modeling and Optimization in Mobile,
Ad Hoc, and Wireless Networks (WiOpt ’05), pp. 332–341 (2005).
34. Khoury, B.N., Pardalos, P.M., Hearn, D.W.: Equivalent formulations for the Steiner problem
in graphs. In Du, D.Z. et al. (eds.), Network Optimization Problems, pp. 111–123. World
Scientific Publishing, Singapore, 1993.
35. Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks.
In: Lecture Note in Computer Science 1200, pp. 363–374 (1997).
36. Klasing, R., Navarra, A., Papadopoulos, A., Pérennes, S.: Adaptive broadcast consumption
(ABC), a new heuristic and new bounds for the minimum energy broadcast routing problem.
In: Lecture Notes in Computer Science 2042, pp. 866–877, Springer (2004).
37. Liang, W. Constructing minimum-energy broadcast trees in wireless ad hoc networks. In:
Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking &
Computing (MOBIHOC ’02), pp. 112–122, 2002.
38. Min, M., Prokopyev, O.A., Pardalos, P.M.: Optimal solutions to minimum total energy broadcasting
problem in wireless ad hoc networks. Journal of Combinatorial Optimization 11, 59–
69 (2006).