Consistent Data Release in MANET Using Light Weight Verification Algorithm with High Node Mobility
B.Natraj Kumar, M.Sri Lakshmi, Dr.S.Prem Kumar, ,
Affiliations M.Tech Research Scholar</br>Assistant Professor</br>Head of the Department Department of CSE, G.Pullaiah College of Engineering and Technology JNTU Anatapur, Andhra Pradesh, India
This paper addresses data aggregation and data packets problems for extremely
dynamic mobile temporary networks and Wireless sensor Networks thereby resulting in a timely
and reliable reduction in each communication and energy consumption. However there may be
node failures in existing systems Associate in an aggregation framework doesn't address
problems with false sub-aggregate values down to compromised nodes resulting in massive
errors in base station computed aggregates once data is transferred through mobile device
nodes. It cannot conjointly transfer data when nodes fail at the intermediate level. This paper
proposes a completely unique light-weight verification rule and Position primarily based
timeserving Routing (PTR) protocol that reduces node failure and knowledge loss problems.
Theoretical analysis and simulation prove that PTR and also the novel light-weight verification
rule succeed glorious performance below high node quality with acceptable overhead.
Conjointly the new void handling theme performs expeditiously.
B.Natraj Kumar,M.Sri Lakshmi,Dr.S.Prem Kumar."Consistent Data Release in MANET Using Light Weight Verification Algorithm with High Node Mobility". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.1, Issue 01,pp.44-53, July - 2014, URL :https://ijcert.org/ems/ijcert_papers/P7.pdf,
Keywords : Geographic routing, opportunistic forwarding, reliable data delivery, void handling, mobile ad hoc
network, Base station, data aggregation, hierarchical aggregation, in-network aggregation, sensor network
security, synopsis diffusion
 Madden, S., Franklin, M. J., Hellerstein, J. M., & Hong, W.(2002). TAG: A tiny aggregation service for ad-hoc
sensor networks. ACM SIGOPS Operating Systems Review, 36(SI),131-146.
 Law, Y. W., Palaniswami, M., &Phan, R. C. W. (2009). Secure Data Aggregation in Wireless Sensor Networks.
Guide to Wireless Sensor Networks, 533-559.
 Considine, J., Li, F., Kollios, G., & Byers, J. (2004, March). Approximate aggregation techniques for sensor
databases. In Data Engineering, 2004. Proceedings. 20th International Conference on (pp. 449-460). IEEE.
 Garofalakis, M., Hellerstein, J. M., &Maniatis, P. (2007,April). Proof sketches: Verifiable in-network
aggregation. In Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on (pp. 996-1005). IEEE.
 Yu, H. (2011). Secure and highly-available aggregation queries in large-scale sensor networks via set
sampling.Distributed Computing, 23(5), 373-394.
 Frikken, K. B., & Dougherty IV, J. A. (2008, March). An efficient integrity-preserving scheme for hierarchical
sensor aggregation. In Proceedings of the first ACM conference on Wireless network security (pp. 68-76). ACM.
 Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y. C., &Jetcheva, J. (1998, October). A performance comparison of
multi-hop wireless ad hoc network routing protocols. In Proceedings of the 4th annual ACM/IEEE international
conference on Mobile computing and networking (pp. 85-97). ACM.
 Karp, B., & Kung, H. T. (2000, August). GPSR: Greedy perimeter stateless routing for wireless networks. In
Proceedings of the 6th annual international conference on Mobile computing and networking (pp. 243-254). ACM.
 Arad, N., &Shavitt, Y. (2009). Minimizing recovery state in geographic ad hoc routing. Mobile Computing,
IEEE Transactions on, 8(2), 203-217.
 Ganesan, D., Govindan, R., Shenker, S., &Estrin, D. (2001).Highly-resilient, energy-efficient multipath routing
in wireless sensor networks. ACM SIGMOBILE Mobile Computing and Communications Review, 5(4), 11-25.
 Ye, Z., Krishnamurthy, S. V., &Tripathi, S. K. (2003, March). A framework for reliable routing in mobile ad hoc networks. In INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies (Vol. 1, pp. 270-280). IEEE.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.