Sciweavers

179 search results - page 13 / 36
» A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc ...
Sort
View
MOBICOM
2004
ACM
14 years 1 months ago
A structured group mobility model for the simulation of mobile ad hoc networks
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
Ken Blakely, Bruce Lowekamp
ICDCIT
2005
Springer
14 years 1 months ago
Merging Clustering Algorithms in Mobile Ad Hoc Networks
Abstract. Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a n...
Orhan Dagdeviren, Kayhan Erciyes, Deniz Cokuslu
WONS
2005
IEEE
14 years 1 months ago
A Partition Prediction Algorithm for Service Replication in Mobile Ad Hoc Networks
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
Abdelouahid Derhab, Nadjib Badache, Abdelmadjid Bo...
MOBIHOC
2005
ACM
14 years 7 months ago
Link-layer salvaging for making routing progress in mobile ad hoc networks
IEEE 802.11 MAC, called the Distributed Coordination Function (DCF), employs carrier sensing to effectively avoid collisions, but this makes it difficult to maximally reuse the sp...
Chansu Yu, Kang G. Shin, Lubo Song
TMC
2008
125views more  TMC 2008»
13 years 7 months ago
Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
Hong-Yen Yang, Chia-Hung Lin, Ming-Jer Tsai