scholarly journals A Multi-Core Controller for an Embedded AI System Supporting Parallel Recognition

Micromachines ◽  
2021 ◽  
Vol 12 (8) ◽  
pp. 852
Author(s):  
Suyeon Jang ◽  
Hyun Woo Oh ◽  
Young Hyun Yoon ◽  
Dong Hyun Hwang ◽  
Won Sik Jeong ◽  
...  
Keyword(s):  
Original Data ◽  
Network Resources ◽  
Stringent Requirement ◽  
Computing Systems ◽  
Security Issues ◽  
Network Bandwidth ◽  
Resource Limited ◽  
System Use ◽  
Field Programmable ◽  
Client System

Recent advances in artificial intelligence (AI) technology encourage the adoption of AI systems for various applications. In most deployments, AI-based computing systems adopt the architecture in which the central server processes most of the data. This characteristic makes the system use a high amount of network bandwidth and can cause security issues. In order to overcome these issues, a new AI model called federated learning was presented. Federated learning adopts an architecture in which the clients take care of data training and transmit only the trained result to the central server. As the data training from the client abstracts and reduces the original data, the system operates with reduced network resources and reinforced data security. A system with federated learning supports a variety of client systems. To build an AI system with resource-limited client systems, composing the client system with multiple embedded AI processors is valid. For realizing the system with this architecture, introducing a controller to arbitrate and utilize the AI processors becomes a stringent requirement. In this paper, we propose an embedded AI system for federated learning that can be composed flexibly with the AI core depending on the application. In order to realize the proposed system, we designed a controller for multiple AI cores and implemented it on a field-programmable gate array (FPGA). The operation of the designed controller was verified through image and speech applications, and the performance was verified through a simulator.

scholarly journals RPPUF: An Ultra-Lightweight Reconfigurable Pico-Physically Unclonable Function for Resource-Constrained IoT Devices

Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 3039
Author(s):  
Zhao Huang ◽  
Liang Li ◽  
Yin Chen ◽  
Zeyu Li ◽  
Quan Wang ◽  
...  
Keyword(s):  
Low Cost ◽  
Resource Constrained ◽  
Security Issues ◽  
Resource Limited ◽  
Field Programmable ◽  
Hardware Resource ◽  
Inherent Nature ◽  
Iot Devices ◽  
Multiple Samples ◽  
The Internet Of Things

With the advancement of the Internet of Things (IoTs) technology, security issues have received an increasing amount of attention. Since IoT devices are typically resource-limited, conventional security solutions, such as classical cryptography, are no longer applicable. A physically unclonable function (PUF) is a hardware-based, low-cost alternative solution to provide security for IoT devices. It utilizes the inherent nature of hardware to generate a random and unpredictable fingerprint to uniquely identify an IoT device. However, despite existing PUFs having exhibited a good performance, they are not suitable for effective application on resource-constrained IoT devices due to the limited number of challenge-response pairs (CRPs) generated per unit area and the large hardware resources overhead. To solve these problems, this article presents an ultra-lightweight reconfigurable PUF solution, which is named RPPUF. Our method is built on pico-PUF (PPUF). By incorporating configurable logics, one single RPPUF can be instantiated into multiple samples through configurable information K. We implement and verify our design on the Xilinx Spartan-6 field programmable gate array (FPGA) microboards. The experimental results demonstrate that, compared to previous work, our method increases the uniqueness, reliability and uniformity by up to 4.13%, 16.98% and 10.5%, respectively, while dramatically reducing the hardware resource overhead by 98.16% when a 128-bit PUF response is generated. Moreover, the bit per cost (BPC) metric of our proposed RPPUF increased by up to 28.5 and 53.37 times than that of PPUF and the improved butterfly PUF, respectively. This confirms that the proposed RPPUF is ultra-lightweight with a good performance, making it more appropriate and efficient to apply in FPGA-based IoT devices with constrained resources.

scholarly journals PERFORMANCE COMPARISON WITH ACCESSIBILITY PREDICTION AND LINK BREAKAGE PREDICTION IN MANETS

2015 ◽  
pp. 48-54
Author(s):  
TEJAL ARVIND SONAWALE ◽  
SHIKHA NEMA
Keyword(s):  
Ad Hoc ◽  
Power Level ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Network Resources ◽  
Average Delay ◽  
Network Bandwidth ◽  
Multiple Routes ◽  
Hoc Networks

