Sciweavers

36 search results - page 4 / 8
» Construction of directional virtual backbones with minimum r...
Sort
View
INFOCOM
2009
IEEE
14 years 12 days ago
VirtualFace: An Algorithm to Guarantee Packet Delivery of Virtual-Coordinate-Based Routing Protocols in Wireless Sensor Networks
Abstract—Because the global positioning system (GPS) consumes a large amount of power and does not work indoors, many virtual-coordinate-based routing protocols are proposed for ...
Ming-Jer Tsai, Fang-Ru Wang, Hong-Yen Yang, Yuan-P...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 7 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
INFOCOM
2002
IEEE
13 years 10 months ago
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder
MOBIHOC
2008
ACM
14 years 5 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
JCIT
2008
138views more  JCIT 2008»
13 years 5 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan