DialM-POMC the Fifth ACM SIGACTSIGOPS International Workshop on Foundation of Mobile Computing (2008)Ĭalinescu, G., Kapoor, S., Olshevsky, A., Zelikovsky, A.: Network lifetime and power assignment in ad-hoc wireless networks. 583–592 (2010)Ĭalinescu, G., Ellis, R.: On the lifetime of randomly deployed sensor networks.
5(2), 195–205 (2011)īyrka, J., Grandoni, F., Rothvoss, T., Sanita, L.: An improved LP-based approximation for Steiner tree. International Conference on Communication, Montreal, Canada (1997)īutenko, S., Kahruman-Anderoglu, S., Ursulenko, O.: On connected domination in unit ball graphs. Nova Science Publishers, New York (2005)īharghavan, V., Das, B.: Routing in ad hoc networks using minimum connected dominating sets. (eds.) Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing, vol. 2329–2334 (2004)īerman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient energy management in sensor networks. IEEE Wireless Communication and Networking Conference (WCNC’04), Atlanta, pp. 35–39 (2000)īerman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. Technical Report, Humboldt-Universitt zu Berlin (2000)īenini, L., Castelli, G., Macii, A., Poncino, M., Scarsi, R.: A discrete-time battery model for high-level power estimation. ACM 41(1), 153–180 (1994)īaudis, G., Gröpl, C., Hougardy, S., Nierhoff, T., Prömel, H.J.: Approximating minimum spanning sets in hypergraphs and polymatroids. Springer, Berlin (2006)īaker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006). Ad Hoc Network 3(3), 257–279 (2005)Īmbühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs. Akyildiz, I.F., Pompili, D., Melodia, T.: Underwater acoustic sensor networks: research challenges.
0 kommentar(er)
