• Title/Summary/Keyword: Node Area

Search Result 854, Processing Time 0.027 seconds

Configuration Technique of Efficient Wireless Sensor Networks using Node Relocation Algorithm (노드 재배치 알고리즘을 이용한 효율적인 무선 센서 네트워크 구성 기법)

  • Heo, Junyoung;Min, Hong;Kim, Bongjae;Jung, Jinman
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.205-210
    • /
    • 2017
  • Wireless sensor networks are useful to various unmanned monitoring application such as monitoring environments, surveillance system, unmanned space exploration, and so on. Due to the inappropriate placement of sensor nodes, there are some problems, for example, low connectivity and high overlapped sensing area. These problems can make it difficult for the data collection and lead to a waste of energy. In this paper, we propose a node relocating method to resolve the inappropriate placement of sensor nodes. Given monitoring area, we place sensor nodes randomly and find redundant nodes and move them to uncovered area. Through the simulation, We show that the proposed method is viable and efficient compared with the existing randomly locating method.

A New Framework of 6lowpan node for Neighboring Communication with Healthcare Monitoring Applications

  • Singh, Dhananjay;Lee, Hoon-Jae;Chung, Wan-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.281-286
    • /
    • 2009
  • The proposed technique uses cyclic frame structure, where three periods such as beacon period (BP), mesh contention access period (MCAP) and slotted period (SP) are in a data frame. This paper studies on a mechanism to allow communication nodes (6lowpan) in a PAN with different logical channel for global healthcare applications monitoring technology. The proposed super framework structure system has installed 6lowpan sensor nodes to communicate with each other. The basic idea is to time share logical channels to perform 6lowpan sensor node. The concept of 6lowpan sensor node and various biomedical sensors fixed on the patient BAN (Body Area Network) for monitoring health condition. In PAN (hospital area), has fixed gateways that received biomedical data from 6lowpan (patient). Each 6lowpan sensor node (patient) has IP-addresses that would be directly connected to the internet. With the help of IP-address service provider can recognize or analyze patient data from all over the globe by the internet service provider, with specific equipments i.e. cell phone, PDA, note book. The NS-2.33 result shows the performance of data transmission delay and data delivery ratio in the case of hop count in a PAN (Personal Area Networks).

  • PDF

Selection of Monitoring Nodes to Maximize Sensing Area in Behavior-based Attack Detection

  • Chong, Kyun-Rak
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.73-78
    • /
    • 2016
  • In wireless sensor networks, sensors have capabilities of sensing and wireless communication, computing power and collect data such as sound, movement, vibration. Sensors need to communicate wirelessly to send their sensing data to other sensors or the base station and so they are vulnerable to many attacks like garbage packet injection that cannot be prevented by using traditional cryptographic mechanisms. To defend against such attacks, a behavior-based attack detection is used in which some specialized monitoring nodes overhear the communications of their neighbors(normal nodes) to detect illegitimate behaviors. It is desirable that the total sensing area of normal nodes covered by monitoring nodes is as large as possible. The previous researches have focused on selecting the monitoring nodes so as to maximize the number of normal nodes(node coverage), which does not guarantee that the area sensed by the selected normal nodes is maximized. In this study, we have developed an algorithm for selecting the monitoring nodes needed to cover the maximum sensing area. We also have compared experimentally the covered sensing areas computed by our algorithm and the node coverage algorithm.

Dynamic Local Update-based Routing Protocol(D-LURP) in Wireless Sensor Network with Mobile Sink (모바일 싱크노드를 갖는 무선 센서 네트워크에서 동적 지역 업데이트 기반의 라우팅 프로토콜(D-LURP))

  • Chung, Jae-Hoon;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.3
    • /
    • pp.116-122
    • /
    • 2009
  • Mobile Wireless Sensor Network is an organized collection of sensor nodes and mobile sink nodes, in which the sensor node transmits the signal to the sink node. In real environment, there are many cases in which sinks have mobility caused by the people, the vehicle and etc. Since all nodes in the sensor networks have limited energy, many researches have been done in order to prolong the lifetime of the entire network. In this paper we propose Dynamic Local Update-based Routing Protocol(D-LURP) that prolong the lifetime of the entire network to efficiently maintain frequent location update of mobile sink static sensor nodes in Mobile WSNs. When the sink node moves out of the local broadcasting area the proposed D-LURP configures dynamically the local update area consisted of the new local broadcasting area and the previous dissemination node(DN) and find the path between the DN and the sink node, instead of processing a new discovering path like LURP. In this way the processing of broadcasting sink node's location information in the entire network will be omitted. and thus less energy will be consumpted. We compare the performances of the proposed scheme and existing Protocols.

