Sciweavers

106 search results - page 18 / 22
» A Path Density Protocol for MANETs
Sort
View
IDC
2009
Springer
13 years 5 months ago
Efficient Broadcasting by Selective Forwarding
A major challenge faced in mobile ad hoc networks (MANETs) is locating devices for communication, especially in the case of high node mobility and sparse node density. Present solu...
Doina Bein, Ajoy Kumar Datta, Balaji Ashok Sathyan...
INFOCOM
2002
IEEE
14 years 18 days ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
MOBIHOC
2005
ACM
14 years 7 months ago
On the node-scheduling approach to topology control in ad hoc networks
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
Budhaditya Deb, Badri Nath
WCNC
2008
IEEE
14 years 2 months ago
Adaptive Routing in Dynamic Ad Hoc Networks
Abstract—Dynamic ad hoc networks are mobile ad hoc networks (MANETs) where network characteristics, such as network density and node mobility, change significantly over time and...
Cong Liu, Jie Wu
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal