본문 바로가기
KERD
논문KCI 등재

A visiting scheme of mobile sink system in distributed sensor networks

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류컴퓨터학

초록

The sensor networks should be appropriately designed by applied network purpose, so that they can support proper application functions. Based on the design of suitable network model, the network lifetime can be maximized than using other general strategies which have not the consideration of specific network environments. In this paper, we propose a non-deterministic agent scheme to the mobile sink in distributed wireless sensor networks. The sensor network area can be divided into several sensor regions. Hence, to these such networks, the specified suitable scheme is requested by the applied network model to implement satisfactory network management. In this paper, we theoretically represent the proposed scheme, and provide the evaluation with the simulation results.

Abstract

The sensor networks should be appropriately designed by applied network purpose, so that they can support proper application functions. Based on the design of suitable network model, the network lifetime can be maximized than using other general strategies which have not the consideration of specific network environments. In this paper, we propose a non-deterministic agent scheme to the mobile sink in distributed wireless sensor networks. The sensor network area can be divided into several sensor regions. Hence, to these such networks, the specified suitable scheme is requested by the applied network model to implement satisfactory network management. In this paper, we theoretically represent the proposed scheme, and provide the evaluation with the simulation results.

참고문헌 (10)

  1. I.F. Akyildiz, "A survey on sensor networks", IEEE Communications Magazine, 40(8), pp.102~114 (2002), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  2. Seema Bandyopadhyay, "An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks", IEEE INFOCOM, pp.1713~1723 (2003)[DOI]
  3. Santosh Kumar, "On K-Coverage in a Mostly Sleeping Sensor Networks", ACM Mobicom, pp.144~158 (2004)
  4. Wei Wang, "Extending the Lifetime of Wireless Sensor Networks Through Mobile Relays", IEEE, 2008, pp.16(5), 1108~1120[DOI]
  5. Benyuan Liu, "Dynamic Coverage of Mobile Sensor Networks", IEEE Transactions on Parallel and Distributed Systems, 24(2), pp.301~311 (2013), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  6. Xiaofeng Gao, "Energy Efficient Scheduling Algorithms for Sweep Coverage in Mobile Sensor Networks", IEEE Transactions on Mobile Computing, 19(6), pp.1332~1345 (2020), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  7. Tianheng Wang, "Network Navigation with Scheduling: Distributed Algorithms", IEEE, 2019, pp.27(4), 1319~1329
  8. Tianheng Wang, "Network Navigation With Scheduling: Distributed Algorithms", IEEE, 2019, pp.27(4), 1319~1329[DOI]
  9. Hiroshi Saito, "Geometric Analysis of Estimability of Target Object Shape Using Location-Unknown Distance Sensors", IEEE Transactions on Control of Network Systems, 6(1), pp.94~103 (2019), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
  10. Hsuan-Yin Lin, "Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks", IEEE Transactions on Signal Processing, 68, pp.647~661 (2020), Institute of Electrical and Electronics Engineers (IEEE)[DOI]

관련 논문AI추천

이 간행물의 다른 논문 (29건)