• Title/Summary/Keyword: international networks

Search Result 1,138, Processing Time 0.026 seconds

Computer Science Research Ideas Generation Using Neural Networks

  • Maghraby, Ashwag;Assaeed, Joanna
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.6
    • /
    • pp.127-130
    • /
    • 2022
  • The number of published journals, conferences, and research papers in computer science is increasing rapidly, which has led to a challenge in coming up with new and unique ideas for research. To alleviate the issue, this paper uses artificial neural networks (ANNs) to generate new computer science research ideas. It does so by using a dataset collected from IEEE published journals and conferences to train an ANN model. The results reveal that the model has a 14% success rate in generating usable ideas. The outcome of this paper has implications for helping both new and experienced researchers come up with novel research topics.

Software-Defined Vehicular Networks (SDVN)

  • Al-Mekhlafi, Zeyad Ghaleb
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.9
    • /
    • pp.231-243
    • /
    • 2022
  • The expansion of new applications and business models is being significantly fueled by the development of Fifth Generation (5G) networks, which are becoming more widely accessible. The creation of the newest intelligent vehicular net- works and applications is made possible by the use of Vehicular Ad hoc Networks (VANETs) and Software Defined Networking (SDN). Researchers have been concentrating on the integration of SDN and VANET in recent years, and they have examined a variety of issues connected to the architecture, the advantages of software defined VANET services, and the new features that can be added to them. However, the overall architecture's security and robustness are still in doubt and have received little attention. Furthermore, new security threats and vulnerabilities are brought about by the deployment and integration of novel entities and several architectural components. In this study, we comprehensively examine the good and negative effects of the most recent SDN-enabled vehicular network topologies, focusing on security and privacy. We examine various security flaws and attacks based on the existing SDVN architecture. Finally, a thorough discussion of the unresolved concerns and potential future study directions is provided.

A Deep Learning Model for Predicting User Personality Using Social Media Profile Images

  • Kanchana, T.S.;Zoraida, B.S.E.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.11
    • /
    • pp.265-271
    • /
    • 2022
  • Social media is a form of communication based on the internet to share information through content and images. Their choice of profile images and type of image they post can be closely connected to their personality. The user posted images are designated as personality traits. The objective of this study is to predict five factor model personality dimensions from profile images by using deep learning and neural networks. Developed a deep learning framework-based neural network for personality prediction. The personality types of the Big Five Factor model can be quantified from user profile images. To measure the effectiveness, proposed two models using convolution Neural Networks to classify each personality of the user. Done performance analysis among two different models for efficiently predict personality traits from profile image. It was found that VGG-69 CNN models are best performing models for producing the classification accuracy of 91% to predict user personality traits.

An Advanced Resource Allocation Algorithm for PON-LTE Converged Networks

  • Abhishek Gaur;Vibhakar Shrimali
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.16-22
    • /
    • 2023
  • Enhanced radio access technologies (RAT) are deployed in Next Generation Convergence Networks by the service providers so as to satisfy the basic requirements of end-users for e.g. QoS. Whenever the available resources are being shared simultaneously and dynamically by multiple users or distribution of allocated channels randomly, the deficiency of spectral resources and dynamic behavior of Network traffic in real time Networking, we may have problem. In order to evaluate the performance of our proposed algorithm, computer simulation has been performed on NS-2 simulator and a comparison with the existing algorithms has been made.

FANET:-Communication Architecture and Routing Protocols A Review

  • Moazzam Ali;Adil Idress;Jawwad Ibrahim
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.5
    • /
    • pp.181-190
    • /
    • 2024
  • FANET (Flying ad-hoc network) is a self-adjusting wireless network that enables easy to deploy flying nodes, inexpensive, flexible such as UAV in the absence of fixed network infrastructure they communicate amoung themselves. Past few decades FANET is only the emerging networks with it's huge range of next-generation applications.FANET is a sub-set of MANET's(Mobile Ad-hoc Network) and UAV networks are known as FANET.Routing enables the flying nodes to establish routes to radio access infrastructure specifically FANET and among themselves coordinate and collaborate.This paper presents a review on existing proposed communication architecture and routing protocols for FANETS.In addition open issues and challenges are summarized in tabular form with proposed solution.Our goal is to provide a general idea to the researchers about different topics to be addressed in future.

