TY - GEN
T1 - Coverage density as a dominant property of large-scale sensor networks
AU - Yadgar, Osher
AU - Kraus, Sarit
PY - 2006
Y1 - 2006
N2 - Large-scale sensor networks are becoming more present in our life then ever. Such an environment could be a cellular network, an array of fire detection sensors, an array of solar receptors, and so on. As technology advances, opportunities arise to form large-scale cooperative systems in order to solve larger problems in an efficient way. As more large-scale systems are developed, there is a growing need to (i) measure the hardness of a given large-scale sensor network problem, (ii) compare a given system to other large-scale sensor networks in order to extract a suitable solution, (iii) predict the performance of the solution, and (iv) derive the value of each system property from the desired performance of the solution, the problem constraints, and the user's preferences. The following research proposes a novel system term, the coverage density, to define the hardness of a large-scale sensor network. This term can be used to compare two instances of large-scale sensor networks in order to find the suitable solutions for a given problem. Given a coverage density of a system, one may predict the solution performance and use it jointly with the preference and the constraints to derive the value of the system's properties.
AB - Large-scale sensor networks are becoming more present in our life then ever. Such an environment could be a cellular network, an array of fire detection sensors, an array of solar receptors, and so on. As technology advances, opportunities arise to form large-scale cooperative systems in order to solve larger problems in an efficient way. As more large-scale systems are developed, there is a growing need to (i) measure the hardness of a given large-scale sensor network problem, (ii) compare a given system to other large-scale sensor networks in order to extract a suitable solution, (iii) predict the performance of the solution, and (iv) derive the value of each system property from the desired performance of the solution, the problem constraints, and the user's preferences. The following research proposes a novel system term, the coverage density, to define the hardness of a large-scale sensor network. This term can be used to compare two instances of large-scale sensor networks in order to find the suitable solutions for a given problem. Given a coverage density of a system, one may predict the solution performance and use it jointly with the preference and the constraints to derive the value of the system's properties.
UR - http://www.scopus.com/inward/record.url?scp=33750969373&partnerID=8YFLogxK
U2 - 10.1007/11839354_11
DO - 10.1007/11839354_11
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33750969373
SN - 354038569X
SN - 9783540385691
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 138
EP - 152
BT - Cooperative Information Agents X - 10th International Workshop, CIA 2006. Proceedings
PB - Springer Verlag
T2 - 10th International Workshop on Cooperative Information Agents, CIA 2006
Y2 - 11 September 2006 through 13 September 2006
ER -