Routing in communications networks
Computer networks (3rd ed.)
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Source-Tree Routing in Wireless Networks
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
A mobility-based framework for adaptive clustering in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Flow-oriented protocols for scalable wireless networks
MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Effect of overhearing transmissions on energy efficiency in dense sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Quality of service in mobile ad hoc networks
The handbook of ad hoc wireless networks
A Two-Zone Hybrid Routing Protocol for Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Experimental Evaluation of Ad Hoc Routing Protocols
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
On the Performance of the HSLS Routing Protocol for Mobile Ad hoc Networks
Wireless Personal Communications: An International Journal
IEEE Annals of the History of Computing
JAVeLEN - An ultra-low energy ad hoc wireless network
Ad Hoc Networks
An energy-conscious transport protocol for multi-hop wireless networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
A declarative perspective on adaptive manet routing
Proceedings of the ACM workshop on Programmable routers for extensible services of tomorrow
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
RapidMesh: declarative toolkit for rapid experimentation of wireless mesh networks
Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization
A demonstration of the RapidMesh development toolkit
Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization
A scalable routing scheme with group motion support in large and dense wireless ad hoc networks
Computers and Electrical Engineering
MANETKit: supporting the dynamic deployment and reconfiguration of ad-hoc routing protocols
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
PROSE: scalable routing in MANETs using prefix labels and distributed hashing
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
An improved location-aided routing protocol for mobile ad hoc networks with greedy approach
WSEAS TRANSACTIONS on COMMUNICATIONS
MANETKit: supporting the dynamic deployment and reconfiguration of ad-hoc routing protocols
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Dircast: flooding-reduced routing in MANETs without destination coordinates
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
PUMA: policy-based unified management architecture for wireless networking
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
Comparison of proposed OSPF MANET extensions
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
On performance modeling of ad hoc routing protocols
EURASIP Journal on Wireless Communications and Networking
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Comparison of reactive and proactive routing protocols for different mobility conditions in WSN
Proceedings of the 2011 International Conference on Communication, Computing & Security
A wireless interface type for OSPF
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
A study of link state flooding optimizations for scalable wireless networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Towards adaptable ad hoc networks: the routing experience
WAC'04 Proceedings of the First international IFIP conference on Autonomic Communication
A Semantics-based Approach to Large-Scale Mobile Social Networking
Mobile Networks and Applications
Byzantine Agreement & Fault Diagnosis Agreement in Dynamic Ad-Hoc Environment
Fundamenta Informaticae
Declarative policy-based adaptive mobile ad hoc networking
IEEE/ACM Transactions on Networking (TON)
Mercator: self-organizing geographic connectivity maps for scalable ad-hoc routing
IWSOS'07 Proceedings of the Second international conference on Self-Organizing Systems
PassCAR: A passive clustering aided routing protocol for vehicular ad hoc networks
Computer Communications
APDV: making distance vector routing scale using adaptive publish-subscribe mechanisms
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
In this paper, we introduce a class of approaches that attempt to scale link-state routing by limiting the scope of link state update dissemination in space and over time. We present the first fundamental analysis of this generic class, which we call "Fuzzy Sighted Link State routing". Using a novel perspective on the "overhead"of a protocol that includes not only the overhead due to control messages but also due to route sub-optimality, we formulate an analytical model whose solution automatically leads to the best algorithm in this class. This algorithm is shown to have nearly the best possible asymptotic overhead for any routing algorithm -proactive or reactive. Simulation results are presented that compare the performance or several algorithms in this class