FTCARP: A Fault-Tolerant Routing Protocol for Cognitive Radio Ad Hoc Networks

  • Che-aron, Zamree;Abdalla, Aisha Hassan;Abdullah, Khaizuran;Rahman, Md. Arafatur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.2
    • /
    • pp.371-388
    • /
    • 2014
  • Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

Football match intelligent editing system based on deep learning

  • Wang, Bin;Shen, Wei;Chen, FanSheng;Zeng, Dan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.5130-5143
    • /
    • 2019
  • Football (soccer) is one of the most popular sports in the world. A huge number of people watch live football matches by TV or Internet. A football match takes 90 minutes, but viewers may only want to watch a few highlights to save their time. As far as we know, there is no such a product that can be put into use to achieve intelligent highlight extraction from live football matches. In this paper, we propose an intelligent editing system for live football matches. Our system can automatically extract a series of highlights, such as goal, shoot, corner kick, red yellow card and the appearance of star players, from the live stream of a football match. Our system has been integrated into live streaming platforms during the 2018 FIFA World Cup and performed fairly well.

Position-Based Multicast Routing in Mobile Ad hoc Networks: An Analytical Study

  • Qabajeh, Mohammad M.;Adballa, Aisha H.;Khalifa, Othman O.;Qabajeh, Liana K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1586-1605
    • /
    • 2012
  • With the prevalence of multimedia applications and the potential commercial usage of Mobile Ad hoc Networks (MANETs) in group communications, Quality of Service (QoS) support became a key requirement. Recently, some researchers studied QoS multicast issues in MANETs. Most of the existing QoS multicast routing protocols are designed with flat topology and small networks in mind. In this paper, we investigate the scalability problem of these routing protocols. In particular, a Position-Based QoS Multicast Routing Protocol (PBQMRP) has been developed. PBQMRP builds a source multicast tree guided by the geographic information of the mobile nodes, which helps in achieving more efficient multicast delivery. This protocol depends on the location information of the multicast members which is obtained using a location service algorithm. A virtual backbone structure has been proposed to perform this location service with minimum overhead and this structure is utilized to provide efficient packet transmissions in a dynamic mobile Ad hoc network environment. The performance of PBQMRP is evaluated by performing both quantitative analysis and extensive simulations. The results show that the used virtual clustering is very useful in improving scalability and outperforms other clustering schemes. Compared to On-Demand Multicast Routing Protocol (ODMRP), PBQMRP achieves competing packet delivery ratio and significantly lower control overhead.

Risk Communication on Social Media during the Sewol Ferry Disaster

  • Song, Minsun;Jung, Kyujin;Kim, Jiyoung Ydun;Park, Han Woo
    • Journal of Contemporary Eastern Asia
    • /
    • v.18 no.1
    • /
    • pp.189-216
    • /
    • 2019
  • The frequent occurrence of overwhelming disasters necessitates risk communication systems capable of operating effectively in disaster contexts. Few studies have examined risk communication networks during disasters through social networking services (SNS). This study therefore investigates the patterns of risk communication by comparing Korean and international networks based on the social amplification of risk communication in the context of the Sewol ferry disaster (SFD). In addition, differences in language use and patterns between Korean and international contexts are identified through a semantic analysis using KrKwick, NodeXL, and UCINET. The SFD refers to the sinking of the ferry while carrying 476 people, mostly secondary school students. The results for interpersonal risk communication reveal that the structure of the Korean risk communication network differed from that of the international network. The Korean network was more fragmented, and its clustering was more sparsely knitted based on the impact and physical proximity of the disaster. Semantic networks imply that the physical distance from the disaster affected the content of risk communication, as well as the network pattern.

Design of Hard Partition-based Non-Fuzzy Neural Networks

  • Park, Keon-Jun;Kwon, Jae-Hyun;Kim, Yong-Kab
    • International journal of advanced smart convergence
    • /
    • v.1 no.2
    • /
    • pp.30-33
    • /
    • 2012
  • This paper propose a new design of fuzzy neural networks based on hard partition to generate the rules of the networks. For this we use hard c-means (HCM) clustering algorithm. The premise part of the rules of the proposed networks is realized with the aid of the hard partition of input space generated by HCM clustering algorithm. The consequence part of the rule is represented by polynomial functions. And the coefficients of the polynomial functions are learned by BP algorithm. The number of the hard partition of input space equals the number of clusters and the individual partitioned spaces indicate the rules of the networks. Due to these characteristics, we may alleviate the problem of the curse of dimensionality. The proposed networks are evaluated with the use of numerical experimentation.