Multiple-hop Network Research Articles

Design of an efficient energy based dual level co-operative route protocols in multiple hop WSNs

The design and implementation of an energy efficient dual stage cooperative routing protocol (DSCR) in multiple hop wireless nets is discussed in this paper in brief, with the goal of improving network life-time, boosting dependability, and reducing energy consumption. This contribution’s major goal is to propose an enhanced version of the double stage data transfer system that computes the routing path utilizing cooperative mechanisms and the notion of reduced node energy. The work presented here also includes talks, discussion and graphical representations of the various outcomes achieved for all of the test scenarios, as well as the relevant observations and explanations. The research paper comes to a close with the multiple hop networks’ overall conclusions remarks.

Switching-Based Selection Techniques for Tripolar Antennas in Multihop IoT Networks

Adaptive multielement antennas can be leveraged to improve the reliability of wireless systems deployed in cluttered, depolarizing environments, such as those expected for Internet of Things (IoT) applications. While the performance improvement provided by such antennas has been well studied for individual links, multiple-hop networks have received little attention. In this work, we consider the problem of how devices in a multihop network should configure a three-element, tripolar antenna when deployed in a Rayleigh fading environment. We propose two switching-based antenna selection strategies: 1) Max-Sum and 2) Max–Min, each of which considers the channel conditions for communicating to nodes both higher and lower in the network hierarchy. We first derive the outage performance of the proposed schemes analytically and compare their performance with the well-known approaches of selection and switched diversity. Through simulations, which utilize empirical channel data from IoT devices equipped with a tripolar antenna, we show that the proposed Max-Sum and Max-Min schemes reduce antenna switching by over 80%, when compared to selection diversity. In addition, these two approaches lead to a median gain of 1.8 and 0.3 dB and a 1% diversity gain of 3.6 and 1.4 dB, respectively, relative to switched diversity.

Statistical Channel Knowledge-Based Distributed Power Allocation for Analog Network Coding in High SNR

A novel distributed power allocation scheme for analog network coding (ANC) in high signal-to-noise ratio (SNR) is proposed by using statistical channel knowledge at the transmitters only. The scheme considers nonorthogonal amplified-and- forward (NAF) protocol. In the derivation, a general Rayleigh fading multiple hop network is accurately approximated by a simpler two hop network, and the closed-formed expression for the outage probability of the simplified two hop network is obtained and optimized with respect to the power allocation. Numerical results show that the derived power allocation scheme has significant performance gain over the equal power scheme. In some cases, it approaches the optimal scheme.

Implmenting A Modified Shared Tree Multicast O-Corman Protocol in Wireless Adhoc Network

A mobile Ad Hoc network is a Noinfrastructure networkand randomly moves nodes are presented .Multicasting support data forwarding, and thus it is suitable for MANETs.Implementing’Multicast opportunistic cooperative routing in Mobile Ad Hoc Network’, (MANET) to improves the %PDR , and reduces the power consumption, multicast is meant for group communication. Multicasting sending copy of the information to all members in a group, it improves, the wireless link in a network.In an Ad Hoc network nodesare randomly distributed and free to fly without any existing infrastructure or infrastructure less administration. In the Networkeach node isfitted out with a single omnidirectional antennaand that multiple nodes are allowed, together their transmissions to take the advantages of spatial diversity to obtain energy savings.It is assumed that some nodes are not a member in a group, hence it does not receive transmission, and packet has be resent again. Where as in existing unicast transmission protocol for multiple hop network picked by multiple intermediate nodes,and only one receiver. Theprotocol performance is analyzed using the ns-2.32 network simulator.

Integrated Approach to Find Trusted Path Under Blackhole problem in Ad-hoc networks using Digital Signature and BackTrace-AODV

Mobile wireless ad-hoc networks are independent, infrastructure less, dynamic and multiple hop networks designed for trusted environment which are deployed spontaneously any time anywhere in specified geographical area with no pre established infrastructure and central authority. The intrinsic features of like heterogeneity, constrained resources, lack of fixed infrastructure, network dynamics make these networks suffering from various vulnerabilities by untrust worthy entities to crumble the network operation. One such vulnerability is a black hole attack which is an unresolved threat and hazard to routing protocol of ad hoc network caused by faulty node. In this paper, we have integrated a detection technique using digital signature to diminish the impairment impact of black hole attack and BackTrace-AODV (BT-AODV) algorithm into AODV to find trusted route. The simulation experiments show that proposed technique performs effective in thwarting black hole attack. We also explore effects of number of mobile nodes on routing behavior of AODV with our proposed protocol and our scheme outperforms AODV with blackhole with more throughput and packet delivery ratio.

