• Title/Summary/Keyword: 네트워크 동적변화

Search Result 337, Processing Time 0.028 seconds

Regional Path Re-selection Period Determination Method for the Energy Efficient Network Management in Sensor Networks applied SEF (통계적 여과 기법이 적용된 센서 네트워크에서 에너지 효율적인 네트워크 관리를 위한 영역별 경로 재설정 주기 결정 기법)

  • Park, Hyuk;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.3
    • /
    • pp.69-78
    • /
    • 2011
  • A large-scale sensor network usually operates in open and unattended environments, hence individual sensor node is vulnerable to various attacks. Therefore, malicious attackers can physically capture sensor nodes and inject false reports into the network easily through compromised nodes. These false reports are forwarded to the base station. The false report injection attack causes not only false alarms, but also the depletion of the restricted energy resources in a battery powered network. The statistical en-route filtering (SEF) mechanism was proposed to detect and drop false reports en route. In SEF, the choice of routing paths largely affect the energy consumption rate and the detecting power of the false report. To sustain the secure routing path, when and how to execute the path re-selection is greatly need by reason of the frequent network topology change and the nodes's limitations. In this paper, the regional path re-selection period determination method is proposed for efficient usage of the limited energy resource. A fuzzy logic system is exploited in order to dynamically determine the path re-selection period and compose the routing path. The simulation results show that up to 50% of the energy is saved by applying the proposed method.

Design and Analysis of Multiple Mobile Router Architecture for In-Vehicle IPv6 Networks (차량 내 IPv6 네트워크를 위한 다중 이동 라우터 구조의 설계와 분석)

  • Paik Eun-Kyoung;Cho Ho-Sik;Choi Yang-Hee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.2 no.2 s.3
    • /
    • pp.43-54
    • /
    • 2003
  • As the demand for ubiquitous mobile wireless Internet grows, vehicles are receiving a lot of attention as new networking platforms. The demand for 4G all-IP networks encourages vehicle networks to be connected using IPv6. By means of network mobility (NEMO) support, we can connect sensors, controllers, local ,servers as well as passengers' devices of a vehicle to the Internet through a mobile router. The mobile router provides the connectivity to the Internet and mobility transparency for the rest of the mobile nodes of an in-vehicle nv6 network. So, it is .important for the mobile router to assure reliable connection and a sufficient data rate for the group of nodes behind it. To provide reliability, this paper proposes an adaptive multihoming architecture of multiple mobile routers. Proposed architecture makes use of different mobility characteristics of different vehicles. Simulation results with different configurations show that the proposed architecture increases session preservation thus increases reliability and reduces packet loss. We also show that the proposed architecture is adaptive to heterogeneous access environment which provide different access coverage areas and data rates. The result shows that our architecture achieves sufficient data rates as well as session preservation.

  • PDF

A Dynamic Management Method for FOAF Using RSS and OLAP cube (RSS와 OLAP 큐브를 이용한 FOAF의 동적 관리 기법)

  • Sohn, Jong-Soo;Chung, In-Jeong
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.2
    • /
    • pp.39-60
    • /
    • 2011
  • Since the introduction of web 2.0 technology, social network service has been recognized as the foundation of an important future information technology. The advent of web 2.0 has led to the change of content creators. In the existing web, content creators are service providers, whereas they have changed into service users in the recent web. Users share experiences with other users improving contents quality, thereby it has increased the importance of social network. As a result, diverse forms of social network service have been emerged from relations and experiences of users. Social network is a network to construct and express social relations among people who share interests and activities. Today's social network service has not merely confined itself to showing user interactions, but it has also developed into a level in which content generation and evaluation are interacting with each other. As the volume of contents generated from social network service and the number of connections between users have drastically increased, the social network extraction method becomes more complicated. Consequently the following problems for the social network extraction arise. First problem lies in insufficiency of representational power of object in the social network. Second problem is incapability of expressional power in the diverse connections among users. Third problem is the difficulty of creating dynamic change in the social network due to change in user interests. And lastly, lack of method capable of integrating and processing data efficiently in the heterogeneous distributed computing environment. The first and last problems can be solved by using FOAF, a tool for describing ontology-based user profiles for construction of social network. However, solving second and third problems require a novel technology to reflect dynamic change of user interests and relations. In this paper, we propose a novel method to overcome the above problems of existing social network extraction method by applying FOAF (a tool for describing user profiles) and RSS (a literary web work publishing mechanism) to OLAP system in order to dynamically innovate and manage FOAF. We employed data interoperability which is an important characteristic of FOAF in this paper. Next we used RSS to reflect such changes as time flow and user interests. RSS, a tool for literary web work, provides standard vocabulary for distribution at web sites and contents in the form of RDF/XML. In this paper, we collect personal information and relations of users by utilizing FOAF. We also collect user contents by utilizing RSS. Finally, collected data is inserted into the database by star schema. The system we proposed in this paper generates OLAP cube using data in the database. 'Dynamic FOAF Management Algorithm' processes generated OLAP cube. Dynamic FOAF Management Algorithm consists of two functions: one is find_id_interest() and the other is find_relation (). Find_id_interest() is used to extract user interests during the input period, and find-relation() extracts users matching user interests. Finally, the proposed system reconstructs FOAF by reflecting extracted relationships and interests of users. For the justification of the suggested idea, we showed the implemented result together with its analysis. We used C# language and MS-SQL database, and input FOAF and RSS as data collected from livejournal.com. The implemented result shows that foaf : interest of users has reached an average of 19 percent increase for four weeks. In proportion to the increased foaf : interest change, the number of foaf : knows of users has grown an average of 9 percent for four weeks. As we use FOAF and RSS as basic data which have a wide support in web 2.0 and social network service, we have a definite advantage in utilizing user data distributed in the diverse web sites and services regardless of language and types of computer. By using suggested method in this paper, we can provide better services coping with the rapid change of user interests with the automatic application of FOAF.

Adaptive Streaming Media Service Based on Frame Priority Considering Battery Characteristics of Mobile Devices (이동단말기의 배터리 특성을 고려한 프레임 우선순위 기반 적응적 스트리밍 미디어 서비스)

  • Lee, Joa-Hyoung;Lim, Dong-Sun;Lim, Hwa-Jung;Jung, In-Bum
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.493-504
    • /
    • 2007
  • With the advance and proliferation of computer and wireless network technology, it is common to access to network through the wireless network using mobile device. The ratio of using the streaming media out of many applications through the network is increasing not only in the wired network but also in the wireless network. The streaming media is much bigger than other contents and requires more network bandwidth to communicate and more computing resources to process. However the mobile devices have relatively poor computing resource and low network bandwidth. If the streaming media service is provided for mobile devices without any consideration about the network bandwidth and computing power, it is difficult for the client to get the service of high quality. Since especially mobile devices are supported with very limited energy capacity from the battery, the streaming media service should be adjusted to the varying energy state of mobile devices to ensure the complete playback of streaming media. In this paper, we propose a new method to guarantee the complete playback time of the streaming media for the mobile clients by dynamically controlling transmitted frame rate to the client according to the estimated available time of mobile device using battery model reflecting the characteristic of the battery. Since the proposed method controls the number of frames transmitting to the client according to the energy state of the mobile device, the complete playback time is guaranteed to mobile clients.

Energy Efficient Distributed Intrusion Detection Architecture using mHEED on Sensor Networks (센서 네트워크에서 mHEED를 이용한 에너지 효율적인 분산 침입탐지 구조)

  • Kim, Mi-Hui;Kim, Ji-Sun;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.151-164
    • /
    • 2009
  • The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

Dynamic Discovery of Geographically Cohesive Services in Internet of Things Environments (사물인터넷 환경에서 지리적 응집도를 고려한 동적 서비스 검색방법)

  • Baek, KyeongDeok;Kim, MinHyeop;Ko, InYoung
    • Journal of KIISE
    • /
    • v.43 no.8
    • /
    • pp.893-901
    • /
    • 2016
  • In Internet of Things (IoT) environments, users are required to search for IoT devices necessary to access services for accomplishing their tasks. As IoT technologies advance, a user task will utilize various types of IoT-based services that are deployed in an IoT environment. Therefore, to accomplish a user task effectively, the services that utilize IoT devices need to be found in a certain geographical region. In addition, the service discovery needs to be accomplished in a stable manner while considering dynamically changing IoT environments. To deal with these issues, we propose two service discovery methods that consider geographic cohesiveness of services in IoT environments. We compare the effectiveness of the proposed methods against a traditional service discovery algorithm that does not consider geographic cohesiveness.

