Sciweavers

522 search results - page 23 / 105
» Connected k-Hop Clustering in Ad Hoc Networks
Sort
View
131
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
A Graph-Based Model for Disconnected Ad Hoc Networks
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
Francesco De Pellegrini, Daniele Miorandi, Iacopo ...
ICC
2007
IEEE
174views Communications» more  ICC 2007»
15 years 8 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...
ICWN
2004
15 years 3 months ago
A Distributed Clustering Framework in Mobile Ad Hoc Networks
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...
Mohit Garg, R. K. Shyamasundar
GLOBECOM
2009
IEEE
14 years 11 months ago
Secure Unified Cellular Ad Hoc Network Routing
Abstract--Previous simulations have shown substantial performance gains can be achieved by using hybrid cellular and wireless LAN (WLAN) approaches [1]. In a hybrid system, a proxy...
Jason J. Haas, Yih-Chun Hu