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

Zigbee 센서 네트워크에서는 multihop 전송을 위하여 tree topology와 beacon-enabled 네트워크 구성을 갖는다. 이러한 multihop beaconing 네트워크의 목적은 routing 노드들에게 Sleep할 기회를 주어 파워의 소모를 줄이고자 하는 데 있다. 파워의 소모를 줄이고 beacon 전송시의 충돌을 방지하기 위하여 beacon 전송 스케줄링이 필요한데 본 논문은 multihop을 지원하고 에너지 효율에 효과적인 beacon 전송 스케줄링 알고리즘과 이를 바탕으로 에너지 효율적인 라우팅 기법을 제안한다. 본 제안은 Zigbee coordinator의 beacon interval(BI)이 결정되면 네트워크 내의 beacon을 전송하는 모든 노드들은 Zigbee coordinator의 BI를 알고 모든 노드의 superframe duration(SD)은 동일하다고 가정한다. 이러한 가정하에서 beacon을 전송하는 노드들이 Zigbee coordinator의 BI 구간 중 항상 정해진 시간에 자신의 beacon을 전송한다면 beacon의 충돌을 막을 수 있음을 보여 준다. 또한 노드들이 서로의 beacon 전송 시간을 알 수 있기 때문에 목적지 노드의 beacon을 tracking하지 않고도 목적지 노드가 active 되는 시점에 패킷을 전송하면 에너지 측면에서 좀 더 효율적인 라우팅 기반을 제공한다는 것을 보여 준다.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.219-228
• /
• 2007

End-to-end path setup and maintenance are very important for mobile ad-hoc wireless communications, because of the mobility and the limited battery capacity of the nodes in the networks. the AODV routing protocol is the one of mary proposed protocols. However, there are route failure problem with the Proposed protocols between intermediate nodes due to such mobility and exhausted battery characteristics, and this is because only the shortest hop count is considered for the route setup. If route failure happens. Problem such as the waste of bandwidth and the increment of the energy consumption occur because of the discarding data packets in the intermediate nodes and the path re-setup process required by the source node. In addition, it obviously causes the network lifetime to be shortened. This paper proposes a routing protocol based on the AODV routing protocol that it makes use of the remaining energy, signal strength and SNR of the MAC layer resources to setup a path.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.531-532
• /
• 2009

위치기반 라우팅 기법들은 소스에서 목적지노드로 데이터 패킷을 전송하기 위한 목적으로 널리 사용된다. 오리지널 그리디 포워딩 기법은 실제 무선링크의 신뢰성을 고려하지 않아 수많은 데이터 패킷 재전송이 발생한다. 이러한 문제를 해결하기 위해 PRR ${\times}$ Distance 기법이 제안되었지만 실제 무선링크의 비대칭성을 고려하지 않아 여전히 많은 재전송이 발생한다. 제안기법은 포워딩할 데이터 패킷을 가진 현재 노드의 전송 반경 내에서 전송 가능한 1-hop과 2-hop 라우팅 경로를 찾는다. 이들 라우팅 경로들 중 기대전송비용이 최소가 되는 경로를 선택하여 데이터와 ACK 패킷을 전송한다. 시뮬레이션을 결과를 통해 제안기법이 기존 기법들보다 높은 신뢰성과 에너지 효율을 가짐을 보인다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.4
• /
• pp.155-162
• /
• 2013

Routing protocol in ad hoc mobile networking has been an active research area in recent years. However, the environments of ad hoc network tend to have vulnerable points from attacks, because ad hoc mobile network is a kind of wireless network without centralized authentication or fixed network infrastructure such as base stations. Also, existing routing protocols that are effective in a wired network become inapplicable in ad hoc mobile networks. To address these issues, several secure routing protocols have been proposed: SAODV and SRPTES. Even though our protocols are intensified security of networks than existing protocols, they can not deal fluidly with frequent changing of wireless environment. Moreover, demerits in energy efficiency are detected because they concentrated only safety routing. In this paper, we propose an energy efficient secure routing protocol for various ad hoc mobile environment. First of all, we provide that the nodes distribute security information to reliable nodes for secure routing. The nodes constitute tree-structured with around nodes for token escrow, this action will protect invasion of malicious node through hiding security information. Next, we propose multi-path routing based security level for protection from dropping attack of malicious node, then networks will prevent data from unexpected packet loss. As a result, this algorithm enhances packet delivery ratio in network environment which has some malicious nodes, and a life time of entire network is extended through consuming energy evenly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.9
• /
• pp.620-628
• /
• 2014

