• Title/Summary/Keyword: networking of networks

Search Result 815, Processing Time 0.025 seconds

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.

Influence Assessment Model of a Person within Heterogeneous Networks Based on Networked Community

  • Kim, Tae-Geon;Yoon, Soungwoong;Lee, Sang-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.10
    • /
    • pp.181-188
    • /
    • 2018
  • In this paper, we tried to investigate whether the influence of 'I' in a heterogeneous network of physical network and virtual network can be quantitatively measurable. To do this, we used Networked Community(NC) methodology to devise a concrete model of influence assessment in heterogeneous network. In order to test the model, we conducted an experiment with Donald J. Trump and his surroundings to evaluate the effectiveness of this influence assessment model. Experimentation included the measurement of impacts on the physical and virtual networks, and the impact on the networked community. Using Trump's case, we found that analyzing only one of the two networks can not accurately analyze the impact on others.

Global Civil Society from Hyperlink Perspective: Exploring the Website Networks of International NGOs

  • Meier, Harald
    • Journal of Contemporary Eastern Asia
    • /
    • v.15 no.1
    • /
    • pp.64-77
    • /
    • 2016
  • This case study takes a look at the hyperlink networks extracted from the websites of 367 international non-governmental organizations (NGOs) with datasets from 2010, 2012 and 2014. The first level of evaluation focuses on connections between the NGOs, identifying important nodes, groups and their relations. The second level takes into account the broad range of networked websites from the World Wide Web delivering insights into general networking patterns. The third level explores the underlying spatial configurations of the network which offers a great variety of geographic insights on information flows between and within continents, countries and cities. The most interesting findings of this study are a low level of interconnectedness between the NGOs and at the same time a strong spatial concentration of all embedded network actors.

An Efficient Routing Algorithm for extreme networking environments (극단적인 네트워크 환경을 위한 효율적인 라우팅 알고리즘)

  • Wang, Jong Soo;Seo, Doo Ok
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.1
    • /
    • pp.47-53
    • /
    • 2012
  • Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.

Zone based Ad Hoc Network Construction Scheme for Local IoT Networks

  • Youn, Joosang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.95-100
    • /
    • 2017
  • In this paper, we propose a zone based ad hoc network construction scheme which support ad hoc path between nodes in local IoT networks consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Recently, the various routing protocols have been studied to support ad hoc networking of local IoT environments. This is, because basis RPL protocol is deigned to be used for the connecting service with Internet through gateway, ad hoc path between nodes in local IoT networks is not supported in basis RPL protocol. Thus, in this paper, the proposed routing scheme provides both ad hoc path and Infra path through gateway, supporting basis RPL protocol simultaneously. Through simulation, we show that the proposed routing scheme with zone based path selection scheme improves the performance of the success rate of end-to-end data transmission and the end-to-end delay, compared to basis RPL protocol.

QoS Provisioning in Wireless Body Area Networks: A Review on MAC Aspects

  • Thapa, Anup;Shin, Seok-Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1267-1285
    • /
    • 2012
  • Wireless Body Area Networks (WBANs) deal with variety of healthcare services with diverse Quality of Service (QoS) requirements. However, QoS handling is a challenging problem in such networks. In general, QoS related problems can be addressed from different layers in the networking protocol suite. Design of an efficient QoS aware Medium Access Control (MAC) protocol can address this problem in MAC layer. This paper analyzes the QoS requirements of WBAN, identifies the requisites of QoS handling system, and outlines the trends that are being followed for its advancement with focus on QoS issues at MAC layer. We review some prior works, compare them, and analyze the current research concerned with problem of providing QoS in WBAN. We also explore some open issues and discuss them.

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.

OPEED: Optimal Energy-Efficient Neighbor Discovery Scheme in Opportunistic Networks

  • Yang, Dongmin;Shin, Jongmin;Kim, Jeongkyu;Kim, Geun-Hyung
    • Journal of Communications and Networks
    • /
    • v.17 no.1
    • /
    • pp.34-39
    • /
    • 2015
  • In opportunistic networks, it is difficult to predict when a node encounters others and how long it keeps in contact with another. Nodes continually attempt to explore neighbor nodes in the vicinity to transmit data. In battery-operated devices, this persistent exploration consumes a great deal of energy. In this paper, we propose an optimal energy-efficient neighbor discovery scheme (OPEED) that guarantees neighbor discovery within a delay bound. Through performance evaluation, we show that the OPEED scheme consumes 33%-83% less energy than other schemes.

Topological design for packet network with hop-count the minimum degree ordering method (경유교환기 수의 제약을 고려한 패킷 통신망 설계에 관한 연구)

  • 윤문길;주성순;전경표
    • Korean Management Science Review
    • /
    • v.12 no.2
    • /
    • pp.89-103
    • /
    • 1995
  • Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.

  • PDF

Verifying Active Network Applications (액티브 네트워크 응용의 검증)

  • Park, Jun-Cheol
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.510-523
    • /
    • 2002
  • The routers in an active network perform customized computations on the messages flowing through them, while the role of routers in the traditional packet network, such as the Internet, is to passively forward packets as fast as possible. In contrast to the Internet, the processing in active networks can be customized on a per user or per application basis. Active networks allow users to inject information into the network, where the information describes or controls a program to be executed for the users by the routers as well as the end hosts. So the network users can realize the active networks by "programming" the network behavior via the programming interface exposed to them. In this paper, we devise a network protocol model and present a verification technique for reasoning about the correctness of an active application defined using the model. The technique is developed in a platform- and language-independent way, and it is algorithmic and can be automated by computer program. We give an example dealing with network auction to illustrate the use of the model and the verification technique.