• Title/Summary/Keyword: Active node

Search Result 235, Processing Time 0.028 seconds

Novel Architecture of Self-organized Mobile Wireless Sensor Networks

  • Rizvi, Syed;Karpinski, Kelsey;Razaque, Abdul
    • Journal of Computing Science and Engineering
    • /
    • v.9 no.4
    • /
    • pp.163-176
    • /
    • 2015
  • Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

An Efficient Neighbor Discovery Method for Cooperative Video Surveillance Services in Internet of Vehicles (차량 인터넷에서 협업 비디오 감시 서비스를 위한 효율적인 이웃 발견 방법)

  • Park, Taekeun;Lee, Suk-Kyoon
    • Journal of Information Technology Services
    • /
    • v.15 no.4
    • /
    • pp.97-109
    • /
    • 2016
  • The rapid deployment of millions of mobile sensors and smart devices has resulted in high demand for opportunistic encounter-based networking. For the cooperative video surveillance of dashboard cameras in nearby vehicles, a fast and energy-efficient asynchronous neighbor discovery protocol is indispensable because a dashboard camera is an energy-hungry device after the vehicle's engine has turned off. In the existing asynchronous neighbor discovery protocols, all nodes always try to discover all neighbors. However, a dashboard camera needs to discover nearby dashboard cameras when an event is detected. In this paper, we propose a fast and energy-efficient asynchronous neighbor discovery protocol, which enables nodes : 1) to have different roles in neighbor discovery, 2) to discover neighbors within a search range, and 3) to report promptly the exact discovery result. The proposed protocol has two modes: periodic wake-up mode and active discovery mode. A node begins with the periodic wake-up mode to be discovered by other nodes, switches to the active discovery mode on receiving a neighbor discovery request, and returns to the periodic wake-up mode when the active discovery mode finishes. In the periodic wake-up mode, a node wakes up at multiples of number ${\alpha}$, where ${\alpha}$ is determined by the node's remaining battery power. In the active discovery mode, a node wakes up for consecutive ${\gamma}$ slots. Then, the node operating in the active discovery mode can discover all neighbors waking up at multiples of ${\beta}$ for ${\beta}{\leq}{\gamma}$ within ${\gamma}$ time slots. Since the proposed protocol assigns one half of the duty cycle to each mode, it consumes equal to or less energy than the existing protocols. A performance comparison shows that the proposed protocol outperforms the existing protocols in terms of discovery latency and energy consumption, where the frequency of neighbor discovery requests by car accidents is not constantly high.

MAC Layer Based Certificate Authentication for Multiple Certification Authority in MANET

  • Sekhar, J. Chandra;Prasad, Ramineni Sivarama
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.5
    • /
    • pp.298-305
    • /
    • 2014
  • In this study, a novel Randomly Shifted Certification Authority Authentication protocol was used in ad hoc networks to provide authentication by considering the MAC layer characteristics. The nodes achieve authentication through the use of public key certificates issued by a CA, which assures the certificate's ownership. As a part of providing key management, the active CA node transfers the image of the stored public keys to other idle CA nodes. Finally the current active CA randomly selects the ID of the available idle CA and shifts the CA ownership by transferring it. Revoking is done if any counterfeit or duplicate non CA node ID is found. Authentication and integrity is provided by preventing MAC control packets, and Enhanced Hash Message Authentication Code (EHMAC) can be used. Here EHMAC with various outputs is introduced in all control packets. When a node transmits a packet to a node with EHMAC, verification is conducted and the node replies with the transmitter address and EHMAC in the acknowledgement.

A Performance Modeling of Wireless Sensor Networks as a Queueing Network with On and Off Servers

  • Ali, Mustafa K. Mehmet;Gu, Hao
    • Journal of Communications and Networks
    • /
    • v.11 no.4
    • /
    • pp.406-415
    • /
    • 2009
  • In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

ANC Caching Technique for Replacement of Execution Code on Active Network Environment (액티브 네트워크 환경에서 실행 코드 교체를 위한 ANC 캐싱 기법)

  • Jang Chang-bok;Lee Moo-Hun;Cho Sung-Hoon;Choi Eui-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9B
    • /
    • pp.610-618
    • /
    • 2005
  • As developed Internet and Computer Capability, Many Users take the many information through the network. So requirement of User that use to network was rapidly increased and become various. But it spend much time to accept user requirement on current network, so studied such as Active network for solved it. This Active node on Active network have the capability that stored and processed execution code aside from capability of forwarding packet on current network. So required execution code for executed packet arrived in active node, if execution code should not be in active node, have to take by request previous Action node and Code Server to it. But if this execution code take from previous active node and Code Server, bring to time delay by transport execution code and increased traffic of network and execution time. So, As used execution code stored in cache on active node, it need to increase execution time and decreased number of request. So, our paper suggest ANC caching technique that able to decrease number of execution code request and time of execution code by efficiently store execution code to active node. ANC caching technique may decrease the network traffic and execution time of code, to decrease request of execution code from previous active node.

Implementation of Security Enforcement Engine for Active Nodes in Active Networks (액티브 네트워크 상에서 액티브 노드의 보안 강화를 위한 보안 엔진 구현)

  • Kim, Ok-Kyeung;Lim, Ji-Young;Na, Hyun-Jung;Na, Ga-Jin;Kim, Yeo-Jin;Chae, Ki-Joon;Kim, Dong-Young
    • The KIPS Transactions:PartC
    • /
    • v.10C no.4
    • /
    • pp.413-422
    • /
    • 2003
  • An active network is a new generation network based on a software-intensive network architecture in which applications are able to inject new strategies or code into the infrastructure for their immediate needs. Therefore, the secure active node architecture is needed to give the capability defending an active node against threats that may be more dynamic and powerful than those in traditional networks. In this paper, a security enforcement engine is proposed to secure active networks. We implemented an operating engine with security, authentication and a authorization modules. Using this engine, it is possible that active networks are protected from threats of the malicious active node.

