Mohsen Eftekhari Hesari

Learn More
We consider several variations of the problems of covering a set of barriers (modeled as line segments) using sensors so that sensors can detect any intruder crossing any of the barriers. Sensors are initially located in the plane and they can relocate to the barriers. We assume that each sensor can detect any intruder in a circular area centered at the(More)
A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. Barrier coverage is achieved by a set of sensors if every point on the barrier is covered by some sensor in the set. Assuming n identical, anonymous, and relocatable sensors are placed(More)
We study the barrier coverage problem using relocatable sensor nodes. We assume each sensor can sense an intruder or event inside its sensing range. Sensors are initially located at arbitrary positions on the barrier and can move along the barrier. The goal is to find final positions for sensors so that the entire barrier is covered. In recent years, the(More)
We study the load balancing aspect of routing algorithms in wireless ad hoc networks. We define a statistical measure called local coefficient of variance (lcv) to study the smoothness of the load distribution in the network. The importance of keeping lcv as low as possible in designing load balanced routing algorithms is demonstrated. We analyze how number(More)
One common model that has been used to analyze routing algorithms in ad hoc networks considers networks that are so dense that a node exists close enough to any point in the network. Continuous techniques were used to calculate the average and maximum loads of the routing algorithms. In this paper we explain some limitations of such techniques in predicting(More)
  • 1