2891. |
|
|
2892. |
|
|
2893. |
|
|
2894. |
- Martínez-Ortega, José-Fernán, et al.
(författare)
-
Trade-off between performance and energy consumption in wireless sensor networks
- 2007
-
Ingår i: Self-Organizing Systems. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783540749165 ; , s. 264-271
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- Nowadays WSNs support applications such as target tracking, environmental control or vehicles traffic monitoring. Generally, these applications have strong and strict requirements for end-to-end delaying and loosing during data transmissions. In this paper, we propose a practical scenario for application of the WSN field in order to illustrate selection of an appropriate approach for guaranteeing performance in a WSN-deployed application. The methodology we have used includes four major phases: 1) Requirements analysis of the application scenario; 2) QoS modelling in different layers of the communications protocol stack and selection of more suitable QoS protocols and mechanisms; 3) Definition of a simulation model based on an application scenario, to which we applied the protocols and mechanisms selected in phase 2; 4) Validation of decisions by means of simulation; and 5) analysis of results. This work has being partially developed in the framework of the CRISAL - M0700204174 project (partially funded by “Universidad Politécnica de Madrid” and “Comunidad de Madrid”, Spain).
|
|
2895. |
- Martini, Antonio, et al.
(författare)
-
Message from the ICSA 2023 SAIP, NEMI, ECRF, Artifacts, Posters, Journal First, Workshops/Tutorials and Working Sessions Tracks Chairs
- 2023
-
Ingår i: 2023 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE ARCHITECTURE COMPANION, ICSA-C. - : IEEE COMPUTER SOC. - 9781665464598 ; , s. XIII-XIV
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
2896. |
|
|
2897. |
|
|
2898. |
- Masud, Abu Naser
(författare)
-
Termination and Cost Analysis : Complexity and Precision Issues
- 2012
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The research in this thesis is related to static cost and termination analysis.Cost analysis aims at estimating the amount of resources that a given programconsumes during the execution, and termination analysis aims at proving thatthe execution of a given program will eventually terminate. These analyses arestrongly related, indeed cost analysis techniques heavily rely on techniques developedfor termination analysis. Precision, scalability, and applicability are essentialin static analysis in general. Precision is related to the quality of the inferredresults, scalability to the size of programs that can be analyzed, and applicabilityto the class of programs that can be handled by the analysis (independently fromprecision and scalability issues). This thesis addresses these aspects in the contextof cost and termination analysis, from both practical and theoretical perspectives.For cost analysis, we concentrate on the problem of solving cost relations (aform of recurrence relations) into closed-form upper and lower bounds, which isthe heart of most modern cost analyzers, and also where most of the precision andapplicability limitations can be found. We develop tools, and their underlyingtheoretical foundations, for solving cost relations that overcome the limitations ofexisting approaches, and demonstrate superiority in both precision and applicability.A unique feature of our techniques is the ability to smoothly handle bothlower and upper bounds, by reversing the corresponding notions in the underlyingtheory. For termination analysis, we study the hardness of the problem ofdeciding termination for a specic form of simple loops that arise in the context ofcost analysis. This study gives a better understanding of the (theoretical) limitsof scalability and applicability for both termination and cost analysis.
|
|
2899. |
|
|
2900. |
|
|