Data networks (2nd ed.)
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Routing in communications networks
Routing in communications networks
Solutions to hidden terminal problems in wireless networks
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Hierarchically-organized, multihop mobile wireless networks for quality-of-service support
Mobile Networks and Applications - Special issue: mobile multimedia communications
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Wireless ATM and Ad-Hoc Networks: Protocols and Architectures
Wireless ATM and Ad-Hoc Networks: Protocols and Architectures
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Loop-Free Internet Routing Using Hierarchical Routing Trees
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Source-Tree Routing in Wireless Networks
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Scalable Link-State Internet Routing
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Distributed, scalable routing based on vectors of link states
IEEE Journal on Selected Areas in Communications
Finding multi-constrained feasible paths by using depth-first search
Wireless Networks
Improving routing in long-distance wireless mesh networks via a distributed embedded router
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The efficiency with which the routing protocol of a multihop packet-radio network uses transmission bandwidth is critical to the ability of the network nodes to conserve energy. We present and verify the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than both table-driven and on-demand routing protocols proposed for wireless networks in the recent past. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router needs to reach every destination. To conserve transmission bandwidth and energy, a router transmits changes to its source routing tree only when the router detects new destinations, the possibility of looping, ot the possibility of node failures or network partitions. Simulation results show that STAR is an order of magnitude more efficient than any topology-broadcast protocol proposed to date and depending on the scenario is up to six times more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols.