2497 search results - page 72 / 500 » Requirements for models of achievable routing |
121
click to vote
HOST
2008
IEEE
15 years 8 months ago
2008
IEEE
—Straightforward implementations of cryptographic algorithms are known to be vulnerable to attacks aimed not at the mathematical structure of the cipher but rather at the weak po...
94
Voted
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
— In this paper, we model and characterize the performance of multihop radio networks in the presence of energy constraints, and design routing algorithms to optimally utilize th...
108
click to vote
IJDSN
2006
15 years 1 months ago
2006
Security is a critical challenge for creating robust and reliable sensor networks. For example, routing attacks have the ability to disconnect a sensor network from its central ba...
126
click to vote
PERCOM
2007
ACM
16 years 1 months ago
2007
ACM
Traditional mobile ad hoc routing protocols fail to deliver any data in Intermittently Connected Mobile Ad Hoc Networks (ICMN's) because of the absence of complete end-to-end ...
126
click to vote
NAS
2010
IEEE
15 years 2 days ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...