Embedded Dynamic Security Networking Technology Based on Fast Jump and Trust Degree

2014 ◽  
Vol 602-605 ◽  
pp. 2773-2775
Author(s):  
Wen Kui Zheng ◽  
Man Jin
Keyword(s):  
Embedded System ◽  
Security Risks ◽  
Network Systems ◽  
Network Nodes ◽  
Dynamic Security ◽  
Network Search ◽  
Trust Degree ◽  
Multiple Network ◽  
Security Of Network ◽  
Networking Technology

The traditional embedded system networking technology ignores the security of network systems, either ignores fast networking requirements of network system, these requirements can be achieved at the same time. A embedded dynamic security networking technology based on fast jump and trust degree is proposed, when systems is networking, the use of random beating from multiple network nodes and fast switching optimize network search methods. Experimental results show that the proposed method can detect distribution of systems security risks accurately, and has a good application value for network security.

scholarly journals Full-Duplex NOMA Transmission with Single-Antenna Buffer-Aided Relays

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1482 ◽  
Author(s):  
Nikolaos Nomikos ◽  
Panagiotis Trakadas ◽  
Antonios Hatziefremidis ◽  
Voliotis
Keyword(s):  
Low Complexity ◽  
Cooperative Relaying ◽  
Full Duplex ◽  
Practical Implementation ◽  
Network Nodes ◽  
Communication Techniques ◽  
Single Antenna ◽  
Low Complexity Implementation ◽  
Significant Performance ◽  
Multiple Network

The efficient deployment of fifth generation and beyond networks relies upon the seamless combination of recently introduced transmission techniques. Furthermore, as multiple network nodes exist in dense wireless topologies, low-complexity implementation should be promoted. In this work, several wireless communication techniques are considered for improving the sum-rate performance of cooperative relaying non-orthogonal multiple access (NOMA) networks. For this purpose, an opportunistic relay selection algorithm is developed, employing single-antenna relays to achieve full-duplex operation by adopting the successive relaying technique. In addition, as relays are equipped with buffers, flexible half-duplex transmission can be performed when packets reside in the buffers. The proposed buffer-aided and successive single-antenna (BASSA-NOMA) algorithm is presented in detail and its operation and practical implementation aspects are thoroughly analyzed. Comparisons with other relevant algorithms illustrate significant performance gains when BASSA-NOMA is employed without incurring high implementation complexity.

Study on Information Security of Network-Based Manufacturing Environment

2014 ◽  
Vol 484-485 ◽  
pp. 493-496 ◽  
Author(s):  
Xin Ju Mo
Keyword(s):  
Information Security ◽  
Computer Networks ◽  
Preventive Measures ◽  
Rapid Development ◽  
Network Information ◽  
Threat Analysis ◽  
Major Threat ◽  
Security Of Network ◽  
Networking Technology

with the rapid development and wide application of networking technology, information security increasingly prominent problems are evident, more and more attention. The article introduced the current situation of network information security, explored the meaning of network information security, major threat analysis network information security, and finally gives the implementation technology of network information security and preventive measures, to ensure the information security of computer networks, so as to give full play to role of computer networks.

scholarly journals Fusing Node Embeddings and Incomplete Attributes by Complement-Based Concatenation

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Zheng Wang ◽  
Yuexin Wu ◽  
Yang Bao ◽  
Jing Yu ◽  
Xiaohui Wang
Keyword(s):  
Critical Role ◽  
Inductive Method ◽  
Network Embedding ◽  
Parametric Function ◽  
Adjacency Graph ◽  
Network Nodes ◽  
Learning Tasks ◽  
Multiple Network ◽  
The Given ◽  
Node Embeddings

Network embedding that learns representations of network nodes plays a critical role in network analysis, since it enables many downstream learning tasks. Although various network embedding methods have been proposed, they are mainly designed for a single network scenario. This paper considers a “multiple network” scenario by studying the problem of fusing the node embeddings and incomplete attributes from two different networks. To address this problem, we propose to complement the incomplete attributes, so as to conduct data fusion via concatenation. Specifically, we first propose a simple inductive method, in which attributes are defined as a parametric function of the given node embedding vectors. We then propose its transductive variant by adaptively learning an adjacency graph to approximate the original network structure. Additionally, we also provide a light version of this transductive variant. Experimental results on four datasets demonstrate the superiority of our methods.

Service Providers Indexing Using P2P Systems

