477 search results - page 6 / 96 » Information-Theoretic Bounds for Mobile Ad-hoc Networks Rout... |
DFN
2004
13 years 10 months ago
2004
: Mobile ad hoc networks are self-organized, and devices in such networks have to locate available services dynamically. We propose to utilize anycast for efficient service discove...
INFORMATICALT
2006
13 years 8 months ago
2006
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
PE
2006
Springer
13 years 8 months ago
2006
Springer
Malicious nodes in a mobile and wireless ad hoc network can be a threat to the security and/or anonymity of the exchanged data. While data encryption can protect the content excha...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
ICNS
2007
IEEE
14 years 3 months ago
2007
IEEE
: Ad hoc networks are networks that consist of wireless mobile nodes. They are networks that do not require any preestablished infrastructure. Their ability to quickly and dynamica...