Protocols For Wireless Ad-hoc Networks Research Articles

Receiver-prioritized Next Transmission in Multichannel MAC Protocol for Wireless Ad-hoc Networks

Receiver-prioritized Next Transmission in Multichannel MAC Protocol for Wireless Ad-hoc Networks

A Multi-Objective Target-Oriented Cooperative MAC Protocol for Wireless Ad-hoc Networks With Energy Harvesting

In this paper, we present a cross layer cooperative medium access control (CMAC) protocol with energy harvesting (EH) capability. The small energy capacity and size of wireless nodes pose a great challenge to the longevity of wireless networks due to the cost of ensuring a reliable communication link between transmitting nodes characterized by path-loss, shadowing and fading effects. Besides, the inability of existing CMAC protocols to exhibit multi-objective target orientation limits their adaptation to the dynamic network requirements. To address this problem, we propose a protocol that harnesses the radio frequency (RF) EH in the physical layer to enhance the throughput, end to end delay, energy efficiency and network lifetime of energy constraint wireless networks. This ensures that beneficial cooperation is achieved in fairness and multi-objective target-oriented protocol. We then investigate the performance of deploying a selective time-switching relaying (TSR) and power-splitting relaying (PSR) schemes in the MAC layer stack for a decode-and-forward (DF) reactive relaying distributed network. In addition, the quality of service requirement, outage probability, and network lifetime optimization techniques, respectively were utilized for optimal power allocation. Also, we propose a distributed and adaptive relay selection algorithm to select the best helper node that improves the network performance and balance the network energy consumption. The results of simulation show that a multi-objective target orientation can be achieved by the proposed EH-CMAC protocol and outperforms EAP-CMAC protocol with respect to throughput, end to end delay, network lifetime and energy efficiency.

Context-Aware Smallworld Routing for Wireless Ad-Hoc Networks

We propose a Context-aware Smallworld routing protocol for wireless ad-hoc networks which finds efficient routes to the destination nodes often through a very short chain of intermediate nodes, without using any routing table. This protocol exploits the “small-world” phenomenon of social networks where source-destination pairs typically get connected through few intermediate friends and the individuals can collectively discover such short paths. The key idea behind our routing protocol is that for forwarding an incoming packet to the destination, a node picks the next hop from among the one-hop neighbor from its one-hop neighborhood that is closest to the destination, and multiple randomly selected long-distance neighbor(s) , i.e., from outside of its one-hop neighborhood, based on which of these neighbors is closest to the destination. The long-distance neighbors are selected by using their contextual information through a probabilistic mapping. We provide the theoretical foundations behind our protocol. This simple but effective algorithm can meet performance objectives for most scenarios by reducing loss and latency. Simulation results, using synthetic network topologies, have demonstrated that the routing performance of context-aware Smallworld is better than geographical ( distance-based ) Smallworld and other standard proactive routing protocols (e.g., OLSRv2) when metrics, such as packet losses , end-to-end delays , hop-counts , connectivity drops , and control traffic generated , are used as the key performance indicators. We also show that the proposed protocol is resilient to dynamic topology changes.

Weakly connected dominating set-assisted ant-based routing protocol for wireless ad-hoc networks

Advances in wireless ad-hoc network techniques have spurred the development of new approaches to increase network efficiency. One of the more popular approaches is swarm intelligence. Swarm intelligence imitates the collective behavior of biological species to solve network routing problems. Meanwhile, weakly connected dominating sets (WCDS) can serve as auxiliary structures for clustering nodes in the network. This paper uses the clustering concept of WCDS to propose an improved ant-based on-demand clustering routing (AOCR) protocol for wireless ad-hoc networks. Network states’ information is obtained from the Forward_Ant, and is only broadcast by the head of every cluster, thus decreasing the overhead required to transmit ant packets. To increase network efficiency, the pseudo-random-proportional-selection strategy is used to evaluate the best path from the source node to the destination node by the Backward_Ant.

Optimization of Wireless Ad-hoc Networks using an Adjacent Collaborative Directional MAC (ACDM) Protocol

In this paper we designed a modern Medium access control (MAC) protocol for wireless ad-hoc network that focuses on neighbor node information availability and uses directional antenna. MAC protocol coordinates different users to share the wireless channel fairly and resourcefully in the wireless networks. However, using directional antennas in ad-hoc networks causes new challenges such as new hidden terminal, deafness problems, unnecessary blocking of nodes etc. The problems arise mostly due to lack of information of the neighbor node’s activities. Thus, we proposed a new directional MAC protocol name Adjacent Collaborative Directional MAC Protocol (ACDM) for wireless ad-hoc networks. The objective is to improve the throughput and delay performance together with overhead reduction of the wireless network. In addition, the integrity of the ACDM has been verified using the distributed network simulator tool NS3. The simulation results have shown that the ACDM protocol outperforms the existing protocols of wireless networks using directional antennas by minimizing the depressing effect of hidden-terminal, deafness and head of line blocking problems that also avoids asymmetry-in-gain problem. The performance of ACDM protocol shows that it improves the throughput and reduces the overhead from the state-of-art works.

Analysis of Secure Routing Protocol for Wireless Adhoc Networks Using Efficient DNA Based Cryptographic Mechanism

Abstract This paper presents a novel concept for designing an efficient security solution that can protect wireless ad hoc networks from heterogeneous attacks. This proposed Secure Routing Protocol against Heterogeneous Attacks (SRPAHA) protocol effectively detects and defends the collaborative malicious node without the need of expensive signatures. Finally, this methods had been validated through numerous simulation scenarios that synthetically generates the data sets and verifies using various parameters such as Route Acquisition Time, Throughput (or packet delivery ratio), Routing Overhead and Average End-to-End Delay. Moreover, the results of this work provide better performances as compared to existing security schemes in-terms of security, less communication overhead.

Energy Efficient Routing with MAX-Min Energy Scheme in Ad-hoc On-Demand Multipath Distance Vector routing for MANET

During the past few years, there has been increasing interest in the design of energy efficient protocols for wireless ad-hoc networks. Node within an ad hoc network generally relies on batteries (or exhaustive energy sources) for power. Since these energy sources have a limited lifetime, power availability is one of the most important constraints for the operation of the ad hoc network. Therefore energy efficiency is of vital importance in the design of protocols for the application in such networks and efficient operations are critical to enhance the network lifetime. A routing protocol that does not take into account of congestion control will result in usage of paths that are already heavy in traffic load. It will add more burdens on the energy consumption to these paths and indirectly lead to imbalanced energy consumption of the whole network. The nodes in a high traffic load path will ‘die’ off faster than nodes in paths that have lower traffic load. AOMDV protocol is provided the alternative path from source to destination so that if one path is congested another path can be use to send the packet from source to destination and thus reduce energy consumption. in these research work we are using threshold value to choose some path from the selected path then average energy scheme is used to choose the path for packet delivery.

Energy Optimization for Wireless Sensor Networks using a Novel Dynamic Multicast Routing Protocol

Minimization of energy consumption has always been the predominant factor deciding the acceptability of a routing protocol for wireless ad-hoc networks. In this study we have proposed a novel efficient multicast routing protocols in wireless mobile ad hoc networks is proposed. Due to the high mobility of nodes and highly dynamic topology, performing efficient and robust multicast in a Mobile Ad hoc Network (MANET) is a challenging task. Most of existing multicast protocols in MANETs discover the routing path by flooding message over the whole network, which result in considerable cost for routing discovery and maintenance. Moreover, the reliability of the discovered path cann ot be guaranteed, since the stabilities of nodes along such path are unpredictable. Here an attempt is made to devise an algorithm combining the features of both energy efficient and low latency algorithms. The new algorithm is intended to do well in real-world scenarios where the energy capacities of the nodes are not uniform. It employs a mobility prediction based election process to construct a reliable backbone structure performing packet transmission, message flooding, routing discovery and maintenance. Several virtual architectures are used in the protocol without need of maintaining state information for more robust and scalable membership management and packet forwarding in the presence of high network dynamics due to unstable wireless channels and node movements.

A Survey on Energy Efficient Routing Algorithms for Ad-Hoc Network

