• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.60-68
• /
• 2006

Using the wireless communication among unacquainted vehicles, an intelligent vehicle safety system can be constructed to exchange vehicle safety-related information, such as urgency stop, traffic accident and road obstacles. In the majority of vehicle safety applications, vehicle safety messages are propagated in the form of broadcast. However, this approach causes some effectiveness and performance problems with massive radio collision, multi-hop propagation. This paper presents a priority based relay node selection method for propagating vehicle safety messages of traffic accident protection system. With this method, vehicle safety messages are relayed by a node that locates in proper distance out of the nodes that are included in the radio transmission range. By decreasing the number of duplicated messages, the packet overhead is lessened while the communication performance is raised. The proposed method was proven to be better than other schemes through network simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.89-99
• /
• 2011

In this paper, we propose an routing algorithm for ultra low power and high reliable transmission in WBAN environment. This algorithm is to minimize energy consumption and to maximize the life and reliability for medical devices. Also, this algorithm is not only medical devices but also non-medical devices is to minimize energy consumption and to maximize the life of device. The combination of the distance from the previous node and residual energy calculates weight. The calculated weight is used to calculate the weight of full path by cumulative weights. The full path to the smallest of the weights are set to the path. Also this algorithm is able to select another path to avoid the error path by determining the link status between nodes, when occurs link error and congestion. In this paper, we show that WSN routing algorithm based on shortest hop count routing algorithm and EAR routing algorithm compared to ensure high reliability and low power characteristic of WBAN to be verified through simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.437-445
• /
• 2009

Node of USN(Ubiquitous Sensor Network) environments uses radio based communication mechanism for a delivering message. Thus the multiple hop flooding is necessary for considering limited power and communicating unknown node long-range. However if there are many unknown nodes located in users' vision, the flooding of the radio base is insufficient alternative. Thus as a flash may be used to find a key in a darkness, a more direct and short range communication system is required. This study shall resolve such question through 2 different steps. First a Two kind of code method that convert Text message to color code shall be suggested. Second a hardware module, which may deliver various LED(light-emitting diode) color signal, shall be developed. The experiment may take place by fixing the entry angle of light and distance by setting a specific element as a standard mean.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.188-195
• /
• 2012

Many systems are developing for the realization of NCW(Network Centric Warfare). UAV(Unmanned Aerial Vehicle) Network is attracting attention in a lot of military applications. In general, UAVs have the potential to create an ad-hoc network and greatly reduce the hops from source to destination. However, UAV networks exhibit unique properties such as high mobility, high data rate, and real time service. The routing protocols are required to design the multi-hop routing protocols that can dynamically adapt to the requirements of UAV network. In this paper we analyse Geographic Routing Protocol is based on geographical distance between source and destination for efficient and reliable transmission. Geographic Routing Protocol is evaluated in video service scenarios with TDMA model in our simulation. The simulation results show that the performance of Geographic Routing Protocol is better than the MANET Routing Protocol in terms of packet received ratio, end to end delay, and routing traffic sent.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.89-95
• /
• 2013

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 13% compared with JXTA and 69% compared with Chord. It can decrease the discovery routing distance by 17% compared with JXTA and 83% compared with Chord depending on the environment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.62-66
• /
• 2008

In this paper we have proposed a power aware location based routing protocol for wireless ad hoc network. The existing greedy perimeter stateless routing (GPSR) has some problems which are certain node overloaded and void situation. The proposed power aware greedy perimeter stateless routing (PAGPSR) protocol gives a solution for these problems in GPSR. PAGPSR uses power aware and geographically informed neighbor selection to route a packet towards the destination. It also gives a solution for the fundamental problem in geographical routing called communication void. It considers residual energy of battery and distance to the destination for the next hope node selection. When it encounters a void it starts limited-flooding to select next hop node. To evaluate the performance of our protocol we simulated PAGPSR in ns-2. Our simulation results show that our protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR).

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1038-1041
• /
• 2009

Wireless sensor network with wireless sensor nodes which equipped with temperature, humidity, illumination, or soil sensor etc, get a natural environment information and analyze and utilized variety way.these network consist of a short distance wireless communication and multi-hop techniques with multiple nodes equipped low-power wireless transceivers. so the characteristic of the data collected through the wireless sensor network is obtained from compact nodes within a limited range. However, to get a data from the wireless sensor nodes scattered in a wide range, this network needs a wireless transceiver that consumes many power or a lot of intermediate nodes. then, merit of low cost and low electrical energy decrease. To solve this problem, this paper offers environment monitoring system using autonomous mobile robot that collect data from groups of each sensor networks scattered widely.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5744-5764
• /
• 2018

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

• Fire Science and Engineering
• /
• v.33 no.6
• /
• pp.165-172
• /
• 2019

This study presents the design and manufacture of a self-contained breathing apparatus SCBA wireless communication module with a multipoint simultaneous full-duplex communication system to enable communication between team members wearing the SCBA system. It is necessary for fire-fighters to wear the SCBA system during extinguishing and rescue work at the fire site. Evaluation of the team communication module confirmed the feasibility of communication over more than 500 m in the test condition based on the line of sight. By implementing the Ad-hoc function, it was confirmed that the communication distance could be extended to 128 m by automatic routing up to 3 hoc. The vertical distance inside the building for successful communication was up to the 5th floor in the open staircase and up to the 3rd floor in the partitioned staircase. Furthermore, the performance testing of the communication module assuming a fire situation, confirmed that five team members correctly recognized the standard abbreviation of fire and wireless communication without a separate PTT key operation. In addition, the flame resistance was verified by exposing the module to a flame at 950 ± 50 ℃ for 5 s and then immediately extinguishing the flame.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.229-238
• /
• 2007

Sensor networks consist of many tiny sensor nodes that collaborate among themselves to collect, process, analyze, and disseminate data. In sensor networks, sensor nodes are typically powered by batteries, and have limited computing resources. Moreover, the redeployment of nodes by energy exhaustion or their movement makes network topology change dynamically. These features incur problems that do not appear in traditional, wired networks. Security in sensor networks is challenging problem due to the nature of wireless communication and the lack of resources. Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop suity mechanisms that can survive malicious attacks from "insiders" who have access to the keying materials or the full control of some nodes. In order to protect against insider attacks, it is necessary to understand how an insider can attack a sensor network. Several attacks have been discussed in the literature. However, insider attacks in general have not been thoroughly studied and verified. In this paper, we study the insider attacks against routing protocols in sensor networks using the Ad-hoc On-Demand Distance Vector (AODV) protocol. We identify the goals of attack, and then study how to achieve these goals by modifying of the routing messages. Finally, with the simulation we study how an attacker affects the sensor networks. After we understand the features of inside attacker, we propose a detect mechanism using hop count information.