Various on-demand manner routing protocols have been proposed for efficient energy consumption in mobile ad-hoc networks. Some of the protocols tried to extend the network lifetime by periodically rerouting paths according to the energy consumption rate of nodes. However, those protocols suffer from frequent flooding and high overhead. This paper proposed a new routing protocol called ALPMR (Adaptive Local Path Modification Routing) that extends the network lifetime by using local path rerouting. The proposed ALPMR protocol performs local rerouting around nodes with little remaining energy as well as data congestion, thus reduces flooding and routing overhead and can extend the network lifetime. The performance of ALPMR protocol is observed using ns-2 simulator.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.308-310
• /
• 2012

최근 무선 센서 네트워크 환경에서 대용량 멀티미디어 데이터에 대한 요구가 증가하면서 통신 대역폭 및 한정적인 에너지의 한계를 극복하기 위한 대안으로 데이터 분할 및 다중 경로 기법들이 제안되었다. 기존 기법들은 데이터 전송 시에 발생하는 부하의 분산을 통해 네트워크의 성능을 향상시킬 수 있다는 것을 증명하였지만, 데이터의 효율적인 분할과 악의적인 공격에 의한 보안성 문제에 대해서 고려하지 않았다. 이러한 문제점을 해결하기 위해 본 논문에서는 비트평면 분할 기반의 보안성 있는 비-중첩 다중경로 라우팅 기법을 제안한다. 제안하는 기법은 멀티미디어 데이터를 비트평면 단위로 분할하여 다중 경로로 전송함으로써 기존의 키 기반의 암호화 기법을 사용하지 않고도 전체 네트워크에 대한 보안성을 향상 시켰다. 또한 경로 상 노드들의 잔여 에너지를 고려하여 데이터 전송을 수행함으로써 전체 네트워크의 에너지 효율성을 향상시켰다. 성능평가 결과, 제안하는 기법은 기존 기법에 비해 노드의 생존율이 평균 50% 이상 향상되었고, 데이터가 노출되더라도 해당 패킷을 가지고 본래 이미지를 복구하는 것이 불가능하기 때문에 높은 보안성을 제공한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.3
• /
• pp.101-109
• /
• 2011

In this paper, we present a new routing protocol, multipath and multi-priority based routing protocol, (MMRP) for wireless multimedia sensor networks. The proposed MMRP chooses the multiple routing paths from source to the sink, then the selected paths are assigned with different priority levels depending upon the residual energy and transmission delay in the routing paths. That is, the highly prioritized I frames of the MPEG video are transmitted over the high priority routing paths, and other P and B frames are transmitted over the lower priority routing paths. The proposed MMRP protocol can be applied to time critical applications which require both lower latency and low power consumption over wireless multimedia sensor network. Simulations results of MMRP protocol show respectively an improvement of 23.48% and 23.11% in energy conservation and 81.6% and 32.01% improvement in latency as compared to protocols without and with multipath routing.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.8
• /
• pp.59-64
• /
• 2009

This paper is intended to study how well the routing protocol supplied in wireless mesh networks can evade interference path along the applied routing metric. Wireless mesh networks, unlike existing network techniques, has the characteristics that node movement is less and energy effect is limited. Therefore. this type of network requires path configuring technique to reflect such network characteristics and new routing metric to determine proper path. Routing metric proposed recently is designed to produce link quality accurately, but it configures path not considering the traffic situation of adjacent nodes. Thus. this technique has the problems of reduced transfer rate and delay between terminals occurring due to frequent traffic chaos by the interference of adjacent nodes. Therefore, this paper proposes metric that configures routing path by finding like metric that can transfer data effectively by considering the traffic situation of adjacent nodes. We confirmed through simulation that the proposed routing metric reduces the delay between terminals via the path that evades the traffic interference of adjacent node.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.165-172
• /
• 2011

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Directed Diffusion is a well known routing protocol. In this paper we adopt the clustering mechanism to improve the efficiency of Directed Diffusion. We introduce C-Directed Diffusion which make clusters, select the CH(Cluster Head) and CHs do the same process as in Directed Diffusion. C-Directed Diffusion is pretty simple and show better performance than Directed Diffusion.