A Selfishness Aware Neighbor Coverage Based Probabilistic Rebroadcast Protocol for Manets

International Journal of Computer Trends and Technology (IJCTT)          
© - November Issue 2013 by IJCTT Journal
Volume-5 Issue-1                           
Year of Publication : 2013
Authors :Deepthi Sivaraj.


Deepthi Sivaraj."A Selfishness Aware Neighbor Coverage Based Probabilistic Rebroadcast Protocol for Manets"International Journal of Computer Trends and Technology (IJCTT),V5(1):44-48 November Issue 2013 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract:- Broadcasting is a fundamental and effective data dissemination mechanism for route discovery, address resolution and many other network services in ad hoc networks. While data broadcasting has many advantages, it also causes some problems such as the broadcast storm problem, which is characterized by redundant retransmission, collision, and contention. To discover the route better than broadcasting methodology, rebroadcast can be done with the help of neighbor knowledge methods. In order to effectively exploit the neighbor coverage knowledge, we propose a novel rebroadcast delay and a connectivity factor to provide the node density adaptation. This paper proposes new reputation based neighbor coverage based probabilistic rebroadcast protocol based on AODV (Ah hoc On demand Distance Vector). This approach can significantly decrease the number of retransmissions so as to reduce the routing overhead and also improve the routing performance.


References -

[1] Luis Angel Maestro Ruiz de Temino and Carles Navarro I Manchon, “Iterative Channel Estimation with Robust Wiener Filtering in LTE Downlink,”IEEE Trans.Commn.,Aug, 2008
[2] Andrea Ancora , Calogero , Bona Dirk T.M. Slock , “Down-Sampled Impulse Respponse Least-Squares Channel Estimation For LTE OFDMA, ”IEEE Trans.,ICASSP ’07.
[3] Farzad Foroughi , Johan Lofgren, Ove Edfors,”Channel estimation for a Mobile Terminal in a Multi-Standard Enviroment (LTE and DVBH).” IEEE Trans. Aug 2009.
[4] Members of 3GPP, “Technical Sepcification Group Radio Access Network;Physical Channels and Modulation (3GPP TS 36.211 Version 8.8.0),”3GPP,Tech.Spe.,Sep,2009..
[5] L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inf. Theory, vol, IT-20, no. 2, pp.284-287, Mar.1974
[6] G. Bauch, H. Khoram, J. Haganauer, “Iterative equalization and decoding in mobile communications systems,” in Proc. 2nd EPMCC, 3.ITGFachtagung “Mobile Kommunikation,” Sep./Oct. 1997, pp. 307– 312.VDE/ITG..
[7] P. Robertson, P. Hoeher, and E. Villebrun, “Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding,” Eur. Trans. Telecommun., vol. 8, no. 2, pp. 119–125, 1997.
[8] J. A. Erfanian, S. Pasupathy, and G. Gulak, “Reduced complexity symbol detectors with parallel structures for ISI channels,” IEEE Trans.Commun. , vol. 42, no. 234, pp. 1661–1671, Feb.–Apr. 1994.

Keywords :— Mobile ad hoc networks, neighbor coverage, network connectivity, probabilistic rebroadcast, routing overhead, reputation.