Skip to main content

7 Result(s)

within Mihaela Cardei Remove this filter Mathematics Remove this filter

and

  1. No Access

    Article

    Energy-efficient weak-barrier coverage with adaptive sensor rotation

    Wireless sensor networks have been widely used in environment, climate, animal monitoring, the medical field, and also for surveillance. In surveillance applications, when sensors are deployed randomly along a...

    Catalina Aranzazu-Suescun, Mihaela Cardei in Journal of Combinatorial Optimization (2022)

  2. No Access

    Article

    Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks

    When deploying sensors to monitor boundaries of battlefields or country borders, sensors are usually dispersed from an aircraft following a predetermined path. In such scenarios sensing gaps are usually unavoi...

    Yueshi Wu, Mihaela Cardei in Journal of Combinatorial Optimization (2018)

  3. No Access

    Reference Work Entry In depth

    Coverage Problems in Sensor Networks

    Wireless sensor networks have many applications in national security, environmental monitoring, surveillance, military, and health care. Coverage problems have become an important research topic in wireless se...

    Mihaela Cardei in Handbook of Combinatorial Optimization (2013)

  4. No Access

    Article

    Adaptive energy efficient sensor scheduling for wireless sensor networks

    In this paper, we consider an adaptive energy efficient sensor scheduling mechanism. We consider a wireless sensor network where the sink sends queries form time to time, and sensors are equipped with one or m...

    Yinying Yang, Mihaela Cardei in Optimization Letters (2010)

  5. No Access

    Article

    Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication

    In the design of wireless networks, techniques for improving energy efficiency and extending network lifetime have great importance, particularly for defense and civil/rescue applications where resupplying tra...

    Ionut Cardei, Mihaela Cardei, Lusheng Wang, Baogang Xu… in Journal of Global Optimization (2006)

  6. No Access

    Article

    Paired-domination of Trees

    Let G= (V, E) be a graph without isolated vertices. A set S⊂V is a paired-dominating set if it dominates V and the subgraph induced by S,〈S〉, contains a perfect matching. The paired-domination number γp(G) is def...

    Hong Qiao, Liying Kang, Mihaela Cardei, Ding-Zhu Du in Journal of Global Optimization (2003)

  7. No Access

    Article

    A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem

    In this paper, we present the design of a Polynomial Time Approximation Scheme (PTAS) for the Grade of Service Steiner Minimum Tree (GOSST) problem, which is known to be NP-Complete. Previous research has focu...

    Joonmo Kim, Mihaela Cardei, Ionut Cardei, **aohua Jia in Journal of Global Optimization (2002)