Open Access   Article Go Back

Improving load balance in Wireless Network using Spatial Reusability

Vinodh P Vijayan1 , Neena Joseph2 , Neema George3 , Simy Mary Kurian4

Section:Research Paper, Product Type: Journal Paper
Volume-4 , Issue-12 , Page no. 142-147, Dec-2016

Online published on Jan 02, 2016

Copyright © Vinodh P Vijayan, Neena Joseph, Neema George, Simy Mary Kurian . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Vinodh P Vijayan, Neena Joseph, Neema George, Simy Mary Kurian, “Improving load balance in Wireless Network using Spatial Reusability,” International Journal of Computer Sciences and Engineering, Vol.4, Issue.12, pp.142-147, 2016.

MLA Style Citation: Vinodh P Vijayan, Neena Joseph, Neema George, Simy Mary Kurian "Improving load balance in Wireless Network using Spatial Reusability." International Journal of Computer Sciences and Engineering 4.12 (2016): 142-147.

APA Style Citation: Vinodh P Vijayan, Neena Joseph, Neema George, Simy Mary Kurian, (2016). Improving load balance in Wireless Network using Spatial Reusability. International Journal of Computer Sciences and Engineering, 4(12), 142-147.

BibTex Style Citation:
@article{Vijayan_2016,
author = {Vinodh P Vijayan, Neena Joseph, Neema George, Simy Mary Kurian},
title = {Improving load balance in Wireless Network using Spatial Reusability},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {12 2016},
volume = {4},
Issue = {12},
month = {12},
year = {2016},
issn = {2347-2693},
pages = {142-147},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=5481},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=5481
TI - Improving load balance in Wireless Network using Spatial Reusability
T2 - International Journal of Computer Sciences and Engineering
AU - Vinodh P Vijayan, Neena Joseph, Neema George, Simy Mary Kurian
PY - 2016
DA - 2017/01/02
PB - IJCSE, Indore, INDIA
SP - 142-147
IS - 12
VL - 4
SN - 2347-2693
ER -

VIEWS PDF XML
1069 1081 downloads 1052 downloads
  
  
           

Abstract

The surest route from the supply node to the destination node that guarantees a high cease-to-stop throughput is the principle trouble of routing in multi-hop wireless network. As the surroundings is heterogeneous the issue seems to be a lot complicated, most of the answers cease with local most desirable due to the fact the ones algorithms often fail to make certain an quit to quit throughput. By considering spatial reusability of wireless media, the cease-to-give up throughput in wi-fi multi-hop far flung structures may be stronger hugely. To assist the argument, Spatial-reusability Aware Single-path Routing (SASR) algorithm is proposed and as compared with existing single direction routing protocol. The assessment showed that proposed protocol display full-size improvement in end-to-give up throughput in evaluation with existing protocols.

Key-Words / Index Term

WSN, througput, optimization.

References

[1] W. Hu, J. Xie, and Z. Zhang, “Practical opportunistic routing in high-speed multi-rate Wireless mesh networks,” in Proc. 14th ACM Int. Symp. Mobile Ad Hoc Netw. Comput. 2013, pp. 127–136.
[2] N. M. Jones, B. Shrader, and E. Modiano, “Optimal routing and scheduling for a simple network coding scheme,” in Proc. INFOCOM, 2012, pp. 352–360.
[3] S. Zhao, L. Fu, X. Wang, and Q. Zhang, “Fundamental relationship between node density and delay in wireless ad hoc networks with unreliable links,” in Proc. 17th Annu. Int. Conf. Mobile Comput. Netw. 2011, pp. 337–348.
[4] R. P. Laufer, H. Dubois-Ferri_ere, and L. Kleinrock, “Multirateanypathrouting in wireless mesh networks,” in Proc. INFOCOM, 2009, pp. 37–45.
[5] Y. Lin, B. Li, and B. Liang, “Codeor: Opportunistic routing in wireless mesh networks with segmented network coding,” in Proc. IEEE Int. Conf. Netw. Protocols, 2008, pp. 13–22.
[6] G. Jakllari, S. Eidenbenz, N. W. Hengartner, S. V. Krishnamurthy, and M. Faloutsos, “Link. Positions matter: A noncommutative routing metric for a wireless mesh network,” in Proc. IEEE 27thConf. Comput. Commun., 2008, pp. 744–752.
[7] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, “Trading structure for randomness in wireless opportunistic ro uting,” in Proc. SIGCOMM Conf. Appl., Technol., Archit. Protocols Comput. Commun., 2007, pp. 169–180.
[8] T.-S. Kim, J. C. Hou, and H. Lim, “Improving spatial reuse through tuning transmit power, carrier sense threshold, and data rate in multihop wireless networks,” in Proc. 12th Annu. Int. Conf. Mobile Comput. Netw., 2006, pp. 366–377.
[9] S. Biswas and R. Morris, “Exor: Opportunistic multi-hop routing for wireless networks,” in Proc. SIGCOMM Conf. Appl., Technol., Archit., Protocols Comput. Commun., 2005, pp. 133-144 .
[10] J. Padhye, S. Agarwal, V. N. Padmanabhan, L. Qiu, A. Rao, and B. Zill, “Estimation of link interference in static multi-hop wireless networks,” in Proc. Internet Meas. Conf., 2005, p 28.
[11] A. Adya, P. Bahl, J. Padhye, A. Wolman, and L. Zhou, “A multi-radio unification protocol for IEEE 802.11 wireless networks,” in Proc. 1st Int. Conf. Broadband Netw., 2004, pp. 344–345.
[12] R. Draves, J. Padhye, and B. Zill, “Routing in multi-radio, multihop wireless mesh networks,” in Proc. 10th Annu. Int. Conf. Mobile Comput. Netw., 2004, pp. 114–128.
[13] R. Cohen, and S. Havlin, (2003, Feb.). Scale-free networks are ultrasmall. Phys. Rev. Lett. [Online] 90, p. 058701.Available: http://link.aps.org/doi/10.1103/PhysRevLett.90.058701.
[14] D. S. J. D. Couto, D. Aguayo, J. C. Bicket, and R. Morris, “A high throughput path metric for multi-hop wireless routing,” in Proc. 9th Annu. Int. Conf. Mobile Comput. Netw., 2003, p 134–146.
[15] C. E. Perkins and E. M. Belding-Royer, “Ad-hoc on-demand distance vector routing,” in Proc. 2nd IEEE Workshop Mobile Comput.Syst. Appl., 1999, pp. 90–100.
[16] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. G. Jetcheva, “A Performance Comparison of multi-hop wireless ad hoc network routing protocols,” in Proc. 4th Annu. ACM/IEEE Int. Conf. Mobile Comput. Newt., 1998, pp. 85–97.
[17] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,” Mobile Comput., vol. 353, pp. 153– 181, 1996.
[18] C. E. Perkins and P. Bhagwat, “Highly dynamic destination sequenced distance-vector routing (DSDV) for mobile computers,” in Proc. Conf. Commun. Archit., Protocols Appl., 1994, pp. 234–244.