Yang-Min Cheng

Learn More
We are concerned with wireless sensor networks where n sensors are independently and uniformly distributed at random in a finite plane. Events that are within a fixed distance from some sensor are assumed to be detectable and the sensor is said to cover that point. In this paper, we have formulated an exact mathematical expression for the expected area that(More)
Sleep scheduling in a wireless sensor network is the process of deciding which nodes are eligible to sleep (enter power-saving mode) after random deployment to conserve energy while retaining network coverage. Most existing approaches toward this problem require sensor’s location information, which may be impractical considering costly locating overheads.(More)
Density control in a wireless sensor network refers to the process of deciding which node is eligible to sleep (enter power-saving mode) after random deployment to conserve energy while retaining network coverage. Most existing approaches toward this problem require sensor's location information, which may be impractical considering costly locating(More)
Clustering coefficient has been proposed to characterize complex networks. Hidden terminals may degrade the performance of CSMA (carrier sense multiple access) protocol. This letter computes analytically the clustering coefficient and the quantity of hidden terminals for ad hoc networks. The former turns out to be a constant and the latter is proportional(More)
This paper aims tominimize energy expense for chainbased data gathering schemes, which is essential to prolong operation lifetime of wireless sensor networks. We propose the concept of virtual chain, where an edge may correspond to a multi-hop data propagation path to conserve power. In contrast, an edge in previous work can only be a costly direct(More)
  • 1