Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Delivery analysis of multicasting in BitTorrent enabled ad hoc network (MBEAN) routing
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Throughput analysis of IEEE802.11 multi-hop ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Multi-path routing protocols in wireless mobile ad hoc networks: a quantitative comparison
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The analytical model of BitTorrent Enabled Ad hoc Network (BEAN) routing protocol (unicast extension of Multi-cast BEAN - MBEAN routing protocol) is discussed for a random network. The source node forms multiple routes to destination differentiating each route by it's neighbor and sends packets through the best route. When a link or route fails, the source node chooses one of the existing alternate routes. This paper compares the throughput obtained analytically with that obtained in simulation for both AODV (Ad hoc On Demand Distance Vector) and BEAN routing protocols. Further simulations are run for realistic cases and the two protocols are compared for packet delivery ratio (PDR) and system throughput. The results show that, in spite of expending more time and control packets in finding a new route, BEAN performs as good as and in many cases, better than AODV, for a network with high density, in terms of throughput and PDR, thereby making it a potential unicast routing protocol for multicast applications.