Ad Hoc Networks face a lot of problems due to issues like mobility, power level, load of the network, bandwidth constraints, dynamic topology which lead to link breaks, node break down and increase in overhead. As nodes are changing their position consistently, routes are rapidly being disturbed, thereby generating route errors and new route discoveries. The need for mobility awareness is widely proclaimed. In our dissertation we present a scheme AOMDV-APLP that makes AOMDV aware of accessibility of neighbor nodes in the network. Nodes acquire the accessibility information of other nodes through routine routing operations and keep in their routing table. Based on this information route discovery is restricted to only “accessible” and “start” nodes. Further route with the strongest signal strength is selected from multiple routes using Link life value predicted by Link Breakage prediction technique. Simulation result shows that using accessibility and link life knowledge in route discovery process MAC overhead, routing overhead and average delay is reduced 3 times, and improve the Packet delivery ratio to a large extent than standard AOMDV which reflects effective use of network resources.

scholarly journals Utilizing the Enhanced Risk Assessment Equation to Determine the Apparent Risk due to User Datagram Protocol (UDP) Flooding Attack

2017 ◽  
Vol 9 (1-4) ◽  
Author(s):  
Athirah Rosli ◽  
Abidah Mat Taib ◽  
Wan Nor Ashiqin Wan Ali
Keyword(s):  
Risk Assessment ◽  
Simulation Software ◽  
Network Communication ◽  
Network Resources ◽  
User Datagram Protocol ◽  
Security Issues ◽  
Flooding Attack ◽  
Internet Users ◽  
Mitigation Techniques ◽  
Internet Of Thing

Escalation of Internet-of-Thing (IoT) may cause internet users being exposed to IPv6 security issues. End-to-end connection feature in IPv6 can be misused by attackers to flood targeted host. Using User Datagram Protocol (UDP), attackers can certainly congest the network by injecting UDP packets during network communication. This will introduce risk if there is no precaution step taken. Enhanced risk assessment equation can be adopted to mitigate the perils. Thus, this paper presents the use of enhanced risk assessment equation to identify risk value that is caused by UDP flooding attack. The attack was simulated using OMNeT++ simulation software. The inputs that were considered in the enhanced equation are based on the features of the tested network scenarios. The obtained risk value can be used in determining appropriate mitigation techniques that help the organization in maintaining and strengthening their network. It also offers organization to secure their network resources and assets. Furthermore, this paper also reveals that the enhanced risk assessment equation is flexible to be used in any situation. Hereafter, more IPv6 based protocols will be tested to measure the capability of using the enhanced equation. 

Game Theory for Wireless Network Resource Management

Game Theory ◽  
2017 ◽  
pp. 383-399
Author(s):  
Sungwook Kim
Keyword(s):  
Game Theory ◽  
Computer Network ◽  
Limited Resource ◽  
Shared Resources ◽  
Network Resources ◽  
Network Resource ◽  
Network Bandwidth ◽  
Competitive Game ◽  
Network Usage ◽  
Fair Sharing

Computer network bandwidth can be viewed as a limited resource. The users on the network compete for that resource. Their competition can be simulated using game theory models. No centralized regulation of network usage is possible because of the diverse ownership of network resources. Therefore, the problem is of ensuring the fair sharing of network resources. If a centralized system could be developed which would govern the use of the shared resources, each user would get an assigned network usage time or bandwidth, thereby limiting each person's usage of network resources to his or her fair share. As of yet, however, such a system remains an impossibility, making the situation of sharing network resources a competitive game between the users of the network and decreasing everyone's utility. This chapter explores this competitive game.

Denial-of-Service and Botnet Analysis, Detection, and Mitigation

2021 ◽  
pp. 20-48
Author(s):  
Sobana Sikkanan ◽  
Kasthuri M.
Keyword(s):  
Denial Of Service ◽  
The Internet ◽  
Dos Attack ◽  
Dos Attacks ◽  
Network Resources ◽  
Systematic Analysis ◽  
Network Bandwidth ◽  
Research Areas ◽  
History Analysis ◽  
Near Future

The internet is designed for processing and forwarding of any packet in a best effort manner. The packets carried by the internet may be malicious or not. Most of the time, internet architecture provides an unregulated path to victims. Denial-of-service (DoS) attack is the most common critical threat that causes devastating effects on the internet. The Botnet-based DoS attack aims to exhaust both the target resources and network bandwidth, thereby making the network resources unavailable for its valid users. The resources are utilized by either injecting a computer virus or flooding the network with useless traffic. This chapter provides a systematic analysis of the causes of DoS attacks, including motivations and history, analysis of different attacks, detection and protection techniques, various mitigation techniques, the limitations and challenges of DoS research areas. Finally, this chapter discusses some important research directions which will need more attention in the near future to guarantee the successful defense against DoS attacks.

Security Issues in Distributed Computing System Models

2017 ◽  
pp. 211-259 ◽  
Author(s):  
Ghada Farouk Elkabbany ◽  
Mohamed Rasslan
Keyword(s):  
Distributed Systems ◽  
Distributed Computing ◽  
Computing System ◽  
Computing Environment ◽  
Distributed Computing Systems ◽  
Computing Systems ◽  
Research Directions ◽  
System Models ◽  
Security Issues ◽  
Systems Security

