• Title/Summary/Keyword: mobile cluster

Search Result 309, Processing Time 0.026 seconds

A Study on Flooding Attack Detection and Response Technique in MANET (MANET에서 플러딩 공격 탐지 및 대응 기법에 관한 연구)

  • Yang, Hwan Seok;Yoo, Seung Jae
    • Convergence Security Journal
    • /
    • v.13 no.4
    • /
    • pp.41-46
    • /
    • 2013
  • Routing protocol using in the existing wire network cannot be used as it is for efficient data transmission in MANET. Because it consists of only mobile nodes, network topology is changing dynamically. Therefore, each mobile node must perform router functions. Variety of routing attack like DoS in MANET is present owing to these characteristic. In this paper, we proposed cooperative-based detection method to improve detection performance of flooding attack which paralyzes network by consuming resource. Accurate attack detection is done as per calculated adaptively threshold value considered the amount of all network traffic and the number of nodes. All the mobile nodes used a table called NHT to perform collaborative detection and apply cluster structure to the center surveillance of traffic.

A Session Key Establishment Scheme in Mobile Ad-Hoc Networks (이동 애드혹 네트워크에서 세션 키 설정 방안)

  • 왕기철;정병호;조기환
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.4
    • /
    • pp.353-362
    • /
    • 2004
  • Mobile Ad-Hoc network tends to expose scarce computing resources and various security threats because all traffics are carried in air along with no central management authority. To provide secure communication and save communication overhead, a scheme is inevitable to serurely establish session keys. However, most of key establishment methods for Ad-Hoc network focus on the distribution of a group key to all hosts and/or the efficient public key management. In this paper, a secure and efficient scheme is proposed to establish a session key between two Ad-Hoc nodes. The proposed scheme makes use of the secret sharing mechanism and the Diffie-Hellman key exchange method. For secure intra-cluster communication, each member node establishes session keys with its clusterhead, after mutual authentication using the secret shares. For inter-cluster communication, each node establishes session keys with its correspondent node using the public key and Diffie-Hellman key exchange method. The simulation results prove that the proposed scheme is more secure and efficient than that of the Clusterhead Authentication Based Method(1).

The analysis on the effect of rician fading and lognormal shadowing in microcellular mobile radio system using outage probability (마이크로셀룰라 이동 무선 시스템에서 Outage 확률을 이용한 라이시안 페이딩과 로그노말 섀도우잉 영향에 관한 분석)

  • Ahn, Chy-Hun;Kim, Nam;Park, Sung-Gyun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.9 no.1
    • /
    • pp.60-71
    • /
    • 1998
  • The propagation environment is effected by Rayleigh fading, Rician fading, path loss and lognormal shadowing in microcellular mobile radio system. In these surroundings we analysed the performance on received Rician signals among L Rician interferers and the characteristics of lognormal shadowing for various parameters such as reuse distance, cluster size, signal to interference power ratio and protection ratio using outage probability. We also studied various channels Rayleigh signal and Rician interferer, Rician signal and Rayleigh interferer, Rician signal and Rician interferer and so on using outage probability. The theoretical extention and computer simulation effectively analysed the characteristic of lognormal shadowed Rician channel.

  • PDF

An Improvement of Fault Tolerant for Routing using Secondary Header in CBRP (CBRP에서 보조헤더를 이용한 라우팅 고장 극복 개선)

  • 허태성;이균하
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.7
    • /
    • pp.983-996
    • /
    • 2001
  • Mobile Ad Hoc Network (MANET) is a network architecture which has no backborn network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, previously developed routing algorithms in wired networks cannot be used. And many new algorithms have been undergone. This study proposes the Secondary Header approach to the cluster based routing protocol (CBRP). In case, the main header becomes abnormal status so that the main header can not participate the communications between network entities, the secondary header immediately replaces the primary header without selecting process of the new primary header. The performances of proposed algorithm CBRP-SH(Cluster Based Routing Protocol using Secondary Header) are compared with CBRP and results are presented in order to show the effectiveness of the algorithm.

  • PDF