Mobile ad hoc network is highly dynamic and distributed in nature hence routing is one of the key issues in it. In particular, designing efficient algorithm for routing may be the most important criteria for MANETs since mobile nodes have limited battery capacity. This results in short continuous operations which is the general constraint in wireless communication. Power failure of a mobile node may affect its ability to forward packets on behalf of other nodes and thus the overall lifetime of the network. For this reason, many research efforts have been devoted to developing energy aware routing protocols. Here a survey on energy efficient routing protocols for wireless Ad-Hoc networks is presented. This discussion is centered on proposed energy efficient routing algorithms. Here analysis of some conventional protocols has been done and some modifications have been suggested to make these protocols energy efficient and to overcome the shortcomings in these protocols.

Swarm Intelligence based Energy Efficient Routing Protocol for Wireless Ad-hoc Networks

Mobile Ad Hoc Networks are communication networks built up of a collection of mobile devices which can communicate through wireless connections. Mobile Ad-hoc network (MANET) has emerged as the self organized wireless interconnection for the various applications in random topology. However, achieving reliable multicast transmission in MANET is crucial due to the change in network topology caused by the node mobility. Wireless Networks are characterized by having specific requirements such as limited energy availability and reduced processing power. In this paper deals with the inability of the network to recover in case of failure networks, to reduce the maintenance overhead, increase the path stability, reducing the congestion in Mobile Ad-hoc network and with the inability of the network to recover in case of power problem in wireless network . Ant based routing protocols can add a significant contribution to assist in the maximisation of the network life-time, but this is only possible by means of an adaptable and balanced algorithm that takes into account the Wireless Sensor networks main restrictions.We are introducing a new concept of two ants, one acting as load agent and another as strategy agent to ensure better performance. The strategy agent is software acting as a processor which controls and guide the load agents as forward ants and backward ants.We are using a Backpressure technique for network activities as link failure and restoration of link information. We carry out these simulation results using NS 2.34. Keyword: MANET, congestion, energy, QoS

A Location-Based Distributed Routing Algorithm for Mobile Ad-Hoc Networks

Without any infrastructure MANETs need to utilize the broadcast or multicast modes to transfer efficiently packets between wireless nodes. However, broadcast may easily cause a broadcast storm in the wireless networks, which will lead to network congestion and make the normal packets cannot be transferred. This paper tries to combine the advantages of location-aware distributed cluster algorithm and MAOVD schemes to improve the transmission efficiency and the throughput of MANET in geographic routing protocols. We also identify the problems in broadcast storm and bandwidth wasting problems that could be improved by using the design of our LDCA routing protocol for wireless ad-hoc networks. —Mobile ad-hoc networks, MANET, MAODV, multicast.

Secure neighbor discovery and wormhole localization in mobile ad hoc networks

Neighbor discovery is an important part of many protocols for wireless adhoc networks, including localization and routing. When neighbor discovery fails, communications and protocols performance deteriorate. In networks affected by relay attacks, also known as wormholes, the failure may be more subtle. The wormhole may selectively deny or degrade communications. In this article we present Mobile Secure Neighbor Discovery (MSND), which offers a measure of protection against wormholes by allowing participating mobile nodes to securely determine if they are neighbors, and a wormhole localization protocol, which allows nodes that detected the presence of a wormhole to determine wormhole’s location. To the best of our knowledge, this work is the first to secure neighbor discovery in mobile adhoc networks and to localize a wormhole. MSND leverages concepts of graph rigidity for wormhole detection. We prove security properties of our protocols, and demonstrate their effectiveness through extensive simulations and a real system evaluation employing Epic motes and iRobot robots.

A Survey On MAC Protocols for Wireless Adhoc Networks with Beamforming Antennas

The beamforming antenna technology is a promising solution to many challenges facing wireless ad hoc networks. Beamforming antennas have the ability to increase the spatial reuse, improve the transmission reliability, extend the transmission range and/or save the power consumption. If they are effectively used, they can significantly improve the network capacity, lifetime, connectivity and security. However, traditional Medium Access Control (MAC) protocols fail to exploit the potential benefits due to the unique characteristics of wireless ad hoc networks with beamforming antennas. To that end, numerous MAC protocols have been designed over the years to harness the offered potential. In this paper, we survey the literature on MAC protocols proposed for wireless ad hoc networks with beamforming antennas during the last decade. We discuss the main beamforming-related challenges facing the medium access control in ad hoc networks. We present taxonomy of the MAC protocols proposed in the literature based on their mode of operation and the mechanisms used to address the challenges. In addition, we provide a qualitative comparison of the protocols highlighting their features, benefits and requirements. Finally, we provide directions for possible future work.

