Earticle

현재 위치 Home

Design and Implementation of Energy Aware Algorithm using Greedy Routing for Sensor Networks

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJSIA) 바로가기
  • 간행물
    International Journal of Security and Its Applications SCOPUS 바로가기
  • 통권
    Vol.2 No.2 (2008.04)바로가기
  • 페이지
    pp.71-86
  • 저자
    Razia Haider, Dr. Muhammad Younus Javed, Naveed S. Khattak
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A74989

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
Routing in sensor networks is a challenging issue due to inherent constraints such as energy, memory and CPU processing capabilities. The energy efficiency is one of the key concerns in sensor networks for their better performance, as sensor nodes are limited in their battery power. In this research work, different routing algorithms have been studied and the main focus was on geographic routing in sensor networks. A location based protocol EAGR (Energy Aware Greedy Routing) has been presented for sensor networks to extend the lifetime of the network and to get higher data delivery rate and to balance the energy consumption of nodes. In EAGR, each node makes the local decision to choose its next hop. This algorithm works on forwarding rule based on location and energy levels of nodes. Each node knows its own geographic location and its energy levels and the location and energy level of its neighbors. The transmitting node writes the geographic position of destination into the packet header and forwards it to the destination by establishing the sub-destinations. The sub-destination nodes must be alive and geographically near to the destination node to route the packet by choosing the shortest and reliable path. Simulation has been made by using OMNET++. Simulation results show that the proposed algorithm gives better performance in terms of higher data delivery rate and less number of dead nodes. It has been noted that the ratio of successful packet delivery will increase in EAGR as number of nodes increased in the network. Consequently, the proposed algorithm can scale to thousands of nodes in future sensor networks and can effectively increase the lifetime of the sensor networks.

목차

Abstract
 1. Introduction
 2. Related work
 3. Energy aware greedy routing (EAGR)
  3.1. Motivation
  3.2. Objective
  3.3. Problem Statement
  3.4. Assumptions for EAGR
  3.5. Principle of EAGR
 4. Design and Implementation of EAGR
  4.1. EAGR algorithm
  4.2. Work flow of EAGR algorithm
  4.3. Energy model
 5. Simulation
  5.1. Block Diagram of the implemented system
  5.2. Simulation model and tools
  5.3. Evaluation metrics
  5.4. Simulation results and performance comparison
  5.5. Discussion
 6. Conclusion and future work
 7. References

저자

  • Razia Haider [ Department of Computer Science, Military College of Signal, National University of Science & Technology, Rawalpinid, Pakistan. ]
  • Dr. Muhammad Younus Javed [ Department of Computer Engineering, E&ME College, National University of Science & Technology, Rawalpindi, Pakistan. ]
  • Naveed S. Khattak [ Department of Computer Science, Military College of Signal, National University of Science & Technology, Rawalpinid, Pakistan. ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJSIA) [Science & Engineering Research Support Center, Republic of Korea(IJSIA)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Security and Its Applications
  • 간기
    격월간
  • pISSN
    1738-9976
  • 수록기간
    2008~2016
  • 등재여부
    SCOPUS
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Security and Its Applications Vol.2 No.2

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장