Du, Dingzhu
Permanent URI for this collectionhttps://hdl.handle.net/10735.1/4209
Dr. Dingzhu Du serves as a professor in the Department of Computer Science. He is also a co-director of the Data Communication and Data Management Laboratory. His research interests and areas of expertise inclue:
- Combinatorial optimization
- Communication networks
- Theory of computation
Browse
Browsing Du, Dingzhu by Subject "Wireless sensor networks"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage with Heterogeneous Wireless Sensors(Institute of Electrical and Electronics Engineers Inc.) Zhang, Z.; Wu, Weili; Yuan, Jing; Du, Dingzhu; 288884264 (Du, D); Wu, Weili; Yuan, Jing; Du, DingzhuBarrier Coverage plays a vital role in wireless sensor networks. Research on barrier coverage has mainly focused on the lifetime maximization and the critical conditions to achieve k-Barrier Coverage under various sensing models. When sensors are randomly deployed along the boundary of an area of interest, they may form several disjoint barrier covers. To maximize the lifetime of barrier coverage, those barrier covers need to be scheduled to avoid a security problem, call breach. In a heterogeneous wireless sensor network, given a set of barrier-covers each with a lifetime, we study the problem of finding a lifetime-maximizing subset with a breach-free sleep-wakeup scheduling. We first prove that it can be judged in polynomial time whether a given sleep-wakeup schedule is breach-free or not, but given a set of barrier-covers, it is NP-Complete to determine whether there exists a breach-free schedule. Then, we show that the problem of finding a lifetime-maximizing breach-free schedule is equivalent to the maximum node weighted path problem in a directed graph, and design a parameterized algorithm. Experimental results show that our algorithm significantly outperforms the heuristics proposed in the literature.Item Quality of Barrier Cover with Wireless Sensors(Inderscience Enterprises Ltd, 2019-04-01) Wu, Weili; Zhang, Zhao; Gao, Chuangen; Du, Hai; Wang, Hua; Du, Dingzhu; Wu, Weili; Du, DingzhuA set of wireless sensors is called a barrier cover if they can monitor the boundary of an area so that an intruder cannot enter the area without being found by any sensor. The quality of a barrier cover is the shortest length of path along which an intruder can enter the area from outside. We study four problems, in this paper, related to the quality of the barrier cover and give their computational complexity and algorithmic solutions.