<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8780</REFNUM><AUTHORS><AUTHOR>Aminu,M.</AUTHOR><AUTHOR>Ould-Khaoua,M.</AUTHOR><AUTHOR>Mackenzie,L.M.</AUTHOR><AUTHOR>Abdulai,J.</AUTHOR></AUTHORS><YEAR>2008</YEAR><TITLE>An Adjusted Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks</TITLE><PLACE_PUBLISHED>Proceedings of the Tenth International Conference on Computer Modeling and Simulation(EUROSIM/UKSIM 2008), 1-3 April 2008, University of Cambridge, UK.</PLACE_PUBLISHED><PUBLISHER>IEEE Computer Society Press</PUBLISHER><PAGES>441 - 446</PAGES><ISBN>0-7695-3114-8</ISBN><LABEL>Aminu:2008:8780</LABEL><KEYWORDS><KEYWORD>MANETs</KEYWORD></KEYWORDS<ABSTRACT>Broadcasting is a fundamental and frequently used operation in mobile ad hoc networks (MANETs) where a source node diffuses a message to all other nodes in the networks. Flooding, the process in which each node retransmits every uniquely received packet exactly once is the simplest and most commonly used mechanism for broadcasting in MANETs. Despite its simplicity, it can result in high redundant retransmission, contention and collision, a phenomenon collectively referred to as the broadcast storm problem, which can greatly increase the network communication overhead. This paper proposes an adjusted counter-based scheme which combines the advantages of probability and counterbased approaches to mitigate this inherent problem. The scheme is simple, efficient and uses two rebroadcast probabilities to differentiate between mobile nodes in sparse and dense area as against dropping the rebroadcast packet when a node is in dense area. We evaluate the performance of our scheme by comparing it against flooding, fixed probability and counter-based schemes. Simulation results reveal that our scheme achieves better performance in terms of saved rebroadcast, end-toend delay and without sacrificing reachability.</ABSTRACT></RECORD></RECORDS></XML>