• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 4
  • 4
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

SF-SACK: A Smooth Friendly TCP Protocol for Streaming Multimedia Applications

Bakthavachalu, Sivakumar 16 April 2004 (has links)
Voice over IP and video applications continue to increase the amount of traffic over the Internet. These applications utilize the UDP protocol because TCP is not suitable for streaming applications. The flow and congestion control mechanisms of TCP can change the connection transmission rate too drastically, affecting the user-perceived quality of the transmission. Also, the TCP protocol provides a level of reliability that may waste network resources, retransmitting packets that have no value. On the other hand, the use of end-to-end flow and congestion control mechanisms for streaming applications has been acknowledged as an important measure to ease or eliminate the unfairness problem that exist when TCP and UDP share the same congested bottleneck link. Actually, router-based and end-to-end solutions have been proposed to solve this problem. This thesis introduces a new end-to-end protocol based on TCP SACK called SF-SACK that promises to be smooth enough for streaming applications while implementing the known flow and congestion control mechanisms available in TCP. Through simulations, it is shown that in terms of smoothness the SF-SACK protocol is considerably better than TCP SACK and only slightly worse than TFRC. Regarding friendliness, SF-SACK is not completely fair to TCP but considerably fairer than UDP. Furthermore, if SF-SACK is used by both streaming and data-oriented applications, complete fairness is achieved. In addition, SF-SACK only needs sender side modifcations and it is simpler than TFRC.
2

Truthful Incentive Mechanism for Mobile Crowdsensing

Özyagci, Özlem Zehra January 2016 (has links)
Smart devices have become one of the fundamental communication and computing devices in people's everyday lives over the past decade. Their various sensors and wireless connectivity have paved the way for a new application area called mobile crowdsensing where sensing services are provided by using the sensor outputs collected from smart devices. A mobile crowdsensing system's service quality heavily depends on the participation of smart device users who probably expect to be compensated in return for their participation. Therefore, mobile crowdsensing applications need incentive mechanisms to motivate such people into participating. In this thesis, we first defined a reverse auction based incentive mechanism for a representative mobile crowdsensing system. Then, we integrated the Vickrey-Clarke- Groves mechanism into the initial incentive mechanism so as to investigate whether truthful bidding would become the dominant strategy in the resulting incentive mechanism. We demonstrated by theoretical analysis that overbidding was the dominant strategy in the base incentive mechanism, whereas truthful bidding was the dominant strategy in the derived incentive mechanism when the VCG mechanism was applicable. Finally, we conducted simulations of both incentive mechanisms in order to measure the fairness of service prices and the fairness of cumulative participant earnings using Jain's fairness index. We observed that both the fairness of service prices and the fairness of cumulative participant earnings were generally better in the derived incentive mechanism when the VCG mechanism was applied. We also found that at least 70% of service requests had fair prices, while between 5% and 85% of participants had fair cumulative earnings in both incentive mechanisms.
3

Multi-Stakeholder Consensus Decision-Making Framework Based on Trust and Risk

Alfantoukh, Lina Abdulaziz 05 1900 (has links)
Indiana University-Purdue University Indianapolis (IUPUI) / This thesis combines human and machine intelligence for consensus decision-making, and it contains four interrelated research areas. Before presenting the four research areas, this thesis presents a literature review on decision-making using two criteria: trust and risk. The analysis involves studying the individual and the multi-stakeholder decision-making. Also, it explores the relationship between trust and risk to provide insight on how to apply them when making any decision. This thesis presents a grouping procedure of the existing trust-based multi-stakeholder decision-making schemes by considering the group decision-making process and models. In the first research area, this thesis presents the foundation of building multi-stakeholder consensus decision-making (MSCDM). This thesis describes trust-based multi-stakeholder decision-making for water allocation to help the participants select a solution that comes from the best model. Several criteria are involved when deciding on a solution such as trust, damage, and benefit. This thesis considers Jain's fairness index as an indicator of reaching balance or equality for the stakeholder's needs. The preferred scenario is when having a high trust, low damages and high benefits. The worst scenario involves having low trust, high damage, and low benefit. The model is dynamic by adapting to the changes over time. The decision to select is the solution that is fair for almost everyone. In the second research area, this thesis presents a MSCDM, which is a generic framework that coordinates the decision-making rounds among stakeholders based on their influence toward each other, as represented by the trust relationship among them. This thesis describes the MSCDM framework that helps to find a decision the stakeholders can agree upon. Reaching a consensus decision might require several rounds where stakeholders negotiate by rating each other. This thesis presents the results of implementing MSCDM and evaluates the effect of trust on the consensus achievement and the reduction in the number of rounds needed to reach the final decision. This thesis presents Rating Convergence in the implemented MSCDM framework, and such convergence is a result of changes in the stakeholders' rating behavior in each round. This thesis evaluates the effect of trust on the rating changes by measuring the distance of the choices made by the stakeholders. Trust is useful in decreasing the distances. In the third research area, this thesis presents Rating Convergence in the implemented MSCDM framework, and such convergence is a result of changes in stakeholders' rating behavior in each round. This thesis evaluates the effect of trust on the rating changes by measuring the perturbation in the rating matrix. Trust is useful in increasing the rating matrix perturbation. Such perturbation helps to decrease the number of rounds. Therefore, trust helps to increase the speed of agreeing upon the same decision through the influence. In the fourth research area, this thesis presents Rating Aggregation operators in the implemented MSCDM framework. This thesis addresses the need for aggregating the stakeholders' ratings while they negotiate on the round of decisions to compute the consensus achievement. This thesis presents four aggregation operators: weighted sum (WS), weighted product (WP), weighted product similarity measure (WPSM), and weighted exponent similarity measure (WESM). This thesis studies the performance of those aggregation operators in terms of consensus achievement and the number of rounds needed. The consensus threshold controls the performance of these operators. The contribution of this thesis lays the foundation for developing a framework for MSCDM that facilitates reaching the consensus decision by accounting for the stakeholders' influences toward one another. Trust represents the influence.
4

