Sciweavers

2572 search results - page 514 / 515
» Identification in Ad Hoc Networks
Sort
View
JFP
2008
72views more  JFP 2008»
13 years 5 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
AAAI
2010
13 years 4 months ago
A Trust Model for Supply Chain Management
hey generalize these factors to the abstract concepts of ability, integrity, and benevolence. This model does not use probabilistic decision theory. Other SCM trust factors have be...
Yasaman Haghpanah, Marie desJardins
INFOCOM
2010
IEEE
13 years 4 months ago
A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs
—We propose and investigate a deterministic traveling wave model for the progress of epidemic routing in disconnected mobile ad hoc networks. In epidemic routing, broadcast or un...
Daniel J. Klein, João Pedro Hespanha, Upama...
TMC
2010
158views more  TMC 2010»
13 years 4 months ago
Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
Murtuza Jadliwala, Sheng Zhong, Shambhu J. Upadhya...
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 23 days ago
Fairness issues in a chain of IEEE 802.11 stations
: We study a simple general scenario of ad hoc networks based on IEEE 802.11 wireless communications, consisting in a chain of transmitters, each of them being in the carrier sense...
Bertrand Ducourthial, Yacine Khaled, Stépha...