Sciweavers

1464 search results - page 216 / 293
» Worst case mobility in ad hoc networks
Sort
View
COCOA
2010
Springer
13 years 6 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
MOBIHOC
2003
ACM
14 years 8 months ago
A MAC protocol for full exploitation of directional antennas in ad-hoc wireless networks
Directional antennas in ad hoc networks offer many benefits compared with classical omnidirectional antennas. The most important include significant increase of spatial reuse, cov...
Thanasis Korakis, Gentian Jakllari, Leandros Tassi...
MOBICOM
2006
ACM
14 years 2 months ago
SKVR: scalable knowledge-based routing architecture for public transport networks
Vehicular AdHoc Networks (VANET) can be treated as special kinds of Delay-tolerant Networks (DTN) where end-toend path might never be possible. As a result, mobile adhoc (MANET) r...
Shabbir Ahmed, Salil S. Kanhere
PADS
2004
ACM
14 years 2 months ago
Simulation Validation Using Direct Execution of Wireless Ad-Hoc Routing Protocols
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
Jason Liu, Yougu Yuan, David M. Nicol, Robert S. G...
ENTCS
2006
109views more  ENTCS 2006»
13 years 8 months ago
An Overview of MANETs Simulation
Mobile Ad hoc NETworks (MANETs) are dynamic networks populated by mobile stations. Stations in MANETs are usually laptops, PDAs or mobile phones. These devices feature Bluetooth a...
Luc Hogie, Pascal Bouvry, Frédéric G...