Sciweavers

483 search results - page 35 / 97
» On extracting consistent graphs in wireless sensor networks
Sort
View
HICSS
2008
IEEE
153views Biometrics» more  HICSS 2008»
15 years 13 hour ago
Fault-Tolerant k-Fold Pivot Routing in Wireless Sensor Networks
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
Doina Bein
TCOM
2008
120views more  TCOM 2008»
14 years 11 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
15 years 1 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
ACIIDS
2009
IEEE
108views Database» more  ACIIDS 2009»
15 years 6 months ago
Scrutinizing Performance of Ad Hoc Routing Protocols on Wireless Sensor Networks
Abstract—Wireless sensor networks(WSNs) have been regarded as an incarnation of Ad Hoc Networks for a specific application. Since a WSN consists of potentially hundreds of low c...
Zhongwei Zhang, Hong Zhou, Jason Gao
MOBIQUITOUS
2008
IEEE
15 years 6 months ago
Congestion control protocol for wireless sensor networks handling prioritized heterogeneous traffic
Heterogeneous applications could be assimilated within the same wireless sensor network with the aid of modern motes that have multiple sensor boards on a single radio board. Diff...
Muhammad Mostafa Monowar, Md. Obaidur Rahman, Al-S...