COCOWA MODEL: WATCHDOG MECHANISM USED TO PROPAGATE SELFISH NODES IN CELLULAR NETWORKS OF MOVING VEHICLES

Main Article Content

Dr R VADIVEL

Abstract

The cellular networks are used to move the rapid growth in the mobile data in the explosion on the cellular network. The offload cellular networks are dynamic in the swimming condition. The highly dynamic sector is improved by the WIFI networks the Access point is configured by the MAC and the IP address. The mobile Ad hoc network model is formatted on the selfish node behavior .The detecting selfish node is performed by the watch dog timers. The swimming performances are used to move the delay tolerant networks. The cocowa approach based on the diffusion on the selfish node propagated. The collaborative approach are reduces the time and increases the precision when detecting the selfish nodes.

Downloads

Download data is not yet available.

Article Details

Section
Articles

References

P. A. K. Acharya, A. Sharma, E. M. Belding, K. C. Almeroth, S. Member, and D. Papagiannaki, “Rate adaptation in congested wireless networks through real-time measurements,†IEEE Transactions on Mobile Computing, vol. 9, no. 11, pp. 1535–1550, Nov. 2010.

Y. Sheng, G. Chen, H. Yin, K. Tan, U. Deshpande, B. Vance, D. Kotz, A. Campbell, C. McDonald, T. Henderson, and J. Wright, “MAP: a scalable monitoring system for dependable 802.11 wireless networks,†Wireless Communications, IEEE, vol. 15, no. 5, pp.10–18, October.

.K. Tan, C. McDonald, B. Vance, C. Arackaparambil, S. Bratus, and D. Kotz, “From MAP to DIST: the evolution of a largescale WLAN monitoring system,†IEEE Transactions on Mobile Computing, vol. 99, no. PrePrints, p. 1, 2012.

Matteo Sammarco, Miguel Elias M. Campista, and Marcelo Dias de Amorim “Scalable Wireless Traffic Capture Through Community Detection and Trace Similarity†in IEEE TRANSACTIONS ON MOBILE COMPUTING vol.15, issue July 2016

U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,†Physical Review E, vol. 76, no. 3, pp. 036 106+, Sep. 2007. [Online]. Available: http://dx.doi.org/10.1103/physreve. 76.036106

A. Argyriou and V. Madisetti, “Using a New Protocol to Enhance Path Reliability and Realize Load Balancing in Mobile Ad Hoc Networks,†Ad Hoc Networks, vol. 4, pp. 60-74, 2006.

A. Bletsas, A. Khisti, D.P. Reed, and A. Lippman, “A Simple Cooperative Diversity Method Based on Network Path Selection,†IEEE J. Selected Areas in Comm., vol. 24, no. 3, pp. 659-672, Mar. 2006.

V. Venkataramanan, X. Lin, L. Ying, and S. Shakkottai, “On Scheduling for Minimizing End-to-End Buffer Usage over Multi- Hop Wireless Networks,†Proc. IEEE INFOCOM, 2010.

B. B. Romdhanne, D. Dujovne, and T. Turletti, “Efficient and scalable merging algorithms for wireless traces,†in Workshop on Real Overlays and Distributed Systems (ROADS), Oct. 2009, pp. 1–7.

A. Balachandran, G. M. Voelker, P. Bahl, and P. V. Rangan, “Characterizing user behavior and network performance in a public wireless LAN,†in ACM SIGMETRICS, Jun.15-19 2002, pp. 195–205.

M. Sammarco, M. E. M. Campista, and M. D. de Amorim, “Trace selection for improved WLAN monitoring,†in ACM HotPlanet Workshop, Aug.16 2013, pp. 1–6.

M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,†Physical Review E, vol. 69, no. 2, pp. 026 113+, Feb. 2004. [Online]. Available: http: //dx.doi.org/10.1103/physreve.69.026113