Sciweavers

545 search results - page 5 / 109
» Minimum energy accumulative routing in wireless networks
Sort
View
INFOCOM
2011
IEEE
12 years 11 months ago
Construction of directional virtual backbones with minimum routing cost in wireless networks
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
Ling Ding, Weili Wu, James Willson, Hongjie Du, Wo...
ICDCS
2010
IEEE
13 years 7 months ago
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
ICC
2008
IEEE
14 years 2 months ago
Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
Ji Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe...
ADHOC
2007
122views more  ADHOC 2007»
13 years 7 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
IPCCC
2006
IEEE
14 years 1 months ago
Energy-efficient cooperative routing in multi-hop wireless ad hoc networks
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
Fulu Li, Kui Wu, Andrew Lippman