An ant swarm-inspired energy-aware routing protocol for wireless ad-hoc networks

Primitive routing protocols for ad-hoc networks are “power hungry” and can therefore consume considerable amount of the limited amount of battery power resident in the nodes. Thus, routing in ad-hoc networks is very much energy-constrained. Continuous drainage of energy degrades battery performance as well. If a battery is allowed to intermittently remain in an idle state, it recovers some of its lost charge due to the charge recovery effect, which, in turn, results in prolonged battery life. In this paper, we use the ideas of naturally occurring ants’ foraging behavior (Dorigo and Stuetzle, 2004) [1] and based on those ideas, we design an energy-aware routing protocol, which not only incorporates the effect of power consumption in routing a packet, but also exploits the multi-path transmission properties of ant swarms and, hence, increases the battery life of a node. The efficiency of the protocol with respect to some of the existing ones has been established through simulations. It has been observed that the energy consumed in the network, the energy per packet in the case of EAAR are 60% less compared to MMBCR and the packets lost is only around 12% of what we have in AODV, in mobility scenarios.

Assertion Checking in J-Sim Simulation Models of Network Protocols

Verification and validation (V&V) is a critically important phase in the development life cycle of a simulation model. In the context of network simulation, traditional network simulators perform well in using a simulation model for evaluating the performance of a network protocol but lack the capability to check the “correctness” of the simulation model being used. To address this problem, we have extended J-Sim—an open-source component-based network simulator written entirely in Java—with a state space exploration (SSE) capability that explores the state space created by a network simulation model, up to a configurable maximum depth, in order to find an execution (if any) that violates an assertion, i.e. a property specifying an invariant that must always hold true in all states. In this paper, we elaborate on the SSE framework in J-Sim and present one of our fairly complex case studies, namely verifying the simulation model of the Ad-hoc On-demand Distance Vector (AODV) routing protocol for wireless ad-hoc networks. The SSE framework makes use of protocol-specific properties along two orthogonal dimensions: state similarity and state ranking. State similarity determines whether a state is “similar to” another in order to enable the implementation of stateful search. State ranking determines whether a state is “better than” another in order to enable the implementation of best-first search (BeFS). Specifically, we develop protocol-specific search heuristics to guide SSE towards finding assertion violations in less time. We evaluate the efficiency of our SSE framework by comparing its performance with that of a state-of-the-art model checker for Java programs, namely Java PathFinder (JPF). The results of the comparison show that the time needed to find an assertion violation by our SSE framework in J-Sim can be significantly less than that in JPF unless a substantial amount of programming effort is spent in JPF to make its performance close to that of our SSE framework.

OFDMA-Based Reliable Multicast MAC Protocol for Wireless Ad-Hoc Networks

Compared with unicast, multicast over wireless ad-hoc networks do not support reliability due to their inability to exchange request-to-send/clear-to-send (RTS/CTS) and ACK packets with multiple recipients. Although several media access control (MAC) layer protocols have been proposed to provide reliable multicast, these introduce additional overhead, which degrades system performance. A novel MAC protocol for reliable wireless multicast is proposed in this paper. By adapting orthogonal frequency division multiple access characteristics in CTS and ACK packets, the protocol achieves reliability over wireless multicast with minimized overhead.

A peer-to-peer file search and download protocol for wireless ad-hoc networks

Deployment of traditional peer-to-peer file sharing systems on a wireless ad-hoc network introduces several challenges. Information and workload distribution as well as routing are major problems for members of a wireless ad-hoc network, which are only aware of their immediate neighborhood. In this paper, we propose a file sharing system that is able to answer location queries, and also discover and maintain the routing information that is used to transfer files from a source peer to another peer. We present a cross-layer design, where the lookup and routing functionality are unified. The system works according to peer-to-peer principles, distributes the location information of the shared files among the members of the network. The paper includes a sample scenario to make the operations of the system clearer. The performance of the system is evaluated using simulation results and analysis is provided for comparing our approach with a flooding-based, unstructured approach.