Sciweavers

2691 search results - page 224 / 539
» Securing Ad Hoc Networks
Sort
View
WINET
2010
105views more  WINET 2010»
15 years 5 months ago
Flow rank based probabilistic fair scheduling for wireless ad hoc networks
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...
MOBIHOC
2005
ACM
16 years 6 months ago
Inducing spatial clustering in MAC contention for spread spectrum ad hoc networks
This paper proposes a new principle for designing MAC protocols for spread spectrum based ad hoc networks ? inducing spatial clustering in contending transmitters/receivers. We fi...
Xiangying Yang, Gustavo de Veciana
206
Voted
MOBICOM
2003
ACM
15 years 12 months ago
Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED
Significant TCP unfairness in ad hoc wireless networks has been reported during the past several years. This unfairness results from the nature of the shared wireless medium and ...
Kaixin Xu, Mario Gerla, Lantao Qi, Yantai Shu
INFOCOM
2002
IEEE
15 years 11 months ago
QoS and Fairness Constrained Convex Optimization of Resource Allocation for Wireless Cellular and Ad Hoc Networks
— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...
David Julian, Mung Chiang, Daniel O'Neill, Stephen...
INFOCOM
2000
IEEE
15 years 11 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