• 제목/요약/키워드: Grid routing

Search Result 106, Processing Time 0.025 seconds

The Design of PCB Automatic Routing System using the Shortest Path (최단경로를 이용한 PCB 자동 배선 시스템 설계)

  • 우경환;이용희;임태영;이천희
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.257-260
    • /
    • 2001
  • Routing region modeling methods for PCB auto-routing system in Shape based type(non-grid method) used region process type and the shape located in memory as a individual element, and this element consumed small memory due to unique data size. In this paper we design PCB(Printed Circuit Board) auto-routing system using the auction algorithm method that 1) Could be reached by solving the shortest path from single original point to various destination, and 2) Shaped based type without any memory dissipation with the best speed. Also, the auto-routing system developed by Visual C++ in Window environment, and can be used in IBM Pentium computer or in various individual PC system.

  • PDF

GDCS : Energy Efficient Grid based Data Centric Storage for Sensor Networks (GDCS : 센서네트워크를 위한 에너지 효율적인 그리드 기반 데이터 중심 저장 시스템)

  • Shin, Jae-Ryong;Yoo, Jae-Soo;Song, Seok-Il
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.98-105
    • /
    • 2009
  • In this paper, new data centric storage that is dynamically adapted to the change of work load is proposed. The proposed data centric storage distributes the load of hot spot area by using multilevel grid technique. Also, the proposed method is able to use existing routing protocol such as GPSR (Greedy Perimeter Stateless Routing) with small changes. Through simulation the proposed method enhances the lifetime of sensor networks over one of the state-of-the-art data centric storages. We implement the proposed method based on a operating system for sensor networks, and evaluate the performance through running based on a simulation tool.

Buffered Routing Tree Construction under Buffer Location and Wiring Constraints (버퍼 삽입 위치 및 배선 제한을 고려한 Buffered 배선 트리 구성)

  • 정동식;김덕환;임종석
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.11
    • /
    • pp.73-82
    • /
    • 2003
  • In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

Performance Analysis of Saturation Routing Algorithm in Non-Hierarchical Networks (비계층 통신망에서의 포화 경로 선정 알고리즘의 성능분석)

  • Park Young-Chul
    • Journal of Digital Contents Society
    • /
    • v.3 no.1
    • /
    • pp.89-99
    • /
    • 2002
  • Saturation routing algorithm is known to be an effective routing mechanism for tactical application and packet radio networks, since it minimizes the call set-up time and does not have to maintain routing tables. But, it is known that it has significant drawbacks with respect to the network efficiency, the overhead on the control messages [1]. We consider a tactical circuit-switched grid network with a maximum of tour links and two priority classes of voice traffic. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched network without increasing the call set-up time and processor loading of the algorithm.

  • PDF

Energy Aware Landmark Election and Routing Protocol for Grid-based Wireless Sensor Network (그리드 기반 무선센서네트워크에서 에너지 인지형 Landmark 선정 및 라우팅 프로토콜)

  • Sanwar Hosen, A.S.M.;Cho, Gi-Hwan
    • Annual Conference of KIPS
    • /
    • 2011.11a
    • /
    • pp.177-180
    • /
    • 2011
  • In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

Identity-Based Key Management Scheme for Smart Grid over Lattice

  • Wangke, Yu;Shuhua, Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.1
    • /
    • pp.74-96
    • /
    • 2023
  • At present, the smart grid has become one of the indispensable infrastructures in people's lives. As a commonly used communication method, wireless communication is gradually, being widely used in smart grid systems due to its convenient deployment and wide range of serious challenges to security. For the insecurity of the schemes based on large integer factorization and discrete logarithm problem in the quantum environment, an identity-based key management scheme for smart grid over lattice is proposed. To assure the communication security, through constructing intra-cluster and inter-cluster multi-hop routing secure mechanism. The time parameter and identity information are introduced in the relying phase. Through using the symmetric cryptography algorithm to encrypt improve communication efficiency. Through output the authentication information with probability, the protocol makes the private key of the certification body no relation with the distribution of authentication information. Theoretic studies and figures show that the efficiency of keys can be authenticated, so the number of attacks, including masquerade, reply and message manipulation attacks can be resisted. The new scheme can not only increase the security, but also decrease the communication energy consumption.

