Learn More
Connected Dominating Set is widely used as virtual backbone in wireless networks to improve network performance and optimize routing protocols. Based on special characteristics of ad-hoc and sensor networks, we usually use unit disk graph to represent the corresponding geometrical structures, where each node has a unit transmission range and two nodes are(More)
—The unstructured multi-hop radio network model, with asynchronous wake-up, no collision detection and little knowledge on the network topology, is proposed for capturing the particularly harsh characteristics of initially deployed wireless ad hoc and sensor networks. In this paper, assuming such a practical model, we study a fundamental problem of both(More)
Given a universe N containing n elements and a collection of multisets or sets over N , the multiset multicover (MSMC) or the set multicover (SMC) problem is to cover all elements at least a number of times as specified in their coverage requirements with the minimum number of multisets or sets. In this paper, we give various exact algorithms for these two(More)
Keywords: Minimum-weighted dominating set Minimum-weighted connected dominating set Minimum-weighted chromatic disk cover Node-weighted Steiner tree Polynomial-time approximation scheme Approximation algorithm a b s t r a c t Given a node-weighted graph, the minimum-weighted dominating set (MWDS) problem is to find a minimum-weighted vertex subset such(More)
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is to schedule all these requests in as few timeslots as possible. In this paper, assuming the more realistic physical interference model and no knowledge of the topology, we present(More)
—We propose a novel demand side management method to tackle the intermittency in wind power generation. Our focus is on an isolated microgrid with one wind turbine, one fast-responding conventional generator, and several users. Users act as independent decision makers in shaping their own load profiles. Using dynamic potential game theory, we analyze and(More)
a r t i c l e i n f o a b s t r a c t Available online xxxx Keywords: Distributed algorithm Randomized algorithm Wireless ad-hoc and sensor networks Coloring Physical interference model In multi-hop radio networks, such as wireless ad-hoc networks and wireless sensor networks, nodes employ a MAC (Medium Access Control) protocol such as TDMA to coordinate(More)
—Rendezvous is a fundamental process in Cognitive Radio Networks, through which a user establishes a link to communicate with a neighbor on a common channel. Most previous solutions use either a central controller or a Common Control Channel (CCC) to simplify the problem, which are inflexible and vulnerable to faults and attacks. Some blind rendezvous(More)
Coverage is critical for wireless sensor networks to monitor a region of interest and to provide a good quality of service. In most cases we need to achieve full coverage which means every point inside the region (excluding the obstacles) must be covered by at least one sensor. The problem of placing the minimum number of sensors to achieve full coverage(More)
a r t i c l e i n f o a b s t r a c t Keywords: Distributed algorithm Multiple-message broadcast SINR model Wireless ad hoc networks In a multiple-message broadcast, an arbitrary number of messages originate at arbitrary nodes in the network at arbitrary times. The problem is to disseminate all these messages to the whole network. This paper gives the first(More)