Maggie Xiaoyan Cheng

Learn More
The idea of virtual backbone routing for ad hoc wireless networks is to operate routing protocols over a virtual backbone. One purpose of virtual backbone routing is to alleviate the serious broadcast storm problem suffered by many exiting on-demand routing protocols for route detection. Thus constructing a virtual backbone is very important. In our study,(More)
This paper considers the problem of broadcasting in large ad hoc wireless networks. We focus on the energyeflcient broadcast routing in stationary networks and consider the case where wireless nodes can dynamically control their transmission power for each broadcast session. Minimum spanning tree(MST) has the property that the longest edge in the tree is(More)
Wireless sensor networks have recently attracted lots of research effort due to its wide range of applications. These networks must operate for months or years. However, the sensors are powered by battery, which may not be possible to be recharged after they are deployed. Thus, energy-aware network management is extremely important. In this paper, we study(More)
In sensor networks, both energy and bandwidth are scarce resources. In the past, many energy efficient routing algorithms have been devised in order to maximize network lifetime, in which wireless link bandwidth has been optimistically assumed to be sufficient. This article shows that ignoring the bandwidth constraint can lead to infeasible routing(More)
Recent research in sensor networks highlights the low-power mode operation of sensor networks. In wireless sensor networks, network lifetime can be extended by organizing sensors into mutually exclusive subsets and alternatively activating each subset. Coverage breach occurs when a subset fails to cover all the targets. In bandwidth-constrained sensor(More)
In ad hoc wireless networks, to compute the transmission power of each wireless node such that the resulting network is connected and the total energy consumption is minimized is defined as a Minimum Energy Network Connectivity (MENC) problem, which is an NP-complete problem. In this paper, we consider the approximated solutions for the MENC problem in ad(More)
Many applications of wireless sensor networks (WSNs) require location information of the randomly deployed nodes. A common solution to the localization problem is to deploy a few special beacon nodes having location awareness, which help the ordinary nodes to localize. In this approach, non-beacon nodes estimate their locations using noisy distance(More)
This paper addresses the problem of broadcasting and multicasting in large scale multihop ad hoc wireless networks. We focus on the energy-efficient broadcast routing in stationary networks and consider the case where wireless nodes can dynamically control their transmission power for each broadcast session. Minimum spanning tree (MST) has the property that(More)