2010 ◽  
pp. 852-889
Author(s):  
G. Marchetto ◽  
M. Papa Manzillo ◽  
L. Torrero ◽  
L. Ciminiera ◽  
F. Risso
Keyword(s):  
Service Providers ◽  
Service Selection ◽  
Peer To Peer ◽  
Shared Resources ◽  
Network Nodes ◽  
P2p Systems ◽  
Natural Solution ◽  
Multiple Network ◽  
Cost Parameters ◽  
Topological Proximity

The idea of sharing resources across the network has become very popular during the last few years, leading to a diversified scenario in which shared resources include not only files and videos but also storage and CPU cycles. A new trend is to extend this paradigm toward a distributed architecture in which multiple network nodes cooperate to provide services in a distributed fashion, thus ensuring robustness and scalability. Peer-to-peer (P2P) overlays are the natural solution to achieve this goal as, thanks to their simplicity and flexibility, they can change their topology in order to fit the needs of the different kinds of services that can be provided on top of them. This chapter focuses on the indexing of nodes (i.e., the service providers) in these P2P systems, presenting the state-of-the-art solutions concerning the P2P-based indexing architectures and a taxonomy of possible services that can be built upon different overlay structures. Finally, emphasis is given to mechanisms implementing service selection based on some cost parameters (e.g., topological proximity) in order to introduce some mechanism based on optimality in case multiple service providers exist.

The Research of Comprehensive Network Maintenance Management System Based on BDS & GPS

2014 ◽  
Vol 543-547 ◽  
pp. 2858-2861
Author(s):  
Xiao Mei Zhang ◽  
Yuan Cheng ◽  
Bing Qi ◽  
Chen Xiong
Keyword(s):  
Management System ◽  
Satellite System ◽  
Maintenance Management ◽  
System Structure ◽  
Network Systems ◽  
Basic Principles ◽  
Maintenance System ◽  
Network Maintenance ◽  
Security Of Network ◽  
Gps System

According to the existing network maintenance system and the basic principles of composition, this paper provides a terminal system scheme and network maintenance management system based on BeiDou Navigation Satellite System (BDS) compatible with GPS by analyzing the system structure, functional architecture and software architecture. Studies have shown that the BDS compatible with GPS system can manage and monitor personnel and vehicles in real time and improves the reliability and security of network systems.

scholarly journals Ensemble Classification for Intrusion Detection

2016 ◽  
Vol 2 (9) ◽  
Author(s):  
Shweta Sharma ◽  
Prof. Aishwarya Mishra
Keyword(s):  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Detection System ◽  
Ensemble Classification ◽  
Intrusion Detection Systems ◽  
Sensitive Information ◽  
Network Systems ◽  
Detection Systems ◽  
Secure Information ◽  
Security Of Network

Security of network systems is becoming an important issue, as more and sensitive information is being stored and manipulated online. Therefore, it is essential to find an effective way to protect it. Mining approach can play very important role in developing an intrusion detection system. This paper presents various data mining Classification techniques applied on intrusion detection systems for the effective identification of both known and unknown patterns of attacks, to develop secure information systems.

Virtualized Disaster Recovery Model for Large Scale Hospital and Healthcare Systems

2012 ◽  
pp. 307-319
Author(s):  
Olivia F. Lee ◽  
Dennis Guster
Keyword(s):  
Disaster Preparedness ◽  
Disaster Recovery ◽  
Large Scale ◽  
Hospital Information Systems ◽  
Future Research ◽  
Virtual Model ◽  
Recovery Model ◽  
Healthcare Organizations ◽  
Network Systems ◽  
Multiple Network

Healthcare organizations face rising costs in effective management of hospital information systems. Adding to this burden is the Joint Commission’s mandate for disaster preparedness, which demands restoring access to information after unexpected catastrophes. Disaster recovery within healthcare organizations is essential because of its inherent critical nature and the possible losses’ impact on patients’ lives. This paper presents a virtualized disaster recovery model and presents steps for setting up the recovery environment and implementing the virtualized plan across multiple network systems. A large scale hospital and healthcare system in Minnesota participated in this study, and results indicate that the virtual model can provide acceptable performance when a limited number of client workstations are functioning. However, its performance is not as good as the traditional physical model, and its workload performance decays much quicker. Future research is suggested that tests more sophisticated models and incorporates finer granularity in the tabular distribution methodology.

Sign in / Sign up

Export Citation Format

Share Document