• Title/Summary/Keyword: power-based routing

Search Result 240, Processing Time 0.031 seconds

Geographic and Energy Aware Geocasting in Ad-Hoc Networks (Ad-Hoc 네트워크에서 위치와 에너지를 고려한 지오캐스팅 알고리즘)

  • Lee Ju-Young
    • Journal of Internet Computing and Services
    • /
    • v.5 no.2
    • /
    • pp.75-84
    • /
    • 2004
  • Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

  • PDF

Dynamic Routing and Wavelength Assignment Algorithm to Improve Energy Efficiency in IP over WDM Network with Multifiber (다중 광섬유 링크를 갖는 IP over WDM 망에서 에너지 효율 향상을 위한 동적 경로 배정 및 파장 할당 알고리즘)

  • Lee, Ki-Beom;Kang, Keun-Young;Kim, Do Young;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.4
    • /
    • pp.370-379
    • /
    • 2014
  • Recently, the interest in optical network with multifiber link is continuing to rise since the network traffic has been growing exponentially. However, growing traffic in network leads to increasing the energy consumption of the network equipment. In this paper, we propose a dynamic routing and wavelength assignment (RWA) algorithm based on V-like cost function and layered graph to improve energy efficiency in IP over WDM network with multifiber link. The V-like cost function is used to decide the fiber cost according to the number of used wavelengths. The layered graph with multifiber link is used to select the energy efficient route and wavelength. The proposed RWA algorithm is compared and analyzed with conventional algorithm in view of average power consumption and blocking probability through OPNET modeler.

A Routing Method Considering Sensed Data in Wireless Sensor Networks (무선 센서 네트워크에서 데이터 센싱을 고려한 라우팅 기법)

  • Song, Chang-Young;Lee, Sang-Won;Cho, Seong-Soo;Kim, Seong-Ihl;Won, Young-Jin;Kang, June-Gill
    • 전자공학회논문지 IE
    • /
    • v.47 no.1
    • /
    • pp.41-47
    • /
    • 2010
  • It is very important to prolong the lifetime of wireless sensor networks by using their limited energy efficiently, since it is not possible to change or recharge the battery of sensor nodes after deployment. LEACH protocol is a typical routing protocol based on the clustering scheme for the efficient use of limited energy. It is composed of a few clusters, which consist of head nodes and member nodes. Though LEACH starts from the supposition that all nodes have data transferred to a head, there must be some nodes having useless data in actual state. In this paper we propose a power saving scheme by making a member node dormant if previous sensed data and current data is same. We evaluate the performance of the proposed scheme in comparison with original clustering algorithms. Simulation results validate our scheme has better performance in terms of the number of alive nodes as time evolves.

Improving QoS using Cellular-IP/PRC in Hospital Wireless Network

  • Kim, Sung-Hong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.1 no.2
    • /
    • pp.120-126
    • /
    • 2006
  • In this paper, we propose for improving QoS in hospital wireless network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it has its vulnerability in frequent handoff environment. This handoff state machine using differentiated handoff improves quality of services in Cellular-IP/PRC. Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and most of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

  • PDF

Improving QoS using Cellular-IP/PRC in Wireless Internet Environment (Cellular-IP/PRC에서 핸드오프 상태 머신에 의한 QoS 개선)

  • Kim Dong-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.6
    • /
    • pp.1302-1308
    • /
    • 2005
  • Propose Cellular-IP/PRC network with united paging and Cellular IP special duality that use roof information administration cache to secure lake acceptance method in wireless Internet environment and QoS in lesser extent cell environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and moat of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

