![]() ![]() 126–135 (1994)ĭing, L., Wu, W., Willson, J.K., Du, H., Lee, W.: Construction of directional virtual backbones with minimum routing cost in wireless networks. 410, 756–765 (2009)ĭeering, S., Farinacci, D., Jacobson, V., Lui, C.-G., Wei, L.: An architecture for wide area multicast routing. ![]() 15(10), 908–920 (2004)ĭai, D., Yu, C.: A (5 + ε)-approximation algorithm for minimum weighted dominating set in unit disk graph. 86(1–3), 179–189 (1990)ĭai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. 86(1–3), 165–177 (1990)Ĭolbourn, C.J., Stewart, L.K.: Permutation graphs: connected domination and Steiner trees. Networks 42(2), 202–208 (2003)Ĭhvátal, V.: A greedy heuristic for the set-covering problem. 6, 183–190 (2006)Ĭheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. TOSN 3(2), 12 (2007)Ĭheng, X., Ding, M., Du, D.H., Jia, X.: Virtual backbone construction in multihop ad hoc wireless networks. 2638–2645 (2005)Ĭheng, M.X., Ruan, L., Wu, W.: Coverage breach problems in bandwidth-constrained sensor networks. 51(3), 447–462 (2011)Ĭheng, M.X., Ruan, L., Wu, W.: Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. In: Proceedings of the Third ACM International Symposium on Mobile ad hoc Networking and Computing, Lausanne, Switzerland (2002)Ĭheng, M.X., Gong, X.: Maximum lifetime coverage preserving scheduling algorithms in sensor networks. Networks 3(3–4), 213–229 (2002)Ĭhen, Y.P., Liestman, A.L.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. 1976–1984 (2005)Ĭardei, M., MacCallum, D., Cheng, X., Min, M., Jia, X., Li, D., Du, D.-Z.: Wireless sensor networks with energy efficient organization. In: Proceedings the Sixth International Conference on Computer Science and Informatics (CS&I’2002) (2002)Ĭardei, M., Thai, M., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. 11(3), 333–340 (2005)Ĭardei, M., Cheng, M.X., Cheng, X., Du, D.-Z.: Connected domination in ad hoc wireless networks. 114–126 (2003)Ĭardei, M., Du, D.-Z.: Improving wireless sensor network lifetime through power aware organization. Proceedings of European Symposium on Algorithms (ESA’03), Lecture Notes in Computer Science, vol. 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 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |