Sciweavers

192 search results - page 19 / 39
» On the Minimum k-Connectivity Repair in Wireless Sensor Netw...
Sort
View
ICC
2008
IEEE
141views Communications» more  ICC 2008»
14 years 1 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
TON
2010
197views more  TON 2010»
13 years 5 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
MOBICOM
2006
ACM
14 years 21 days ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
JUCS
2010
217views more  JUCS 2010»
13 years 1 months ago
Cross Layer Optimization for Data Gathering in Wireless Multimedia Sensor Networks within Expected Network Lifetime
: The use of multimedia sensor nodes can significantly enhance the capability of wireless sensor networks (WSNs) for event description. In a number of scenarios, e.g., an erupting ...
Lei Shu, Manfred Hauswirth, Yan Zhang, Jianhua Ma,...
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 7 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...