• Title/Summary/Keyword: centralized network

Search Result 496, Processing Time 0.026 seconds

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

  • Gupta, Govind P.;Misra, Manoj;Garg, Kumkum
    • Journal of Information Processing Systems
    • /
    • v.11 no.1
    • /
    • pp.148-164
    • /
    • 2015
  • The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments

  • Kang, Sae-Hoon;Kim, Dae-Woong;Lee, Young-Hee;Hyun, Soon-J.;Lee, Dong-Man;Lee, Ben
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.545-558
    • /
    • 2007
  • This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

  • PDF

A P2P Based Tactical Information Sharing System for Mobile Nodes (P2P 기반의 모바일 노드간의 전술 정보 공유 시스템)

  • Lee, Hyun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.17 no.4
    • /
    • pp.501-509
    • /
    • 2014
  • In NCW(Network Centric Warfare) environment, mobile nodes communicate through wireless link. But wireless link provides limited networking performance due to signal interferences or mobility of nodes. So it is quite challenge to acquire enough networking resources and use the resources efficiently. In this paper, we have proposed a P2P based tactical information sharing system which provides satisfactory visual information playout for mobile nodes(i.e., military personnel, vehicle,..) in NCW environment. Our proposed system consists of two components. One is caching-enabled switch which stores tactical information segments at its internal storage and then transports them to mobile nodes when require. Another is centralized scheduling algorithm which exploits networking resources more efficiently. To validate performance of proposed system, we performed series of experiments in wireless network testbed. Results show improved performance in terms of segment-missing ratio, networking resources usage, sharing time, and number of simultaneous playout mobile nodes with acceptable playout continuity(i.e., over 95%).

Performance Analysis and Evaluation of SNMP and Mobile Agent for Efficient Network Management (효율적인 네트워크 관리를 위한 SNMP와 이동 에이전트의 성능 분석 및 평가)

  • 이정우;정진하;윤완오;최상방
    • Proceedings of the IEEK Conference
    • /
    • 2002.06a
    • /
    • pp.105-108
    • /
    • 2002
  • This paper analytical models of a centralized approach based on SNMP Protocol, distributed approach based on mobile agent, and mixed model which is tile existing mobile agent model in order to overcome large communication numbers of SNMP and accumulated data of mobile agent. And then, we compare and analyze these analytical models. Performance evaluation results show that performance of mobile agent and the mixed model is less sensitive to the network traffic and more profitable for complex network environment than that of SNMP.

  • PDF

The Effects of team centralization on shared mental model, satisfaction, and achievement in a web-based collaborative learning (웹기반 협력학습에서 상호작용의 중심화 정도가 팀원의 공유정신모형, 만족도, 성취도에 미치는 영향)

  • LIM, Kyu Yon;KIM, Ye Jin;KIM, Hee Joon
    • The Journal of Korean Association of Computer Education
    • /
    • v.18 no.4
    • /
    • pp.41-53
    • /
    • 2015
  • The purpose of this study is to investigate the effects of centralization on shared mental model, satisfaction and achievement in a web-based collaborative learning. Sixty-eight undergraduate students were randomly assigned to 7 groups and they participated in a 4-week web-based collaborative learning. Three highly centralized teams and three less centralized teams were selected, and analyzed for investigating whether there are meaningful differences in shared mental model, satisfaction and achievement according to the degree of centralization. The results showed that there was no significant difference in shared mental model between the highly and less centralized teams. However, the highly centralized teams showed higher level of satisfaction and achievement than the less centralized teams.

Centralized Control Algorithm for Power System Performance using FACTS Devices in the Korean Power System

  • Kang, Sang-Gyun;Seo, Sang-Soo;Lee, Byong-Jun;Chang, Byung-Hoon;Myung, Ro-Hae
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.3
    • /
    • pp.353-362
    • /
    • 2010
  • This paper presents a centralized control algorithm for power system performance in the Korean power system using Flexible AC Transmission Systems (FACTS) devices. The algorithm is applied to the Korean power system throughout the metropolitan area in order to alleviate inherent stability problems, especially concerns with voltage stability. Generally, control strategies are divided into local and centralized control. This paper is concerned with a centralized control strategy in terms of the global system. In this research, input data of the proposed algorithm and network data are obtained from the SCADA/EMS system. Using the full system model, the centralized controller monitors the system condition and decides the operating point according to the control objectives that are, in turn, dependent on system conditions. To overcome voltage collapse problems, load-shedding is currently applied in the Korean power system. In this study, the application of the coordination between FACTS and switch capacitor (SC) can restore the solvability without load shedding or guarantee the FV margin when the margin is insufficient. Optimal Power Flow (OPF) algorithm, for which the objective function is loss minimization, is used in a stable case. The results illustrate examples of the proposed algorithm using SCADA/EMS data of the Korean power system in 2007.

