Browsing by Author "Min, Manki"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    A Distributed Approximation for Minamum Connecting Dominated Sets in Wireless Networks
    (2003-05-02) Min, Manki; Lanka, Raghuram; Huang, Xiao; Du, Ding-Zhu
    A wireless ad-hoc network is a wireless, multihop network without an infrastructure. And due to the limited resources of hosts in the network, the resource utilization becomes more critical. As a result, construction of virtual backbones in wireless ad-hoc networks gets more attractive. In this paper, we present a distributed approximation scheme for minimum connected dominating sets in unit-disk graphs which can serve as a virtual backbone in the network. Our algorithm has the performance ratio of 7 and the message complexity of $O(n log n)$, which are the best among the schemes in the literature.
  • Thumbnail Image
    Item
    Wireless Sensor Networks with Energy Efficient Organization
    (2002-12-08) Cardei, Mihaela; MacCallum, David; Cheng, Xiaoyan; Min, Manki; Jia, Xiaohua; Li, Deying; Du, Ding-Zhu; Hung-Chang Du, David
    A critical aspect of applications with wireless sensor networks is network lifetime. Battery-powered sensors are usable as long as they can communicate captured data to a processing node. Sensing and communications consume energy, therefore judicious power management and scheduling caneffectively extend the operational time. One important class of wireless sensor applications consists of deployment of large number of sensors in an area for environmental monitoring. The data collected by the sensors is sent to a central node for processing. In this paper we propose an efficient method to achieve energy savings by organizing the sensor nodes into a maximum number of disjoint dominating sets (DDS) which are activated successively. Only the sensors from the active set are responsible for monitoring the target area and for disseminating the collected data. All other nodes are into a sleep mode, characterized by a low energy consumption. We define the maximum disjoint dominating sets problem and we design a heuristic that computes the sets. Theoretical analysis and performance evaluation results are presented to verify our approach.