• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.39-47
• /
• 2010

In Wireless Sensor Network, transmission errors are frequently occurred due to the node failure, battery discharge, and interference by objects. Although Directed Diffusion has been considered as a prominent Data-centric routing algorithm, it revealed some weaknesses at this kind of unexpected network errors. In order to address the problem, we proposed a radio-aware routing algorithm for improving reliability of Directed Diffusion in Wireless Sensor Networks. The proposed algorithm is aware of the network status based on the radio information of MAC and PHY layers using a cross-layer approach. The link quality and the node failure information from the acquired network status were used to decide an alternative path to provide a reliable data transmission in error-prone sensor networks. The proposed algorithm showed its effectiveness of the data delivery rate and data ratio with several simulations consisting of various error rates and the number of nodes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.887-898
• /
• 2009

Conventional routing protocols proposed for wireless sensor networks (WSNs) cannot fully accommodate the characteristics of WSNs. In particular, although it is possible to largely obtain benefits in the solution of energy consumption and global identification problems through applying position information, there are few protocols that actively apply such position information. In the case of geographical and energy aware routing (GEAR) that is a typical algorithm, which uses position information, it does not fully represent the characteristics of WSNs because it is limited to forward query messages and assumed as fixed network environments. The routing protocols proposed in this paper defines the direction of data, which is routed based on the position information of individual and target nodes, in which each node configures its next hop based on this direction and routes signals. Because it performs data-centric routing using position information, it does not require certain global identifications in order to verify individual nodes and is able to avoid unnecessary energy consumption due to the forwarding of packets by defining its direction.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.12
• /
• pp.319-328
• /
• 2021

With popularization of services for massive content, the fundamental limitations of TCP/IP networking were discussed and a new paradigm called Information-centric networking (ICN) was presented. In ICN, content is addressed by the content identifier (content name) instead of the location identifier such as IP address, and network nodes can use the cache to store content in transit to directly service subsequent user requests. As the user request can be serviced from nearby network caches rather than from far-located content servers, advantages such as reduced service latency, efficient usage of network bandwidth, and service scalability have been introduced. However, these advantages are determined by how actively content stored in the cache can be utilized. In this paper, we 1) introduce content access schemes in Named-data networking, one of the representative ICN architectures; 2) in particular, review the schemes that allow access to cached content away from routing paths; 3) conduct comparative study on the performance of the schemes using the ndnSIM simulator.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1126-1132
• /
• 2012

To enhance network efficiency, CCN allow intermediate network nodes between a content consumer and a content publisher to temporarily cache transmitted contents. Then the network nodes immediately return back the cached contents to another consumers when the nodes receives relevant contents request messages from the consumers. For that, CCN utilizes hierarchical content names to forward a request message as well as a response message. However, such content names semantically contain much information about domain/user as well as content itself. So it is possible to invade users' privacy. In this paper, we first review both the problem of CCN name in the view point of privacy and proposed schemes. Then we propose an improved name management scheme for users' privacy preservation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1505-1510
• /
• 2008

In large-scale wireless sensor networks, the deployed nodes cannot be replaced or recharged after first deployment. Also, dead nodes maγ lead to the partition of whole networks. While performing data dissemination under a battery power constraint, energy efficiency is a key design factor of routing protocol. As a solution for the efficient data dissemination, in this paper, we propose a protocol namely Hierarchical Data Dissemination (HDD) which provides scalable and efficient data delivery to multiple sources and mobile sinks. HDD uses the facts that sink nodes are central gathering Points and source-centric data forwarding paths are constructed and it is maintained with two-tier communications. The performance of HDD is compared with TTDD about the energy consumption, data delivery time and data success ration. The extensive simulation results show that HDD Routing Protocol outperforms TIDD by more than $1.5{\sim}3times$ on energy consumption.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.259-266
• /
• 2005

Recently data centric routing or application dependent routing protocols are emerged in mobile ad hoc networks. In this paper, we propose a routing method for query processing in MANET(Mobile Ad hoc NETwork) environment, called road-based query routing, with consideration on real time traffic information of large number of vehicles. In particular, we focus on the method that process arrival time dependent shortest path query in MANET without a central server on the road networks. The main idea of our approach lies in a routing message that includes query predicates based on the road connectivity and on data gathering method in real time from vehicles on the road by ad-hoc network. We unify route discovery phase and data delivery(query processing) phase in our mechanism and reduce unnecessary flooding messages by pruning mobile nodes which are not on the same or neighboring road segments. In order to evaluate the performances of the proposed method, we established a model of road networks and mobile nodes which travel along the roads. The measurement factor is the number of nodes to whom route request is propagated according to each pruning strategy. Simulation result shows that road information is a dominant factor to reduce the number of messages.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.621-624
• /
• 2006

무선 센서 네트워크는 기존의 무선 통신 기술로는 구현 불가능했던 다양한 응용 기술의 실현을 가능케 할 것으로 기대되고 있다. 이를 위해 제한된 자원의 효율적인 사용을 통한 무선 센서 네트워크의 성능 향상에 대한 연구가 지속되고 있으며 네트워크 계층에 있어서는 에너지 효율적인 라우팅 알고리즘에 대한 연구가 활발히 진행되고 있다. 본 논문에서는 데이터 중심(data-centric) 멀티 홉(multi-hop) 평면 라우팅 알고리즘에 최적화 알고리즘의 하나인 Ant Colony Optimization을 적용한 에너지 효율적인 라우팅 알고리즘을 제안한다. 시뮬레이션 결과, 제안한 알고리즘은 기존의 알고리즘에 비해 데이터 전송 지연 시간을 줄였을 뿐만 아니라, 경로 선택 및 유지에 필요한 제어 메시지 최소화를 통해 에너지 소모를 줄여 데이터 전송량의 증가를 가능케 했다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.6
• /
• pp.1657-1673
• /
• 2023

With the advancement of information technology, criminals employ multiple cyberspaces to promote cybercrime. To combat cybercrime and cyber dangers, banks and financial institutions use artificial intelligence (AI). AI technologies assist the banking sector to develop and grow in many ways. Transparency and explanation of AI's ability are required to preserve trust. Deep learning protects client behavior and interest data. Deep learning techniques may anticipate cyber-attack behavior, allowing for secure banking transactions. This proposed approach is based on a user-centric design that safeguards people's private data over banking. Here, initially, the attack data can be generated over banking transactions. Routing is done for the configuration of the nodes. Then, the obtained data can be preprocessed for removing the errors. Followed by hierarchical network feature extraction can be used to identify the abnormal features related to the attack. Finally, the user data can be protected and the malicious attack in the transmission route can be identified by using the Wrapper stepwise ResNet classifier. The proposed work outperforms other techniques in terms of attack detection and accuracy, and the findings are depicted in the graphical format by employing the Python tool.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.858-863
• /
• 2005

Sensor network is subject to novel problems and constraints because it is composed of thousands of tiny devices with very limited resources. The large number of motes in a sensor network means that there will be some failing nodes owing to the lack of battery in sensor nodes. Therefore, it is imperative to save the energy as much as possible. In this work, we propose energy efficient routing algorithm which is based on directed diffusion scheme. In the proposed scheme, some overloads required for reinforcing the gradient path can be effectively eliminated. Furthermore, in order to verify the usefulness of the proposed algorithm, several simulations are executed.