Sciweavers

968 search results - page 110 / 194
» Throughput, Delay, and Mobility in Wireless Ad Hoc Networks
Sort
View
MOBIHOC
2002
ACM
16 years 5 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
WIMOB
2007
IEEE
16 years 17 days ago
A Fault Resilient Routing Protocol for Mobile Ad-Hoc Networks
— In a Mobile Ad hoc NETwork (MANET), mobile devices cooperate to forward packets for each other without the assistance of dedicated routing infrastructures. Due to its networkin...
Sirisha Medidi, Jiong Wang
INFOCOM
2000
IEEE
15 years 10 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
INFOCOM
2010
IEEE
15 years 4 months ago
From Time Domain to Space Domain: Detecting Replica Attacks in Mobile Ad Hoc Networks
—A common vulnerability of wireless networks, in particular, the mobile ad hoc network (MANET), is their susceptibility to node compromise/physical capture attacks since the wire...
Kai Xing, Xiuzhen Cheng
COMCOM
2006
188views more  COMCOM 2006»
15 years 6 months ago
Dynamic bandwidth allocation for QoS routing on TDMA-based mobile ad hoc networks
The paper proposes several dynamic bandwidth allocation strategies for QoS routing on TDMA-based mobile ad hoc networks. Comprehensively, these strategies are called a distributed...
Kuei-Ping Shih, Chih-Yung Chang, Yen-Da Chen, Tsun...