• 한국인터넷방송통신학회논문지
• /
• 제10권6호
• /
• pp.131-136
• /
• 2010

무선 센서네트워크에서 센서 노드들에 대한 에너지 소비를 최소화하기 위한 연구가 최근에 활발히 진행되고 있다. 특히 각각의 센선 노드들은 제한적인 에너지로 인해서 관련이 없는 패킷들의 엿듣기 현상에 의한 에너지 소비를 줄이고자 한다. 본 논문에서는 이웃 센서 노드들이 서로 다른 wakeup time을 통해서, 엿듣기로 인한 에너지 소비를 줄이는 방식을 제안 한다. 주로 wakeup scheme에 대한 연구는 전송 지연을 줄이기 위한 연구에 초점을 두고 있다. 우리는 이러한 wakeup scheme을 통해서 엿듣기에 의한 에너지 소비를 줄이고자 한다. 본 논문의 실험 결과에서는 제안하는 wakeup schem이 센서 네트워크의 수명을 연장시켜주고 있음을 보여주고 있다.

• ETRI Journal
• /
• 제24권4호
• /
• pp.311-322
• /
• 2002

Presently, optical burst switching (OBS) technology is under study as a promising solution for the backbone of the optical Internet in the near future because OBS eliminates the optical buffer problem at the switching node with the help of no optical/electro/optical conversion and guarantees class of service without any buffering. To implement the OBS network, there are a lot of challenging issues to be solved. The edge router, burst offset time management, and burst assembly mechanism are critical issues. In addition, the core router needs data burst and control header packet scheduling, a protection and restoration mechanism, and a contention resolution scheme. In this paper, we focus on the burst assembly mechanism. We present a novel data burst generation algorithm that uses hysteresis characteristics in the queueing model for the ingress edge node in optical burst switching networks. Simulation with Poisson and self-similar traffic models shows that this algorithm adaptively changes the data burst size according to the offered load and offers high average data burst utilization with a lower timer operation. It also reduces the possibility of a continuous blocking problem in the bandwidth reservation request, limits the maximum queueing delay, and minimizes the required burst size by lifting up data burst utilization for bursty input IP traffic.

• 한국공간구조학회논문집
• /
• 제19권4호
• /
• pp.69-76
• /
• 2019

A stadium roof that uses the pin-jointed spatial truss system has to be designed by taking into account the unstable phenomenon due to the geometrical non-linearity of the long span. This phenomenon is mainly studied in the single-free-node model (SFN) or double-free-node model (DFN). Unlike the simple SFN model, the more complex DFN model has a higher order of characteristic equations, making analysis of the system's stability complicated. However, various symmetric conditions can allow limited analysis of these problems. Thus, this research looks at the stability of the DFN model which is assumed to be symmetric in shape, and its load and equilibrium state. Its governing system is expressed by nonlinear differential equations to show the double Duffing effect. To investigate the dynamic behavior and characteristics, we normalize the system of the model in terms of space and time. The equilibrium points of the system unloaded or symmetrically loaded are calculated exactly. Furthermore, the stability of these points via the roots of the characteristic equation of a Jacobian matrix are classified.

• Industrial Engineering and Management Systems
• /
• 제8권4호
• /
• pp.239-246
• /
• 2009

This paper deals with the makespan minimization problem of job shops. The problem is known as one of hard problems to optimize, and therefore, many heuristic methods have been proposed by many researchers. The aim of this study is also to propose a heuristic scheduling method for the problem. However, the difference between the proposed method and many other heuristics is that the proposed method is based on depth-first branch and bound, and thus it is possible to find an optimal solution at least in principle. To accelerate the search, when a node is judged hopeless in the search tree, the proposed flexible branch and bound method can indicate a higher backtracking node. The unexplored nodes are stored and may be explored later to realize the strict optimization. Two methods are proposed to generate the backtracking point based on the critical path of the current best feasible schedule, and the minimum lower bound for the makespan in the unexplored sub-problems. Schedules are generated based on Giffler and Thompson's active schedule generation algorithm. Acceleration of the search by the flexible branch and bound is confirmed by numerical experiment.

• 한국전자거래학회지
• /
• 제2권1호
• /
• pp.21-37
• /
• 1997

As the complexity in design and manufacturing activities of distributed virtual enterprises rapidly increases, the issue of process management becomes more critical to shorten the time-to-market, reduce the manufacturing cost and improve the product quality. This paper proposes a unified framework to manage design and manufacturing processes in a distributed environment. We present a methodology which utilizes process flow graphs to depict the hierarchical structure of workflows and process grammars to represent various design processes and design tools. To implement the proposed concept, we develop a process management system which mainly consists of a cockpit and manager programs, and we finally address a preliminary implementation procedure based on the Object Modeling Technique. Since the proposed framework can be a formal approach to the process management by providing formalism, parallelism, reusability, and flexibility, it can be effectively applied to further application domains of distributed virtual enterprises.

• Journal of information and communication convergence engineering
• /
• 제7권4호
• /
• pp.475-479
• /
• 2009

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method, the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.

• 전기전자학회논문지
• /
• 제13권3호
• /
• pp.39-46
• /
• 2009

무선 센서 네트워크는 무선 네트워크 기능이 있는 소형 장치로 구성된다. 실제 현장에서 센서 네트워크의 응용 영역을 증가시키기 위해서는 에너지 소모를 최소화 하는 것이 가장 큰 문제이다. 그러므로 센서 네트워크의 평가를 위해서 정확한 에너지 모델이 필요하다. 본 논문에서는 센서 네트워크의 전력 소모를 분석한다. 전력 소모 모델을 개발하기 위해서 TelosB를 기반으로 하는 상용 제품인 Kmote의 전력 특성을 측정한다. 제안한 모델로부터 PIR 센서를 이용하는 인체 감지 응용에서 건전지를 사용하는 센서 노드는 약 6.9개월의 수명을 예상할 수 있다. 이러한 결과를 바탕으로 독거노인 모니터링 시스템에 적용 가능함을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.5150-5169
• /
• 2015

Mobile Ad hoc NETworks (MANETs) are the best choice when mobility, scalability, and decentralized network infrastructure are needed. Because of critical mission applications of MANETs, network security is the vital requirement. Most routing protocols in MANETs assume that every node in the network is trustworthy. However, due to the open medium, the wide distribution, and the lack of nodes' physical protection, attackers can easily compromise MANETs by inserting misbehaving nodes into the network that make blackhole attacks. Previous research to detect the misbehaving nodes in MANETs used the overhearing methods, or additional ACKnowledgement (ACK) packets to confirm the reception of data packets. In this paper a special lightweight acknowledgement-based method is developed that, contrary to existing methods, it uses ACK packets of MAC layer instead of adding new ACK packets to the network layer for confirmations. In fact, this novel method, named PIGACK, uses ACK packets of MAC 802.11 to piggyback confirmations from a receiver to a sender in the same transmission duration that the sender sends a data packet to the receiver. Analytical and simulation results show that the proposed method considerably decreases the network overhead and increases the packet delivery ratio compared to the well-known method (2ACK).

• Journal of Computing Science and Engineering
• /
• 제4권2호
• /
• pp.128-152
• /
• 2010

With the advance of computer and communication technologies, wireless sensor networks (WSNs) are increasingly used in many aspects of our daily life. However, since the battery lifetime of WSN nodes is restricted, the WSN lifetime is also limited. Therefore, it is crucial to determine this limited lifetime in advance for preventing service interruptions in critical applications. This paper proposes a feasible static analysis approach to estimating the worstcase lifetime of a WSN. Assuming known routes with a given sensor network topology and SMAC as the underlying MAC protocol, we statically estimate the lifetime of each sensor node with a fixed initial energy budget. These estimations are then compared with the results obtained through simulation which run with the same energy budget on each node. Experimental results of our research on TinyOS applications indicate that our approach can safely and accurately estimate worst-case lifetime of the WSN. To the best of our knowledge, our work is the first one to estimate the worst-case lifetime of WSNs through a static analysis method.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.357-360
• /
• 2007

An asset tracking using wireless sensor network is concerned with geographical locations of sensor nodes. The limited size of sensor nodes makes them attractable for tracking service, at the same time their size causes power restrictions, limited computation power, and storage restrictions. Due to such constrained capabilities, the wireless sensor network basically assumes the failure of sensor nodes. This causes a set of concerns in designing asset tracking system on wireless sensor network and one of the most critical factors is location uncertainty of sensor nodes. In this paper, we classify the location uncertainty problem in asset tracking system into following cases. First, sensor node isn't read at all because of sensor node failure, leading to misunderstanding that asset is not present. Second, incorrect location is read due to interference of RSSI, providing unreliable location of asset. We implemented and installed our asset tracking system in a real environment and continuously monitored the status of asset and measured error rate of location of sensor nodes. We present experimental results that demonstrate the location uncertainty problem in asset tracking system using wireless sensor network.