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

255 results for “Ad hoc”
Set a search alert
Research ArticleOpen accessPhrase in the titleAnt Colony Based Node Disjoint Hybrid Multi-path Routing for Mobile Ad Hoc NetworkB. Kalaavathi, K. DuraiswamyMobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure and frequent node mobility. A class of ant colony based routing protocols has recently gained attention because of their adaptability to the network changes. AntHocNet is ant colony based hybrid algorithm, which combines reactive path setup with proactive path probing, maintenance and improvement. Multi-path routing represents a … …Journal of Computer Science, Vol. 4, Issue 2 · 28 Feb 2008 · 7,047 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleProximity Aware Routing in Ad Hoc NetworksValerie Alandzi, Alejandro QuinteroMost of the existing routing protocols for ad hoc networks are designed to scale in networks of a few hundred nodes. They rely on state concerning all links of the network or links on the route between a source and a destination. This may result in poor scaling properties in larger mobile networks or when node mobility is high. Using … …Journal of Computer Science, Vol. 3, Issue 7 · 31 Jul 2007 · 6,738 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA Novel Multicast Routing Protocol for Mobile Ad Hoc NetworksZeyad M. Alfawaer, GuiWei Hua, Noraziah AhmedIn mobile ad hoc networks, how to achieve the multicast communication is a challenging task due to the fact that the topology may change frequently and communication links may be broken because of users' mobility. We introduced MANHSI (Multicast for Ad hoe Network with hybrid Swarm Intelligence) protocol, which relies on a swarm intelligence based optimization technique to learn and … …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 7,300 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleUtilization of AODV in Wireless Ad Hoc NetworksZeyad M. Alfawaer, GuiWei Hua, Nidal A. HamdehAODV is a mature and widely accepted routing protocol for Mobile Ad hoc Networks (MANET), it has low processing and memory overhead and low network utilization, and works well even in high mobility situation. We modified AODV to use these dominating sets, resulting in the AODV-DS protocol. Our contribution in addressing the fragility of a minimum connected dominating set in … …Journal of Computer Science, Vol. 3, Issue 4 · 30 Apr 2007 · 7,162 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleEnhanced Route Re-Construction Method for Associativity Based Routing Protocol for Mobile Ad hoc NETworks (MANET)Fawaz A.M. Masoud, Said A. Shaar, Ayman Murad, Ghassan KanaanA mobile Ad-hoc NETwork (MANET) is wireless network composed of mobile nodes that are dynamically and randomly located in such a manner that the interconnections between nodes are capable of changing on a continual basis. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad-hoc … …Journal of Computer Science, Vol. 2, Issue 12 · 31 Dec 2006 · 6,546 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleDistributed Clusterhead Architecture for Mobile Ad Hoc NetworksEmad Qaddoura, Wesam AlMobaideen, Ahmad OmariMobile Ad Hoc Network (MANET) consists of dynamic topology as nodes in the network are mobile, and connected via wireless links. The nodes are grouped in clusters for the purpose of routing. Nodes within the cluster communicate directly. However, nodes communicate outside the cluster through a centralized node that is called a clusterhead. An elected clusterhead is assigned for communication … …Journal of Computer Science, Vol. 2, Issue 7 · 31 Jul 2006 · 6,809 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleHybrid Optimize Strategy based QoS Route Algorithm for Mobile Ad hoc NetworksFu Peng, Zhang DeyunIt is very difficult to find feasible QoS (Quality of service) routes in the mobile ad hoc networks (MANETs), because of the nature constrains of it, such as dynamic network topology, wireless communication link and limited process capability of nodes. In order to reduce average cost in flooding path discovery scheme of the traditional MANETs routing protocols and increase the … …Journal of Computer Science, Vol. 2, Issue 2 · 28 Feb 2006 · 6,548 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleAdaptive Reliable Efficient Multicasting Protocol for Mobile Ad Hoc NetworksK. Baskaran, A. Ebenezer Jeyakumar, V. Sumathy, J. Lakshmana PerumalThe Adaptive Reliable Multicast Protocol (ARM) with intermediate node support is introduced to guarantee message delivery to all multicast receivers in mobile ad hoc environment. ARM distributes multicast message cache and retransmission tasks among intermediate nodes to offer a scalable reliable multicasting. Due to limited memory and node’s mobility, ARM defines intermediate node as all nodes which overhear multicast messages. … …Journal of Computer Science, Vol. 1, Issue 3 · 30 Sep 2005 · 6,821 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA Fast-and-Fair Collision Resolution Protocol Tailored for Ad Hoc Wireless NetworksMarcos F. Caetano, Lucas M. Guimaraes, Jacir L. BordimWireless technologies have permeated a significant number of devices over the years. On the other hand, Medium Access Control (MAC) protocols strive to deal with an increasing number of contending nodes on crowded frequency bands. This work presents an efficient medium access control resolution protocol. The proposed protocol, termed Collision Resolution Protocol (CRP), uses pulse/tone signaling that works in both … …Journal of Computer Science, Vol. 12, Issue 8 · 1 Nov 2016 · 7,145 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleCONSTRUCTION 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,918 accessesView PDFCite