Earticle

초록

영어

Wireless sensor networks (WSNs) consists of spatially distributed autonomous sensor nodes to monitor physical or environmental conditions because of that they have widespread applications in human communities and existence world. Like other computer and telecommunication networks, wireless sensor networks are susceptible to regarding destructive threats and attacks and simple hardware of these electronic devices prevents applying defensive mechanisms called networks. Positioning key is of main performances of coding in all kinds of applications in which security is considered as an anxiety. Despite the nature of limited resources on sensor nodes limits using current routing and security mechanisms in wireless sensor networks. Secure routing protocol design because of being under the influence of resource limitations and physical nodes of the sensor is essential for wireless sensor networks. In this paper, we study topology control and virtual backbone based on dominating sets for wireless sensor networks. We deal with the performance evaluation of connected dominating set construction algorithms.

목차

Abstract
 1. Introduction
 2. Dominating Sets in Graphs
  2.1. Applications of a CDS in Wireless Sensor Networks
  2.2. Bounds on the Domination Number
 3. Topology Control in Wireless Sensor Networks
  3.1. Options for Topology Control
 4. Constructing CDSs
  4.1. Centralized Algorithms
  4.2. Distributed Algorithms (Prune-based Algorithms)
  4.3. Distributed Algorithms (MIS-based Algorithms)
 5. Conclusions
 References

키워드

저자

• Amir Hassani Karbasi [ Department of Computer Engineering, Guilan University, Rasht, Iran ]
• Reza Ebrahimi Atani [ Department of Computer Engineering, Guilan University, Rasht, Iran ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605