• Journal of the Korea Society for Simulation
• /
• v.20 no.4
• /
• pp.31-40
• /
• 2011

Sensor nodes are easily exposed to malicious attackers by physical attacks. The attacker can generate various attacks using compromised nodes in a sensor network. The false report generating application layers injects the network by the compromised node. If a base station has the injected false report, a false alarm also occurs and unnecessary energy of the node is used. In order to defend the attack, a statistical en-route filtering method is proposed to filter the false report that goes to the base station as soon as possible. A path renewal method, which improves the method, is proposed to maintain a detection ability of the statistical en-route filtering method and to consume balanced energy of the node. In this paper, we proposed the secure path cycle method to consume effective energy for a path renewal. To select the secure path cycle, the base station determines through hop counts and the quantity of report transmission by an evaluation function. In addition, three methods, which are statistical en-route filter, path selection method, and path renewal method, are evaluated with our proposed method for efficient energy use. Therefore, the proposed method keeps the secure path and makes the efficiency of energy consumption high.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.623-628
• /
• 2009

The emergence of compact and low-power wireless communication sensors and actuators in the technology supporting the ongoing miniaturization of processing and storage allows for entirely the new kinds of embedded systems. These systems are distributed and deployed in environments where they may have been designed into a particular control method, and are often very dynamic. Collection of devices can communicate to achieve a higher level of coordinated behavior. Wireless sensor nodes deposited in various places provide light, temperature, and activity measurements. Wireless sensor nodes attached to circuits or appliances sense the current or control the usage. Together they form a dynamic and multi-hop routing network connecting each node to more powerful networks and processing resources. Wireless sensor networks are a specific-application and therefore they have to involve both software and hardware. They also use protocols that relate to both applications and the wireless network. Wireless sensor networks are consumer devices supporting multimedia applications such as personal digital assistants, network computers, and mobile communication devices. Wireless sensor networks are becoming an important part of industrial and military applications. The characteristics of modem embedded systems are the capable of communicating adapting the different operating environments. In this paper, We designed and implemented sensor network system which shows through host PC sensing temperature and humidity data transmitted for wireless sensor nodes composed wireless temperature and humidity sensor and designs sensor nodes using embedded system with the intention of studying USN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.1
• /
• pp.110-121
• /
• 2016

Link-16 is a representative TDL operated by US air force and NATO and supports structure of Multi-net. Under Multi-net, military operation can be conducted effectively since terminal nodes in Link-16 hop over total frequency band simultaneously. As air traffic is rapidly increasing, new aeronautical system is introduced or existing system should be expanded to accommodate increasing air traffic and frequency band assigned for operating this system is scarce. It is scheduled to implement frequency remapping to solve frequency scarcity. With limited frequency band for operating Link-16, as frequency remapping is implemented, degradation of Multi-net performance can happen since multiple access interference in Link-16 is increasing so it is difficult to conduct multiple military operations. Thus, Group-based frequency hopping scheme is proposed to solve this problem. We verified the performance of the proposed scheme is improved.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2091-2098
• /
• 2006

In this paper, it proposes a protocol of resource adaptive data dissemination for sensor nodes in a wireless sensor network. In general, each sensor node used in a wireless sensor network delivers the required information to the final destination by conducting cooperative works such as sensing, processing, and communicating each other using the battery power of a independent sensor node. So, a protocol used for transferring the acquired information to users through the wireless sensor network can minimize the power consumption of energy resource given to a sensor node. Especially, it is very important to minimize the total amount of power consumption with a method for handling the problems on implosion. data delivery overlapping, and excessive message transfer caused by message broadcasting. In this paper, for the maintaining of the shortest path between sensor nodes, maximizing of the life time of a sensor node and minimizing of communication cost, it presents a method for selecting the representative transfer node for an event arising area based on the negotiation scheme and maintaining optimal transfer path using hop and energy information. Finally, for the performance evaluation, we compare the proposed protocol to existing directed diffusion and SPIN protocol. And, with the simulation results, we show that the proposed protocol enhances the performance on the power consumption rate when the number of overall sensor nodes in a sensor network or neighbor sensor nodes in an event area are increased and on the number of messages disseminated from a sensor node.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.33-39
• /
• 2016

