Sciweavers

832 search results - page 58 / 167
» Secure Node Discovery in Ad-hoc Networks and Applications
Sort
View
INFOCOM
2002
IEEE
15 years 11 months ago
Clustering Overhead for Hierarchical Routing in Mobile Ad hoc Networks
Numerous clustering algorithms have been proposed that can support routing in mobile ad hoc networks (MANETs). However, there is very little formal analysis that considers the comm...
John Sucec, Ivan Marsic
IJNM
2008
112views more  IJNM 2008»
15 years 6 months ago
How to avoid packet droppers with proactive routing protocols for ad hoc networks
Routing protocols for mobile ad hoc networks (MANETs) have been an active area of research for the last decade, with many very interesting potential as well as actual applications...
Ignacy Gawedzki, Khaldoun Al Agha
MSWIM
2006
ACM
16 years 2 days ago
Pattern matching based link quality prediction in wireless mobile ad hoc networks
As mobile devices, such as laptops, PDAs or mobile phones, are getting more and more ubiquitous and are able to communicate with each other via wireless technologies, the paradigm...
Károly Farkas, Theus Hossmann, Lukas Ruf, B...
IWCMC
2009
ACM
16 years 19 days ago
On fault tolerant ad hoc network design
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, e...
Wasim El-Hajj, Hazem Hajj, Zouheir Trabelsi
TMC
2008
125views more  TMC 2008»
15 years 6 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai