• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.82-94
• /
• 2013

In this paper, we propose a novel tunnel-free scheme in a proxy mobile IPv6 (PMIPv6)-based nested network mobility environment; several mobile nodes (MNs) and mobile routers (MRs) compose a hierarchical wireless network topology. Because tunnels created by several MRs overlap and data packets travel along several local mobility anchors (LMAs), the utilization of the wireless section is reduced and the packet forwarding path of the wire-line section is not optimal. In our tunnel-free scheme, the mobile access gateway (MAG) plays an important role in both the wireless and wire-line sections. Using a local binding update, this tunnel-free scheme forwards data packets with a host-based routing table without any tunnel. Establishing a direct tunnel between the MAG and the last LMA, this scheme removes nested tunnels between intermediate LMAs and MRs, and optimizes the forwarding path to the MN in the wire-line section.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.143-144
• /
• 2007

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.684-684
• /
• 2006

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2006.07a
• /
• pp.338-338
• /
• 2006

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.510-513
• /
• 2010

In hierarchical wireless sensor network, Sensor nodes forming a cluster with a hierarchy. And there are being study for balanced energy consumption between cluster nodes. When forming network routing path, if there are configured incorrectly then it can be wasting energy. In this paper to solve these problem, We propose that it can consider sensor's communication range to create minimum hop layer when cluster heads configure routing path.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.47-50
• /
• 2010

본 논문은 현재 경찰청 및 각 지자체의 주도하에 수도권을 중심으로 새롭게 보급되고 있는 도시 교통 정보 시스템 (UTIS)과 국토해양부 및 한국 도로 공사 등을 중심으로 한 DSRC 기반의 교통 정보 시스템을 모두 활용하는 시스템 및 효율적인 경로탐색 알고리즘을 제안한다. 도시 교통 정보 시스템은 무선랜과 같은 프로토콜을 이용해서, 기존 단방향 방식인 TPEG의 주요 도로 위주의 제한된 교통 정보 단점을 극복하고 많은 지선를 포함한 교통 정보를 제공하고 있다. 그러나 대부분의 운전자들이 단지 도심 내에서만 운전하는 것이 아니고 고속도로 등을 통해서 장거리 운전도 하기 때문에 고속도로 상의 DSRC 기반의 서비스도 동일 단말에서 지원해야 하나의 단말에서 다양한 서비스를 지원받을 수 있다. 따라서 본 논문의 두 개의 다른 통신 모듈의 통합된 단말 시스템을 제안하고 기존에 제안된 UTIS 기반의 분산 경로 탐색 방식을 DSRC 기반의 고속도로 교통 정보를 활용해서 새로운 경로탐색 알고리즘을 제안한다. 또한 향후 추가적으로 이루어질 연구와 현재 다른 주체들의 주도로 이루어지는 서비스를 제도적으로 보완할 수 있는 방안도 제시한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.125-135
• /
• 2010

Recently, the problem of global warming has issued seriously, so Green IT(Information Technology) using RFID/USN is concerned in order to solve environmental problems. In this paper, we implemented that public area like an underground parking lot could reduce unnecessary energy consumption used by lighting control system based on Ubiquitous Sensor Networks. The lighting control system for underground parking lot is comprised of intersection nodes for watching cars enter and leave, and light node for controlling light. It applies the routing protocol based on hierarchical cluster, hierarchical addressing method, and probability filtering method for the specific place like an underground parking lot. The result after experiments shows that the lighting control system could decrease electrical energy consumption to around 61.7%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1113-1119
• /
• 2008

In IP-USN for replacing the sensor network based on Zigbee by IP-based it, routing and the address assignment technique for sensor node are important focuses. But, there is a weak point in existing hierarchical routings. It is that all paths must be searched because the end node isn't considered. And the end node based muting is not sufficient in the mobile sensor network environment because it supports the only simple-path-search. Hereupon, this thesis suggests ComHRP(Complement HRP) that have the only merits of existing methods. The address assignment technique and search method are also proposed. ComHRP simplifies the organization of sensor networks and reduces network complexity. Also, It can efficiently deal with restructuring networks for the unpredictable ubiquitous sensor network feature.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.2
• /
• pp.370-376
• /
• 2009

Recently, Study for routing protocol is gone vigorously in the Ubiquitous Sensor Network. A hierarchical routing protocol is being practical and received interest among them. Therefore we analyze a weak point of HEED. And I suggest the new protocol that solved a weak point of HEED. The new protocol that we propose puts weight in the energy remainder amount than HEED and elect CH. And elected CH is designed to change by new node when quantity of energy leftover becomes less than 50%. Therefore all nodes come to use energy fairly. The protocol that we proposed can prove the cluster survival rate about 30%. And CH is more effective because when elect CH replace, response time selects small node.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.180-190
• /
• 2011

Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.