Sciweavers

375 search results - page 71 / 75
» On Increasing End-to-End Throughput in Wireless Ad Hoc Netwo...
Sort
View
MOBIHOC
2006
ACM
14 years 7 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
14 years 1 months ago
Restricted Shortest Path Routing with Concave Costs
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi
WINET
2010
185views more  WINET 2010»
13 years 6 months ago
TDMA scheduling algorithms for wireless sensor networks
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
Sinem Coleri Ergen, Pravin Varaiya
JSAC
2007
133views more  JSAC 2007»
13 years 7 months ago
On broadcasting with cooperative diversity in multi-hop wireless networks
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
Gentian Jakllari, Srikanth V. Krishnamurthy, Micha...
WINET
2008
81views more  WINET 2008»
13 years 7 months ago
Interference power statistics in ad-hoc and sensor networks
Abstract There exist accurate calculation methods for estimation of interference power sum statistics in fixedtopology wireless networks based on the log-normal shadowing radio mod...
Ramin Hekmat, Piet Van Mieghem