With recent advances in sensor technology, CMOS-based semiconductor devices and networking protocol, the areas for application of wireless sensor networks greatly expanded and diversified. Such diversification of uses for wireless sensor networks creates a multitude of beneficial possibilities for several industries. In the application of wireless sensor networks for monitoring systems' data transmission process from the sensor node to the sink node, transmission through multi-hop paths have been used. Also mobile sink techniques have been applied. However, high energy costs, unbalanced energy consumption of nodes and time gaps between the measured data values and the actual value have created a need for advancement. Therefore, this thesis proposes a new model which alleviates these problems. To reduce the communication costs due to frequent data exchange, a State Prediction Model has been developed to predict the situation of the peripheral node using a geographic autocorrelation of sensor nodes constituting the wireless sensor networks. Also, a Risk Analysis Model has developed to quickly alert the monitoring system of any fatal abnormalities when they occur. Simulation results have shown, in the case of applying the State Prediction Model, errors were smaller than otherwise. When the Risk Analysis Model is applied, the data transfer latency was reduced. The results of this study are expected to be utilized in any efficient communication method for wireless sensor network monitoring systems where all nodes are able to identify their geographic location.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.813-826
• /
• 1999

실시간 멀티미디어 응용의 등장으로 멀티캐스트와 QoS(Quality of Service) 지원이 필수적인 망 서비스로 부각되고 있다. 이에, ATM 기반의 인터넷에서 IP 멀티캐스트의 효율적인 처리를 위하여 MARS(Multicast Address Resolution Server)가 제안되었고, 기존의 최선 서비스 기반의 인터넷에서 QoS(Quality of Service)를 지원하기 위하여 RSVP(Resource Reservation Protocol)가 제안되었다. 본 논문에서는 ATM 망에서 QoS가 지원되는 IP 멀티캐스트 서비스를 제공하기 위하여 MARS 구조에서 RSVP를 지원하는 두 가지 방안을 제안하고, 시뮬레이션을 통하여 그 성능을 분석하였다. 제안하는 두 가지 방법은 각각 'RSVP 전 홉 노드 방식'과 'MARS 서버 방식'이라 명명하였다. RSVP 전 홉 노드 방식은 송신원으로부터 ATM 망으로 진입하는 노드와 수신원을 향하여 ATM 망을 진출하는 노드 간에 각각 일대일 양방향 VC를 설정하여 멀티캐스트 그룹에 속하는 수신원들이 보내는 자원 예약 메시지를 ATM 망에서 전송하는 방안이다. MARS 서버 방식은 ATM 망을 진출하는 노드와 MARS 서버간에 MARS 제어 메시지 교환을 위해 존재하는 ATM VC를 사용하여 RSVP의 자원 예약 메시지를 전송하고, MARS 서버가 RSVP 자원 예약 메시지를 처리하도록 그 기능을 확장함으로써 ATM 망에서 필요로 하는 제어 VC 수를 절약할 수 있는 방안이다. 시뮬레이션을 통하여, MARS 서버 방식은 ATM 제어 VC의 수를 절약할 수 있을 뿐 아니라 경우에 따라 RSVP 자원 예약 메시지 전달 지연을 줄일 수도 있음을 볼 수 있었다. 그러나, MARS 클러스터 내에 동시에 존재하는 RSVP 흐름이 많을 때에는 MARS 서버 방식의 경우 MARS 서버에서의 병목 현상으로 인해 성능이 저하될 수 있다.Abstract Emerging real time multimedia applications require multicast service with a QoS(Quality of Service) support. An overlay service architecture MARS(Multicast Address Resolution Server) is proposed to support IP multicast over an ATM network, and a resource reservation protocol RSVP is proposed to provide QoS support in the Internet which is originally based upon best effort service only. In this paper, we propose two schemes to support IP multicast service with QoS support over ATM networks: 'RSVP Previous Hop Node(RPHN) scheme' and 'MARS server based scheme'. In RPHN scheme, the RSVP reservation messages are transported via one-to-one ATM control VC from the egress nodes to the ingress nodes of the the multicast flow set up between each pair of nodes. The RSVP message processing occurs at the ingress nodes of the multicast flow. Whereas, in the MARS server based scheme, the RSVP reservation messages are transported via the MARS control VCs between the egress nodes and the MARS server. The RSVP message processing burden is imposed at MARS server in this scheme. For MARS server based scheme, no additional ATM VC is required for RSVP reservation message transmission, while the processing burden at the MARS server is high. Simulation results show that the MARS server based scheme, may accomplish RSVP reservation message delivery with smaller delay as well as saving of the number of ATM VCs. When the number of simultaneous RSVP flows in the MARS cluster is large, however, MARS based scheme may suffer performance degradation since MARS server becomes a performance bottleneck.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.31-40
• /
• 2009