Distributed computing systems allow homogenous/heterogeneous computers and workstations to act as a computing environment. In this environment, users can uniformly access local and remote resources in order to run processes. Users are not aware of which computers their processes are running on. This might pose some complicated security problems. This chapter provides a security review of distributed systems. It begins with a survey about different and diverse definitions of distributed computing systems in the literature. Different systems are discussed with emphasize on the most recent. Finally, different aspects of distributed systems security and prominent research directions are explored.

ON A REFINED CYCLIC RESERVATION-BASED MAC SCHEME FOR ULTRA HIGH-SPEED HIERARCHICAL RING MANS

1998 ◽  
Vol 08 (03) ◽  
pp. 379-404
Author(s):  
WEN-FONG WANG ◽  
LING-YANG KUNG
Keyword(s):  
Access Control ◽  
Traffic Congestion ◽  
High Speed ◽  
Control Method ◽  
Mac Protocol ◽  
Network Resources ◽  
Medium Access ◽  
Network Bandwidth ◽  
Mac Scheme ◽  
Fair Access

To support a great number of dispersed users in a wider area with high-speed communication services, we investigate a highly efficient medium access control (MAC) scheme for the hierarchical ring networks. In these networks, traffic congestion may happen due to the mismatch of transmission speed between backbone and outer rings. To cope with the issue, we propose a refined MAC protocol based on the cyclic reservation-based access control method for different network resources, viz. network bandwidth and buffers. By this approach, our protocol can achieve fair access to the network resources and avoid traffic congestion at the same time. Also, the networks will have the properties of extremely high throughput, low delay, fair access, simple implementation, and so forth. To evaluate the network, several simulative experiments are performed and some optimistic results are revealed.

scholarly journals Provide a secured automatic program algorithm for DNA sequence storage arrangement in cloud

2018 ◽  
Vol 7 (2.20) ◽  
pp. 10
Author(s):  
G Geetha ◽  
G Surekha ◽  
P Aditya Sharma ◽  
E Uma Shankari
Keyword(s):  
Cloud Computing ◽  
Dna Sequences ◽  
Sequence Data ◽  
Low Cost ◽  
Original Data ◽  
Reference Sequence ◽  
Secret Data ◽  
Security Issues ◽  
Information Accessibility ◽  
Minimum Number

The primary target of this paper is to provide a secured implementing algorithm for hiding DNA sample sequence data confidently by using special software in cloud computing environments. The suggested algorithm here for hiding DNA sequences is based on binary coding and complementary pairing rules. Hence DNA reference sequence is taken as a sample secret data with a notation of M. But after applying some steps the final result obtained in cloud environment is M’’’. The procedure of identifying or extracting the original data M from the hidden DNA Reference sequence is depended on the user if and only if the user wants to use the data for process. Likewise there are security issues for the manipulating from claiming information. In this way that accessible user’s information arrangement may be isolated under SPs in such a way that it has to reach minimum number of specified threshold SPs number from the whole data block. In this paper, we recommend A low cost secured and multi- cloud storage  (SCMCS) model over cloud computing which holds an prudent appropriation about information Around the accessible SPs in the market, with gatherings gives client information accessibility and additionally secure capacity.  

scholarly journals Wireless Transmission Method for Large Data Based on Hierarchical Compressed Sensing and Sparse Decomposition

Sensors ◽  
2020 ◽  
Vol 20 (24) ◽  
pp. 7146
Author(s):  
Youtian Qie ◽  
Chuangbo Hao ◽  
Ping Song
Keyword(s):  
Compressed Sensing ◽  
Signal Reconstruction ◽  
Large Data ◽  
Original Data ◽  
Wireless Transmission ◽  
Wireless Sensor ◽  
Transmission Method ◽  
Widespread Application ◽  
Sparse Decomposition ◽  
Network Bandwidth

With the widespread application of wireless sensor networks, large-scale systems with high sampling rates are becoming more and more common. The amount of original data generated by the wireless sensor network is very large, and transmitting all the original data back to the host wastes network bandwidth and energy. This paper proposes a wireless transmission method for large data based on hierarchical compressed sensing and sparse decomposition. This method includes a hierarchical signal decomposition method based on the same sparse basis and different sparse basis hierarchical compressed sensing method with a mask. Compared with the traditional compressed sensing method, this method reduces the error of signal reconstruction, reduces the amount of calculation during signal reconstruction, and reduces the occupation of hardware resources. We designed comparison experiments between the traditional compressed sensing algorithm and the method proposed in this article. In addition, the experiments’ results prove that our proposed method reduces the execution time, as well as the reconstruction error, compared with the traditional compressed sensing algorithm, and it can achieve better reconstruction at a relatively low compression ratio.

Sign in / Sign up

Export Citation Format

Share Document