Skip to content
naulon
Not checkedNot checked for notices yet.

Secure and Reliable Resource Allocation and Caching in Aerial-Terrestrial Cloud Networks (ATCNs)

Vishal Sharma, Ilsun You, Jung Taek Seo and 1 more

IEEE Access · 2019

doi:10.1109/access.2019.2893775 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Aerial-terrestrial cloud networks (ATCNs), global integration of air and ground communication systems, pave a way for a large set of applications such as surveillance, on-demand transmissions, data-acquisition, and navigation. However, such networks suffer from crucial challenges of secure and reliable resource allocation and content-caching as the involved entities are highly dynamic and there is no fine-tuned strategy to accommodate their connectivity. To resolve this quandary, cog-chain, a novel paradigm for secure and reliable resource allocation and content-caching in ATCNs, is presented. Various requirements, key concepts, and issues with ATCNs are also presented along with basic concepts to establish a cog-chain in ATCNs. Feed and fetch modes are utilized depending on the involved entities and caching servers. In addition, a cog-chain communication protocol is presented which avails to evaluate the formation of a virtual cog-chain between the nodes and the content-caching servers. The efficacy of the proposed solution is demonstrated through consequential gains observed for signaling overheads, computational time, reliability, and resource allocation growth. The proposed approach operates with the signaling overheads ranging between 30.36 and 303.6 bytes*hops/sec and the formation time between 186 and 195 ms. Furthermore, the overall time consumption is 83.33% lower than the sequential-verification model and the resource allocation growth is 27.17% better than the sequential-verification model.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.