Article

Towards LP Modeling for Maximizing Throughput and Minimizing Routing Delay in Proactive Protocols in Wireless Multi-hop Networks

Article

Towards LP Modeling for Maximizing Throughput and Minimizing Routing Delay in Proactive Protocols in Wireless Multi-hop Networks

If you want to read the PDF, try requesting it from the authors.

Abstract

Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different routing protocols are used to facilitate users demand(s). To practically examine constraints of respective LP_models over different routing techniques, we select three proactive routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). These protocols are simulated in two important scenarios regarding to user demands; mobilities and different network flows. To evaluate the performance, we further relate the protocols strategy effects on respective constraints in selected network scenarios.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

... DR-LEACH also uses multi-hop communication between clusters. In this way, energy utilization efficiency is also increased and hence, lifetime and stability region of the network is enhanced.[10]used LP modeling for maximizing throughput in proactive protocols in wireless multi-hop networks. ...
... Routing protocols improve the lifetime of a network and specifically the stability period of a network. Protocols[2],[4],[8],[10],[13],[21],[24],[17],[18],[19]and[20]are proposed to achieve these goals. As shown inFigure 1, LEACH uses dynamic clustering. ...
... So some of the area is left unattended. To efficiently utilize the energy and to improve the coverage area, many researchers have introduced some effective approaches[2],[3],[4]and[10]. In these approaches, the total area is divided into small regions and these regions are treated separately for the nodes distribution and it improves the area coverage. ...
Article
Full-text available
In this paper, we propose Regional Energy Efficient Cluster Heads based on Maximum Energy (REECH-ME) Routing Protocol for Wireless Sensor Networks (WSNs). The main purpose of this protocol is to improve the network lifetime and particularly the stability period of the network. In REECH-ME, the node with the maximum energy in a region becomes Cluster Head (CH) of that region for that particular round and the number of the cluster heads in each round remains the same. Our technique outperforms LEACH [1] which uses probabilistic approach for the selection of CHs. We also implement the Uniform Random Distribution Model to find the packet drop to make this protocol more practical. We also calculate the confidence interval of all our results which helps us to visualize the possible deviation of our graphs from the mean value.
... However, on the basis of the limitations of the physical layer, our main focus is on the design and implementation of network layer protocol. Research shows that the clustering of nodes in WSNs is an effective program of energy conservation such as [39] and [16]. ...
... Authors in [39] used LP modeling for maximizing throughput in proactive protocols in wireless multi-hop networks. so that the maximum data will be gathered at the base station. ...
... Mobility constraints also help to achieve better network lifetime similar to [33,34]. In future, we also aim to improve the network energy utilization in the light of wireless ad-hoc networks [35], [36], [37], [38], [39] and [40]. ...
Article
Full-text available
In this paper, a novel framework is presented through link and path duration for link availability of paths. Further, we evaluate and analyze our work by varying the number of nodes, pause time and speed in VANETs. We select three routing protocols namely Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Fish-eye State Routing (FSR). Performance of these protocols is analyzed using Packet Delivery Ratio (PDR), Normalized Routing Overhead (NRO), End-to-End Delay (E2ED), Average Link Duration (ALD) and Average Path Duration (APD) against varying scalability, pause time and speed as performance metrices. We perform these simulations with NS-2 implementing Nakagami radio propagation model. The SUMO simulator is used to generate a random mobility pattern for VANETs. To find link duration and path duration we also use MATLAB. From the extensive simulations, we observe that AODV and DSR outperform better among all three routing protocols.
... Transmission delay is another problem in WSNs when time critical data is required like health care applications. In26272829, authors presented and evaluate the performance of energy efficient and delay aware routing protcols to maximize the energy consumption. They investigate the different techniques to reduce the transmission delay for reactive and time critical applications. ...
Article
An energy efficient routing protocol is the major attentiveness for researcher in field of Wireless Sensor Networks (WSNs). In this paper, we present some energy efficient hierarchal routing protocols, prosper from conventional Low Energy Adaptive Clustering Hierarchy (LEACH) routing protocol. Fundamental objective of our consideration is to analyze, how these ex- tended routing protocols work in order to optimize lifetime of network nodes and how quality of routing protocols is improved for WSNs. Furthermore, this paper also emphasizes on some issues experienced by LEACH and also explains how these issues are tackled by other enhanced routing protocols from classi- cal LEACH. We analytically compare the features and performance issues of each hierarchal routing protocol. We also simulate selected clustering routing protocols for our study in order to elaborate the enhancement achieved by ameliorate routing protocols.
... Another way to reduce energy consumption is to improve network routing algorithms for load balancing among sensor nodes in a network . However, the above mentioned solutions are prone to channel impairments and hence, result in degradation of system performance [3, 6, 14, 5] Error control coding (ECC) is a well defined approach that lowers the required transmit power. Strong codes provide better performance at the cost of complex circuitry on the decoder sides which is a wastage of battery resources [2]. ...
Article
Due to small size of sensor nodes deployed in Wireless Sensor Networks (WSNs), energy utilization is a key issue. Poor channel conditions lead to retransmissions and hence, result in energy wastage. Error control strategies are usually utilized to accommodate channel impairments like noise and fading in order to optimize energy consumption for network lifetime enhancement. Meanwhile, cooperative communication also emerges to be an appropriate candidate to combat the effects of channel fading. Energy efficiency of cooperative scheme when applied with Automatic Repeat Request (ARQ), Hybrid-ARQ (HARQ) and Forward Error Correction (FEC) is investigated in this work. Moreover, the expressions for energy efficiency of Direct Transmission, Single Relay Cooperation and Multi Relay Cooperation are also derived. In all, our work is focused towards energy optimal communication in WSNs. Our results show that error control strategies with cooperative schemes can significantly enhance system performance in form of energy optimization.
... To examine limitations of presented linear programming models they chose DSDV, FSR and OLSR from proactive routing protocols. Extending this work, [28] presented linear programming for efficient throughput and normalized control overhead. Authors in [24] contribute a path loss model for proactive routing in VANET environment. ...
Article
To ensure seamless communication in wireless multi-hop networks, certain classes of routing protocols are defined. This vary paper, is based upon proactive routing protocols for Wireless multihop networks. Initially, we discuss Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR), precisely followed by mathematical frame work of control overhead regarding proactive natured routing protocols. Finally, extensive simulations are done using NS 2 respecting above mentioned routing protocols covering mobility and scalability issues. Said protocols are compared under mobile and dense environments to conclude our performance analysis.
... Another way to reduce energy consumption is to improve network routing algorithms for load balancing among sensor nodes in a network . However, the above mentioned solutions are prone to channel impairments and hence, result in degradation of system performance [3, 6, 14, 5] Error control coding (ECC) is a well defined approach that lowers the required transmit power. Strong codes provide better performance at the cost of complex circuitry on the decoder sides which is a wastage of battery resources [2]. ...
Conference Paper
Due to small size of sensor nodes deployed in Wireless Sensor Networks (WSNs), energy utilization is a key issue. Poor channel conditions lead to retransmissions and hence, result in energy wastage. Error control strategies are usually utilized to accommodate channel impairments like noise and fading in order to optimize energy consumption for network lifetime enhancement. Meanwhile, cooperative communication also emerges to be an appropriate candidate to combat the effects of channel fading. Energy efficiency of cooperative scheme when applied with Automatic Repeat Request (ARQ), Hybrid-ARQ (HARQ) and Forward Error Correction (FEC) is investigated in this work. Moreover, the expressions for energy efficiency of Direct Transmission, Single Relay Cooperation and Multi Relay Cooperation are also derived. In all, our work is focused towards energy optimal communication in WSNs. Our results show that error control strategies along with the cooperative scheme significantly enhances system performance in the form of energy optimization.
Article
Fair resource allocation in a wireless multihop (MH) network is very important for ensuring high bandwidth reuse and high end-to-end throughput without a bottle-neck problem. However, it is very challenging because the available bandwidth for a node in wireless MH networks is limited by both the number of neighboring nodes and their geographic locations, which are always changeable due to users’ mobility. To address this problem, we propose a distributed resource allocation algorithm that enables collision-free and fair resource allocation among neighbors within two-hop distance. In the proposed algorithm, each node has a phase that linearly increases from 0 to 1 with a period of 1, and shares the phase information with its one- and two-hop neighbors. The shared phase information is used for distributed fair resource allocation for each node in a time division multiple access (TDMA) based network. We elaborate various characteristics of the proposed algorithm attributed to the MH properties. The necessary condition to ensure stability of the proposed algorithm is derived and analytically proved. Simulation results verify the stability of the proposed algorithm under various scenarios, and show faster convergence and higher bandwidth reuse compared to a comparison algorithm.
Article
Increased use of Wireless sensor Networks (WSNs) in variety of applications has enabled the designers to create autonomous sensors, which can be deployed randomly, without human supervision, for the purpose of sensing and communicating valuable data. Many energy-efficient routing protocols are designed for WSNs based on clustering structure. In this paper, we have proposed iMODLEACH protocol which is an extension to the MODLEACH protocol. Simulation results indicate that iMODLEACH outperforms MODLEACH in terms of network life-time and packets transferred to base station. The mathematical analysis helps to select such values of these parameters which can suit a particular wireless sensor network application.
Article
One of the major challenges in Wireless Body Area Networks (WBANs) is to prolong the lifetime of network. Traditional research work focuses on minimizing transmit power; however, in the case of short range communication the consumption power in decoding is significantly larger than transmit power. This paper investigates the minimization of total power consumption by reducing the decoding power consumption. For achieving a desired Bit Error Rate (BER), we introduce some fundamental results on the basis of iterative message-passing algorithms for Low Density Parity Check Code (LDPC). To reduce energy dissipation in decoder, LDPC based coded communications between sensors are considered. Moreover, we evaluate the performance of LDPC at different code rates and introduce Adaptive Iterative Decoding (AID) by exploiting threshold on the number of iterations for a certain BER (0.0004). In iterative LDPC decoding, the total energy consumption of network is reduced by 20 to 25%.
Article
Full-text available
This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Article
Full-text available
This document describes the Optimized Link State Routing (OLSR) protocol for mobile ad hoc networks. The protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN. The key concept used in the protocol is that of multipoint relays (MPRs). MPRs are selected nodes which forward broadcast messages during the flooding process. This technique substantially reduces the message overhead as compared to a classical flooding mechanism, where every node retransmits each message when it receives the first copy of the message. In OLSR, link state information is generated only by nodes elected as MPRs. Thus, a second optimization is achieved by minimizing the number of control messages flooded in the network. As a third optimization, an MPR node may chose to report only links between itself and its MPR selectors. Hence, as contrary to the classic link state algorithm, partial link state information is distributed in the network. This information is then used for route calculation. OLSR provides optimal routes (in terms of number of hops). The protocol is particularly suitable for large and dense networks as the technique of MPRs works well in this context.
Article
Full-text available
We develop a detailed approach to study how mobility impacts the performance of reactive mobile ad hoc network routing protocols. In particular, we examine how the statistics of path durations including probability density functions vary with the parameters such as the mobility model, relative speed, number of hops, and radio range. We find that at low speeds, certain mobility models may induce multimodal distributions that reflect the characteristics of the spatial map, mobility constraints and the communicating traffic pattern. However, this paper suggests that at moderate and high velocities the exponential distribution with appropriate parameterizations is a good approximation of the path duration distribution for a range of mobility models. Analytically, we show that the reciprocal of the average path duration has a strong linear relationship with the throughput and overhead of dynamic source routing (DSR), which is also confirmed by simulation results. In addition, we show how the mathematical expression obtained for the path duration distribution can also be used to prove that the nonpropagating cache hit ratio in DSR is independent of velocity for the freeway mobility model. These two case studies illustrate how various aspects of protocol performance can be analyzed with respect to a number of significant parameters including the statistics of link and path durations.
Article
Full-text available
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic BellmanFord routing mechanisms, as specified by the Routing Information Protocol, making it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad-hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing th...
Conference Paper
Proactive routing protocols for mobile ad hoc networks are table driven, where each node tries to maintain routing information about every other node in the network at all the times. Mobility in ad hoc network causes new link or breaking of network, proactive routing protocol is required to broadcast these updates throughout the network. In this paper, the effects of different updating schemes on the performance of proactive routing protocol have been examined. We set up a mathematical model to optimize proactive routing in order to balance between routing protocol overhead and routing accuracy. According to the math model we build on proactive routing, we find that proactive routing protocol has limited optimum propagating zone, and nonlinear relationship exists between updating interval and network size. Beyond the conclusion we have made, we aim at some proactive routing protocol using the ACK mechanism to ensure the update message reliability, in order to eliminate unnecessary flooding over the network, and optimize the hello interval, we make a math model according to kummer-confluent function of mobility model. Considering traffic and mobility, we find that, ACK mechanism may take effect when link state changes are not very often and data traffic is heavy. By optimizing time interval of hello message, the proactive routing protocol will have less routing overhead and high delivery rate
Article
A mobile ad hoc network (MANET) is a collection of wireless mobile nodes communicating with each other using multi-hop wireless links without any existing network infrastructure or centralized administration. In recent years, a variety of routing protocols targeted specifically at this environment have been developed and some performance simulations are made. However, the related works took the simulation model with a constant network size and a varying pause times or mobility velocities. And these works do not take into account the influence on the protocols when the mobile nodes’ pause time is invariable but the network size is changing. On the contrary, This paper considers the problem from a different perspective, using the simulation model with a dynamic network size and an invariable pause time which should be zero under weakest case because a longer pause time of the node may be insignificant for mobile Ad hoc network with frequently and fast moving nodes. Furthermore, based on the QoS (delay, jitter, throughput, loss ratio), routing load and the connectivity (to our knowledge, we first use the jitter and the connectivity as the valued metrics in the simulation of wireless ad hoc network protocols), this paper systematically discuses the performance evaluation and comparison of four typical routing protocols of ad hoc networks with the different simulation model and metrics, and drew more complete and valuable conclusions.
Article
In an ad hoc network each host (node) participates in routing packets. Ad hoc networks based on 802.11 WLAN technology have been the focus of several prior studies. These investigations were mainly based on simulations of scenarios involving up to 100 nodes (usually 50 nodes) and relaxed (too unrealistic) data traffic conditions. Many routing protocols in such setting offer the same performance, and many potential problems stay undetected. At the same time, an ad hoc network may not want (or be able) to limit the number of hosts involved in the network. As more nodes join an ad hoc network or the data traffic grows, the potential for collisions and contention increases, and protocols face the challenging task to route data packets without creating high administrative load. The investigation of protocol behavior in large scenarios exposes many hidden problems. The understanding of these problems helps not only in improving protocol scalability to large scenarios but also in increasing the throughput and other QoS metrics in small ones. This paper studies on the example of AODV and DSR protocols the influence of the network size (up to 550 nodes), nodes mobility, nodes density, suggested data traffic on protocols performance. In this paper we identify and analyze the reasons for poor absolute performance that both protocols demonstrate in the majority of studied scenarios. We also propose and evaluate restructured protocol stack that helps to improve the performance and scalability of any routing protocol in wireless ad hoc networks.
Article
In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In all of the above mentioned situations, routing overhead and delay generated by the chosen protocols can exactly be calculated from our modeled equations. Finally, we analyze the performance of selected routing protocols using our proposed framework in NS-2 by considering different performance parameters; Route REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) with respect to varying rates of mobility and density of nodes in the underlying wireless network.
Article
In this paper, we present a novel routing protocol for wireless ad hoc networks -- Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks. Nodes exchange link state entries with their neighbors with a frequency which depends on distance to destination. From link state entries, nodes construct the topology map of the entire network and compute optimal routes. Simulation experiments show that FSR is simple, efficient and scalable routing solution in a mobile, ad hoc environment. 1 Introduction As the wireless and embedded computing technologies continue to advance, increasing numbers of small size and high performance computing and communication devices will be capable of tetherless communications and ad hoc wireless networking. An ad hoc wireless network is a selforganizing and self-configuring network with the capability of rapid deployment in response to application needs. An important characteristic wh...