Sciweavers

1017 search results - page 86 / 204
» On Measuring Anonymity For Wireless Mobile Ad-hoc Networks
Sort
View
ICDCS
2010
IEEE
14 years 12 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
JSAC
2007
127views more  JSAC 2007»
14 years 9 months ago
Routing in Sparse Vehicular Ad Hoc Wireless Networks
— A Vehicular Ad Hoc Network (VANET) may exhibit a bipolar behavior, i.e., the network can either be fully connected or sparsely connected depending on the time of day or on the ...
Nawaporn Wisitpongphan, Fan Bai, Priyantha Mudalig...
VTC
2007
IEEE
15 years 4 months ago
Mobility-Aware Data Management on Mobile Wireless Networks
— We design a Mobility-aware DAta management (MoDA) scheme for mobile ad hoc networks (MANETs) composed by mobile nodes such as urban pedestrians and vehicles. By fully utilizing...
Akiko Yamasaki, Hirozumi Yamaguchi, Shinji Kusumot...
ETFA
2005
IEEE
15 years 3 months ago
ZRP versus DSR and TORA: a comprehensive survey on ZRP performance
Ad hoc networks are characterized by dynamic topology caused by node mobility, multihop wireless connectivity and channel non-deterministic behavior (interference, multipath, hidd...
Spilios Giannoulis, Christos D. Antonopoulos, Evan...
WINET
2010
105views more  WINET 2010»
14 years 8 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...