Integrated Circuit Implementation and Characteristic Analysis of a CMOS Chaotic Neuron for Chaotic Neural Networks (카오스 신경망을 위한 CMOS 혼돈 뉴런의 집적회로 구현 및 특성 해석)

  • Song, Han-Jeong;Gwak, Gye-Dal
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.5
    • /
    • pp.45-53
    • /
    • 2000
  • This paper presents an analysis of the dynamical behavor in the chaotic neuron fabricated using 0.8${\mu}{\textrm}{m}$ single poly CMOS technology. An approximated empirical equation models for the sigmoid output function and chaos generative block of the chaotic neuron are extracted from the measurement data. Then the dynamical responses of the chaotic neuron such as biurcation diagram, frequency responses, Lyapunov exponent, and average firing rate are calculated with numerical analysis. In addition, we construct the chaotic neural networks which are composed of two chaotic neurons with four synapses and obtain bifurcation diagram according to synaptic weight variation. And results of experiments in the single chaotic neuron and chaotic neural networks by two neurons with the $\pm$2.5V power supply and sampling clock frequency of 10KHz are shown and compared with the simulated results.

  • PDF

A Prediction of Shear Behavior of the Weathered Mudstone Soil Using Dynamic Neural Network (동적신경망을 이용한 이암풍화토의 전단거동예측)

  • 김영수;정성관;김기영;김병탁;이상웅;정대웅
    • Journal of the Korean Geotechnical Society
    • /
    • v.18 no.5
    • /
    • pp.123-132
    • /
    • 2002
  • The purpose of this study is to predict the shear behavior of the weathered mudstone soil using dynamic neural network which mimics the biological system of human brain. SNN and RNN, which are kinds of the dynamic neural network realizing continuously a pattern recognition as time goes by, are used to predict a nonlinear behavior of soil. After analysis, parameters which have an effect on learning and predicting of neural network, the teaming rate, momentum constant and the optimum neural network model are decided to be 0.5, 0.7, 8$\times$18$\times$2 in SU model and 0.3, 0.9, 8$\times$24$\times$2 in R model. The results of appling both networks showed that both networks predicted the shear behavior of soil in normally consolidated state well, but RNN model which is effective fir input data of irregular patterns predicted more efficiently than SNN model in case of the prediction in overconsolidated state.

Load-based Dynamic Backoff Algorithm in Contention-based Wireless Shared Medium (단일 경쟁 매체에서의 새로운 로드 기반 동적 매체 접속 제어 백오프 알고리즘)

  • Seo Chang-Keun;Wang Weidong;Yoo Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6B
    • /
    • pp.406-415
    • /
    • 2005
  • The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

Group Key Assignment Scheme based on Secret Sharing Scheme for Dynamic Swarm Unmanned Systems (동적 군집 무인체계를 위한 비밀분산법 기반의 그룹키 할당 기법)

  • Jongkwan Lee
    • Convergence Security Journal
    • /
    • v.23 no.4
    • /
    • pp.93-100
    • /
    • 2023
  • This paper presents a novel approach for assigning group keys within a dynamic swarm unmanned system environment. In this environment, multiple groups of unmanned systems have the flexibility to merge into a single group or a single unmanned system group can be subdivided into multiple groups. The proposed protocol encompasses two key steps: group key generation and sharing. The responsibility of generating the group key rests solely with the leader node of the group. The group's leader node employs a secret sharing scheme to fragment the group key into multiple fragments, which are subsequently transmitted. Nodes that receive these fragments reconstruct a fresh group key by combining their self-generated secret fragment with the fragment obtained from the leader node. Subsequently, they validate the integrity of the derived group key by employing the hash function. The efficacy of the proposed technique is ascertained through an exhaustive assessment of its security and communication efficiency. This analysis affirms its potential for robust application in forthcoming swarm unmanned system operations scenarios characterized by frequent network group modifications.