A study on Inference Network Based on the Resilient Ontology-based Dynamic Multicast Routing Protocol (상황인식 기반의 RODMRP 추론망 연구)

  • Kim, Sun-Guk;Chi, Sam-Hyun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1214-1221
    • /
    • 2007
  • Ad-hoc network is soft wireless communication network that is consisted of mobile node and clusters without helping of infrastructure. We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. Proposed structure is consisted of context awareness parameters as like distance between each nodes. The proposed architecture performs two types of routing discovery. One is Flooding Discovery Routing(FDR) for comparing analysis step and Local Discovery Routing(LDR) to compose path of node forecast(preservation) step from node's state value. The inference network structure of proposed RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) adopts a tree structure to enhance an efficient packet in various environment between mobile node. We will have developed an algorithm that will desist multi-hierarchy Layered networks to simulate a desired system.

Relative Speed based Task Distribution Algorithm for Smart Device Cluster (스마트 디바이스로 구성된 클러스터를 위한 상대속도 기반 작업 분배 기법)

  • Lee, Jaehun;Kang, Sooyong
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.3
    • /
    • pp.60-71
    • /
    • 2017
  • Smart devices such as smart phones, smart TVs, and smart pads have become essential devices in recent years. As the popularity and demand grows, the performance of smart devices is also getting better and users are dealing with a lot of things such as education and business using smart devices instead of desktop. However, smart devices that still have poor performance compared to desktop, even with improved performance, have difficulty running high performance applications due to limited resources. In this paper, we propose a load balancing algorithm applying the characteristics of smart devices to overcome the resource limitations of devices. in order to verify the algorithm, we implemented the algorithm after adding the distributed processing system service in Android platform. After constructing the cluster on the smart device, various experiments were conducted. Through the analysis of the test results, it is confirmed that the proposed algorithm efficiently improves the overall distributed processing performance by effectively aggregating different amounts of computing resources in heterogeneous smart devices.

Forecasting the Growth of Smartphone Market in Mongolia Using Bass Diffusion Model (Bass Diffusion 모델을 활용한 스마트폰 시장의 성장 규모 예측: 몽골 사례)

  • Anar Bataa;KwangSup Shin
    • The Journal of Bigdata
    • /
    • v.7 no.1
    • /
    • pp.193-212
    • /
    • 2022
  • The Bass Diffusion Model is one of the most successful models in marketing research, and management science in general. Since its publication in 1969, it has guided marketing research on diffusion. This paper illustrates the usage of the Bass diffusion model, using mobile cellular subscription diffusion as a context. We fit the bass diffusion model to three large developed markets, South Korea, Japan, and China, and the emerging markets of Vietnam, Thailand, Kazakhstan, and Mongolia. We estimate the parameters of the bass diffusion model using the nonlinear least square method. The diffusion of mobile cellular subscriptions does follow an S-curve in every case. After acquiring m, p, and q parameters we use k-Means Cluster Analysis for grouping countries into three groups. By clustering countries, we suggest that diffusion rates and patterns are similar, where countries with emerging markets can follow in the footsteps of countries with developed markets. The purpose was to predict the timing and the magnitude of the market maturity and to determine whether the data follow the typical diffusion curve of innovations from the Bass model.

Uncertainty for Privacy and 2-Dimensional Range Query Distortion

  • Sioutas, Spyros;Magkos, Emmanouil;Karydis, Ioannis;Verykios, Vassilios S.
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.3
    • /
    • pp.210-222
    • /
    • 2011
  • In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width $2A_{min}$, where $A_{min}$ defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, ${\theta}$) plane, where u and ${\theta}$ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, ${\theta}$) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one.

The Routing Algorithm for Wireless Sensor Networks with Random Mobile Nodes

  • Yun, Dai Yeol;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.38-43
    • /
    • 2017
  • Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

An Optimal Resource Distribution Scheme for P2P Streaming Service over Centralized DU Environment in LTE (LTE에서 집중화된 DU 환경에서 P2P 스트리밍 서비스를 위한 최적의 자원 배분 방안)

  • Kim, Yangjung;Chong, Ilyoung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.3
    • /
    • pp.81-86
    • /
    • 2014
  • According to the development of streaming services with P2P and mobile network technologies, researches to enhance the service quality in mobile environment have been proposed. However, streaming services considering high-speed mobile environment and characteristics of heterogenous terminals have been hindered from being provided with the required quality from user because of bandwidth congestion between selfish peers of existing P2P system. It is also prone to long delay and loss in accordance with the repeated traffic amounts because there are no optimized solution for traffic localization. The structure to enhance peer contribution for service differentiation and peer selection with clustering scheme with location information of terminal can satisfy both users and service providers with service quality and efficiency. In this paper, we propose an incentive mechanism and resource distribution scheme with user contribution and traffic cost information based on user location, which make mobile users increase the satisfaction of service quality in LTE environments.