Research on Data Packets Clustering Algorithm in the Wireless Multiple Hop Network

In view of the problems existing in the wireless multiple hop network such as consumption imbalance of node power, disunity of node transmission data efficiency, unfixed life within the scope of network, it has put forward the trade-off relationship between the wireless multiple hop network node energy consumption and multiple factors based on the k-means clustering method. The principle of steps and characteristics of the k-means clustering algorithm are first introduced; Then model the influence of the K-means polymerization on VoIP service quality, then use the k-means clustering method to make cluster analysis for network node data package, and mine the trade-off relationship between data transmission service quality and multiple hops node energy consumption; Finally carry on the simulation experiment to test the performance of this method. Simulation results show that the method not only improves the data transmission service quality of VoIP service, but also reduces the energy consumption of nodes and prolongs the life span of the wireless network.

Packet Delay and Energy Consumption in Non-homogeneous Networks

This paper studies whether a packet will ultimately succeed in reaching a given destination, how long this will take and how much energy may be expended, in the context of a network with imperfect routing tables and non-homogeneous network characteristics. It also investigates the effect of non-cooperative routers that may actually choose to drop certain packets if they view them to be dangerous for destination nodes, as when packets may be carrying worms, viruses or malware, and when certain packets have been identified as being part of a Denial of Service attack. The approach we take is to construct a probability model for packet travel from a source to destination node in a large non-homogeneous multiple hop network. The randomness models the lack of precise routing information at each of the network hops, and randomness in routing can also be used to model networks where one wishes to explore alternate paths in a network to discover the more reliable paths, or those that may have other desirable characteristics such as lower delay or lower packet loss. We assume that each packet has the same time out: when the time-out elapses, the packet is dropped if it has not yet reached the destination, and some time later the source will retransmit a duplicate packet. A numerical–analytical solution is developed to compute the average travel time of the packet from source to destination and to estimate its total energy consumption. Two applications of these results are then presented. In the first one, the packet is an ‘attack’ packet (e.g. a Denial of Service packet, or some malware) and as it approaches the destination node it is being frequently inspected by routers that may decide to drop it if they correctly detect that it is a threat. The second example considers a wireless network where areas which are remote from the source and destination nodes have poorer wireless coverage so that packet losses become more frequent as the packet ‘unknowingly’ (due to poor routing tables errors) meanders away from the main coverage area. Other applications in wireless networks are also provided and a simulation study is performed to validate the analytical model.

A Mutual Network Synchronization Method for Wireless Ad Hoc and Sensor Networks

Mutual network synchronization is a distributed method in which geographically separated clocks align their times to one another without the need of reference or master clocks. Mutual network synchronization is attractive for wireless ad hoc and sensor networks, because there is no overhead associated with the discovery, management, and tracking of specific nodes with reference clocks. Existing mutual network synchronization methods, however, make use of physical and medium access control layers that are proprietary and not widely available. This paper presents clock sampling mutual network synchronization (CS-MNS). CS-MNS is able to achieve microsecond networkwide synchronization accuracy for single-hop or multiple-hop network topologies in mobile or static wireless ad hoc and sensor networks. Different from existing mutual network synchronization approaches, the timing information is exchanged explicitly by using periodic time stamp packets. These packets can be, for instance, the same beacons used in the IEEE 802.11 or IEEE 802.15.4 standards, which, to the best of our knowledge, makes CS-MNS the first mutual network synchronization method compatible to these popular standards. A CS-MNS node adjusts the time and frequency of its clock recursively in the time domain by multiplying the time of its clock by a factor that is updated with any newly received time stamp. Sufficient stability conditions are derived via the discrete Lyapunov direct method. Additionally, CS-MNS enables several beacon medium access approaches, which are discussed and analyzed. Thorough numerical results are presented, which demonstrate at least one and two orders of magnitude improvement in scalability and accuracy, respectively, relative to the IEEE 802.11 timing synchronization function (TSF). CS-MNS also shows better accuracy than the multihop ad hoc TSF (MATSF) and the automatic self-time-correcting procedure (ASP) methods under similar scenarios. The latter is achieved with less complexity and with fully compatible IEEE 802.11 beacons.

Routing in Multi-Channel Wireless Ad-hoc Networks: OSPF-MCDS-MC

