Blockchain Edge Server Deployment Scheme in Internet of Vehicles

Table of Contents

• 1. Gabatarwa
• 2. Bayan Fage da Ayyukan Da suka Danganci
  • 2.1 Blockchain a cikin IoVs
  • 2.2 Haɗin Ƙididdiga na Gefe
• 3. Hanyar Aiki
  • 3.1 Tsarin Tsari
  • 3.2 Tsarin Matsala
  • 3.3 Algorithm na Bazuwar Bazu
• 4. Experimental Results
• 5. Nazarin Fasaha
• 6. Aiwarwarin Code
• 7. Future Applications
• 8. References

1. Gabatarwa

Tare da ci gaban motocin hankali, aminci da amintaccen sadarwa tsakanin motoci ya zama matsala mai muhimmanci a cikin Intanet na Motoci (IoVs). Ana ɗaukar Blockchain a matsayin mafita mai yuwuwa saboda rashin ƙaddamarwa, rashin iya jabunta, da kuma kulawa tare. Duk da haka, ƙarancin ƙarfin lissafi na hanyoyin sadarwar mota yana haifar da ƙalubale ga aiwatar da Blockchain. Wannan takarda ta ba da shawarar yin amfani da lissafin gefe tare da raka'o'in gefen hanya (RSUs) a matsayin sabar gefe don magance waɗannan iyakokin.

2. Bayan Fage da Ayyukan Da suka Danganci

2.1 Blockchain a cikin IoVs

Fasahar Blockchain tana ba da amintaccen watsa bayanai ta hanyar gine-ginen sa na rashin tsari. Tsarin haƙo ma'adinai yana buƙatar albarkatun lissafi masu yawa, wanda ke da kalubale ga nodes na mota masu ƙuntatawa. A cewar takardar Bitcoin ta asali na Nakamoto, yarjejeniyar tabbatar da aiki tana buƙatar ƙarfin lissafi wanda na'urorin hannu ba za su iya bayarwa ba.

2.2 Haɗin Ƙididdiga na Gefe

Ƙididdiga na Edge yana faɗaɗa iyawar girgije zuwa gefen cibiyar sadarwa, yana ba da ayyuka na ain-lokaci tare da ƙananan jinkiri. RSUs suna aiki azaman ingantattun uwar garken gefe saboda kafaffun tsarin hanyar sadarwa, ingantattun hanyoyin sadarwa, da ƙwararrun iyawar lissafi/ma'ajiya idan aka kwatanta da nodes na mota.

3. Hanyar Aiki

3.1 Tsarin Tsari

Tsarin ya ƙunshi nodes na abin hawa, RSUs waɗanda ke aiki azaman sabar gefe, da kuma hanyar sadarwa ta blockchain. Sabar gefe suna aiwatar da ayyukan haƙar ma'adinai da kuma sarrafa bayanan blockchain, yayin da motocin ke jujjuya ayyukan lissafi zuwa waɗannan sabar.

3.2 Tsarin Matsala

An tsara matsalar ɗaukar hoto a matsayin haɓaka adadin nodes na abin hawa da sabar gefe da aka tura su rufe. Aikin haƙiƙa zai iya bayyana kamar haka: $\max \sum_{i=1}^{n} x_i$ dangane da $\sum_{j \in N(i)} y_j \geq x_i$ ga duk $i$, inda $x_i$ ke nuna ko an rufe abin hawa $i$ ko a'a kuma $y_j$ ke nuna ko an tura sabar gefe $j$ ko a'a.

3.3 Algorithm na Bazuwar Bazu

Tsarin algorithm ɗin da aka ba da shawara yana ƙididdige mafita na kusantar don ajiyawar sabar gefe don haɓaka ɗaukar hoton abin hawa. Algorithm ɗin yana ba da garanti na ka'idar akan ingancin mafita tare da rikitarwar lokaci mai yawa.

4. Experimental Results

Simulations compared the proposed scheme with other deployment strategies. The randomized algorithm achieved approximately 15-20% better coverage compared to greedy approaches and 25-30% improvement over random deployment. Performance was evaluated under varying vehicle densities and mobility patterns, demonstrating consistent superiority in coverage metrics.

5. Nazarin Fasaha

Industry Analyst Perspective: This research tackles a critical bottleneck in vehicular networks with a pragmatic fusion of blockchain and edge computing. The approach is technically sound but faces scalability challenges in dense urban environments. The randomized algorithm provides good theoretical bounds but may struggle with real-time deployment decisions. Compared to similar work like CycleGAN for image translation, this solution addresses a more constrained optimization problem with stricter latency requirements. The integration of RSUs as miners is innovative but depends heavily on infrastructure investment.

6. Aiwarwarin Code

Pseudocode for the randomized deployment algorithm:

function RandomizedDeployment(vehicles, potentialSites):
    deployedServers = []
    uncovered = vehicles.copy()
    
    while uncovered not empty:
        candidate = randomSelect(potentialSites)
        coverage = calculateCoverage(candidate, uncovered)
        if coverage > threshold:
            deployedServers.append(candidate)
            uncovered = removeCovered(uncovered, candidate)
        potentialSites.remove(candidate)
    
    return deployedServers

7. Future Applications

Hanyoyin nan gaba sun haɗa haɗa kwaikwayon koyo don turawa na annabce-annabce, haɓaka hanyoyin yarjejeniya gauraye waɗanda suke haɗa hujjar aiki da hujjar tarayya, da faɗaɗawa zuwa hanyoyin sadarwar motoci na 5G/6G. Aikace-aikace sun faɗaɗa zuwa kayayyakin birane masu wayo, daidaitawar motocin cin gashin kansu, da tsare-tsaren kula da zirga-zirga da aka rarraba.

8. References

1. Nakamoto, S. (2008). Bitcoin: A Peer-to-Peer Electronic Cash System.
2. Shi, W., et al. (2016). Edge Computing: Vision and Challenges.
3. Zhu, L., et al. (2020). Blockchain-based Secure Data Sharing in IoV.
4. IEEE Transactions on Vehicular Technology, Special Issue on Blockchain in IoV.
5. Isola, P., et al. (2017). Image-to-Image Translation with Conditional Adversarial Networks (CycleGAN).