Multi-Stakeholder Consensus Decision-Making Framework Based on Trust and Risk

LIna Abdulaziz Alfantoukh (6586319) 10 June 2019 (has links)
<div>This thesis combines human and machine intelligence for consensus decision-making, and it contains four interrelated research areas. Before presenting the four research areas, this thesis presents a literature review on decision-making using two criteria: trust and risk. The analysis involves studying the individual and the multi-stakeholder decision-making. Also, it explores the relationship between trust and risk to provide insight on how to apply them when making any decision. This thesis presents a grouping procedure of the existing trust-based multi-stakeholder decision-making schemes by considering the group decision-making process and models. In the first research area, this thesis presents the foundation of building multi-stakeholder consensus decision-making (MSCDM). This thesis describes trust-based multi-stakeholder decision-making for water allocation to help the participants select a solution that comes from the best model. Several criteria are involved when deciding on a solution such as trust, damage, and benefit. This thesis considers Jain's fairness index as an indicator of reaching balance or equality for the stakeholder's needs. The preferred scenario is when having a high trust, low damages and high benefits. The worst scenario involves having low trust, high damage, and low benefit. The model is dynamic by adapting to the changes over time. The decision to select is the solution that is fair for almost everyone. In the second research area, this thesis presents a MSCDM, which is a generic framework that coordinates the decision-making rounds among stakeholders based on their influence toward each other, as represented by the trust relationship among them. This thesis describes the MSCDM framework that helps to find a decision the stakeholders can agree upon. Reaching a consensus decision might require several rounds where stakeholders negotiate by rating each other. This thesis presents the results of implementing MSCDM and evaluates the effect of trust on the consensus achievement and the reduction in the number of rounds needed to reach the final decision. This thesis presents Rating Convergence in the implemented MSCDM framework, and such convergence is a result of changes in the stakeholders' rating behavior in each round. This thesis evaluates the effect of trust on the rating changes by measuring the distance of the choices made by the stakeholders. Trust is useful in decreasing the distances. In the third research area, this thesis presents Rating Convergence in the implemented MSCDM framework, and such convergence is a result of changes in stakeholders' rating behavior in each round. This thesis evaluates the effect of trust on the rating changes by measuring the perturbation in the rating matrix. Trust is useful in increasing the rating matrix perturbation. Such perturbation helps to decrease the number of rounds. Therefore, trust helps to increase the speed of agreeing upon the same decision through the influence. In the fourth research area, this thesis presents Rating Aggregation operators in the implemented MSCDM framework. This thesis addresses the need for aggregating the stakeholders' ratings while they negotiate on the round of decisions to compute the consensus achievement. This thesis presents four aggregation operators: weighted sum (WS), weighted product (WP), weighted product similarity measure (WPSM), and weighted exponent similarity measure (WESM). This thesis studies the performance of those aggregation operators in terms of consensus achievement and the number of rounds needed. The consensus threshold controls the performance of these operators. The contribution of this thesis lays the foundation for developing a framework for MSCDM that facilitates reaching the consensus decision by accounting for the stakeholders' influences toward one another. Trust represents the influence.</div>

Page generated in 0.0571 seconds