scholarly journals Mobility for Cellular-Connected UAVs: Challenges for the Network Provider

Author(s):  
Erika Fonseca ◽  
Boris Galkin ◽  
Marvin Kelly ◽  
Luiz A. DaSilva ◽  
Ivana Dusparic
Keyword(s):  
2010 ◽  
Vol 25 (2) ◽  
pp. 109-125 ◽  
Author(s):  
Hanna Krasnova ◽  
Sarah Spiekermann ◽  
Ksenia Koroleva ◽  
Thomas Hildebrand

On online social networks such as Facebook, massive self-disclosure by users has attracted the attention of Industry players and policymakers worldwide. Despite the Impressive scope of this phenomenon, very little Is understood about what motivates users to disclose personal Information. Integrating focus group results Into a theoretical privacy calculus framework, we develop and empirically test a Structural Equation Model of self-disclosure with 259 subjects. We find that users are primarily motivated to disclose Information because of the convenience of maintaining and developing relationships and platform enjoyment. Countervailing these benefits, privacy risks represent a critical barrier to information disclosure. However, users’ perception of risk can be mitigated by their trust in the network provider and availability of control options. Based on these findings, we offer recommendations for network providers.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Junjie Huang ◽  
Liang Tan ◽  
Sun Mao ◽  
Keping Yu

Blockchain is a mainstream technology in which many untrustworthy nodes work together to maintain a distributed ledger with advantages such as decentralization, traceability, and tamper-proof. The network layer communication mechanism in its architecture is the core of the networking method, message propagation, and data verification among blockchain nodes, which is the basis to ensure blockchain’s performance and key features. When blocks are propagated in peer-to-peer (P2P) networks with gossip protocol, the high propagation delay of the protocol itself reduces the propagation speed of the blocks, which is prone to the chain forking phenomenon and causes double payment attacks. To accelerate the propagation speed and reduce the fork probability, this paper proposes a blockchain network propagation mechanism based on proactive network provider participation for P2P (P4P) architecture. This mechanism first obtains the information of network topology and link status in a region based on the internet service provider (ISP), then it calculates the shortest path and link overhead of peer nodes using P4P technology, prioritizes the nodes with good local bandwidth conditions for transmission, realizes the optimization of node connections, improves the quality of service (QoS) and quality of experience (QoE) of blockchain networks, and enables blockchain nodes to exchange blocks and transactions through the secure propagation path. Simulation experiments show that the proposed propagation mechanism outperforms the original propagation mechanism of the blockchain network in terms of system overhead, rate of data success transmission, routing hops, and propagation delay.


Author(s):  
Adam Pavlidis ◽  
Marinos Dimolianis ◽  
Kostas Giotis ◽  
Loukas Anagnostou ◽  
Nikolaos Kostopoulos ◽  
...  

Abstract Network providers either attempt to handle massive distributed denial-of-service attacks themselves or redirect traffic to third-party scrubbing centers. If providers adopt the first option, it is sensible to counter such attacks in their infancy via provider collaborations deploying distributed security mechanisms across multiple domains in an attack path. This motivated our work presented in this paper. Specifically, we investigate the establishment of trusted federations among adjacent and disjoint network domains, that is, autonomous systems (ASes) that collectively mitigate malicious traffic. Our approach is based on Distributed Ledger Technologies for signaling, coordination, and orchestration of a collaborative mitigation schema via appropriate blockchain-based smart contracts. Reputation scores are used to rank ASes based on their mitigation track record. The allocation of defense resources across multiple collaborators is modeled as a combinatorial optimization problem considering reputation scores and network flow weights. Malicious flows are mitigated using programmable network data paths within the eXpress Data Path (XDP) framework; this enables operators with enhanced packet processing throughput and advanced filtering flexibility. Our schema was implemented in a proof-of-concept prototype and tested under realistic network conditions.


Medical Care ◽  
2013 ◽  
Vol 51 (8) ◽  
pp. 699-705 ◽  
Author(s):  
Kelly A. Kyanko ◽  
Leslie A. Curry ◽  
Susan H. Busch

2018 ◽  
Vol 7 (4.44) ◽  
pp. 127
Author(s):  
Ferry Wahyu Wibowo ◽  
. .

The cellular phones do not use telephone cables. The cellular phones send radio signals into the air to the nearest transmitter tower called the base station. The transmitter tower will emit the signal to the next station and so on until it reaches the phone that is called. When a new call arrives on the phone number, it will generate a tone until it is picked up, rejected, or the time has been ended to receive this tone (each telephone network provider has different policies related to the time used for this telephone connection so that this causes the number of rings raised to vary). This paper focuses on the missed call services which is one of the features found on the telephone. The tone that has been generated by this calling can emerge ring. This ring can be detected and manipulated to be something useful for controlling devices or making some password.  


Sign in / Sign up

Export Citation Format

Share Document