Earticle

현재 위치 Home

An Efficient Data Collection Protocol for Maximum Sensor Network Data Persistence

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJFGCN) 바로가기
  • 간행물
    International Journal of Future Generation Communication and Networking 바로가기
  • 통권
    Vol.9 No.11 (2016.11)바로가기
  • 페이지
    pp.275-286
  • 저자
    Jian Wan, Li Yang, Wei Zhang, Huayou Si, Jin Feng
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A291272

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

원문정보

초록

영어
Sensor network has lot applications in the early warning and assistant of disaster environment such as debris flows, floods and forest fires. However, such disaster environment pose an interesting challenge for data collection since sensor nodes may be destroyed unpredictably and centrally, resulting in the decrease of data persistence in the network. Growth Codes Protocol (GCP) first focuses on increase sensor network data persistent in the disaster. However, the completely random data transmission way in GCP may cause a large number of invalid data transmissions and therefore, the efficiency of data collection of the protocol is not ideal in the late stage of data collection. In this paper, we propose an efficient data collection protocol (DGCP) to maximize sensor network data persistence by changing the completely random data transmission way. Packet classification mechanism and a novel dynamic probability model of data transmission in DGCP are proposed to control the effective direction of data flow. Furthermore, we found that the parameter optimization problem of the probabilistic model is a problem of searching the optimal solution in a mathematical view. Based on this property, we propose a genetic algorithm to optimize the dynamic probability model. The performance of the proposed DGCP is shown by a comparative experimental study. When compared with GCP, our DGCP has better performance in a variety of environments

목차

Abstract
 1. Introduction
 2. Related Works
 3. Network Model
 4. About GA Parameters
 5. DGCP
  5.1. Data Packet Classification Mechanism
  5.2. A Novel Data Transmission Probability Model
  5.3. DGCP
 6. Experimental Results
 7. Conclusions
 References

키워드

Packet Classification Mechanism dynamic probability model of data transmission Genetic Algorithm data collection Growth Codes

저자

  • Jian Wan [ Department of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China / Zhejiang University of Science and Technology, Hangzhou, China / Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, Hangzhou, China ]
  • Li Yang [ Department of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China ]
  • Wei Zhang [ Department of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China / Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, Hangzhou, China ]
  • Huayou Si [ Department of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China / Key Laboratory of Complex Systems Modeling and Simulation, Ministry of Education, Hangzhou, China ]
  • Jin Feng [ PLA the Rocket Force Command College,Wuhan,China ]

참고문헌

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

간행물 정보

발행기관

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

간행물

  • 간행물명
    International Journal of Future Generation Communication and Networking
  • 간기
    격월간
  • pISSN
    2233-7857
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Future Generation Communication and Networking Vol.9 No.11

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

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

      페이지 저장