• Title/Summary/Keyword: information forwarding

Search Result 541, Processing Time 0.025 seconds

Application of GPSR Protocol for Countering Selective Forwarding Attacks in Sensor Networks (센서 네트워크에서 선택적 전달 공격 방어를 위한 GPSR 프로토콜 적용)

  • Moon, Soo Young;Lee, Minjung;Cho, Tae Ho
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2013.07a
    • /
    • pp.51-54
    • /
    • 2013
  • 센서 네트워크는 주변의 환경 정보를 수집하여 사용자에게 제공함으로써 지능적인 처리를 가능하게 하는 시스템이다. 센서 네트워크를 구성하는 센서 노드들은 메모리, 연산 능력, 에너지 등 자원 측면에서 제약을 갖고 있으며 무선 통신을 사용하므로 센서 네트워크 환경에서는 각종 보안 위협이 발생할 수 있다. 선택적 전달 공격에서 네트워크 내의 훼손 노드는 자신을 지나는 이벤트 보고서 중 전체 또는 일부를 제거함으로써 중요한 이벤트 정보가 싱크 노드까지 도달하지 못하도록 한다. 선택적 전달 공격을 방어하기 위한 기존 라우팅 기법은 많은 에너지 소비를 유발한다는 단점이 존재한다. 본 논문에서는 지형 기반의 라우팅 프로토콜인 Greedy Perimeter Stateless Routing (GPSR) 프로토콜을 기반으로 선택적 전달 공격 발생 지점을 우회할 수 있는 방법을 제안한다. 제안 기법은 선택적 전달 공격이 발생하는 환경에서 에너지 효율적으로 소스 노드에서 기지 노드까지 이벤트 보고서를 신뢰성 있게 전달하는데 활용될 수 있다.

  • PDF

Digital Signature Model of Sensor Network Using Hash Chain (해쉬체인을 이용한 센서네트워크의 디지털서명 모델)

  • Kim, Young-Soo;Cho, Seon-Goo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2459-2464
    • /
    • 2009
  • In sensor network there are no nodes or servers that are exclusively responsible for packet forwarding and routing. Instead, sensor nodes participating in network communications perform these activities. Thus, they are vulnerable to the alteration and forgery of message in the process of packet forwarding and routing. To solve this problem, a security to ensure authentication and integrity of routing and forwarding messages should be required. To do this, we propose the hash chain-based digital signature model where it takes less time to compute in generating and verifying the digital signature model, unlike he public key-based digital signature model, and verify if this model is proper by comparing computation times between tow models.

Efficient Energy and Position Aware Routing Protocol for Wireless Sensor Networks

  • Shivalingagowda, Chaya;Jayasree, P.V.Y;Sah, Dinesh.K.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.1929-1950
    • /
    • 2020
  • Reliable and secure data transmission in the application environment assisted by the wireless sensor network is one of the major challenges. Problem like blind forwarding and data inaccessibility affect the efficiency of overall infrastructure performance. This paper proposes routing protocol for forwarding and error recovery during packet loss. The same is achieved by energy and hops distance-based formulation of the routing mechanism. The reachability of the intermediate node to the source node is the major factor that helps in improving the lifetime of the network. On the other hand, intelligent hop selection increases the reliability over continuous data transmission. The number of hop count is factor of hop weight and available energy of the node. The comparison over the previous state of the art using QualNet-7.4 network simulator shows the effectiveness of proposed work in terms of overall energy conservation of network and reliable data delivery. The simulation results also show the elimination of blind forwarding and data inaccessibility.

PRI: A Practical Reputation-based Incentive Scheme for Delay Tolerant Networks

  • Zhang, Xi;Wang, Xiaofei;Liu, Anna;Zhang, Quan;Tang, Chaojing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.973-988
    • /
    • 2012
  • Delay tolerant networks (DTNs) characterized by the lack of guaranteed end-to-end paths exploit opportunistic data forwarding mechanism, which depends on the hypothesis that nodes are willing to store, carry, and forward the in-transit messages in an opportunistic way. However, this hypothesis might easily be violated by the presence of selfish nodes constrained with energy, bandwidth, and processing power. To address this problem, we propose a practical reputation-based incentive scheme, named PRI, to stimulate honest forwarding and discipline selfish behavior. A novel concept of successful forwarding credential and an observation protocol are presented to cope with the detection of nodes' behavior, and a reputation model is proposed to determine egoistic individuals. The simulation results demonstrate the effectiveness and practicality of our proposal.

