• Title/Summary/Keyword: resource constrained

Search Result 278, Processing Time 0.024 seconds

Four Anchor Sensor Nodes Based Localization Algorithm over Three-Dimensional Space

  • Seo, Hwajeong;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.4
    • /
    • pp.349-358
    • /
    • 2012
  • Over a wireless sensor network (WSN), accurate localization of sensor nodes is an important factor in enhancing the association between location information and sensory data. There are many research works on the development of a localization algorithm over three-dimensional (3D) space. Recently, the complexity-reduced 3D trilateration localization approach (COLA), simplifying the 3D computational overhead to 2D trilateration, was proposed. The method provides proper accuracy of location, but it has a high computational cost. Considering practical applications over resource constrained devices, it is necessary to strike a balance between accuracy and computational cost. In this paper, we present a novel 3D localization method based on the received signal strength indicator (RSSI) values of four anchor nodes, which are deployed in the initial setup process. This method provides accurate location estimation results with a reduced computational cost and a smaller number of anchor nodes.

APPLICATION OF CONSTRAINT LOGIC PROGRAMMING TO JOB SEQUENCING

  • Ko, Jesuk;Ku, Jaejung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.617-620
    • /
    • 2000
  • In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

  • PDF

Positioning of the Base Station at Wireless Sensor Network (무선 센서 네트워크에서 기지국의 위치선정)

  • Cho, Do-Hyeoun;Lee, Jong-Young;Lee, Sang-Hun;Choi, Jin-Tak
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.1189-1190
    • /
    • 2008
  • Wireless sensor networks (WSN) have attracted much attention in recent years due to their potential use in many applications such as border protection and combat field surveillance. Given the criticality of such applications, maintaining a dependable operation of the network is a fundamental objective. However, the resource constrained nature of sensor nodes and the ad-hoc formation of the network, often coupled with an unattended deployment, pose non-conventional challenges and motivate the need for special techniques for dependable design and management of WSN. In this article, we highlight the potential of careful positioning of the base station (BS), which acts as a sink resources.

  • PDF

Architecture Support for Context-aware Adaptation of Rich Sensing Smartphone Applications

  • Meng, Zhaozong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.248-268
    • /
    • 2018
  • The performance of smartphone applications are usually constrained in user interactions due to resource limitation and it promises great opportunities to improve the performance by exploring the smartphone built-in and embedded sensing techniques. However, heterogeneity in techniques, semantic gap between sensor data and usable context, and complexity of contextual situations keep the techniques from seamless integration. Relevant studies mainly focus on feasibility demonstration of emerging sensing techniques, which rarely address both general architectures and comprehensive technical solutions. Based on a proposed functional model, this investigation provides a general architecture to deal with the dynamic context for context-aware automation and decision support. In order to take advantage of the built-in sensors to improve the performance of mobile applications, an ontology-based method is employed for context modelling, linguistic variables are used for heterogeneous context presentation, and semantic distance-based rule matching is employed to customise functions to the contextual situations. A case study on mobile application authentication is conducted with smartphone built-in hardware modules. The results demonstrate the feasibility of the proposed solutions and their effectiveness in improving operational efficiency.

Analysis of Blood Cell Images Using Smartphone-based Mobile SmartScope (스마트폰 기반 Mobile SmartScope를 이용한 혈구 영상 분석)

  • Park, Choonho;Cho, Myoung-Ock;Lee, Donghee;Kim, Jung Kyung
    • Journal of the Korean Society of Visualization
    • /
    • v.10 no.2
    • /
    • pp.25-31
    • /
    • 2012
  • High-performance smartphones, equipped with a digital camera and an application software, can render conventional bench-top laboratory instruments mobile at affordable costs. As the smartphone-based devices are portable and wireless, they have wide applications especially in providing point-of-care (POC) tests in resource-constrained areas. We developed a hand-held diagnostic system, Mobile SmartScope, which consists of a small optical unit integrated with a smartphone. The performance of the SmartScope was favorably compared with that of conventional light microscopy in detecting and quantifying red blood cells. We also evaluated the fluorescence detection limit of the SmartScope incorporated with a blue light-emitting diode and appropriate optical filters by using fluorescently labeled microbeads for intensity calibration.