Performance Analysis of Hierarchical Routing Protocols for Sensor Network (센서 네트워크를 위한 계층적 라우팅 프로토콜의 성능 분석)

  • Seo, Byung-Suk;Yoon, Sang-Hyun;Kim, Jong-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.4
    • /
    • pp.47-56
    • /
    • 2012
  • In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

An Effective Authentication in Mobile Ad Hoc Networks (Mobile Ad Hoc Networks에서 효과적인 인증서비스)

  • Kim Yoon-Ho
    • The Journal of Society for e-Business Studies
    • /
    • v.10 no.1
    • /
    • pp.121-134
    • /
    • 2005
  • The MANET has many problems in security despite of its many advantages such as supporting the mobility of nodes, independence of the fixed infrastructure, and quick network establishment. In particular, in establishing security, the traditional certification service has many difficult problems in applying to the MANET because of its safety, expandability, and availability. In this paper, a secure and effective distributed certification service method was proposed using the Secret Sharing scheme and the Threshold Digital Signature scheme in providing certification services in the MANET. In the proposed distributed certification service, certain nodes of relatively high safety among the mobile nodes consisting of the MANET, were set as privileged nodes, from which the process of issuing a certification started. The proposed scheme solved problem that the whole network security would be damaged by the intrusion to one node in the Centralized Architecture and the Hierarchical Architecture. And it decreased the risk of the exposure of the personal keys also in the Fully Distributed Architecture as the number of the nodes containing the partial confidential information of personal keys decreased. By the network simulation, the features and availability of the proposed scheme was evaluated and the relation between the system parameters was analyzed.

  • PDF

Efficient Flooding Mechanisms with Considering Data Transmission Characteristics of the Wireless Sensor Network (무선 센서 네트워크의 데이터 전송 특성을 고려한 효율적인 플러딩 기법)

  • Ahn, Sang-Hyun;Lim, Yu-Jin;Kim, Mahn-Hee
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.209-216
    • /
    • 2009
  • In the wireless sensor network, flooding is required for the dissemination of queries and event announcements. The simple flooding causes the implosion and the overlap problems, so the simple flooding may result in the reduced network lifetime. Therefore, in this paper, we propose the flooding overlay structure (FOS) so that the overhead caused by flooding can be reduced. We propose two variants of FOS mechanisms, the centralized FOS (CFOS) and the distributed FOS (DFOS). In CFOS, the sink collects the network topology information and selects forwarding nodes based on that information. On the other hand, DFOS allows each sensor node to decide whether to act as a forwarding node or not based on its local information. For the performance evaluation of our proposed mechanisms, we carry out NS-2 based simulations and compare ours with the simple flooding and the gossiping. The simulation results indicate that the proposed FOS mechanisms outperform the simple flooding in terms of the network lifetime and the gossiping in terms of the data delivery ratio.

A Multimedia Conference System with a Hybrid Infrastructure (혼합형 하부 구조를 가진 멀티미디어 회의 시스템)

  • Seong, Mi-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.377-383
    • /
    • 1997
  • This paper presents the design and the implemenration of a Mutiuser Multimedia Confernce System for synchronous groupwork.The infrastructure of this system is a hybrid srchiercture of centralized and replicated archietctures,that is to maintain sharde information cinsistently and to reduce the overhead of network traffic to the central part.The communication control of data for groupwerk managrment is centralized to the virtual node and the communication control of real data such as audio,video,text is replicated.In order ot provide a realtime audio and video processing,this system uses synamic queues and multithreads.

  • PDF