scholarly journals Trustworthy Jammer Selection with Truth-Telling for Wireless Cooperative Systems

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Yingkun Wen ◽  
Tao Jing ◽  
Qinghe Gao
Keyword(s):  
Dominant Strategy ◽  
Cooperative Systems ◽  
Numerical Results ◽  
Reverse Auction ◽  
Truth Telling ◽  
Constant Power ◽  
Selection Scheme ◽  
Trust Degree ◽  
Additive Increase ◽  
Wireless Cooperative Systems

In this paper, we propose a trustworthy friendly jammer selection scheme with truth-telling for wireless cooperative systems. We first utilize the reverse auction scheme to enforce truth-telling as the dominant strategy for each candidate friendly jammer. Specifically, we consider two auction cases: (1) constant power (CP) case and (2) the utility of the BS maximization (UBM) case. In both cases, the reverse auction scheme enforces truth-telling as the dominant strategy. Next, we introduce the trust category and trust degree to evaluate the trustworthiness of each Helper transmitter (Helper-Tx). Specifically, an edge controller calculates the reputation value of each Helper-Tx periodically using an additive-increase multiplicative-decrease algorithm by observing its jamming behavior. With the historical reputation values, the edge controller (EC) classifies a Helper-Tx into one of four trust categories and calculates its trust degree. Then, the EC selects the best Helper-Tx based on the trust category and trust degree. Lastly, we present numerical results to demonstrate the performance of our proposed jammer selection scheme.

scholarly journals Efficient Multi-Attribute Auctions Considering Supply Disruption

2019 ◽  
Vol 36 (03) ◽  
pp. 1950013
Author(s):  
Jie Xiang ◽  
Juliang Zhang ◽  
T. C. E. Cheng ◽  
Jose Maria Sallan ◽  
Guowei Hua
Keyword(s):  
Private Information ◽  
Dominant Strategy ◽  
Purchase Decisions ◽  
Reverse Auctions ◽  
Reverse Auction ◽  
Truth Telling ◽  
Supply Disruption ◽  
Bidding Strategies ◽  
Numerical Studies ◽  
The Cost

Although supply disruption is ubiquitous because of natural or man-made disasters, many firms still use the price-only reverse auction (only the cost is considered) to make purchase decisions. We first study the suppliers’ equilibrium bidding strategies and the buyer’s expected revenue under the first- and second-price price-only reverse auctions when the suppliers are unreliable and have private information on their costs and disruption probabilities. We show that the two auctions are equivalent and not efficient. Then we propose two easily implementable reverse auctions, namely the first-price and second-price format announced penalty reverse auction (APRA), and show that the “revenue equivalence principle” holds, i.e., the two auctions generate the same ex ante expected profit to the buyer. We further show that the two reverse auctions are efficient and “truth telling” is the suppliers’ dominant strategy in the second-price format APRA. We conduct numerical studies to assess the impacts of some parameters on the bidding strategies, the buyer’s profit and social profit.

scholarly journals A Simple Auction Mechanism for the Optimal Allocation of the Commons

2008 ◽  
Vol 98 (1) ◽  
pp. 496-518 ◽  
Author(s):  
Juan-Pablo Montero
Keyword(s):  
Optimal Allocation ◽  
Pollution Abatement ◽  
Dominant Strategy ◽  
Truth Telling ◽  
Uniform Price ◽  
Auction Mechanism ◽  
Sealed Bid ◽  
Regulated Firms ◽  
The Commons ◽  
Number Of Firms

Efficient regulation of the commons requires information about the regulated firms that is rarely available to regulators (e.g., cost of pollution abatement). This paper proposes a simple mechanism that implements the first-best for any number of firms: a uniform price, sealed-bid auction of an endogenous number of (transferable) licenses with a fraction of the auction revenues given back to firms. Paybacks, which rapidly decrease with the number of firms, are such that truth-telling is a dominant strategy regardless of whether firms behave non-cooperatively or collusively. The mechanism also provides firms with incentives to invest in socially optimal R&D. (JEL D44, L51, Q21)

scholarly journals Cloud customers service selection scheme based on improved conventional cat swarm optimization

2020 ◽  
Vol 32 (18) ◽  
pp. 14817-14838
Author(s):  
Danlami Gabi ◽  
Abdul Samad Ismail ◽  
Anazida Zainal ◽  
Zalmiyah Zakaria ◽  
Ajith Abraham ◽  
...  
Keyword(s):  
Execution Time ◽  
Resource Selection ◽  
Service Selection ◽  
Dominant Strategy ◽  
Global Search ◽  
Convergence Speed ◽  
Computing Environment ◽  
Total Execution Time ◽  
Selection Scheme ◽  
Cloud Computing Environment

Abstract With growing demand on resources situated at the cloud datacenters, the need for customers’ resource selection techniques becomes paramount in dealing with the concerns of resource inefficiency. Techniques such as metaheuristics are promising than the heuristics, most especially when handling large scheduling request. However, addressing certain limitations attributed to the metaheuristic such as slow convergence speed and imbalance between its local and global search could enable it become even more promising for customers service selection. In this work, we propose a cloud customers service selection scheme called Dynamic Multi-Objective Orthogonal Taguchi-Cat (DMOOTC). In the proposed scheme, avoidance of local entrapment is achieved by not only increasing its convergence speed, but balancing between its local and global search through the incorporation of Taguchi orthogonal approach. To enable the scheme to meet customers’ expectations, Pareto dominant strategy is incorporated providing better options for customers in selecting their service preferences. The implementation of our proposed scheme with that of the benchmarked schemes is carried out on CloudSim simulator tool. With two scheduling scenarios under consideration, simulation results show for the first scenario, our proposed DMOOTC scheme provides better service choices with minimum total execution time and cost (with up to 42.87%, 35.47%, 25.49% and 38.62%, 35.32%, 25.56% reduction) and achieves 21.64%, 18.97% and 13.19% improvement for the second scenario in terms of execution time compared to that of the benchmarked schemes. Similarly, statistical results based on 95% confidence interval for the whole scheduling scheme also show that our proposed scheme can be much more reliable than the benchmarked scheme. This is an indication that the proposed DMOOTC can meet customers’ expectations while providing guaranteed performance of the whole cloud computing environment.

PERMANENCE FOR THE LOTKA–VOLTERRA COOPERATIVE SYSTEM WITH SEVERAL DELAYS

2009 ◽  
Vol 02 (03) ◽  
pp. 267-285 ◽  
Author(s):  
YUKIHIKO NAKATA
Keyword(s):  
Theoretical Analysis ◽  
Time Delays ◽  
Interspecific Interactions ◽  
Cooperative Systems ◽  
Numerical Results ◽  
Sufficient Condition ◽  
Cooperative System ◽  
Nonlinear Anal ◽  
Discrete Delays ◽  
Several Delays

In this paper, we establish a new sufficient condition of the permanence for the Lotka–Volterra cooperative systems with multiple discrete delays by extending the results in [Nakata and Muroya, Permanence for nonautonomous Lotka–Volterra cooperative systems with delays, Nonlinear Anal. RWA., in press]. Our condition holds even if the instantaneous feedback does not dominate over the total of the interspecific interactions and does not need the restriction on the size of time delays, different from the results in [Lu and Lu, Permanence for two-species Lotka–Volterra cooperative systems with delays, Math. Biosci. Eng.5 (2008) 477–484]. We offer an example for comparison with the previous results and numerical results supporting our theoretical analysis are given.

scholarly journals An Incentive Mechanism in Mobile Crowdsourcing Based on Multi-Attribute Reverse Auctions

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3453 ◽  
Author(s):  
Ying Hu ◽  
Yingjie Wang ◽  
Yingshu Li ◽  
Xiangrong Tong
Keyword(s):  
Incentive Mechanism ◽  
Budget Balance ◽  
Selection Algorithm ◽  
Reverse Auction ◽  
Mobile Crowdsourcing ◽  
Trust Degree ◽  
Worker Selection ◽  
Bidding Price ◽  
Good Reputation

In order to avoid malicious competition and select high quality crowd workers to improve the utility of crowdsourcing system, this paper proposes an incentive mechanism based on the combination of reverse auction and multi-attribute auction in mobile crowdsourcing. The proposed online incentive mechanism includes two algorithms. One is the crowd worker selection algorithm based on multi-attribute reverse auction that adopts dynamic threshold to make an online decision for whether accept a crowd worker according to its attributes. Another is the payment determination algorithm which determines payment for a crowd worker based on its reputation and quality of sensing data, that is, a crowd worker can get payment equal to the bidding price before performing task only if his reputation reaches good reputation threshold, otherwise he will get payment based on his data sensing quality. We prove that our proposed online incentive mechanism has the properties of computational efficiency, individual rationality, budget-balance, truthfulness and honesty. Through simulations, the efficiency of our proposed online incentive mechanism is verified which can improve the efficiency, adaptability and trust degree of the mobile crowdsourcing system.

scholarly journals Physical Layer Security in Nonorthogonal Multiple Access Wireless Network with Jammer Selection

2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Langtao Hu ◽  
Xin Zheng ◽  
Chunsheng Chen
Keyword(s):  
Outage Probability ◽  
Wireless Network ◽  
Stochastic Geometry ◽  
Physical Layer Security ◽  
Multiple Access ◽  
Physical Layer ◽  
Numerical Results ◽  
Selection Scheme ◽  
Good Balance ◽  
Traditional Scheme

The physical layer security of downlink nonorthogonal multiple access (NOMA) network is analyzed. In order to improve the secrecy probability, friendly jammers are jointed in the NOMA network. Two jammer schemes are proposed in the NOMA network. All the jammers transmit jamming signal without jammer selection in the first scheme (NO JS scheme). Jammers are selected to transmit jamming signal if their interfering power on scheduled users is below a threshold in the second scheme (JS scheme). A stochastic geometry approach is applied to analyze the outage probability and the secrecy probability. Compared with the NO JS scheme and traditional scheme (without jointing jammers), the jammer selection scheme provides a good balance between the user outage probability and secrecy probability. Numerical results demonstrate that the security performance of the two proposed schemes can be improved by jointing the jammers in the NOMA wireless network.

Sign in / Sign up

Export Citation Format

Share Document