Processing math: 100%
  • Title/Summary/Keyword: hop distance

Search Result 185, Processing Time 0.028 seconds

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

Energy Balancing Distribution Cluster With Hierarchical Routing In Sensor Networks (계층적 라우팅 경로를 제공하는 에너지 균등분포 클러스터 센서 네트워크)

  • Mary Wu
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.24 no.3
    • /
    • pp.166-171
    • /
    • 2023
  • Efficient energy management is a very important factor in sensor networks with limited resources, and cluster techniques have been studied a lot in this respect. However, a problem may occur in which energy use of the cluster header is concentrated, and when the cluster header is not evenly distributed over the entire area but concentrated in a specific area, the transmission distance of the cluster members may be large or very uneven. The transmission distance can be directly related to the problem of energy consumption. Since the energy of a specific node is quickly exhausted, the lifetime of the sensor network is shortened, and the efficiency of the entire sensor network is reduced. Thus, balanced energy consumption of sensor nodes is a very important research task. In this study, factors for balanced energy consumption by cluster headers and sensor nodes are analyzed, and a balancing distribution clustering method in which cluster headers are balanced distributed throughout the sensor network is proposed. The proposed cluster method uses multi-hop routing to reduce energy consumption of sensor nodes due to long-distance transmission. Existing multi-hop cluster studies sets up a multi-hop cluster path through a two-step process of cluster setup and routing path setup, whereas the proposed method establishes a hierarchical cluster routing path in the process of selecting cluster headers to minimize the overhead of control messages.

A Wireless Location-Based Routing Algorithm in Multi-User Game Environments

  • Lee, Jong-Min;Kim, Seong-Woo;Lee, Jung-Hwa
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1733-1740
    • /
    • 2007
  • In this paper, we propose a wireless location-based routing algorithm which uses the location information of its neighbor nodes and a destination node. At first, the proposed routing algorithm forwards a packet to the X direction by selecting a closest node to its destination as a next hop in terms of the X coordinate until the packet reaches closely to the packet's destination. Then the packet is forwarded to the Y direction by selecting a closest node to its destination in terms of the Y coordinate. We use a back off mechanism in case that a next hop cannot be found using the proposed routing algorithm, which resolves loops while forwarding. The experimental results show that the proposed routing algorithm performs well like the existing routing algorithms Ad hoc On-demand Distance Vector and Greedy Perimeter Stateless Routing. It is expected to use the proposed routing algorithm in the digital battlefield of military environments and survival games of commercial environments.

  • PDF

Power Efficient Multi-hop Routing Protocol in Cluster for Wireless Sensor Networks (무선 센서네트워크 환경에서의 효율적인 전력소비를 위한 라우팅 프로토콜)

  • Bae, Dae-Jin;Kim, Jong-Tae
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.22 no.2
    • /
    • pp.142-147
    • /
    • 2008
  • In wireless sensor networks, one of the most important issue is improvement of network lifetime with an efficient energy consumption. we repose effective multi-hop routing algorithm which increases the number of nodes alive at any time. In our algorithm we use the dynamic selection of cluster head and short distance transmission method. We simulated the proposed algorithm by using Network Simulator 2 and compared its performance with LEACH. The experimental result shows that the number of the nodes alive is increased up to 39.71[%] during the simulation time.

A Tree Scatternet Formation Algorithm for Reducing Average Hop Count Between Bluetooth Devices (블루투스 장치 간의 평균 홉 수를 줄이기 위한 트리 스캐터넷 형성 알고리즘)

  • Kang, Seung-Ho;Kang, Dae-Wook;Lim, Hyeong-Seok
    • The KIPS Transactions:PartC
    • /
    • v.11C no.3
    • /
    • pp.401-408
    • /
    • 2004
  • The Bluetooth Scatternet based on tree structure has several merits such as small numb of links and simple routing method. This paper proposes an algorithm which satisfies the constraints of Bluetooth Specification and forms the topology of scatternet as close as the tree structure that has the shortest average inter-node distance among trees. Also we show that the proposed method reduces the average hop count between any two devices compared to early works without higher formation delay by a simulation.