A study on ODDMRP clustering scheme of Ad hoc network by using context aware information (상황정보를 이용한 ad hoc network의 ODDMRP clustering 기법에 관한 연구)

  • Chi, Sam-Hyun;Lee, Kang-Whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.890-893
    • /
    • 2008
  • 자율성 및 이동성 갖는 네트워크 구조의 하나인 MANET(Mobile Ad-Hoc Networks)은 각 node들은 그 특성에 따라서 clustering service을 한다. node의 전송과정 중 path access에 대하여 중요성 또한 강조되고 있다. 일반적인 무선 네트워크 상에서의 node들은 clustering을 하게 되는데 그 과정에서 발생되는 여러 가지 문제점을 가지고 전송이 이루어진다. 모든 node들이 송, 수신상의 전송 범위(Beam forming area)가지고 있으며, 이러한 각 node들의 전송범위 내에 전송이 이루어지는 전통적인 전송기술 mechanism을 찾는다. 이러한 전송상황에서의 송신하는 node와 수신된 node간에 발생되고 있는 중복성의 문제점으로 즉, 상호적용에 의한 네트워크 duplicate(overlapping)이 크게 우려가 되고 있다. 이러한 전송상의 전송 범위 중첩, node간의 packet 간섭현상, packet의 중복수신 및 broadcasting의 storming현상이 나타난다. 따라서 본 논문에서는 상황정보의 속성을 이용한 계층적 상호 head node들의 접근된 위치와 연계되는 전송속도, 보존하고 있는 head node들의 에너지 source value, doppler효과를 통한 head node의 이동방향 등 분석한다. 분석된 방법으로 전송상의 계층적 path가 구성된 경험적 path 속성을 통한 네트워크 connectivity 신뢰성을 극대화 할 뿐만 아니라 네트워크의 전송 범위 duplicate을 사전에 줄일 수 있고 전송망의 최적화를 유지할 수 있는 기법의 하나인 상황정보를 이용한 ad hoc network의 ODDMRP(Ontology Doppler effect-based Dynamic Multicast Routing Protocol) clustering 기법을 제안한다.

  • PDF

Detection and Management of Misbehaving Node in Tactical Ad-Hoc Networks (전술 Ad-hoc 네트워크에서의 비정상행위 노드 탐지 및 관리)

  • Jang, Beom-Geun;Lee, Soo-Jin
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.12 no.3
    • /
    • pp.333-343
    • /
    • 2009
  • Tactical Information Communication Network(TICN) is a concept-type integrated Military Communication system that enables precise command control and decision making by unifying the diversified military communication network and conveying diverse range of battle field information on real-time, at right place at right time. TICN is designed to advance into high speed, large capacity, long distance wireless relay transmission. To support mobility in battlefield environments, the application of Ad-hoc networking technology to its wireless communication has been examined. Ad-hoc network is consist of mobile nodes and nodes in the network depends on the cooperation of other nodes for forwarding of packets. In this context, some non-cooperating nodes may delay forwarding of packets or drop the packets. This may hamper the network as a whole and disrupt communication between the cooperating nodes. To solve this problem, we present a solution with a Node Weight Management Server(NWMS), which manages each node's weight according to its behavior in local area. When the NWMS detects misbehaving node, it increases the node's weight. If the node's weight exceeds a predefined threshold then the NWMS broadcasts the node's information into network to isolate the misbehaving node from the network. These mechanisms show that they are highly effective and can reliably detect a multitude of misbehaving node.

