• Title/Summary/Keyword: Network topology

Search Result 1,186, Processing Time 0.028 seconds

A Tree-Based Routing Algorithm Considering An Optimization for Efficient Link-Cost Estimation in Military WSN Environments (무선 센서 네트워크에서 링크 비용 최적화를 고려한 감시·정찰 환경의 트리 기반 라우팅 알고리즘에 대한 연구)

  • Kong, Joon-Ik;Lee, Jae-Ho;Kang, Ji-Heon;Eom, Doo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.637-646
    • /
    • 2012
  • Recently, Wireless Sensor Networks (WSNs) are used in many applications. When sensor nodes are deployed on special areas, where humans have any difficulties to get in, the nodes form network topology themselves. By using the sensor nodes, users are able to obtain environmental information. Due to the lack of the battery capability, sensor nodes should be efficiently managed with energy consumption in WSNs. In specific applications (e.g. in intrusion detections), intruders tend to occur unexpectedly. For the energy efficiency in the applications, an appropriate algorithm is strongly required. In this paper, we propose tree-based routing algorithm for the specific applications, which based on the intrusion detection. In addition, In order to decrease traffic density, the proposed algorithm provides enhanced method considering link cost and load balance, and it establishes efficient links amongst the sensor nodes. Simultaneously, by using the proposed scheme, parent and child nodes are (re-)defined. Furthermore, efficient routing table management facilitates to improve energy efficiency especially in the limited power source. In order to apply a realistic military environment, in this paper, we design three scenarios according to an intruder's moving direction; (1) the intruder is passing along a path where sensor nodes have been already deployed. (2) the intruders are crossing the path. (3) the intruders, who are moving as (1)'s scenario, are certainly deviating from the middle of the path. In conclusion, through the simulation results, we obtain the performance results in terms of latency and energy consumption, and analyze them. Finally, we validate our algorithm is highly able to adapt on such the application environments.

A Study on Interconnectioned LAN of Token Ring Network (토큰링 네트워크가 상호 연결된 근거리 통신망에 관한 연구)

  • 이상훈;김경식;강준길
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.11
    • /
    • pp.1206-1218
    • /
    • 1992
  • Token ring systems which control to switch the data stream of networks by passing the token have been widely used to medium access controls in many ring or bus topology LANs. The system could be modeled for analysis as single-server-multi-queue system of the cyclic service method. These concepts could be expanded to multi-token ring systems interconnected with single ring consisting of bridges implemented simply to be stored and transmitted. In the proposal for the performance analysis of the interconnected token ring system, in has been assumed M/G/1 queueing model that frame arrivals are the Poisson process at each station queue and frame sizes are independently and identically distributed. And the average time delays were analyzed mathematically for arbitrary frame transferred from source station to destination area. The time delay of the frame transmission could be explained as the sum of the average time which the token passed from arbitrary position to source station, such as the waiting time in the source station transferring the previous arrival frames, and the propagation time from source station to interdestinated point. These delays were given as the sum of the duration from inner and outer bridge queues, the time delays from inner and outer bridge queues, and the time from outer bridge queue to destination station. These results were investigated by varing parameters effected to total time delays. In the results, those factors to be effected to dominant the total time delays were increased were in the cases of the high arrival rates and the high ration of destination of the other outerring. The system were shown the time delays increased exponentially in spite of the priority service policy. In order to decreasing the number of outerrings and increasing the number of nodes in backbone relatively, so the systems could be decreased the total delay in the interconnected token ring system.

  • PDF

Sink Location Service via Circle Path for Geographic Routing in Wireless Sensor Networks (무선 센서 네트워크에서 위치 기반 라우팅을 위한 원형 경로 기반 싱크 위치 서비스)

  • Park, Ho-Sung;Lee, Jeong-Cheol;Oh, Seung-Min;Yim, Young-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.585-593
    • /
    • 2010
  • Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure local location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of sinks. Most existing geographic routing protocols merely assume that source nodes are aware of the locations of sinks. How can source nodes get the locations of sinks was not addressed in detail. In this paper, we propose a sink location service via circle path for geographic routing in wireless sensor networks. In this scheme, a sink sends a Sink Location Announcement (SLA) message along a circle path, and a source node sends a Sink Location Query (SLQ) message along a straight path that certainly passes through the circle path. By this way we can guarantee the SLQ path and SLA path have at least one crossing point. The node located on the crossing point of the two paths informs the source node the sink location. This procedure can correctly work in any irregular profile sensor networks such as network that has holes or irregular shape by some rules. Simulation results show that our protocol is superior to other protocols in terms of energy consumption and control overhead.

