Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Weizhong Luo"'
Publikováno v:
IEEE Access, Vol 10, Pp 23774-23784 (2022)
In wireless sensor networks, rotating dominating set is an efficient method for balancing the energy consumption of nodes, and thereby extending the network operational time. This method can be abstracted as $k$ -Lifetime Dominating Set in bipartite
Externí odkaz:
https://doaj.org/article/2a4890890a714bf7bf0a27e4559e83cc
Publikováno v:
Theoretical Computer Science. 518:32-41
Max-lifetime Target Coverage can be viewed as a family of problems where the task is to partition the sensors into groups and assign their time-slots such that the coverage lifetime is maximized while satisfying some coverage requirement. Unfortunate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5462d1f057e5d720d94b90ce9a3ccab
https://doi.org/10.1016/j.tcs.2013.06.008
https://doi.org/10.1016/j.tcs.2013.06.008
Publikováno v:
Theoretical Computer Science. 511:2-12
In this paper, we study the Planar Connected Dominating Set problem, which, given a planar graph G=(V,E) and a non-negative integer k, asks for a subset [email protected]?V with |D|@?k such that D forms a dominating set of G and induces a connected g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::85c2b7695c70e33ee37dd10f51d4aecf
https://doi.org/10.1016/j.tcs.2013.06.011
https://doi.org/10.1016/j.tcs.2013.06.011
Publikováno v:
Theoretical Computer Science. 508:16-25
Power assignment in wireless ad hoc networks can be seen as a family of problems in which the task is to find in a given power requirement network a minimum power communication subnetwork that satisfies a given connectivity constraint. These problems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2bf0b06b37d886a94837f3718c86de2
https://doi.org/10.1016/j.tcs.2012.02.040
https://doi.org/10.1016/j.tcs.2012.02.040
Publikováno v:
INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences. 5:406-411
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59ab217893ea84f42c930137d21cc340
https://doi.org/10.4156/aiss.vol5.issue3.48
https://doi.org/10.4156/aiss.vol5.issue3.48
Publikováno v:
International Journal of Advancements in Computing Technology. 3:172-179
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::206ad0dde0397a152237c537cc62f104
https://doi.org/10.4156/ijact.vol3.issue10.22
https://doi.org/10.4156/ijact.vol3.issue10.22
Publikováno v:
Lecture Notes in Electrical Engineering ISBN: 9789811005381
Achieving energy efficient monitoring of targets is a critical issue in sensor networks and, thus various power efficient coverage algorithms have been proposed. These algorithms divide the sensors into monitor sets, where each monitor set is able to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::06dd10f86369dbf5dc10442dc87fee10
https://doi.org/10.1007/978-981-10-0539-8_37
https://doi.org/10.1007/978-981-10-0539-8_37
Publikováno v:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management ISBN: 9783642212031
FAW-AAIM
FAW-AAIM
Power assignment in wireless ad hoc networks can be seen as a family of problems in which the task is to find in a given power requirement network a minimum power communication subnetwork that satisfies a given connectivity constraint. These problems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80ac16ef4e67f6231e380ede7cb54dac
https://doi.org/10.1007/978-3-642-21204-8_19
https://doi.org/10.1007/978-3-642-21204-8_19
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642208768
TAMC
TAMC
In this paper, we study the Planar Connected Dominating Set problem, which, given a planar graph G = (V,E) and a non-negative integer k, asks for a subset D ⊆ V with |D| ≤ k such that D forms a dominating set of G and induces a connected graph. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f88a2aadc9c5b839a5a5b7d095a0a29c
https://doi.org/10.1007/978-3-642-20877-5_8
https://doi.org/10.1007/978-3-642-20877-5_8
Autor:
Weizhong Luo
Publikováno v:
2010 International Conference on Intelligent Computing and Integrated Systems.
In wireless sensor networks, there are often several missions that start and finish at different time need to be handled at some time. Schemes that assign sensor resources to mission demands thus become necessary. In order to adapt to the dynamic cha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f881bf3abcfb9a9306ff5098e1fc730b
https://doi.org/10.1109/iciss.2010.5657071
https://doi.org/10.1109/iciss.2010.5657071