The availability of low-cost network interface cards (NICs) has made the IEEE 802.11 medium access control (MAC) protocol the de facto MAC standard for wireless mobile ad-hoc networks. Although the IEEE 802.11 MAC protocol is designed to have stations share a single channel in a network, many of the IEEE 802.11 physical (PHY) layer standards define multiple channels and allow the simultaneous, non-interfering use of some of these channels. Therefore, simultaneous communications can occur through different channels, offering the opportunity to increase effectivenetwork capacity. We present an innovative routing protocol that utilizes multiple channels to improve performance in a mobile ad hoc network. The key feature of the protocol is that nodes can effectively use multiple channels for simultaneous useful transmissions, thus improving networkcapacity. The proposed scheme requires minor changes to existing proactive or table-driven routing protocols and no modifications to current the IEEE 802.11 MAC protocol. To mitigate the overhead of periodic updates in proactive routing protocols, the proposed scheme divides the network layer into control and data planes. To demonstrate the multi-channel routing scheme, we extend the OSPFMCDS routing protocol to a multi-channel version, OSPFMCDS- MC or, more simply, OMM. Simulation and experimental results indicate OMM successfully exploits multiple channels to increase network capacity. The protocol allows the network goodput to increase in proportion to the number of available channels, even as the number of nodes and network load increase, in both single-hop and multiple-hop networks. We also present a prototype implementation for experimental validation of the proposed multi-channel routing protocol scheme. The implementation includes the multi-channel routing protocol and a virtual interface module, which acts as a buffer for outgoing packets and performs channel-related functions, such as channel selection and switching, while ensuring portability.

Probing-Based Estimation of End-to-End Available Bandwidth

A new mechanism to estimate available bandwidth for multiple hop routes is proposed based on a minimally backlogging concept. Since the proposed mechanism can estimate the available bandwidth quickly and track it adaptively, a reasonable range of available bandwidth for a short time interval can be obtained using the mean and variance of the estimated available bandwidth. The performance of the proposed mechanism is verified by simulation in a multiple hop network topology.

Mark-relay strategy for explicit congestion notification in the Internet

A mark-relay strategy for explicit congestion notification (ECN) that can significantly reduce the transfer delay of congestion information from a congested router to its source host in a multiple-hop network environment is presented. Through simulations, the proposed mark-relay strategy produced a better performance than the existing mark-tail and mark-front strategies in terms of throughput and fairness between transport control protocol (TCP) flows.

Routing for multimedia traffic in wireless frequency-hop communication networks

A new method is described for routing multimedia traffic in a frequency-hop (FH) store-and-forward packet radio network. The method is illustrated for traffic of two types, each type having its own throughput, delay, and error-rate requirements. A typical application is the routing of voice and data packets in a distributed multiple-hop network. In such an application, voice packets cannot tolerate much delay, but they are allowed to contain a small number of frame erasures while data packets must be delivered error-free even if a moderate delay is required to do so. The fully distributed routing protocol presented in the paper takes into account the type of service required for each type of traffic, and it adapts to the interference as seen by the FH radio receivers in the network. Our approach to multimedia routing is based on least-resistance routing with different link and path resistance metrics for different message types. Each of the resistance metrics for a link reflects the ability of the link to provide the service required by the one of the message types. This includes, but is not limited to, a measure of the likelihood of successful reception by the FH radio receiver for that link. The route selection for a particular type of packet depends on the resistances of the links along the routes from that packet's source to its destination. In general, different routes may be selected for different types of packets. The primary conclusion of this paper is that the quality of service increases for each of the two types of multimedia traffic if the routing protocol accounts for the type of message that is being relayed.

Prediction of the outage performance of a microwave multiple-hop network due to rain attenuation

L’etude des liaisons en cascade utilisant des frequences superieures a 10 GHz necessite d’estimer la probabilite d’occurrence des interruptions dues a l’attenuation par la pluie. L’objet de cet article est l’analyse theorique de la probabilite simultanee de l’affaiblissement du a la pluie pour des liaisons en cascade, par etude de la distribution jointe de variables lognormales correlees. Cette analyse est appliquee aux sites ou la distribution de l’intensite de precipitation ponctuelle peut etre approximee par fonction log-normale. Les previsions theoriques pour les interruptions d’une liaison a bonds multiples ont ete comparees aux donnees experimentales obtenues par des liaisons situees en France, aux Etats-Unis et au Japon. L’accord des resultats a ete encourageant.