Open Access   Article Go Back

Towards Online Shortest Path Computation Using Energy Based Clustering And Aggregation Algorithm

S.Sinthuja 1 , V.Geetha 2

Section:Review Paper, Product Type: Journal Paper
Volume-3 , Issue-8 , Page no. 140-142, Aug-2015

Online published on Aug 31, 2015

Copyright © S.Sinthuja , V.Geetha . 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: S.Sinthuja , V.Geetha, “Towards Online Shortest Path Computation Using Energy Based Clustering And Aggregation Algorithm,” International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.140-142, 2015.

MLA Style Citation: S.Sinthuja , V.Geetha "Towards Online Shortest Path Computation Using Energy Based Clustering And Aggregation Algorithm." International Journal of Computer Sciences and Engineering 3.8 (2015): 140-142.

APA Style Citation: S.Sinthuja , V.Geetha, (2015). Towards Online Shortest Path Computation Using Energy Based Clustering And Aggregation Algorithm. International Journal of Computer Sciences and Engineering, 3(8), 140-142.

BibTex Style Citation:
@article{_2015,
author = {S.Sinthuja , V.Geetha},
title = {Towards Online Shortest Path Computation Using Energy Based Clustering And Aggregation Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {8 2015},
volume = {3},
Issue = {8},
month = {8},
year = {2015},
issn = {2347-2693},
pages = {140-142},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=624},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=624
TI - Towards Online Shortest Path Computation Using Energy Based Clustering And Aggregation Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - S.Sinthuja , V.Geetha
PY - 2015
DA - 2015/08/31
PB - IJCSE, Indore, INDIA
SP - 140-142
IS - 8
VL - 3
SN - 2347-2693
ER -

VIEWS PDF XML
2363 2264 downloads 2396 downloads
  
  
           

Abstract

The online briefest way issue aims at processing the briefest way based on live change circumstances. This is extremely imperative in present day car route frame lives up to expectations as it makes a difference drivers to make sensible decisions. To our best knowledge, there is no capable system/arrangement that can offer affordable costs at both customer and server sides on the other hand online briefest way computation. Unfortunately, the ordinary customer server building design scales poorly with the number of clients. A promising approach is to let the server gather live change information and at that point telecast them over radio on the other hand remote network. This approach has excellent versatility with the number of clients. Thus, we create a new framework called live change file (LTI) which empowers drivers to rapidly and effectively gather the live change information on the broadcasting channel. An impressive result is that the driver can compute/update their briefest way result by receiving just a little part of the index. The test study shows that LTI is robust to different parameters and it offers moderately short tune-in fetched (at customer side), quick question reactivity time (at customer side), little telecast size (at server side), and light support time (at server side) on the other hand online briefest way problem.

Key-Words / Index Term

Most Constrained Path, Air Index, Broadcasting

References

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265
[8] Thulasiraman, K. ; Xi Fang ; Dejun Yang more authors,” Computing a Most Probable Constrained Path: NP-Hardness and ApproximatioScheme”. Published in:Computers, IEEE Transactions on (Volume:61 , Issue: 5 Page(s)738 – 744.
[9] Hongbo Wang ; Adamou, B. ; Shiduan Cheng Finding the Most Balanced Delay Constrained PathPublished in:Communications and Mobile Computing, 2009. CMC '09. WRI International Conference on (Volume:3 )Date of Conference:6-8 Jan. 2009Page(s):201 - 205