Energy-Efficient Grid-based Hole-Detouring Scheme in Wireless Sensor Networks (무선센서네트워크에서 에너지 효율적인 그리드 기반의 홀 우회 방식)

  • Kim, Sung-Hwi;Park, Ho-Sung;Lee, Jeong-Cheol;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.227-235
    • /
    • 2012
  • Holes that generated by the unpredictable and harsh nature application environment or uneven energy consumption are an inevitable phenomenon in wireless sensor networks. Most of the existing schemes for this hole problem tend to use a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the boundary of the hole, thus it may enlarge the region of holes. At the same time, traffic would concentrate on the nodes on the boundary of the hole and tend to be depleted quickly. To solve this problem, we introduce energy-efficient grid-based geographic routing and hole-detouring scheme by taking advantage of grid anchor point in wireless sensor network with holes. The location of hole detour anchor node is dynamically shifted in grid cell. just generating dynamic hole detour paths to reduce total energy consumption. Simulation results are provided to validate the claims.

Game Theory-based Bi-Level Pricing Scheme for Smart Grid Scheduling Control Algorithm

  • Park, Youngjae;Kim, Sungwook
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.484-492
    • /
    • 2016
  • Smart grid (SG) technology is now elevating the conventional power grid system to one that functions more cooperatively, responsively, and economically. When applied in an SG the demand side management (DSM) technique can improve its reliability by dynamically changing electricity consumption or rescheduling it. In this paper, we propose a new SG scheduling scheme that uses the DSM technique. To achieve effective SG management, we adopt a mixed pricing strategy based on the Rubinstein-Stahl bargaining game and a repeated game model. The proposed game-based pricing strategy provides energy routing for effective energy sharing and allows consumers to make informed decisions regarding their power consumption. Our approach can encourage consumers to schedule their power consumption profiles independently while minimizing their payment and the peak-to-average ratio (PAR). Through a simulation study, it is demonstrated that the proposed scheme can obtain a better performance than other existing schemes in terms of power consumption, price, average payment, etc.

Comparative Results of Weather Routing Simulation (항로최적화기술 시뮬레이션 비교 결과)

  • Yoo, Yunja;Choi, Hyeong-Rae;Lee, Jeong-Youl
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.52 no.2
    • /
    • pp.110-118
    • /
    • 2015
  • Weather routing method is one of the best practices of SEEMP (Ship Energy Efficiency Management Plan) for fuel-efficient operation of ship. KR is carrying out a basic research for development of the weather routing algorithm and making a monitoring system by FOC (Fuel Oil Consumption) analysis compared to the reference, which is the great circle route. The added resistances applied global sea/weather data can be calculated using ship data, and the results can be corrected to ship motions. The global sea/weather data such as significant wave height, ocean current and wind data can be used to calculate the added resistances. The reference route in a usual navigation is the great circle route, which is the shortest distance route. The global sea/weather data can be divided into grids, and the nearest grid data from a ship's position can be used to apply a ocean going vessel's sea conditions. Powell method is used as an optimized routing technique to minimize FOC considered sea/weather conditions, and FOC result can be compared with the great circle route result.

Research on optimal FCL (Frequently Called List) table sizes in a circuit-switched network including wireless subscribers (무선 가입자를 포함한 회선교환망에서의 최적의 FCL (Frequently Called List) 테이블 크기에 관한 연구)

  • 김재현;이종규
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.10
    • /
    • pp.1-9
    • /
    • 1994
  • In this paper, we have studied optimal FCL(Frequently Called List) table sizes in a grid topology circuit-switched network including wireless subscribers. The FCL table gives the position information of a destination subscriber for a call. When the call is generated in a node, this call is routed by the referenced position information of the destination subscriber in FCL table. In this paper, we have proposed an efficient routing algorithm, mixed FSR(Flood Search Routing) and DAR(Dynamic Adaptive Routing), considering moving wireless subscribers. Also, we have simulated hit ratio and incorrect ratio as performance parameters, consequently proposed the object function composed of table search time, hit ratio, incorrect ratio, FSR time and DAR time, and derived the optimal FCL table size by using it.

  • PDF