Energy-Efficient Data Aggregation and Dissemination based on Events in Wireless Sensor Networks (무선 센서 네트워크에서 이벤트 기반의 에너지 효율적 데이터 취합 및 전송)

  • Nam, Choon-Sung;Jang, Kyung-Soo;Shin, Dong-Ryeol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.35-40
    • /
    • 2011
  • In this paper, we compare and analyze data aggregation methods based on event area in wireless sensor networks. Data aggregation methods consist of two methods: the direct transmission method and the aggregation node method. The direct aggregation method has some problems that are data redundancy and increasing network traffic as all nodes transmit own data to neighbor nodes regardless of same data. On the other hand the aggregation node method which aggregate neighbor's data can prevent the data redundancy and reduce the data. This method is based on location of nodes. This means that the aggregation node can be selected the nearest node from a sink or the centered node of event area. So, we describe the benefits of data aggregation methods that make up for the weak points of direct data dissemination of sensor nodes. We measure energy consumption of the existing ways on data aggregation selection by increasing event area. To achieve this, we calculated the distance between an event node and the aggregation node and the distance between the aggregation node and a sink node. And we defined the equations for distance. Using these equations with energy model for sensor networks, we could find the energy consumption of each method.

Cluster Topology Algorithm for Efficient Data Transmission in Wireless Body Area Network based on Mobile Sink (WBAN 환경에서 효율적인 데이터 전송을 위한 모바일 싱크기반의 클러스터 토폴로지 알고리즘)

  • Lee, Jun-Hyuk
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.56-63
    • /
    • 2012
  • The WBAN technology means a short distance wireless network which provides each device interactive communication by connecting devices inside and outside of body. Standardization on the physical layer, data link layer, network layer and application layer is in progress by IEEE 802.15.6 TG BAN. Wireless body area network is usually configured in energy efficient using sensor and zigbee device due to the power limitation and the characteristics of human body. Wireless sensor network consist of sensor field and sink node. Sensor field are composed a lot of sensor node and sink node collect sensing data. Wireless sensor network has capacity of the self constitution by protocol where placed in large area without fixed position. Mobile sink node distribute energy consumption therefore network life time was increased than fixed sink node. The energy efficient is important matter in wireless body area network because energy resource was limited on sensor node. In this paper we proposed cluster topology algorithm for efficient data transmission in wireless body area network based mobile sink. The proposed algorithm show good performance under the advantage of grid routing protocol and TDMA scheduling that minimized overlap area on cluster and reduced amount of data on cluster header in error prone wireless sensor network based on mobile sink.

A Cluster Formation Scheme with Remaining Energy Level of Sensor Nodes in Wireless Sensor Networks (무선 센서 네트워크에서 잔여 에너지 레벨을 이용한 클러스터 형성 기법)

  • Jang, Kyung-Soo;Kangm, Jeong-Jin;Kouh, Hoon-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.49-54
    • /
    • 2009
  • Sensor nodes in wireless sensor networks operate in distributed environments with limited resources and sensing capabilities. Especially, a sensor node has a small energy. After the sensor nodes are distributed in some area, it is not accessible to the area. AIso, a battery of sensor node cannot change. One of the hot issues in wireless sensor networks maximizes the network lifetime through minimizing the energy dissipation of sensor nodes. In LEACH, the cluster head is elected based on a kind of probability method without considering remaining energy of sensor node. In this paper, we propose a cluster formation scheme that the network elect the node, which has higher energy level than average energy level of overall sensor network, as cluster head node. We show the superiority of our scheme through computer simulation.

  • PDF

Multiple Sink Nodes to Improve Performance in WSN

  • Dick, Mugerwa;Alwabel, Mohammed;Kwon, Youngmi
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.6
    • /
    • pp.676-683
    • /
    • 2019
  • Wireless Sensor Networks (WSNs) consist of multiple tiny and power constrained sensors which use radio frequencies to carry out sensing in a designated sensor area. To effectively design and implement reliable WSN, it is critical to consider models, protocols, and algorithms that can optimize energy consumption of all the sensor nodes with optimal amount of packet delivery. It has been observed that deploying a single sink node comes with numerous challenges especially in a situation with high node density and congestion. Sensor nodes close to a single sink node receive more transmission traffic load compared to other sensors, thus causing quick depletion of energy which finally leads to an energy hole and sink hole problems. In this paper, we proposed the use of multiple energy efficient sink nodes with brute force technique under optimized parameters to improve on the number of packets delivered within a given time. Simulation results not only depict that, deploying N sink nodes in a sensor area has a maximum limit to offer a justifiable improvement in terms of packet delivery ratio but also offers a reduction in End to End delay and reliability in case of failure of a single sink node, and an improvement in the network lifetime rather than deploying a single static sink node.