Sciweavers

329 search results - page 18 / 66
» Source Routing and Scheduling in Packet Networks
Sort
View
SECON
2008
IEEE
14 years 1 months ago
Practical Localized Network Coding in Wireless Mesh Networks
—In this paper, BFLY–a practical localized network coding protocol for wireless mesh networks–is proposed. To supplement forwarding packets in classical networks, intermediat...
Oluwasoji Omiwade, Rong Zheng, Cunqing Hua
NOSSDAV
1995
Springer
13 years 11 months ago
Determining End-to-End Delay Bounds in Heterogeneous Networks
We define a class of Guaranteed Rate (GR) scheduling algorithms. The GR class includes Virtual Clock, Packet-byPacket Generalized Processor Sharing and Self Clocked Fair Queuing....
Pawan Goyal, Simon S. Lam, Harrick M. Vin
SPAA
2005
ACM
14 years 29 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
MOBICOM
2000
ACM
13 years 11 months ago
GPSR: greedy perimeter stateless routing for wireless networks
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...
Brad Karp, H. T. Kung
COMCOM
2006
110views more  COMCOM 2006»
13 years 7 months ago
Localized routing with guaranteed delivery and a realistic physical layer in wireless sensor networks
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
Milos Stojmenovic, Amiya Nayak