A Study on Development of Independent Low Power IoT Sensor Module for Zero Energy Buildings (제로 에너지 건축물을 위한 자립형 저전력 IoT 센서 모듈 개발에 대한 연구)

  • Kang, Ja-Yoon;Cho, Young-Chan;Kim, Hee-Jun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.3
    • /
    • pp.273-281
    • /
    • 2019
  • The energy consumed by buildings among the total national energy consumption is more than 10% of the total. For this reason, Korea has adopted the zero energy building policy since 2025, and research on the energy saving technology of buildings has been demanded. Analysis of buildings' energy consumption patterns shows that lighting, heating and cooling energy account for more than 60% of total energy consumption, which is directly related to solar power acquisition and window opening and closing operation. In this paper, we have developed a low - power IoT sensor module for window system to transfer acquired information to building energy management system. This module transmits the external environment and window opening / closing status information to the building energy management system in real time, and constructs the network to actively take energy saving measures. The power used in the module is designed as an independent power source using solar power among the harvest energy. The topology of the power supply is a Buck converter, which is charged at 4V to the lithium ion battery through MPPT control, and the efficiency is about 85.87%. Communication is configured to be able to transmit in real time by applying WiFi. In order to reduce the power consumption of the module, we analyzed the hardware and software aspects and implemented a low power IoT sensor module.

Controlling Factors on the Development and Connectivity of Fracture Network: An Example from the Baekildo Fault in the Goheung Area (단열계의 발달 및 연결성 제어요소: 고흥지역 백일도단층의 예)

  • Park, Chae-Eun;Park, Seung-Ik
    • Economic and Environmental Geology
    • /
    • v.54 no.6
    • /
    • pp.615-627
    • /
    • 2021
  • The Baekildo fault, a dextral strike-slip fault developed in Baekil Island, Goheung-gun, controls the distribution of tuffaceous sandstone and lapilli tuff and shows a complex fracture system around it. In this study, we examined the spatial variation in the geometry and connectivity of the fracture system by using circular sampling and topological analysis based on a detailed fracture trace map. As a result, both intensity and connectivity of the fracture system are higher in tuffaceous sandstone than in lapilli tuff. Furthermore, the degree of the orientation dispersion, intensity, and average length of fracture sets vary depending on the along-strike variation in structural position in the tuffaceous sandstone. Notably, curved fractures abutting the fault at a high angle occur at a fault bend. Based on the detailed observation and analyses of the fracture system, we conclude as follows: (1) the high intensity of the fracture system in the tuffaceous sandstone is caused by the higher content of brittle minerals such as quartz and feldspar. (2) the connectivity of the fracture system gets higher with the increase in the diversity and average length of the fracture sets. Finally, (3) the fault bend with geometric irregularity is interpreted to concentrate and disturb the local stress leading to the curved fractures abutting the fault at a high angle. This contribution will provide important insight into various geologic and structural factors that control the development of fracture systems around faults.

A research on cyber target importance ranking using PageRank algorithm (PageRank 알고리즘을 활용한 사이버표적 중요성 순위 선정 방안 연구)

  • Kim, Kook-jin;Oh, Seung-hwan;Lee, Dong-hwan;Oh, Haeng-rok;Lee, Jung-sik;Shin, Dong-kyoo
    • Journal of Internet Computing and Services
    • /
    • v.22 no.6
    • /
    • pp.115-127
    • /
    • 2021
  • With the development of science and technology around the world, the realm of cyberspace, following land, sea, air, and space, is also recognized as a battlefield area. Accordingly, it is necessary to design and establish various elements such as definitions, systems, procedures, and plans for not only physical operations in land, sea, air, and space but also cyber operations in cyberspace. In this research, the importance of cyber targets that can be considered when prioritizing the list of cyber targets selected through intermediate target development in the target development and prioritization stage of targeting processing of cyber operations was selected as a factor to be considered. We propose a method to calculate the score for the cyber target and use it as a part of the cyber target prioritization score. Accordingly, in the cyber target prioritization process, the cyber target importance category is set, and the cyber target importance concept and reference item are derived. We propose a TIR (Target Importance Rank) algorithm that synthesizes parameters such as Event Prioritization Framework based on PageRank algorithm for score calculation and synthesis for each derived standard item. And, by constructing the Stuxnet case-based network topology and scenario data, a cyber target importance score is derived with the proposed algorithm, and the cyber target is prioritized to verify the proposed algorithm.