Reduced-Pipelined Duty Cycle MAC Protocol (RP-MAC) for Wireless Sensor Network

  • Nguyen, Ngoc Minh;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2433-2452
    • /
    • 2017
  • Recently, the pipeline-forwarding has been proposed as a new technique to resolve the end-to-end latency problem of the duty-cycle MAC protocols in Wireless Sensor Networks (WSNs). Some protocols based on this technique such as PMAC and PRI-MAC have shown an improvement not only in terms of reducing end-to-end latency but also in terms of reducing power consumption. In these protocols, however, the sensor nodes still waste a significant amount of energy for unnecessary idle listening during contention period of upstream nodes to check the channel activity. This paper proposes a new pipeline-forwarding duty-cycle MAC protocol, named RP-MAC (Reduced Pipelined duty-cycle MAC), which tries to reduce the waste of energy. By taking advantage of ACK mechanism and shortening the handshaking procedure, RP-MAC minimizes the time for checking the channel and therefore reduces the energy consumption due to unnecessary idle listening. When comparing RP-MAC with the existing solution PRI-MAC and RMAC, our QualNet-based simulation results show a significant improvement in term of energy consumption.

Extended Design And Implementation of SIP Proxy Server or Improved Additional Internet Telephony Service (향상된 부가 서비스 지원을 위한 SIP 프락시 서버의 확장 설계 및 구현)

  • 민경주;이종화;강신각;박기식
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.11a
    • /
    • pp.875-879
    • /
    • 2002
  • CPL is a technique that serves various additional service in Internet telephony such as call forwarding, call blocking etc. IETF IPTEL working group developed this CPL standard. Users could request various additional services such as call forwarding, call blocking etc. by registering XML scripts to location servers. This paper would describe the design and the implementation skill of SIP proxy server that support these improved functionalities in detail. SIP registrar and SIP proxy server are designed and implemented in Linux platform because this platform serves fast and low cost development environment.

  • PDF

A Hexagon Tessellation Approach for the Transmission Energy Efficiency in Underwater Wireless Sensor Networks

  • Kim, Sung-Un;Cheon, Hyun-Soo;Seo, Sang-Bo;Song, Seung-Mi;Park, Seon-Yeong
    • Journal of Information Processing Systems
    • /
    • v.6 no.1
    • /
    • pp.53-66
    • /
    • 2010
  • The energy efficiency is a key design issue to improve the lifetime of the underwater sensor networks (UWSN) consisting of sensor nodes equipped with a small battery of limited energy resource. In this paper, we apply a hexagon tessellation with an ideal cell size to deploy the underwater sensor nodes for two-dimensional UWSN. Upon this setting, we propose an enhanced hybrid transmission method that forwards data packets in a mixed transmission way based on location dependent direct transmitting or uniform multi-hop forwarding. In order to select direct transmitting or uniform multi-hop forwarding, the proposed method applies the threshold annulus that is defined as the distance between the cluster head node and the base station (BS). Our simulation results show that the proposed method enhances the energy efficiency compared with the existing multi-hop forwarding methods and hybrid transmission methods

Efficient Forwarding Path Computing Method for Context-Awareness Mobility Prediction Model (상황인식 이동성 예측 모델에서의 효율적인 포워딩 경로 산출 기법)

  • Jeong, Rae-jin;Oh, Young-jun;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.93-95
    • /
    • 2014
  • In this paper, we proposed efficient forwarding path computing method using Context-Awareness Mobility Prediction Model. Context-Awareness Mobility Prediction Model is storing and classifying node's previous velocity and direction according to time in the hierarchical cluster structure. To overcome environment which node-to-node connection is broken off easily, the proposed algorithm calculate the connectivity formed matrix structure by comparing predicted velocity and direction, and use masking operation for selecting relay moving to destination. The proposed algorithm identified to show short delay by utilizing forwarding path which is continue node-to-node connection in the unstable situation.

  • PDF

A Mobile Multicast Routing Mechanism based on the Comparison of Tree Reconstruction Cost and Tunneling Cost (트리 재구성 비용과 터널링 비용의 비교에 근거한 모바일 멀티캐스트 라우팅 기법)

  • Kim Jae-Soo;Baek Deuk-Hwa
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.17-26
    • /
    • 2004
  • Mobile multicast schemes are classified into remote subscription and bi-directional tunneling. While the former scheme has much overhead in the maintenances of multicast tree, the latter suffers from inefficient routing. In this paper, we propose dynamic mobile multicast routing (DMMR) scheme, which is operated on the basis of cost functions related with forwarding cost and tree reconstruction cost, Basically DMMR intends to find lower cost between forwarding cost and tree reconstruction cost. Forwarding cost is the cost of tunneling multicast packets from home agent, and tree reconstruction cost is the joining cost of foreign agent to multicast group. In the case that a mobile host moves to the other area, its foreign agent calculates cost functions related with forwarding cost and tree reconstruction cost. If forwarding cost is higher than tree reconstruction cost, foreign agent joins to multicast group and reconstructs the multicast tree. Accordingly, foreign agent can dynamically adapt remote subscription or bi-directional tunneling, Our scheme provides more stable multicast service to the mobile hosts regardless of the movements of mobile host and the number of mobile group members.

  • PDF

Tunnel-Free Scheme Using a Routing Table in a PMIPv6-Based Nested NEMO Environment

  • Wie, Sunghong;Jang, Jaeshin
    • 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.