• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.175-183
• /
• 2008

In wireless sensor networks with ad hoc networking capability, sensor nodes are battery operated and are usually disposable once deployed. As a result, each sensor node senses and communicates with limited energy and, thus, energy efficiency has been studied as a key design factor which determines lifetime of a wireless sensor network, and it is more improved recently by using so-called cross-layer optimization technique. In this paper, we propose and implement a new energy saving mechanism that reduces energy consumption during data collection by controlling transmission power at sensor nodes and then measure its performance in terms of lifetime improvement for the wireless sensor network platform ZigbeX. When every sensor node transmits sensed data to its clusterhead, it controls its transmission power down to as low level as communication is possible, resulting in energy saving. Each sensor node controls its transmission power based on RSSI(Received Signal Strength Indicator) of the packet received from its clusterhead. In other words, the sensor node can save energy by controlling its transmission power down to an appropriate level that its clusterhead safely receives the packet it transmits. According to the repetitive experiment of the proposed scheme on the ZigbeX platform using the packet analyzer developed by us, it is observed that the network lifetime is prolonged by up to 21.9% by saying energy during the data collection occupying most amount of network traffic.

• 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.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.8-15
• /
• 2001

This paper remarks IETF based requirements for IP/UDP/RTP header compression issued in 3GPP2 All IP Ad Hoc Meeting and protocol stacks of the next generation mobile station. All IP Network, for real time application such as Voice over IP (VoIP) multimedia services based on 3GPP2 3G cdma2000. Frames for various protocols expected in the All IP network Mobile Station (MS) are explained with several figures including the bit-for-bit notation of header format based on IETF draft of Robust Header Compression Working Group (ROHC). Especially, this paper includes problems of IS-707 Radio Link Protocol (RLP) for header compression which will be expected to modify in All IP network MS's medium access layer to accommodate real time packet data service[1]. And also, since PPP has also many problems in header compression and mobility aspects in MS protocol stacks for 3G cdma2000 packet data network based on Mobile IP (PN-4286)[2], we introduce the problem of solution for header compression of PPP. Finally. we suggest the guidelines for All IP network MS header compression about expected protocol stacks, radio resource efficiency and performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.225-232
• /
• 2013

In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.8
• /
• pp.191-200
• /
• 2019

In an Ad-hoc network, a method of time synchronizing all the nodes in a network centering on one reference node can be used. A representative algorithm based on a reference node is Flooding Time Synchronization Protocol (FTSP). In the process of sending and receiving messages, predictable and unpredictable delays occur, which should be removed because it hinders accurate time synchronization. In multi-hop communications, hop delays occur when a packet traverses a number of hops. These hop delays significantly degrade the synchronization performance among nodes. Therefore, we need to find a method to reduce these hop delays and increase synchronization performance. In the FTSP scheme, hop delays can be greatly increased depending on the position of a reference node. In addition, in FTSP, a node with the smallest node ID is elected as a reference node, hence, the position of a reference node is actually arbitrarily determined. In this paper, we propose an optimal reference node election algorithm to reduce hop delays, and compare the performance of the proposed scheme with FTSP using the network simulator OPNET. In addition, we verify that the proposed scheme has an improved synchronization performance, which is robust to topology changes.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.2
• /
• pp.125-137
• /
• 2007

This paper proposes a new scheme to provide the location privacy of sources in Wireless Sensor Networks (WSNs). Because the geographical location of a source sensor reveals contextual information on an 'event' in WSN, anonymizing the source location is an important issue. Despite abundant research efforts, however, about data confidentiality and authentication in WSN, privacy issues have not been researched well so far. Moreover, many schemes providing the anonymity of communication parties in Internet and Ad-hoc networks are not appropriate for WSN environments where sensors are very resource limited and messages are forwarded in a hop-by-hop manner through wireless channel. In this paper, we first categorize the type of eavesdroppers for WSN as Global Eavesdropper and Compromising Eavesdropper. Then we propose a novel scheme which provides the anonymity of a source according to the types of eavesdroppers. Furthermore, we analyze the degree of anonymity of WSN using the entropy-based modeling method. As a result, we show that the proposed scheme improves the degree of anonymity compared to a method without any provision of anonymity and also show that the transmission range plays a key role to hide the location of source sensors.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.81-94
• /
• 2006

This study, in particular, aims to regulate the core techniques of ubiquitous computing, such as the use of an ad hoc network and the smart-tag technique, and to look more closely into RFID Tag's smart-tag-related security service. The study aims to do so because several important technical factors and structures must be taken into account for RFID Tag to be applied in the ubiquitous-computing-related infrastructure, and the security of the tag is considered one of the core technologies. To realize secure ubiquitous computing in the case of the Passive-tag-Performing RF communication, a less costly security service, the technical items needed to carry this out, a security service to be applied to passive tags, and network management techniques are required. Therefore, the passive-tag-based networks as the authentication level is established based on the secure authentication of each tag and the service that the tag delivers in the passive-tag-based networks and as the same service and authentication levels are applied, and the active-tag-based network system proposed herein is not merely a security service against illegal RFID tags by performing a current-location and service registration process after the secure authentication process of the active RFID tag, but is also a secure protocol for single and group services, is proposed in this study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1252-1260
• /
• 2017

As digital communication technology evolves, the diversity of maritime communication methods has benn increasing due to the emergence of new maritime communication technologies such as digital very high frequency (VHF) communication systems and LTE-M as well as traditional conventional maritime communication systems. At sea, all maritime communication methods may be available, but only some communication methods may be available depending on the location. In this paper, we propose a multi-band network selection (MNS) system that can provide seamless maritime communication service by switching to an optimal communication band among available communication systems, depending on network environment and user requirements. The proposed MNS system in the middleware layer is designed to be able to interface with two types of digital VHF communication systems that satisfy Annex 1 and Annex 4 of ITU-R M. 1842-1, LTE, and high frequency (HF) communication systems. We assign priority to each communication band, and design an optimal communication band determination algorithm based on this priority.

• Smart Structures and Systems
• /
• v.6 no.5_6
• /
• pp.481-504
• /
• 2010

Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.6
• /
• pp.1171-1176
• /
• 2016

VANET are a special kind of MANET adapted to the communications between vehicles. In this work, we propose the models used for representing the communication among vehicles, vehicles mobility features, and VANET simulator using realistic vehicular mobility models. VANET requires that a traffic and network simulator should be used together to perform this test. But, simulator tool has been preferred over traffic simulation because it simple, easy and cheap. Goal of this paper is to create a simulation of Vehicular Ad-Hoc network for urban scenario which can be used for testing purposes. Such environment can be used while designing better MAC protocols in VANETs. We are evaluating the performance of two routing protocols namely AODV and DSDV. The comparison was based on the throughout, packet loss and end-to-end delay. We found that DSDV has less throughput performance and high routing overhead than AODV. On average end-to-end delay and packet loss, AODV performs better than DSDV.