Design and validation of computer protocols
Design and validation of computer protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A new approach to the minimum cut problem
Journal of the ACM (JACM)
A cluster-based approach for routing in dynamic networks
ACM SIGCOMM Computer Communication Review
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Cellular IP: a new approach to Internet host mobility
ACM SIGCOMM Computer Communication Review
LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
The Bay Area Research Wireless Access Network (BARWAN)
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
A Performance Comparison of Energy Consumption for Mobile Ad Hoc Network Routing Protocols
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Distributed Clustering for Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
Adaptive clustering for mobile wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We present a cluster-based low-complexity routing algorithm for self-organizing networks of mobile nodes called FRANCA. The proposed algorithm allows mobile nodes to autonomously create clusters to minimize the power consumption. We maintained our proposal as simple as possible also providing it with robustness and auto-recoverability properties to allow nodes reconfiguration to be simple and fast. FRANCA is implemented as two separate protocols: the intra-cluster data-dissemination protocol and the inter-cluster routing protocol. These protocols allow integrating IEEE 802.11 and Bluetooth networks providing interoperability among mobile devices. We present a sensitivity analysis of the overall protocol architecture by varying the critical factors related to protocol behavior and we show that, in general, FRANCA implementation allows up to 25% of energy saving while keeping the overhead extremely low.