Earticle

현재 위치 Home

The Routing Algorithm for Wireless Sensor Networks with Random Mobile Nodes

첫 페이지 보기
  • 발행기관
    국제인공지능학회(구 한국인터넷방송통신학회) 바로가기
  • 간행물
    International Journal of Internet, Broadcasting and Communication KCI 등재후보 바로가기
  • 통권
    Vol.9 No.4 (2017.11)바로가기
  • 페이지
    pp.38-43
  • 저자
    Dai Yeol Yun, Kye-Dong Jung, Jong-Yong Lee
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A315397

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

원문정보

초록

영어
Sensor Networks (WSNs) can be defined as a self-configured and infrastructure- less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH’s nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes’ mobility. In order to simulate the proposed protocol, we make a scenario, nodes’ movements randomly and compared with the LEACH-Mobile protocol.

목차

Abstract
 1. Introduction
 2. Related Researches
  2.1 LEACH Protocol
  2.2 LEACH-Mobile Protocol
 3. Proposed algorithm
  3.1 Cluster Head Selection
  3.2 Sensor Nodes’ Mobility
 4. Simulation Result
  4.1 Simulations
 5. Conclusion
 References

키워드

Wireless sensor network (WSN) Mobile nodes LEACH LEACH-Mobile.

저자

  • Dai Yeol Yun [ Department of Plasma Bioscience and Display, KwangWoon University Graduate School, Seoul 01897, Korea ]
  • Kye-Dong Jung [ Ingenium College of liberal arts, KwangWoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 01897, Korea. ]
  • Jong-Yong Lee [ Ingenium College of liberal arts, KwangWoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 01897, Korea. ] Corresponding author

참고문헌

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

간행물 정보

발행기관

  • 발행기관명
    국제인공지능학회(구 한국인터넷방송통신학회) [The International Association for Artificial Intelligence]
  • 설립연도
    2000
  • 분야
    공학>전자/정보통신공학
  • 소개
    인터넷방송, 인터넷 TV , 방송 통신 네트워크 및 관련 분야에 대한 국내는 물론 국제적인 학술, 기술의 진흥발전에 공헌하고 지식 정보화 사회에 기여하고자 한다.

간행물

  • 간행물명
    International Journal of Internet, Broadcasting and Communication
  • 간기
    계간
  • pISSN
    2288-4920
  • eISSN
    2288-4939
  • 수록기간
    2009~2025
  • 십진분류
    KDC 326 DDC 380

이 권호 내 다른 논문 / International Journal of Internet, Broadcasting and Communication Vol.9 No.4

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

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

      페이지 저장