Stability of binary exponential backoff
Journal of the ACM (JACM)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Radio Resource Management for Wireless Networks
Radio Resource Management for Wireless Networks
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
A framework for opportunistic scheduling in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
When Does Opportunistic Routing Make Sense?
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Understanding the real-world performance of carrier sense
Proceedings of the 2005 ACM SIGCOMM workshop on Experimental approaches to wireless network design and analysis
Fundamentals of wireless communication
Fundamentals of wireless communication
Hop-by-hop congestion control over a wireless multi-hop network
IEEE/ACM Transactions on Networking (TON)
Analysis and implementation of distributed algorithms for multi-robot systems
Analysis and implementation of distributed algorithms for multi-robot systems
Opportunistic routing in wireless ad hoc networks: upper bounds for the packet propagation speed
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
End-to-end delay in wireless random networks
IEEE Communications Letters
Guest editorial: wireless communications in networked robotics
IEEE Wireless Communications
Wireless control of a multihop mobile robot squad
IEEE Wireless Communications
Using mobile robots to harvest data from sensor fields
IEEE Wireless Communications
Using robot mobility to exploit multipath fading
IEEE Wireless Communications
Multi-robot path finding with wireless multihop communications
IEEE Communications Magazine
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
The capacity of random wireless networks
IEEE Transactions on Wireless Communications - Part 1
The capacity of wireless networks
IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas
IEEE Transactions on Information Theory
Ego network models for Future Internet social networking environments
Computer Communications
| Hi-index | 0.24 |
Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing+MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV+CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV+CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.