What are important in wireless sensor networks are reliable data transmission, energy efficiency of each node, and the maximization of network life through the distribution of load among the nodes. The present study proposed DSPR, a dynamic unique path routing machanism that considered these requirements in wireless sensor networks. In DSPR, data is transmitted through a dynamic unique path, which has the least cost calculated with the number of hops from each node to the sink, and the average remaining energy. At that time, each node monitors its transmission process and if a node detects route damage it changes the route dynamically, referring to the cost table, and by doing so, it enhances the reliability of the network and distributes energy consumption evenly among the nodes. In addition, when the network topology is changed, only the part related to the change is restructured dynamically instead of restructuring the entire network, and the life of the network is extended by inhibiting unnecessary energy consumption in each node as much as possible. In the results of our experiment, the proposed DSPR increased network life by minimizing energy consumption of the nodes and improved the reliability and energy efficiency of the network.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.6
• /
• pp.95-102
• /
• 2012

In this paper, we propose a method that can construct efficiently a P2P overlay multicast network composed of many heterogeneous peers in communication bandwidth, processing power and a storage size by selecting a peer in a distributed fashion using an ant-colony theory that is one of the computational intelligence methods. The proposed method considers not only the capacity of a peer but also the number of children peers supported by the peer and the hop distance between a multicast source and the peer when selecting a parent peer of a newly joining node. Thus, an P2P multicast overlay network is constructed efficiently in that the distances between a multicast source and peers are maintained small. In addition, the proposed method works in a distributed fashion in that peers use their local information to find a parent node. Thus, compared to a centralized method where a centralized server maintains and controls the overlay construction process, the proposed method scales well. Through simulations, we show that, by making a few high capacity peers support a lot of low capacity peers, the proposed method can maintain the size of overlay network small even there are a few thousands of peers in the network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2293-2300
• /
• 2008

In ad-hoc sensor network, AODV routing information is disclosed to other nodes because AODV protocol doesn't have any security mechanisms. The problem of AODV is that an attacker can falsify the routing information in RREQ packet. If an attacker broadcasts the falsified packet, other nodes will update routing table based on the falsified one so that the path passing through the attacker itself can be considered as a shortest path. In this paper, we design the routing-information-spoofing attack such as falsifying source sequence number and hop count fields in RREQ packet. And we suggest an efficient scheme for detecting the attackers and isolating those nodes from the network without extra security modules. The proposed scheme doesn't employ cryptographic algorithm and authentication to reduce network overhead. We used NS-2 simulation to evaluate the network performance. And we analyzed the simulation results on three cases such as an existing normal AODV, AODV under the attack and proposed AODV. Simulation results using NS2 show that the AODV using proposed scheme can protect the routing-information-spoofing attack and the total n umber of received packets for destination node is almost same as the existing norm at AODV.