• Title/Summary/Keyword: Energy-Efficient Routing

Search Result 422, Processing Time 0.029 seconds

Development of Directed Diffusion Algorithm with Enhanced Performance (향상된 성능을 갖는 Directed Diffusion 알고리즘의 개발)

  • Kim Sung-Ho;Kim Si-Hwan
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.7
    • /
    • pp.858-863
    • /
    • 2005
  • Sensor network is subject to novel problems and constraints because it is composed of thousands of tiny devices with very limited resources. The large number of motes in a sensor network means that there will be some failing nodes owing to the lack of battery in sensor nodes. Therefore, it is imperative to save the energy as much as possible. In this work, we propose energy efficient routing algorithm which is based on directed diffusion scheme. In the proposed scheme, some overloads required for reinforcing the gradient path can be effectively eliminated. Furthermore, in order to verify the usefulness of the proposed algorithm, several simulations are executed.

An Enhanced Cross-layer Geographic Forwarding Scheme for Wireless Sensor Networks (무선 센서 네트워크에서 향상된 교차 계층 방식의 위치기반 데이터 전달 기법)

  • Kim, Jae-Hyun;Kim, Seog-Gyu;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.8B
    • /
    • pp.712-721
    • /
    • 2012
  • In this paper, we propose an Enhanced cross-layer Geographic Forwarding (EGF) protocol for wireless sensor networks (WSNs). EGF uses an optimal back-off time to make the packet forwarding decisions using only source and destination's location information and energy cost without information about neighbor nodes' location or the number of one hop neighbor nodes. EGF is also a cross-layer protocol by combining efficient asynchronous MAC and geographic routing protocol. The proposed protocol can find optimal next hop location quickly without broadcasting node's location update and with minimizing overhead. In our performance evaluation, EGF has better performance in terms of packet success ratio, energy efficiency and end-to-end delay in wireless sensor networks.

An Efficient TCP Algorithm in Mobile ADHOC Networks (이동망 네트워크에서의 효율적인 TCP 알고리즘)

  • Hong, Sung-Hwa;Kim, Hoon-Ki
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.6
    • /
    • pp.73-81
    • /
    • 2009
  • TCP assumes that packet loss is always happened by congestionlike wired networks because is can not distinguish between congestion loss and transmission error loss,. This assumption results in unnecessary TCP performance degradation in wireless networks by reducing sender's congestion window size and retransmitting the lost packets. Also, repeated retransmissions loed to waste the limited battery power of mobile devices. In this paper, we propose the new congestion control scheme that add the algorithms monitoring networks states and the algorithms preventing congestion to improve TCP throughput performance and energy efficiency in wireless ad-hoc networks. Using NS2, we showd our scheme improved throughput performance and energy efficiency.

The GR-tree: An Energy-Efficient Distributed Spatial Indexing Scheme in Wireless Sensor Networks (GR-tree: 무선 센서 네트워크에서 에너지 효율적인 분산 공간색인기법)

  • Kim, Min-Soo;Jang, In-Sung
    • Spatial Information Research
    • /
    • v.19 no.5
    • /
    • pp.63-74
    • /
    • 2011
  • Recently, there has been much interest in the spatial query which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. The centralized approach which performs the spatial query at a server after acquiring all sensor readings, though simple, it incurs high wireless transmission cost in accessing all sensor nodes. In order to remove the high wireless transmission cost, various in-network spatial indexing schemes have been proposed. They have focused on reducing the transmission cost by performing distributed spatial filtering on sensor nodes. However, these in-network spatial indexing schemes have a problem which cannot optimize both the spatial filtering and the wireless routing among sensor nodes, because these schemes have been developed by simply applying the existing spatial indexing schemes into the in-network environment. Therefore, we propose a new distributed spatial indexing scheme of the GR-tree. The GR-tree which form s a MBR-based tree structure, can reduce the wireless transmission cost by optimizing both the efficient spatial filtering and the wireless routing. Finally, we compare the existing spatial indexing scheme through extensive experiments and clarify our approach's distinguished features.

