Sciweavers

1464 search results - page 7 / 293
» Worst case mobility in ad hoc networks
Sort
View
POLICY
2007
Springer
14 years 1 months ago
On Automated Policy Generation for Mobile Ad Hoc Networks
In this paper we describe an approach to the problem of automated policy generation for mobile ad hoc networks. The automated policy generation problem is difficult in its own rig...
Cho-Yu Jason Chiang, Gary Levin, Yitzchak Gottlieb...
ADHOC
2004
113views more  ADHOC 2004»
13 years 7 months ago
Distributed protocols for ad hoc wireless LANs: a learning-automata-based approach
An ad hoc learning-automata-based protocol for wireless LANs, capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, ...
Petros Nicopolitidis, Georgios I. Papadimitriou, A...
MOBISYS
2003
ACM
14 years 7 months ago
iFlow: Middleware-assisted Rendezvous-based Information Access for Mobile Ad Hoc Applications
Due to node mobility and limitations on bandwidth availability in wireless channels, there exist unique challenges towards achieving efficient and effective information access in ...
Zongpeng Li, Baochun Li, Dongyan Xu, Xin Zhou
CISS
2008
IEEE
14 years 1 months ago
Optimizing redundancy using MDS codes and dynamic symbol allocation in mobile ad hoc networks
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
Anna Kacewicz, Stephen B. Wicker
ASIACRYPT
2008
Springer
13 years 9 months ago
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa