Performance and Security for the Internet of Things by Haya Shajaiah

Performance and Security for the Internet of Things by Haya Shajaiah

Author:Haya Shajaiah
Language: eng
Format: epub
Publisher: McGraw-Hill Education
Published: 2021-04-15T00:00:00+00:00


The spectrum bands allocation procedure is presented as follows:

1. The secure gateway receives a sealed bidding vector from each BS k for its true bidding values of the allocations in α. We assume that the secure gateway is aware of which WSP each bidder belongs to. The secure gateway creates a conflict-table for each bidder, which contains all BSs within the interference range of that bidder with their allocated spectrum bands and charging price. The procedure of encrypting the bidding values using Paillier encryption is similar to the one presented in [198]. The secure gateway randomizes the bidding values and sends them to the auctioneer. For any bidder k, neither the auctioneer nor the other bidders know the actual bidding values of BS k.

2. The auctioneer selects a random bidder k as a root BS and considers its corresponding subnet. The auctioneer does not have an optimal choice for which subnet it starts running the auction from in order to maximize its profit.

3. The auctioneer runs a secure spectrum auction in the subnet of the current root BS k as presented in VI.C [198]. Once the auction results are revealed, the auctioneer determines the winning bidders and their charging prices.

4. Each winning BS is allocated its corresponding spectrum bands and is charged for the allocated resources. The secure gateway updates the conflict table of each winning BS with the allocated spectrum bands and their charging price. If all BSs in have already been considered root BSs, the spectrum auction is considered complete and there is no need to proceed to the next step.

5. The auctioneer selects a new root BS k, that has not been considered as a root BS before, based on a random selection and considers its corresponding subnet, which consists of all BSs within the interference range of the root BS k that have not been previously considered as root BSs. The process is then repeated starting from Step 2.

The spectrum bands allocation process is summarized in Algorithm 5.

The computational complexity of the spectrum bands allocation algorithm is analyzed and compared to other secure spectrum auction algorithms. For a connected random graph with K nodes, the size of each subnet is in the order of (log K) [226]. For N spectrum bands available in a subnet, the number of possible allocations is The number of possible allocations by Stirling's formula is in the order of



Download



Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.