#### Filter Results:

- Full text PDF available (75)

#### Publication Year

1999

2017

- This year (13)
- Last 5 years (95)
- Last 10 years (135)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Mihaela Cardei, David MacCallum, +4 authors Ding-Zhu Du
- Journal of Interconnection Networks
- 2002

- Huan Ma, Meng Yang, Deying Li, Yi Hong, Wenping Chen
- INFOCOM
- 2012

- Deying Li, Qin Liu, Xiao-Dong Hu, Xiaohua Jia
- Computer Communications
- 2007

In this paper, we discuss the energy efficient multicast problem in ad hoc wireless networks. Each node in the network is assumed to have a fixed level of transmission power. The problem of our concern is: given an ad hoc wireless network and a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree is… (More)

- Xiuzhen Cheng, Xiao Huang, Deying Li, Weili Wu, Ding-Zhu Du
- Networks
- 2003

A connected dominating set in a graph is a subset of vertices such that every vertex is either in the subset or adjacent to a vertex in the subset and the subgraph induced by the subset is connected. A minimum-connected dominating set is such a vertex subset with minimum cardinality. An application in ad hoc wireless networks requires the study of the… (More)

- Xiaohua Jia, Deying Li, Ding-Zhu Du
- INFOCOM
- 2004

This paper discusses the energy efficient QoS topology control problem in ad hoc wireless networks. Given a set of nodes in a plane, end-to-end traffic demands and delay bounds between node pairs, the problem is to find a network topology that can meet the QoS requirements and the maximum transmitting power of nodes is minimized. We consider two cases of… (More)

- Deying Li, Xiaohua Jia, Hai Liu
- IEEE Transactions on Mobile Computing
- 2004

In this paper, we discuss energy efficient broadcast in ad hoc wireless networks. The problem of our concern is: given an ad hoc wireless network, find a broadcast tree such that the energy cost of the broadcast tree is minimized. Each node in the network is assumed to have a fixed level of transmission power. We first prove that the problem is NP-hard and… (More)

- Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiaohua Jia
- Networks
- 2000

In a WDM network under multihop architecture, each link is associated with a set of wavelengths available for channel connections, and in the network, the number of wavelengths that can be used is limited. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay. Given a multicast connection, routing is to… (More)

- Deying Li, Lin Liu, Huiqiang Yang
- Discrete Math., Alg. and Appl.
- 2009

- Huiqiang Yang, Deying Li, Hong Chen
- ICC
- 2010

- Deying Li, Hongwei Du, Peng-Jun Wan, Xiaofeng Gao, Zhao Zhang, Weili Wu
- Theor. Comput. Sci.
- 2009

Consider an asymmetric wireless network represented by a digraph G = (V , E). A subset of vertices U is called a strongly connected dominating set (SCDS) if the subgraph induced by U is strongly connected and every vertex not in U has both an in-neighbor in U and an out-neighbor in U . SCDS plays an important role of the virtual backbone in asymmetric… (More)