K Arakadakis, P Charalampidis… - ACM Computing …, 2021 - dl.acm.org
The devices forming Internet of Things (IoT) networks need to be re-programmed over the air, so that new features are added, software bugs or security vulnerabilities are resolved …
In wireless ad hoc networks, due to the dynamic topology changes, multi hop communications and strict resource limitations, routing becomes the most challenging issue …
H Du, W Wu, Q Ye, D Li, W Lee… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
Inspired by the backbone concept in wired networks, virtual backbone is expected to bring substantial benefits to routing in wireless sensor networks (WSNs). Virtual backbone …
F Bonchi, C Lucchese - … Conference on Data Mining (ICDM'04), 2004 - ieeexplore.ieee.org
Constrained frequent patterns and closed frequent patterns are two paradigms aimed at reducing the set of extracted patterns to a smaller, more interesting, subset. Although a lot of …
Y Wu, Y Li - Proceedings of the 9th ACM international symposium …, 2008 - dl.acm.org
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a k-Connected …
L Ding, W Wu, J Willson, H Du, W Lee… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
Topology control is one vital factor to a wireless network's efficiency. A Connected Dominating Set (CDS) can be a useful basis of a backbone topology construction. In this …
L Huang, S Setia - IEEE INFOCOM 2008-The 27th Conference …, 2008 - ieeexplore.ieee.org
This paper presents CORD, a reliable bulk data dissemination protocol for propagating a large data object to all the nodes in a large scale sensor network. Unlike well-known reliable …
Y Wu, F Wang, MT Thai, Y Li - MILCOM 2007-IEEE Military …, 2007 - ieeexplore.ieee.org
A k-Connected m-Dominating Set (kmCDS) working as a virtual backbone in a wireless sensor network is necessary for fault tolerance and routing flexibility. In order to construct a …
L Ding, X Gao, W Wu, W Lee, X Zhu… - 2010 IEEE 30th …, 2010 - ieeexplore.ieee.org
In this paper, we will study a special Connected Dominating Set (CDS) problem-between any two nodes in a network, there exists at least one shortest path, all of whose intermediate …