02068nas a2200229   4500000000100000000000100001008004100002260001200043653001200055653002000067653002200087653001300109653001500122100002000137700002400157245009700181856009800278300001000376490000600386520143200392022001401824       2016                            d  c09/201610aNetwork10aMobile Services10aManagemet Systems10aMobility10aScheduling1 aYoussef Harrati1 aAbdelmounaim Abdali00aMaxHopCount: A New Drop Policy to Optimize Messages Delivery Rate in Delay Tolerant Networks  uhttp://www.ijimai.org/JOURNAL/sites/default/files/files/2016/02/ijimai20164_1_7_pdf_15922.pdf  a37-410 v43 aCommunication has become a necessity, not only between every point on the earth, but also on the globe. That includes hard topography, highlands, underwater areas, and also space- crafts on other planets. However, the classic wired internet cannot be implemented in such areas, hence, researchers have invented wireless networks. The big challenge for wireless networking nowadays, is maintaining nodes connected in some difficult conditions, such as intermittent connectivity, power failure, and lot of obstacles for the interplanetary networks. In these challenging circumstances, a new networking model arises; it is Delay Tolerant networking which is based on the Store-Carry-and-Forward mechanism. Thus, a node may keep a message in its buffer for long periods of time; until a delivery or forward chance arises then it transmit it to other nodes. One of the big issues that confront this mechanism is the congestion of nodes buffer due to the big number of messages and the limited buffer size. Here, researchers have proposed buffer management algorithms in order to deal with the buffer overload problem, and they called it Drop Policies. In our present work, we propose a new Drop policy which we have compared to other existing policies in different conditions and with different routing protocols, and it always shows good result in term of number of delivered messages, network overhead and also average of latency.  a1989-1660