• Title/Summary/Keyword: HOPS

Search Result 221, Processing Time 0.023 seconds

Fuzzy Logic based Next Hop Node Selection Method for Energy Efficient PVFS in WSN (무선 센서 네트워크에서 확률적 투표 기반 여과 기법의 에너지 효율성을 위한 퍼지 로직 시스템 기반의 다음 이웃 노드 선택 기법)

  • Lee, Jae Kwan;Nam, Su Man;Cho, Tae Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.23 no.2
    • /
    • pp.65-72
    • /
    • 2014
  • Sensor nodes are easily compromised by attacker when which are divided in open environment. The attacker may inject false report and false vote attack through compromised sensor node. These attacks interrupt to transmission legitimate report or the energy of sensor node is exhausted. PVFS are proposed by Li and Wu for countermeasure in two attacks. The scheme use inefficiency to energy of sensor node as fixed report threshold and verification node. In this paper, our propose the next neighbor node selection scheme based on fuzzy logic system for energy improvement of PVFS. The parameter of fuzzy logic system are energy, hops, verification success count, CH select high the next neighbor node among neighbor nodes of two as deduction based on fuzzy logic system. In the experimental, our proposed scheme was improvement to energy of about 9% compare to PVFS.

Optimization of Coverage Extension in OFDMA Based MMR System (OFDMA 방식을 사용하는 MMR시스템의 최적화된 커버리지 확장)

  • Kim, Seung-Yeon;Kim, Se-Jin;Ryu, Seung-Wan;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.567-574
    • /
    • 2008
  • In this paper, we propose an optimal coverage extension scheme in the OFDMA based mobile multi-hop relay system. First, we propose an optimal frequency and time assignment scheme for maximizing system throughput and analyze the frame efficiency of schemes. Then, under the given BS capacity, we find the maximum number of relay hops that can be used to estimate the maximum coverage area of a BS in a multi-hop relay system. Analytical results show that the proposed scheme is efficient in coverage extension and throughput maximization in OFDMA based multi-hop relay system. Our work may be a rough guideline to control the parameters for multi-hop relay system optimization.

Virtual Topology Control System for Evaluating Semi-infrastructured Wireless Community Networks (준-인프라 기반 무선 커뮤니티 네트워크 시험을 위한 가상 토폴로지 제어 시스템)

  • Kang, Nam-Hi;Kim, Young-Han
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.1
    • /
    • pp.275-281
    • /
    • 2012
  • Community network is a communication environment where heterogeneous devices can access and communicate with each other at any time and at any space to share information. To do so, mobile devices are required to be self-configured even in absence of communication infrastructures. Semi-infrastructured wireless ad-hoc network is a promising solution to meet with such a requirement. This paper proposes the VTC(virtual topology coordinator) system as an evaluation tool for examining network protocols that are intended to be deployed in the semi-infrastructured ad-hoc networks. VTC emulates multi-hops wireless network topology virtually using a mechanism of selective receiving MAC frame in a small area, where only a single hop communication is available. VTC system cannot consider all properties introduced in real wireless network, but do more wireless properties than verification through simulation.

A Study on the Link Cost Estimation for Data Reliability in Wireless Sensor Network (무선 센서 네트워크에서 데이터 신뢰성을 위한 링크 비용 산출 방안에 관한 연구)

  • Lee, Dae-hee;Cho, Kyoung-woo;Kang, Chul-gyu;Oh, Chang-heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.571-573
    • /
    • 2018
  • Wireless sensor networks have unbalanced energy consumption due to the convergence structure in which data is concentrated to sink nodes. To solve this problem, in the previous research, the relay node was placed between the source node and the sink node to merge the data before being concentrated to the sink node. However, selecting a relay node that does not consider the link quality causes packet loss according to the link quality of the reconfigured routing path. Therefore, in this paper, we propose a link cost calculation method for data reliability in routing path reconfiguration for relay node selection. We propose a link cost estimation formula considering the number of hops and RSSI as the routing metric value and select the RSSI threshold value through the packet transmission experiment between the sensor modules.

  • PDF

Hop Based Gossiping Protocol (HoGoP) for Broadcasting Message Services in Wireless Sensor Networks (무선 센서 망에서 브로드캐스팅 메시지 서비스를 위한 홉 기반 가십 프로토콜)

  • So, Won-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1B
    • /
    • pp.144-153
    • /
    • 2010
  • Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

A Locality based Resource Management Scheme for Hierarchical P2P Overlay Network in Ubiquitous Computing (계층적 P2P에서의 근거리 기반 효율적 자원관리 기법)

  • Hong, Chung-Pyo;Kim, Cheong-Ghil;Kim, Shin-Dug
    • Journal of Digital Contents Society
    • /
    • v.14 no.1
    • /
    • pp.89-95
    • /
    • 2013
  • Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 13% compared with JXTA and 69% compared with Chord. It can decrease the discovery routing distance by 17% compared with JXTA and 83% compared with Chord depending on the environment.