Optimum Logical Topology for WDM Networks

  • Nittayawan, Jittima;Runggeratigul, Suwan
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1371-1374
    • /
    • 2002
  • This paper compares four network con-figurations for using as the logical topology in multi- hop wavelength division multiplexing (WDM) networks. The regular network configurations studied in this paper axe ShuffleNet, de Bruijn graph, hypercube, and Man-hattan street network. Instead of using the weight mean hop distance of node placement problem for comparing optimum logical topology, we introduce a new objective function that includes h and the network cost. It can be seen that the network cost strongly depends on the logical topology selected for the implementation of the network. The objective of this paper is to find an optimum logical topology for WDM networks that gives low as well as low network cost.

  • PDF

A Reliable and Resilient Multipath Routing Algorithm In Wireless Ad-Hoc Network (애드 혹 무선 네트워크에서 복구 가능한 다중 경로 라우팅 알고리즘)

  • Lee, Chang-Joo;Kim, Doo-Young;Lee, Do-Hyeon;Jung, Jae-Il
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.205-206
    • /
    • 2006
  • In this paper, we have proposed an ad-hoc routing protocol named "RRMR (Reliable and Resilient Multipath Routing)" that is expanded from AODV to acquire multiple path at one time. This protocol needs less overhead to configure data routing paths and the paths are maintained to transmit data stably. To get these advantages, RRMR protocol is constructed by expanding from multipath acquiring and maintaining method based on distance vector method and hop-by-hop routing of AODV.

  • PDF

Efficient Forwarding Strategy with Expected Transmission Cost in Wireless Sensor Networks (무선센서네트워크 환경에서 기대전송비용을 이용한 효율적인 포워딩 기법)

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

Energy Efficient Routing Protocols based on LEACH in WSN Environment (WSN 환경에서 LEACH 기반 에너지 효율적인 라우팅 프로토콜)

  • Dae-Kyun Cho;Tae-Wook Kwon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.18 no.4
    • /
    • pp.609-616
    • /
    • 2023
  • In a wireless network environment, since sensors are not always connected to power, the life of a battery, which is an energy source supplied to sensors, is limited. Therefore, various studies have been conducted to extend the network life, and a layer-based routing protocol, LEACH(: Low-energy Adaptive Clustering Hierarchy), has emerged for efficient energy use. However, the LEACH protocol, which transmits fused data directly to the sink node, has a limitation in that it consumes as much energy as the square of the transmission distance when transmitting data. To improve these limitations, this paper proposes an algorithm that can minimize the transmission distance with multi-hop transmission where cluster heads are chained between cluster heads through relative distance calculation from sink nodes in every round.

A Design of ETWAD(Encapsulation and Tunneling Wormhole Attack Detection) based on Positional Information and Hop Counts on Ad-Hoc (애드 혹 네트워크에서 위치 정보와 홉 카운트 기반 ETWAD(Encapsulation and Tunneling Wormhole Attack Detection) 설계)

  • Lee, Byung-Kwan;Jeong, Eun-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.11
    • /
    • pp.73-81
    • /
    • 2012
  • This paper proposes an ETWAD(Encapsulation and Tunneling Wormhole Attack Detection) design based on positional information and hop count on Ad-Hoc Network. The ETWAD technique is designed for generating GAK(Group Authentication Key) to ascertain the node ID and group key within Ad-hoc Network and authenticating a member of Ad-hoc Network by appending it to RREQ and RREP. In addition, A GeoWAD algorithm detecting Encapsulation and Tunneling Wormhole Attack by using a hop count about the number of Hops within RREP message and a critical value about the distance between a source node S and a destination node D is also presented in ETWAD technique. Therefore, as this paper is estimated as the average probability of Wormhole Attack detection 91%and average FPR 4.4%, it improves the reliability and probability of Wormhole Attack Detection.