CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Shortest Path Minimum Broadcast Energy Conserving Protocol for Asymmetric WSN

by Anuja H. Galphade, Arati M. Dixit
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 124 - Number 10
Year of Publication: 2015
Authors: Anuja H. Galphade, Arati M. Dixit
10.5120/ijca2015905614

Anuja H. Galphade, Arati M. Dixit . Shortest Path Minimum Broadcast Energy Conserving Protocol for Asymmetric WSN. International Journal of Computer Applications. 124, 10 ( August 2015), 17-22. DOI=10.5120/ijca2015905614

@article{ 10.5120/ijca2015905614,
author = { Anuja H. Galphade, Arati M. Dixit },
title = { Shortest Path Minimum Broadcast Energy Conserving Protocol for Asymmetric WSN },
journal = { International Journal of Computer Applications },
issue_date = { August 2015 },
volume = { 124 },
number = { 10 },
month = { August },
year = { 2015 },
issn = { 0975-8887 },
pages = { 17-22 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume124/number10/22139-2015905614/ },
doi = { 10.5120/ijca2015905614 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:14:01.537227+05:30
%A Anuja H. Galphade
%A Arati M. Dixit
%T Shortest Path Minimum Broadcast Energy Conserving Protocol for Asymmetric WSN
%J International Journal of Computer Applications
%@ 0975-8887
%V 124
%N 10
%P 17-22
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Asymmetric Wireless sensor network is dynamic in nature and completely operates on infrastructure less environment. It discovers routes dynamically to reach the destination. Securing a dynamic route which is not known before communication is always a challenge. Energy conservation and finding the shortest path is a key challenge. In this paper propose a shortest path Minimum Broadcast Energy conserving (SME) Protocol for Asymmetric Wireless Sensor Network. It finds the shortest path in minimum broadcasts and conserves energy in asymmetric wireless network. The basic idea behind SME is to improve upon RP, Layhet, Egyhet from the state of the art and achieve performance enhancement with better delivery rate consuming minimum energy and slow sinking with reduction in energy during data routing process for data transmission to destination for the route selected in an asymmetric environment. Asymmetric indicates where two end nodes may not use the same path to communicate with each other.

References
  1. I. Alyildiz, Y. Sankarasubramaniam W. Su, and E. Cayicrci, ``A survey on sensor networks,'' IEEE Commun. Mag., vol.40, no.8, pp. 102-116, Aug.
  2. I. A. Essa, ``Ubiquitous sensing for smart and aware environments,'' IEEE Personal Commun., vol. 7, no. 5, pp. 47_49, Oct. 2000.
  3. A. M. Mainwaring, D. E. Culler, J. Polastre, R. Szewczyk, and J. Anderson, ``Wireless sensor networks for habitat monitoring,'' in Proc.1st ACM Int. Workshop WSNA, 2002, pp. 88_97.
  4. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker, ``An empirical study of epidemic algorithms in large scale multihop wireless networks,'' Intel Corp., Santa Clara, CA, USA,Tech. Rep. IRB-TR-02-003, Mar. 2002.
  5. P. Juang, H. Oki, Y. Wang, M. Martonosi, L. S. Peh, and D. Rubenstein, `Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with Zebra Net,'' in Proc. 10th Int. Conf. ASPLOS, Oct. 2002, pp. 96_107.
  6. M. K. Marina and S. R. Das, ``Routing performance in the presence of unidirectional links in multihop wireless networks,'' in Proc. IEEE Symp.Mobile Ad Hoc Network. Compute., Jun. 2002, pp. 85_97
  7. V. Ramasubramanian and D. Mosse, ``BRA: A bidirectional routing abstraction for asymmetric mobile ad hoc networks,'' IEEE/ACM Trans. Netw., vol. 16, no. 1, pp. 116_129, Feb. 2008.X.
  8. X. Chen, W. Y. Qu, H. L. Ma, and K. Q. Li, ``A Geography based heterogeneous hierarchy routing Protocol for wireless sensor networks,'' in Proc.10th IEEE HPCC, Sep. 2008, pp. 767_774.
  9. T. Clausen and P. Jacquet, “Optimal link state Routing,” RFC 3626, Oct. 2003.
  10. C. Perkins and P. Bhagwat, “Highly Dynamic Destination-sequenced distance-Vector routing (DSDV) for mobile computers,” in Proc. ACM SIGCOMM, Aug. 1994 .
  11. R.Prakash, “Unidirectional links prove costly in Wireless ad hoc networks,” in Proc. ACM DIAL-M Workshop, Seattle, A, Aug. 1999.
  12. C. E. Perkins, E. M. Royer, and S. R. Das, “Ad-hoc on demand distance vector (AODV) routing,” RFC 3561, Jul. 2001.
  13. Xio Chen, Zanxun Dai, Wenzhong Lee and Hongch Shi, “Performance Guaranteed Routing Protocols for Asymmetric Sensor Networks”, VOL 1, Issue 1, JUNE 2013, IEEE Transactions.
  14. X. Chen, Z. X. Dai, W. Z. Li, Y. F. Hu, J. Wu, H. C. Shi, and S. L. Lu, ``Prohet: A probabilistic routing Protocol with assured delivery rate in wireless Heterogeneous sensor networks,''IEEE Trans.Wireless Commun., vol. 12, no. 4, pp. 1524_1531, Apr. 2013.
  15. E. Duros,W. Dabbous, H. Izumiyama N. Fujii, and Y. Zhang, A Link Layer, Tunnelling Mechanism for Unidirectional Links. New York, NY, USA: RFC Editor, 2001.
  16. S. Nesargi and R. Prakash, ``A tunneling approach to Routing with unidirectional links in mobile ad hoc Networks,'' in Proc. 9th ICCCN, Oct. 2000, pp. 522 527.
Index Terms

Computer Science
Information Sciences

Keywords

Asymmetric Wireless Sensor Network RP Layhet Egyhet SME.

Powered by PhDFocusTM