A multi carrier selectable routing scheme by normalized transmission characteristics (MCS-NTC) at marine multi-carrier MANETs (다중캐리어 해상 MANET에서 여러 캐리어 선택가능하고 정규화된 전송특성에 의한 경로배정방식)

  • Son, Jooyoung
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.37 no.2
    • /
    • pp.199-204
    • /
    • 2013
  • Marine data communications still look for a novel data communication system at sea because of the restriction of bandwidths and costs of current carriers. In order to make the most efficient use of the broadband land carriers at sea, this paper proposes a routing scheme (MCS-NTC) at a marine MANET model. The routing scheme optimizes the route by choosing optimal nodes and carriers among the traditional and land carriers based on normalized transmission characteristics of applications and carriers. The performance is compared with the max-win method (OMH-MW) scheme considering the specific values of transmission characteristics. The result shows that our scheme derives more efficient routes than the previous one in terms of the transmission characteristics such as bandwidth, cost, delay, the number of hops and carriers.

A Study on Performance of Content Store Replacement Algorithms over Vehicular CCN (VCCN에서 Content Store 교체 알고리즘의 성능에 관한 연구)

  • Choi, Jong-In;Kang, Seung-Seok
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.1
    • /
    • pp.495-500
    • /
    • 2020
  • VANET (Vehicular Ad Hoc Network), an example of an ad hoc vehicular networks, becomes one of the popular research areas together with the self-driving cars and the connected cars. In terms of the VANET implementation, the traditional TCP/IP protocol stack could be applied to VANET. Recently, CCN (Content Centric Networking) shows better possibility to apply to VANET, called VCCN (VANET over CCN). CCN maintains several data tables including CS (Content Store) which keeps track of the currently requested content segments. When the CS becomes full and new content should be stored in CS, a replacement algorithm is needed. This paper compares and contrasts four replacement algorithms. In addition, it analyzes the transmission characteristics in diverse network conditions. According to the simulation results, LRU replacement algorithm shows better performances than the remaining three algorithms. In addition, even the size of CS is small, the network maintains a reasonable transmission performance. As the CS size becomes larger, the transmission rate increases proportionally. The transmission performance decreases when the network is crowded as well as the number of transmission hops becomes large.

A Method to Improve Energy Efficiency Using a Function that Evaluate the Probability of Attempts to Verify a Report at Intermediate Node in USN (USN에서 중간 노드에서의 보고서 검증 시도 확률 평가 함수를 이용한 에너지 효율 향상 기법)

  • Lee, Hyun-Woo;Moon, Soo-Young;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.21-29
    • /
    • 2011
  • Wireless sensor nodes operate in open environments. The deployed sensor nodes are very vulnerable to physical attacks from outside. Attackers compromise some sensor nodes. The compromised nodes by attackers can lead to false data injection into sensor networks. These attacks deplete the limited energy of sensor nodes. Ye et al. proposed the Statistical En-Route Filtering (SEF) as a countermeasure of the attacks. The sensor node in SEF examines the event reports based on certain uniform probability. Thus, the same energies are consumed in both legitimate reports and false reports. In this paper, we propose a method that each node controls the probability of attempts to verify a report to reduce energy consumption of sensor nodes. The probability is determined in consideration of the remaining energy of the node, the number of hops from the node to SINK node, the ratio of false reports. the proposed method can have security which is similar with SEF and consumes lower energy than SEF.

A Study on ZigBee-Based Routing Algorithm (스마트그리드를 위한 지그비 기반의 라우팅 알고리즘에 관한 연구)

  • Kang, Hyung-Seok;Im, Song-Bin;Oh, Young-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.12
    • /
    • pp.137-148
    • /
    • 2012
  • In this paper, we proposed the location-aware coordinate routing algorithm for improving the performance of routing algorithm by using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm that has wasted in address space. The x, y and z coordinate axes from divided address space of 16 bit to solve this problems. However, coordinate routing does not take account of wireless link condition. If wiress link condition is not considered, when the routing table is updated, the nodes with bad link conditions are updated in the routing table and can be chosen as the next hop. This brings out the retransmissions because of received packet's errors. Also, because of these retransmissions, additional power is consumed. In this paper, we propose the location-aware coordinate routing algorithm considering wiress link condition, where reliable data transmission is made and the consumed enegy is minimize. and we compared and connected region and transition region of ZigBee location based routing in the aspect of average number of multi hops, subordinate packet delivery ratio, delay time, and energy consumption of proposed algorithm. It turned out that there were improvements in performances of each items.