Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

119 articles for “MANET”
Set a search alert
Research ArticleOpen accessIn the keywordsComparative Study of Two Reactive Routing Protocols with Realistic Mobility ModelJohn Tengviel, Agyemang SylvesterA Mobile Ad-hoc Networks (MANETs) are dynamic wireless networks that can be formed without the need for any existing infrastructure in which each node can act as a host as well as a router. One of the main challenges of MANETs is the design of robust routing protocols that adapt to the frequent and randomly changing network topology. A variety … …American Journal of Engineering and Applied Sciences, Vol. 13, Issue 4 · 21 Dec 2020 · 6,231 accessesView PDFCite
Review ArticleOpen accessIn the keywordsGeneration Test-Cases of Attacks in Mobile Ad Hoc NetworkSara Chadli, Mohammed Saber, Abdelhak ZiyyatThe number and increasing complexity of attacks against MANETs have grown significantly in recent years. While many security proposals have been developed. However, these proposals suffer from the problems of tests and evaluations. Among these solutions, the Intrusion Detection Systems (IDS) that can act as defense mechanisms. However, this last poses serious problems for its evaluators that need classify the … …Journal of Computer Science, Vol. 12, Issue 10 · 14 Dec 2016 · 6,522 accessesView PDFCite
Research ArticleOpen accessIn the keywordsQUEUEING MODELS IN MOBILE AD-HOC NETWORKSS. Baskar, S. PalaniammalThe Mobile Ad-hoc Networks (MANETs) has gain an essential part of the attention of researchers and become very well-liked in last few years. MANETs can operate with no fixed communications and can live rapid changes in the network topology. They can be studied officially as graphs in which the set of boundaries varies in time. One of the main methods … …American Journal of Applied Sciences, Vol. 11, Issue 2 · 26 Dec 2013 · 6,819 accessesView PDFCite
Research ArticleOpen accessIn the keywordsRange Detection Multicast Routing Protocol for Mobile Ad-Hoc NetworksR. Velumani, K. DuraiswamyProblem statement: Many efforts have been implemented towards the Group membership management on multicast routing in MANETs, but the difficulties associated with Group membership management are still existed. Approach: Maintaining endurance of Group Leader (GL) in multicasting routing has been a great challenge to all the protocol having been invented so far. Results: This study provides the RDMP algorithm for … …Journal of Computer Science, Vol. 8, Issue 4 · 10 Feb 2012 · 6,486 accessesView PDFCite
Research ArticleOpen accessIn the keywordsMisbehaving Node Detection in Mobile Ad Hoc Networks using Multi Hop Acknowledgement SchemeUsha Sakthivel, S. RadhaProblem statement: For any node in a Mobile Ad hoc Network conservation of battery power and bandwidth are the priority. Hence, they try to reduce the overload they would otherwise incur when they forward packets. This selfish behavior of a node affects the throughput of the network. The nodes may also choose a back off value of shorter duration. These … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 6,712 accessesView PDFCite
Research ArticleOpen accessIn the keywordsAn Effective Location-Based Power Conservation Scheme for Mobile Ad Hoc NetworksKhalid Kaabneh, Azmi Halasa, Hussein Al-BahadiliProblem statement: One of the major issues in current reactive routing protocols for Mobile Ad Hoc Networks (MANETs) is the high bandwidth and power consumptions during the routing process. In this study, we proposed and evaluated the performance of an efficient Location-Based Power Conservation (LBPC) scheme for MANETs. Approach: In this scheme, the transmitting node utilized the location-information of the … …American Journal of Applied Sciences, Vol. 6, Issue 9 · 30 Sep 2009 · 6,836 accessesView PDFCite
Research ArticleOpen accessIn the keywordsSecure Packet Encryption and Key Exchange System in Mobile Ad hoc NerworkSudhakar Sengan, S. Chenthur PandianProblem statement: Mobile Ad-hoc Network is infrastructureless network supported by no fixed trusted infrastructure. The packets had a chance to drop or hacked by eavesdropper during transmission. So, encryption method is required for sending and receiving packet in secret manner. Approach: In this approach, the block and key size had been increased by 256 bits. When compared to Rijndael algorithm, … …Journal of Computer Science, Vol. 8, Issue 6 · 17 Mar 2012 · 7,387 accessesView PDFCite
Research ArticleOpen accessIn the keywordsIMPROVING QUALITY OF SERVICE IN MOBILE ADHOC NETWORKS FOR PROACTIVE AND REACTIVE PROTOCOLS USING GENETIC ALGORITHMM. Pushpavalli, A. M. NatarajanNow-a-days finding a path from source to destination for practical multimedia applications by satisfying the QoS requirement is a big challenge. Achieving quality of service in a mobile adhoc network is an NP complete problem due to its dynamic nature of the network and limited resource availability. In this study, we propose a new QoS module which uses genetic algorithm … …American Journal of Applied Sciences, Vol. 11, Issue 7 · 9 Sep 2014 · 6,390 accessesView PDFCite
Research ArticleOpen accessIn the keywordsTHE RATIONAL BEHIND THE SERVAL NETWORK LAYER FOR RESILIENT COMMUNICATIONSPaul Gardner-Stephen, Andrew Bettison, Romana Challans, Jeremy LakemanThe Internet Protocol is the dominant network protocol used in public networks today and has proven to be highly effective for wired networks and wireless networks alike, provided network address allocation can be coordinated. Mesh networks consisting of highly mobile devices present new challenges, especially when the assumption of coordination does not apply. One situation where coordination is not readily … …Journal of Computer Science, Vol. 9, Issue 12 · 25 Nov 2013 · 7,705 accessesView PDFCite
Research ArticleOpen accessIn the keywordsCONSTRUCTION OF STRATEGIC CONNECTED DOMINATING SET FOR MOBILE AD HOC NETWORKSVictor Ceronmani Sharmila, Amalanathan GeorgeConnected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone (minimum size CDS) incurs less communication overhead. Unfortunately, computing a minimum size CDS is NP-hard and thus many algorithms were developed which concentrates on how to construct smaller CDSs. Aiming for minimum number of nodes in CDS, results in CDSs that are highly unstable. … …Journal of Computer Science, Vol. 10, Issue 2 · 16 Nov 2013 · 6,913 accessesView PDFCite