Improving QoS using Cellular-IP/PRC in Hospital Wireless Network (병원 무선망에서 Cellular-IP/PRC에 의한 QoS 개선)

  • Suk, Kyung Hyu;Kim, Sung-Hong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.3 no.3
    • /
    • pp.188-194
    • /
    • 2008
  • In this paper, we propose for improving QoS in Hospital wireless network using Cellular-IP/PRC(Paging Route Cache) with Paging Cache and Route Cache in Cellular-IP and propose for performance of realtime and non-real time handoff service using Handoff state machine Paging Route Cache. Although the Cellular-IP/PRC technology is devised for mobile internet communication, it has its vulnerability in frequent handoff environment. This handoff state machine using differentiated handoff improves quality of services in Cellular-IP/PRC Suggested algorithm shows better performance than existing technology in wireless mobile internet communication environment. When speech quality is secured considering increment of interference to receive in case of suppose that proposed acceptance method grooves base radio station capacity of transfer node is plenty, and moat of contiguity cell transfer node was accepted at groove base radio station with a blow, groove base radio station new trench lake acceptance method based on transmission of a message electric power estimate of transfer node be. Do it so that may apply composing PC(Paging Cache) and RC(Routing Cache) that was used to manage paging and router in radio Internet network in integral management and all nodes as one PRC(Paging Router Cache), and add hand off state machine in transfer node so that can manage hand off of transfer node and Roaming state efficiently, and studies so that achieve connection function at node. Analyze benevolent person who influence on telephone traffic in system environment and forecasts each link currency rank and imbalance degree, forecast most close and important lake interception probability and lake falling off probability, GoS(Grade of Service), efficiency of cell capacity in QoS because applies algorithm proposing based on algorithm use gun send-receive electric power that judge by looking downward link whether currency book was limited and accepts or intercept lake and handles and displays QoS performance improvement.

  • PDF

A Flooding Scheme Based on Packet Reception Counts for Ad Hoc Networks (애드혹 네트워크에서 패킷 수신 횟수에 기반한 확률적 플러딩 알고리즘)

  • Song, Tae-Kyu;Kang, Jeong-Jin;Ahn, Hyun-Sik
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.197-203
    • /
    • 2011
  • Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

A Study on Enhanced PEGASIS Routing Protocol Based on Data Direction (데이터 방향성에 기반한 향상된 PEGASIS 라우팅 프로토콜 기법 연구)

  • Jung Sung-Min;Park Seon-Ho;Han Young-Ju;Chung Tai-Myoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1029-1032
    • /
    • 2006
  • 센서 네트워크는 센서 디바이스를 이용해 원하는 정보를 수집하고 전달하는 일종의 애드혹 (Ad-Hoc)네트워크이다. 현재 센서 네트워크의 기술은 많은 분야에서 응용이 예상되고 있지만 센서의 여러 특성에 의해 기존의 애드혹 라우팅 기법을 적용하기에 적합하지 않아 여러 가지의 라우팅 기법이 제안 되고 있다. 제안된 여러 기법 중 체인기반 프로토콜(Chain-Based Protocol)인 PEGASIS(Power-Efficient GAthering in Sensor Information Systems) 라우팅 기법은 헤드 노드의 선택과정에 있어서 BS(Base Station)의 위치를 고려하지 않고 체인으로 연결된 노드들 중에 하나가 헤드 노드로 선택됨으로써 불필요한 데이터의 이동이 발생하게 된다. 본 논문에서는 PEGASIS라우팅 기법의 성능향상을 위해 BS 노드의 위치를 고려한 데이터 이동의 방향성에 기반한 라우팅을 통해 향상된 PEGASIS 라우팅을 제안한다. 데이터의 이동의 방향성에 기반한 라우팅은 데이터의 불필요한 이동 경로를 줄임으로써 기존의 라우팅보다 에너지 효율면에서 뛰어난 성능을 보인다.

  • PDF

Location-Based Spiral Clustering Algorithm for Avoiding Inter-Cluster Collisions in WSNs

  • Yun, Young-Uk;Choi, Jae-Kark;Yoo, Sang-Jo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.665-683
    • /
    • 2011
  • Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.

Communication Optimization for Energy-Efficient Networks-on-Chips (저전력 네트워크-온-칩을 위한 통신 최적화 기법)

  • Shin, Dong-Kun;Kim, Ji-Hong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.3
    • /
    • pp.120-132
    • /
    • 2008
  • Networks-on-Chip (NoC) is emerging as a practical development platform for future systems-on-chip products. We propose an energy-efficient static algorithm which optimizes the energy consumption of task communications in NoCs with voltage scalable links. In order to find optimal link speeds, the proposed algorithm (based on a genetic formulation) globally explores the design space of NoC-based systems, including network topology, task assignment, tile mapping, routing path allocation, task scheduling and link speed assignment. Experimental results show that the proposed design technique can reduce energy consumption by 28% on average compared with existing techniques.