International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
|
Volume 11 - Issue 11 |
Published: Mar 2017 |
Authors: Kiran K., Vaishnavi K., P. Deepa Shenoy, Venugopal K. R. |
![]() |
Kiran K., Vaishnavi K., P. Deepa Shenoy, Venugopal K. R. . Throughput Analysis in an Infrastructure-based Mesh Network using BeeHive Algorithm. International Journal of Applied Information Systems. 11, 11 (Mar 2017), 1-9. DOI=10.5120/ijais2017451659
@article{ 10.5120/ijais2017451659, author = { Kiran K.,Vaishnavi K.,P. Deepa Shenoy,Venugopal K. R. }, title = { Throughput Analysis in an Infrastructure-based Mesh Network using BeeHive Algorithm }, journal = { International Journal of Applied Information Systems }, year = { 2017 }, volume = { 11 }, number = { 11 }, pages = { 1-9 }, doi = { 10.5120/ijais2017451659 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2017 %A Kiran K. %A Vaishnavi K. %A P. Deepa Shenoy %A Venugopal K. R. %T Throughput Analysis in an Infrastructure-based Mesh Network using BeeHive Algorithm%T %J International Journal of Applied Information Systems %V 11 %N 11 %P 1-9 %R 10.5120/ijais2017451659 %I Foundation of Computer Science (FCS), NY, USA
WiMAX andWiFi are among the major wireless technologies escalating today. Both these technologies provide last mile connectivity and differ in their Media Access Control (MAC) layer and physical (PHY) layers. Since most of the devices are equipped with WiFi, and WiMAX is prevailing in today’s devices, an efficient way of routing the data is by making use of both these technologies simultaneously. This work presents such a technique based on the Bee-hive routing algorithm for an infrastructure-based mesh network, which promotes interoperability between the WiMAX and WiFi technologies. The network consists of two types of nodes - 1)coordinator node 2)subscriber node, and divides the entire network into regions called foraging regions/zones based on the hop count from the coordinator node. A detailed implementation of this algorithm is presented in this work. The algorithm is tested for various mobile and static topologies by varying the parameters such as the speed of motion of the mobile nodes and the hop limit.