Sciweavers

1144 search results - page 34 / 229
» Locally constructed algorithms for distributed computations ...
Sort
View
ISCC
2005
IEEE
104views Communications» more  ISCC 2005»
14 years 2 months ago
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
P2P
2008
IEEE
184views Communications» more  P2P 2008»
14 years 3 months ago
Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Hasan Guclu, Durgesh Kumari, Murat Yuksel
HPCC
2007
Springer
14 years 2 months ago
Maximum-Objective-Trust Clustering Solution and Analysis in Mobile Ad Hoc Networks
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
Qiang Zhang, Guangming Hu, Zhenghu Gong
ICDCSW
2009
IEEE
14 years 3 months ago
A Straightforward Path Routing in Wireless Ad Hoc Sensor Networks
Building a “Straightforward” path in wireless ad hoc sensor networks (WASNs) not only avoids wasting energy in detours, but also incurs less interference in other transmission...
Zhen Jiang, Junchao Ma, Wei Lou, Jie Wu
MOBICOM
2004
ACM
14 years 2 months ago
A scalable model for channel access protocols in multihop ad hoc networks
A new modeling framework is introduced for the analytical study of medium access control (MAC) protocols operating in multihop ad hoc networks. The model takes into account the e...
Marcelo M. Carvalho, Jose Joaquin Garcia-Luna-Acev...