• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.2
• /
• pp.151-157
• /
• 2010

Rapid technological advances in the area of micro electro-mechanical systems (MEMS) have spurred the development of small inexpensive sensors capable of intelligent sensing. A significant amount of research has been done in the area of connecting large numbers of these sensors to create robust and scalable Wireless Sensor Networks (WSNs). The resource scarcity, ad-hoc deployment, and immense scale of WSNs make secure communication a particularly challenging problem. Since the primary consideration for sensor networks is energy efficiency, security schemes must balance their security features against the communication and computational overhead required to implement them. In this paper, we combine location information and probability to create a new security aware multipath geographic routing protocol. The implemented result in network simulator (ns-2) showed that our protocol has a better performance under attacks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.199-212
• /
• 2008

Software simulation has been widely used for the design and application development of a large-scale wireless sensor network. The degree of details of the simulation must be high to verify the behavior of the network and to estimate its execution time and power consumption of an application program as accurately as possible. But, as the degree of details becomes higher, the simulation time increases. Moreover, as the number of sensor nodes increases, the time tends to be extremely long. We propose an optimal-synchronous parallel discrete-event simulation method to shorten the time in a large-scale sensor network simulation. In this method, sensor nodes are partitioned into subsets, and each PC that is interconnected with others through a network is in charge of simulating one of the subsets. Results of experiments using the parallel simulator developed in this study show that, in the case of the large number of sensor nodes, the speedup tends to approach the square of the number of PCs participating in the simulation. In such a case, the ratio of the overhead due to parallel simulation to the total simulation time is so small that it can be ignored. Therefore, as long as PCs are available, the number of sensor nodes to be simulated is not limited. In addition, our parallel simulation environment can be constructed easily at the low cost because PCs interconnected through LAN are used without change.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.155-164
• /
• 2012

Indoor fire simulators have been used to analyse building safety in the events of emergency evacuation. These applications are primarily focused on simulating evacuation behaviors for the purpose of checking building structural problems in normal time rather than in real time situations. Therefore, they have limitations in handling real-time evacuation events with the following reasons. First, the existing models mostly experiment the artificial situations using randomly generated evacuees while real world requires actual data. Second, they take too long time in operation to generate real time data. Third, they do not produce optimal results to be used in rescueing or evacuation guidance. In order to solve these limitations, we suggest a method to build an evacuation simulation system that can be used in real-world emergency situations. The system performs numerous simulations in advance according to varying distributions of occupants. Then the resulting data are stored in DBMS. The actual person data captured in infrared sensor network are compared with the simulation data in DBMS and the querried data most closely is provided to the user. The developed system is tested using a campus building and the suggested processes are illustrated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1697-1703
• /
• 2020

Sensor nodes that directly collect data from the surrounding environment have many constraints, such as power supply and memory size, thus efficient use of resources is required. In this paper, in a sensor node that receives location data of a vehicle on a lane, the data reception period is changed by the target's speed estimated by the Kalman filter and distance weight. For a slower speed of the vehicle, the longer data reception interval of the sensor node can reduce the processing time performed in the entire sensor network. The proposed method was verified through a traffic simulator implemented as MATLAB, and the results achieved that the processing time was reduced in the entire sensor network using the proposed method compared to the baseline method that receives all data from the vehicle.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.194-196
• /
• 2011

일반적으로 센서 네트워크에서는 라우팅 트리를 구축한 후에 시간 동기화 작업을 따로 진행하였다. 그 때문에 패킷교환의 횟수가 늘어나고 전력의 소모를 유발한다. 본 논문에서는 라우팅 트리 구축과정에서 교환하는 정방향과 역방향의 패킷에 LTS(Lightweight Time Synchronization) 알고리즘 연산에 필요한 시간정보를 추가하여 플러딩 라우팅 트리 구축 알고리즘과 시간 동기화 과정을 결합한 알고리즘을 제안한다. 또한 일정한 라운드 시간을 사용하여 클럭 휨으로 인한 시간 오류를 보정하였다. 제안하는 알고리즘이 TPSN(Timing-sync Protocol for Sensor Networks) 방식보다 적은 에너지를 사용하고 센서 노드들 간의 시간을 더욱 정교하게 동기화한다는 것을 NS2 시뮬레이터를 통해서 증명하였다.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.279-286
• /
• 2011

This paper proposes techniques for wireless sensor network routing algorithm with small routing traffics. It reduces routing traffic by gathering routing messages for fixed duration of time and the routing message for the configuration result is sent once. The routing traffic gathering technique has disadvantage of longer network configuration time. To overcome this, first one or first few routing messages are delivered immediately and later routing messages are gathered for fixed duration of time. The proposed scheme was modelled and implemented in Qualnet simulator using C language. Experimental results show that the proposed techniques are effective for reducing routing traffics.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.753-760
• /
• 2017

In this paper, we propose a new method to improve the performance of a Quorum-based NDP (Neighbor Discovery Protocol) in heterogeneous wireless sensor networks. It creates a new set of discovery schedules by combining two different Quorum-based matrices. The original Quorum-based schedule guarantees only two overlapping active slots with a cycle, but the newly created matrix greatly increases the chance of neighbor discovery. Therefore, although the size of the combined matrix of the proposed method increases, the number of discovery chances with neighboring nodes considerably increases, and the new approach is superior to the original Quorum-based neighbor node discovery protocol. In this study, we compares the performance of the proposed method to the Quorum-based protocols such as SearchLight and Hedis using TOSSIM. We assume all sensor nodes operates in a different duty cycle in the experiment. The experimental results show that the proposed algorithm is superior to other Quorum-based methods.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.1-15
• /
• 2010

The damage of safety accidents at home can be minimized by preventing accidents in advance as well as by coping with the accidents promptly through the help of safety management system. In this paper, we identify several services to prevent and cope with the accidents that may occur at home by leveraging sensors and wireless network technology available at home network environments. In order to provide these services, we propose a context-aware system for safety management at home. The proposed system awares the dangerous situations through the information collected by the sensors in home network environment. The proposed system tries to not only prevent the accidents but also to cope with the situations using the information of rescue targets and the location where the accident occurs. We evaluate the appropriateness of sensors by implementing the proposed environments. Through OPNET simulation experiments, we also measure the amount of network traffic in order to confirm that the bandwidth of IEEE 802.15.4 is enough for the proposed system. Finally, we determine more appropriate wireless data transmission mechanism with respect to the end-to-end delay and battery consumption for the proposed system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.75-82
• /
• 2007

This paper proposes the way that reduces power consumption of the IEEE 802.15.4-based sensor network. To reduce power consumption, we consider following two schemes; first scheme is the Adaptive Beacon Interval Control. The next is the Adaptive Superframe Duration Control. Our results show that these guarantee reducing power consumption in ns-2 simulator.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.7
• /
• pp.740-748
• /
• 2016

IT and communication technologies has contributed significantly to the convenience of passengers and the financial management of stations in accordance with the task automation in the field of the urban railway system. The foundation of the above development is based on the large amounts of data from various sensors installed in railways, trains, and stations. In particular, the sensor network that is installed in the station and train has played an important role in the railway information system. The performance of AP is affected by the number of APs and their locations installed in the station. In the installation of APs in stations, the intensity of the radio wave of the AP on its underlying position is considered to determine the number and position of APs. This paper proposes a method to estimate the number of APs and their position based on the structure of the underlying station and implemented a simulator to simulate the performance of the proposed method. The implemented simulator was applied to the decision of AP installation at Busan Seomyeon station to evaluate its performance.