Sciweavers

2691 search results - page 278 / 539
» Security in Ad Hoc Networks
Sort
View
GLOBECOM
2007
IEEE
16 years 14 days ago
Graph Theoretical Analysis of Opportunistic Scheduling Policy for Wireless Ad Hoc Networks
— 1 Taking advantage of the independent fading channel conditions among multiple wireless users, opportunistic transmissions schedule the user with the instantaneously best condi...
Qing Chen, Fei Ye, Zhisheng Niu
172
Voted
IWQOS
2004
Springer
15 years 11 months ago
Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
Theodoros Salonidis, Leandros Tassiulas
ISPAN
2005
IEEE
15 years 11 months ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
167
Voted
COORDINATION
2008
Springer
15 years 8 months ago
A Process Calculus for Mobile Ad Hoc Networks
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
TPDS
2002
155views more  TPDS 2002»
15 years 5 months ago
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
Jie Wu