A Java Virtual Machine for Sensor Networks (센서 네트워크를 위한 자바 가상 기계)

  • Kim, Seong-Woo;Lee, Jong-Min;Lee, Jung-Hwa;Shin, Jin-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.1
    • /
    • pp.13-20
    • /
    • 2008
  • Sensor network consists of a large number of sensor node distributed in the environment being sensed and controlled. The resource-constrained sensor nodes tend to have various and heterogeneous architecture. Thus, it is important to make its software environment platform-independent and reprogrammable. In this paper, we present BeeVM, a Java operating system designed for sensor networks. BeeVM offers a platform-independent Java programming environment with its efficiently executable file format and a set of class APIs for basic operating functions, sensing and wireless networking. BeeVM's high-level native interface and layered network subsystem allow complex program for sensor network to be short and readable. Our platform has been ported on two currently popular hardware platforms and we show its effectiveness through the evaluation of a simple application.

Void Less Geo-Routing for Wireless Sensor Networks

  • Joshi, Gyanendra Prasad;Lee, Chae-Woo
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.433-435
    • /
    • 2007
  • Geographic wireless sensor networks use position information for Greedy routing. Greedy routing works well in dense network where as in sparse network it may fail and require the use of recovery algorithms. Recovery algorithms help the packet to get out of the communication void. However, these algorithms are generally costlier for resource constrained position based wireless sensor type networks. In the present work, we propose a Void Avoidance Algorithm (VAA); a novel idea based on virtual distance upgrading that allows wireless sensor nodes to remove all stuck nodes by transforming the routing graph and forward packet using greedy routing only without recovery algorithm. In VAA, the stuck node upgrades distance unless it finds next hop node which is closer to the destination than itself. VAA guarantees the packet delivery if there is a topologically valid path exists. NS-2 is used to evaluate the performance and correctness of VAA and compared the performance with GPSR. Simulation results show that our proposed algorithm achieves higher delivery ratio, lower energy consumption and efficient path.

  • PDF

Lysosomal Storage Disorders in India: A Mini Review

  • Gupta, Neerja;Aggarwal, Bhawana;Kabra, Madhulika
    • Journal of mucopolysaccharidosis and rare diseases
    • /
    • v.4 no.1
    • /
    • pp.1-6
    • /
    • 2018
  • Lysosomal storage disorders are a group of rare inherited metabolic disorders with protean manifestations and variable severity ranging from attenuated forms to severe ones. It is necessary to diagnose and manage these disorders timely before irreversible damage occurs. Prior to the era of enzyme replacement therapy and newer therapeutics, only treatment option available was palliative care. Over the past two decades, extensive research in the lysosomal storage disorders has led to substantial expansion of our understanding about them. This mini review focusses on the spectrum, challenges faced in the diagnosis and therapy and remedial actions taken so far in lysosomal storage disorders in resource constrained country like India.

Study on the Measurement-Based Packet Loss Rates Assuring for End-to-End Delay-Constrained Traffic Flow (지연 제한 트래픽 흐름에 대한 측정 기반 패킷 손실률 보장에 관한 연구)

  • Kim, Taejoon
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.7
    • /
    • pp.1030-1037
    • /
    • 2017
  • Traffic flows of real-time multimedia services such as Internet phone and IPTV are bounded on the end-to-end delay. Packets violating their delay limits will be dropped at a router because of not useful anymore. Service providers promise the quality of their providing services in terms of SLA(Service Level Agreement), and they, especially, have to guarantee the packet loss rates listed in the SLA. This paper is about a method to guarantee the required packet loss rate of each traffic flow keeping the high network resource utilization as well. In details, it assures the required loss rate by adjusting adaptively the timestamps of packets of the flow according to the difference between the required and measured loss rates in the lossy Weighted Fair Queuing(WFQ) scheduler. The proposed method is expected to be highly applicable because of assuring the packet loss rates regardless of the fluctuations of offered traffic load in terms of quality of services and statistical characteristics.

A Speed Optimized Implementation Technique of HUMMINGBIRD2 Encryption over Sensor Network (센서 네트워크 상에서의 HUMMINGBIRD2 암호화 속도 최적화 구현기법)

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.414-422
    • /
    • 2012
  • In the paper we present optimized implementation method over sensor mote for HUMMINGBIRD2 algorithm, ultra-light symmetric cryptography. For efficient implementation we maximized the register usage and used optimized addressing method to reduce the encryption and decryption time. With the optimized encryption implementation, we can utilize the efficient secure network over resource constrained sensor mote.