Linear shell elements for active piezoelectric laminates

  • Rama, Gil;Marinkovic, Dragan Z.;Zehn, Manfred W.
    • Smart Structures and Systems
    • /
    • v.20 no.6
    • /
    • pp.729-737
    • /
    • 2017
  • Piezoelectric composite laminates are a powerful material system that offers vast options to improve structural behavior. Successful design of piezoelectric adaptive structures and testing of control laws call for highly accurate, reliable and numerically efficient numerical tools. This paper puts focus onto linear and geometrically nonlinear static and dynamic analysis of smart structures made of such a material system. For this purpose, highly efficient linear 3-node and 4-node finite shell elements are proposed. Both elements employ the Mindlin-Reissner kinematics. The shear locking effect is treated by the discrete shear gap (DSG) technique with the 3-node element and by the assumed natural strain (ANS) approach with the 4-node element. Geometrically nonlinear effects are considered using the co-rotational approach. Static and dynamic examples involving actuator and sensor function of piezoelectric layers are considered.

Real-Time Sink Node Architecture for a Service Robot Based on Active Healthcare/Living-support USN (능동 건강/생활지원 USN 기반 서비스 로봇 시스템의 실시간 싱크 노드 구조)

  • Shin, Dong-Gwan;Yi, Soo-Yeong;Choi, Byoung-Wook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.7
    • /
    • pp.720-725
    • /
    • 2008
  • This paper proposes a system architecture for USN with a service robot to provide more active assisted living services for elderly persons by monitoring their mental and physical well-being with USN environments at home, hospital, or silver town. Sensors embedded in USN are used to detect preventive measures for chronic disease. Logged data are transferred to main controller of a service robot via wireless channel in which the analysis of data is performed. For the purpose of handling emergency situations, it needs real-time processing on gathering variety sensor data, routing algorithms for sensor nodes to a moving sink node and processing of logged data. This paper realized multi-hop sensor network to detect user movements with biometric data transmission and performed algorithms on Xenomai, a real-time embedded Linux. To leverage active sensing, a mobile robot is used of which task was implemented with a priority to process urgent data came from the sink-node. This software architecture is anticipated to integrate sensing, communication and computing with real-time manner. In order to verify the usefulness of a proposed system, the performance of data transferring and processing on a real-time OS with non real-time OS is also evaluated.

Ultra low-power active wireless sensor for structural health monitoring

  • Zhou, Dao;Ha, Dong Sam;Inman, Daniel J.
    • Smart Structures and Systems
    • /
    • v.6 no.5_6
    • /
    • pp.675-687
    • /
    • 2010
  • Structural Health Monitoring (SHM) is the science and technology of monitoring and assessing the condition of aerospace, civil and mechanical infrastructures using a sensing system integrated into the structure. Impedance-based SHM measures impedance of a structure using a PZT (Lead Zirconate Titanate) patch. This paper presents a low-power wireless autonomous and active SHM node called Autonomous SHM Sensor 2 (ASN-2), which is based on the impedance method. In this study, we incorporated three methods to save power. First, entire data processing is performed on-board, which minimizes radio transmission time. Considering that the radio of a wireless sensor node consumes the highest power among all modules, reduction of the transmission time saves substantial power. Second, a rectangular pulse train is used to excite a PZT patch instead of a sinusoidal wave. This eliminates a digital-to-analog converter and reduces the memory space. Third, ASN-2 senses the phase of the response signal instead of the magnitude. Sensing the phase of the signal eliminates an analog-to-digital converter and Fast Fourier Transform operation, which not only saves power, but also enables us to use a low-end low-power processor. Our SHM sensor node ASN-2 is implemented using a TI MSP430 microcontroller evaluation board. A cluster of ASN-2 nodes forms a wireless network. Each node wakes up at a predetermined interval, such as once in four hours, performs an SHM operation, reports the result to the central node wirelessly, and returns to sleep. The power consumption of our ASN-2 is 0.15 mW during the inactive mode and 18 mW during the active mode. Each SHM operation takes about 13 seconds to consume 236 mJ. When our ASN-2 operates once in every four hours, it is estimated to run for about 2.5 years with two AAA-size batteries ignoring the internal battery leakage.

A Packet security mechanism for Improving QoS in Active Node (Active Node내에서의 QoS향상을 위한 패킷 보안 메커니즘)

  • 최정희;신미예;이동희;이상호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.619-621
    • /
    • 2001
  • 현재 대부분의 액티브 네트워크에서 액티브 노드로 전송된 패킷은 프로그램 코드와 데이터를 동시에 가지고 있으며, 기존 네트웍 방식에서의 저장(store)-전송(forward) 형태와는 달리 저장(store)-연산(compute)-전송(forward) 방식으로 패킷 처리를 한다 이 과정에서 패킷에 악성 코드가 추가되거나 실제 데이터가 변경되는 경우에는 데이터의 무결성을 보장할 수 없다. 따라서 이 논문에서는 액티브 노드에 들어오는 패킷과 그 노드에서 처리가 이루어진 후 나가는 패킷을 비교하여 악의적이거나 악의 적이지는 않지만 실수로 인한 패킷의 오류를 방어함으로서 액티브 노드의 QoS를 향상시켜주는 방식을 제안한다.

  • PDF