Sciweavers

2571 search results - page 343 / 515
» Approximation schemes for wireless networks
Sort
View
VTC
2010
IEEE
171views Communications» more  VTC 2010»
15 years 4 months ago
Optimum Physical-Layer Frame Size for Maximising the Application-Layer Rateless Code's Effective Throughput
— The tolerable packet-loss ratio of an Internet Protocol (IP) based wireless networks varies according to the specific services considered. File transfer for example must be er...
Tim Stevens, Robert G. Maunder, Lajos Hanzo
MOBIHOC
2004
ACM
16 years 6 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
JAIR
2010
130views more  JAIR 2010»
15 years 5 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
MOBIHOC
2002
ACM
16 years 6 months ago
Topology management for sensor networks: exploiting latency and density
In wireless sensor networks, energy efficiency is crucial to achieve satisfactory network lifetime. In order to reduce the energy consumption of a node significantly, its radio ne...
Curt Schurgers, Vlasios Tsiatsis, Saurabh Ganeriwa...
ACSC
2004
IEEE
15 years 10 months ago
Establishing Trust In Pure Ad-hoc Networks
An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. It is also often termed an infrastructure-less, self-or...
Asad Amir Pirzada, Chris McDonald