• Title/Summary/Keyword: discussion networks

Search Result 94, Processing Time 0.023 seconds

Grid-Based Key Pre-Distribution in Wireless Sensor Networks

  • Mohaisen, Abedelaziz;Nyang, Dae-Hun;Maeng, Young-Jae;Lee, Kyung-Hee;Hong, Do-Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.195-208
    • /
    • 2009
  • In this paper, we introduce a grid-based key pre-distribution scheme in wireless sensor networks, which aims to improve the connectivity and resiliency while maintaining a reasonable overhead. We consider simplification of the key establishment logic and enhancement of the connectivity via plat polynomial assignment on a three-dimensional grid for node allocation and keying material assignment. We demonstrate that our scheme results in improvements via a detailed discussion on the connectivity, resource usage, security features and resiliency. A comparison with other relevant works from the literature along with a demonstrated implementation on typical sensor nodes shows the feasibility of the introduced scheme and its applicability for large networks.

Practical Implementation and Stability Analysis of ALOHA-Q for Wireless Sensor Networks

  • Kosunalp, Selahattin;Mitchell, Paul Daniel;Grace, David;Clarke, Tim
    • ETRI Journal
    • /
    • v.38 no.5
    • /
    • pp.911-921
    • /
    • 2016
  • This paper presents the description, practical implementation, and stability analysis of a recently proposed, energy-efficient, medium access control protocol for wireless sensor networks, ALOHA-Q, which employs a reinforcement-learning framework as an intelligent transmission strategy. The channel performance is evaluated through a simulation and experiments conducted using a real-world test-bed. The stability of the system against possible changes in the environment and changing channel conditions is studied with a discussion on the resilience level of the system. A Markov model is derived to represent the system behavior and estimate the time in which the system loses its operation. A novel scheme is also proposed to protect the lifetime of the system when the environment and channel conditions do not sufficiently maintain the system operation.

Complexity based Sensing Strategy for Spectrum Sensing in Cognitive Radio Networks

  • Huang, Kewen;Liu, Yimin;Hong, Yuanquan;Mu, Junsheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4372-4389
    • /
    • 2019
  • Spectrum sensing has attracted much attention due to its significant contribution to idle spectrum detection in Cognitive Radio Networks. However, specialized discussion is on complexity-based sensing strategy for spectrum sensing seldom considered. Motivated by this, this paper is devoted to complexity-based sensing strategy for spectrum sensing. Firstly, three efficiency functions are defined to estimate sensing efficiency of a spectrum scheme. Then a novel sensing strategy is proposed given sensing performance and computational complexity. After that, the proposed sensing strategy is extended to energy detector, Cyclostationary feature detector, covariance matrix detector and cooperative spectrum detector. The proposed sensing strategy provides a novel insight into sensing performance estimation for its consideration of both sensing capacity and sensing complexity. Simulations analyze three efficiency functions and optimal sensing strategy of energy detector, Cyclostationary feature detector and covariance matrix detector.

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.

The Design of Adaptive Fuzzy Polynomial Neural Networks Architectures Based on Fuzzy Neural Networks and Self-Organizing Networks (퍼지뉴럴 네트워크와 자기구성 네트워크에 기초한 적응 퍼지 다항식 뉴럴네트워크 구조의 설계)

  • Park, Byeong-Jun;Oh, Sung-Kwun;Jang, Sung-Whan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.2
    • /
    • pp.126-135
    • /
    • 2002
  • The study is concerned with an approach to the design of new architectures of fuzzy neural networks and the discussion of comprehensive design methodology supporting their development. We propose an Adaptive Fuzzy Polynomial Neural Networks(APFNN) based on Fuzzy Neural Networks(FNN) and Self-organizing Networks(SON) for model identification of complex and nonlinear systems. The proposed AFPNN is generated from the mutually combined structure of both FNN and SON. The one and the other are considered as the premise and the consequence part of AFPNN, respectively. As the premise structure of AFPNN, FNN uses both the simplified fuzzy inference and error back-propagation teaming rule. The parameters of FNN are refined(optimized) using genetic algorithms(GAs). As the consequence structure of AFPNN, SON is realized by a polynomial type of mapping(linear, quadratic and modified quadratic) between input and output variables. In this study, we introduce two kinds of AFPNN architectures, namely the basic and the modified one. The basic and the modified architectures depend on the number of input variables and the order of polynomial in each layer of consequence structure. Owing to the specific features of two combined architectures, it is possible to consider the nonlinear characteristics of process system and to obtain the better output performance with superb predictive ability. The availability and feasibility of the AFPNN are discussed and illustrated with the aid of two representative numerical examples. The results show that the proposed AFPNN can produce the model with higher accuracy and predictive ability than any other method presented previously.

Ultra Wide BandWireless Communications : A Tutorial

  • Di Benedetto , Maria-Gabriella;Vojcic, Branimir-R.
    • Journal of Communications and Networks
    • /
    • v.5 no.4
    • /
    • pp.290-302
    • /
    • 2003
  • Ultra wide band (UWB) radio has recently attracted increased attention due to its expected unlicensed operation, and potential to provide very high data rates at relatively short ranges. In this article we briefly describe some main candidate multiple access and modulation schemes for UWB communications, followed with their power spectral density calculation and properties. We also present some illustrative capacity results, and provide a discussion of the impact of network topology on multiple access capacity.

A comparative study between the neural network and the winters' model in forecasting

  • Kim, Wanhee
    • Korean Management Science Review
    • /
    • v.9 no.1
    • /
    • pp.17-30
    • /
    • 1992
  • This paper is organized as follows. Section 2 illustrates several applications of neural networks. Section 3 presents the theoretical aspects of the major neural network paradigms as well as the structure of the back -propagation network used in the study. Section 4 describes the experiment including data analysis, modeling, and the performance criteria followed by the detailed discussion of the experimental results. Future research avenues including advantages and limitations of neural network are presented in the last section.

  • PDF

An Implementation of Spectrum Usage Rights for Liberalization of the Radio Spectrum

  • Butler Joe M.;Webb William T.
    • Journal of Communications and Networks
    • /
    • v.8 no.2
    • /
    • pp.163-168
    • /
    • 2006
  • This paper presents one possible approach for liberalization of the radio spectrum based around spectrum usage rights (SURs) which are technology and usage neutral. This is challenging technically because of the complexity of defining rights which are flexible and technology-neutral while retaining sufficient safeguards against interference. The work presented here is part of an ongoing process of defining and testing SURs. Of com is currently considering SURs, though is not committed to implementing them at this stage, and will issue further discussion documents on this area in due course.

Mobile Software Agents for Information Retrieval in WWW-Databases

  • Baek, Seong-Min;Chung, Jae-Yong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.75.6-75
    • /
    • 2002
  • Current database technique offers the possibility to store giant amounts of data, worldwide networks provide the technical base for everybody to access it. However, it is usually very time-consuming or even impossible to find the most relevant information. This article describes the usage of mobile soft-ware agents to query different databases on the Internet, to rate and compress the results and to present them to the user in a consistent form, It contains a general definition of soft-ware agents, a detailed description of the approach and a discussion of its main advantages and weaknesses.

  • PDF

Approximate Cell Loss Performance in ATM Networks: In Comparison with Exact Results

  • Lee, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4A
    • /
    • pp.489-495
    • /
    • 2000
  • In this paper we propose an approximate method to estimate the cell loss probability(CLP) due to buffer overflow in ATM networks. The main idea is to relate the buffer capacity with the CLP target in explicit formula by using the approximate upper bound for the tail distribution of a queue. The significance of the proposition lies in the fact that we can obtain the expected CLP by using only the source traffic data represented by mean rate and its variance. To that purpose we consider the problem of estimating the cell loss measures form the statistical viewpoint such that the probability of cell loss due to buffer overflow does not exceed a target value. In obtaining the exact solution we use a typical matrix analytic method for GI/D/1B queue where B is the queue size. Finally, in order to investigate the accuracy of the result, we present both the approximate and exact results of the numerical computation and give some discussion.

  • PDF