A Study of Optimal path Availability Clustering algorithm in Ad Hoc network (에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.1
    • /
    • pp.225-232
    • /
    • 2013
  • In this paper, we introduce a method that can be used to select the position of head node for context-awareness information. The validity of the head node optimal location is saving the energy in the path according to the clustering. It is important how to elect one of the relay node for energy efficiency routing. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution during the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. The proposed ECOPS (Energy Conserving Optimal path Schedule) algorithm that contextual information is contributed for head node selection in topology protocols. This proposed algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election technique show improving the entire node lifetime and network in management the network from simulation results.

LECEEP : LEACH based Chaining Energy Efficient Protocol (에너지 효율적인 LEACH 기반 체이닝 프로토콜 연구)

  • Yoo, Wan-Ki;Kwon, Tae-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5B
    • /
    • pp.801-808
    • /
    • 2010
  • LEACH, one of hierarchical based routing protocols, was proposed for energy efficiency which is the most important requirement of Wireless Sensor Network(WSN). LEACH protocol is composed of a cluster of certain large number of clusters, which have a cluster head and member nodes. Member nodes send sensing data to their cluster heads, and the cluster heads aggregate the sensing data and transmit it to BS. The challenges of LEACH protocol are that cluster heads are not evenly distributed, and energy consumption to transmit aggregated data from Cluster heads directly to BS is excessive. This study, to improve LEACH protocol, suggests LECEEP that transmit data to contiguity cluster head that is the nearest and not far away BS forming chain between cluster head, and then the nearest cluster head from BS transmit aggregated data finally to BS. According to simulation, LECEEP consumes less energy and retains more number of survival node than LEACH protocol.

Fault Tolerant Data Aggregation for Reliable Data Gathering in Wireless Sensor Networks (무선센서네트워크에서 신뢰성있는 데이터수집을 위한 고장감내형 데이터 병합 기법)

  • Baek, Jang-Woon;Nam, Young-Jin;Jung, Seung-Wan;Seo, Dae-Wha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1295-1304
    • /
    • 2010
  • This paper proposes a fault-tolerant data aggregation which provides energy efficient and reliable data collection in wireless sensor networks. The traditional aggregation scheme does not provide the countermeasure to packet loss or the countermeasure scheme requires a large amount of energy. The proposed scheme applies caching and re-transmission based on the track topology to the adaptive timeout scheduling. The proposed scheme uses a single-path routing based on the traditional tree topology at normal, which reduces the dissipated energy in sensor nodes without any countermeasure against packet loss. The proposed scheme, however, retransmits the lost packet using track topology under event occurrences in order to fulfill more accurate data aggregation. Extensive simulation work under various workloads has revealed that the proposed scheme decrease by 8% in terms of the dissipated energy and enhances data accuracy 41% when the potential of event occurrence exists as compared with TAG data aggregation. And the proposed scheme decrease by 53% in terms of the dissipated energy and shows a similar performance in data accuracy when the potential of event occurrence exists as compared with PERLA data aggregation.

A Protocol Interface for Energy-efficient Network Management in Ubiquitous Sensor Networks (유비쿼터스 센서네트워크에서 에너지 효율적인 망관리 프로토콜 인터페이스)

  • Kim, Byoung-Kug;Hur, Kyeong;Eom, Doo-Seop
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.8
    • /
    • pp.1221-1234
    • /
    • 2010
  • MANET(Mobile Ad-hoc Network)s have been researched primary at routing protocols and at the guarantees of QoS(Quality of Service) for mobile environments. Otherwise the Ubiquitous Sensor Networks (USNs) have some limitations in power energies and in processing of sensing data, as well as their network topologies are frequently changed by fading off and node failures. Thus we should redesign network protocols with concerning to energy efficiency for the USNs above all. In this paper, we focus on the protocol interface for managing for USNs based on the surveys. And then we figure the topology of USNs out and design the network protocol interface to make power saved, with data gathering and processing more efficient using our designed packet structures.

An Energy Efficient Data-Centric Probing Priority Determination Method for Mobile Sinks in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율을 고려한 모바일 싱크의 데이터 중심 탐색 우선순위결정 기법)

  • Seong, Dong-Ook;Lee, Ji-Hee;Yeo, Myung-Ho;Yoo, Jae-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.561-565
    • /
    • 2010
  • Many methods have been researched to prolong sensor network lifetime using mobile technologies. In the mobile sink research, there are the track based methods and the anchor points based methods as representative operation methods for mobile sinks. However, the existing methods decrease Quality of Service (QoS) and lead the routing hotspot in the vicinity of the mobile sink. The reason is that they use static mobile paths that are not concerned about the network environments such as the query position and the data priority. In this paper, we propose the novel mobile sink operation method that solves the problems of the existing methods. In our method, the probing priority of the mobile sink is determined with the data priorities for increasing the QoS and the mobile features are used for reducing the routing hotspot. The experimental results show that the proposed method reduces query response time and improves network lifetime over the existing methods.

The Method of Data Integration based on Maritime Sensors using USN (USN을 활용한 해양 센서 데이터 집합 방안)

  • Hong, Sung-Hwa;Ko, Jae-Pil;Kwak, Jae-Min
    • Journal of Advanced Navigation Technology
    • /
    • v.21 no.3
    • /
    • pp.306-311
    • /
    • 2017
  • In the future ubiquitous network, information will collect data from various sensors in the field. Since the sensor nodes are equipped with small, often irreplaceable, batteries with limited power capacity, it is essential that the network be energy-efficient in order to maximize its lifetime. In this paper, we propose an effective network routing method that can operate with low power as well as the transmission of data and information obtained from sensor networks, and identified the number of sensors with the best connectivity to help with the proper placement of the sensor. These purposes of this research are the development of the sensor middle-ware to integrate the maritime information and the proposal of the routing algorithm for gathering the maritime information of various sensors. In addition, for more secure ship navigation, we proposed a method to construct a sensor network using various electronic equipments that are difficult to access in a ship, and then construct a communication system using NMEA(the national marine electronics association), a ship communication standard, in the future.