Energy efficiency and transmission delay are very important parameters for wireless multi-hop networks. Previous works that study energy efficiency and delay are based on the assumption of reliable links. However, the unreliability of the channel is inevitable in wireless multi-hop networks. This paper investigates the trade-off between the energy consumption and the end-to-end delay of multi-hop communications in a wireless network using an unreliable link model. It provides a closed form expression of the lower bound on the energy-delay trade-off for different channel models (AWGN, Raleigh flat fading and Nakagami block-fading) in a linear network. These analytical results are also verified in 2-dimensional Poisson networks using simulations. The main contribution of this work is the use of a probabilistic link model to define the energy efficiency of the system and capture the energy-delay trade-offs. Hence, it provides a more realistic lower bound on both the energy efficiency and the energy-delay trade-off since it does not restrict the study to the set of perfect links as proposed in earlier works.
Wireless sensor networks have been increasingly used for real-time surveillance over large areas. In such applications, it is important to support end-to-end delay constraints for packet deliveries even when the corresponding flows require multi-hop transmissions. In addition to delay constraints, each flow of real-time surveillance may require some guarantees on throughput of packets that meet the delay constraints. Further, as wireless sensor networks are usually deployed in challenging environments, it is important to specifically consider the effects of unreliable wireless transmissions. I…
With growth in the number of smart devices and advancements in their hardware, in recent years, data-driven machine learning techniques have drawn significant attention. However, due to privacy and communication issues, it is not possible to collect this data at a centralized location. Federated learning is a machine learning setting where the centralized location trains a learning model over remote devices. Federated learning algorithms cannot be employed in the real world scenarios unless they consider unreliable and resource-constrained nature of the wireless medium. In this paper, we propo…
In our paper we provide mathematical analysis of a probabilistic long-hop routing algorithms which uses as the randomizing factor the estimate of distance of a station from the previous-hop source of the message.
The actual performance of video delivery over wireless networks is best captured through experimental studies over real testbed, which is crucial to uncover the technical problems and practical challenges of realizing the proposed video delivery techniques. Network coding (NC) provides a paradigm shift to optimize the network resources for enhancing the video quality as a result of delivery over multi-hop wireless networks. In this paper, we propose a novel framework for evaluating the performance of NC-based video delivery over multi-hop wireless networks. Based on an experimental testbed imp…
Congestions in wireless sensor networks (WSNs) could potentially cause packet loss, throughput impairment and energy waste. To address this issue, a hop-by-hop cross-layer congestion control scheme (HCCC) built on contention-based MAC protocol is proposed in this paper. According to MAC-layer channel information including buffer occupancy ratio and congestion degree of local node, HCCC dynamically adjusts channel access priority in MAC layer and data transmission rate of the node to tackle the problem of congestion. Simulations have been conducted to compare HCCC against closely-related existi…
In this paper, we propose LMEEC, a cluster-based routing protocol with low energy consumption for wireless sensor networks. Our protocol is based on a strategy which aims to provide a more reasonable exploitation of the selected nodes (cluster-heads) energy. Simulation results show the effectiveness of LMEEC in decreasing the energy consumption, and in prolonging the network lifetime, compared to LEACH.
Large-scale wireless testbeds have been setup in the last years with the goal to study wireless multi-hop networks in more realistic environments. Since the setup and operation of such a testbed is expensive in terms of money, time, and labor, the crucial question rises whether this effort is justified with the scientific results the testbed generates. In this paper, we give an answer to this question based on our experience with the DES-Testbed, a large-scale wireless sensor network and wireless mesh network testbed. The DES-Testbed has been operated for almost 5 years. Our analysis comprises…
Security is an important issue in wireless sensor networks (WSNs), which are often deployed in hostile environments. The q-composite key predistribution scheme has been recognized as a suitable approach to secure WSNs. Although the q-composite scheme has received much attention in the literature, there is still a lack of rigorous analysis for secure WSNs operating under the q-composite scheme in consideration of the unreliability of links. One main difficulty lies in analyzing the network topology, whose links are not independent. Wireless links can be unreliable in practice due to the presenc…
In this paper, we present the performance of different broadcast schemes for multihop sensor networks based on mathematical modeling. In near future many applications will demand multicast (Broadcast) communication feature from the sensor networks. This broadcast feature does not use virtual carrier sensing but relies on physical carrier sensing to reduce collision. For this paper, we analyze the different broadcast schemes for multihop wireless sensor networks and also calculated the achievable throughput.
In this paper, we consider the problem of modelling the average delay in an IEEE 802.11 DCF wireless mesh network with a single root node under light traffic. We derive expression for mean delay for a co-located wireless mesh network, when packet generation is homogeneous Poisson process with rate λ. We also show how our analysis can be extended for non-homogeneous Poisson packet generation. We model mean delay by decoupling queues into independent M/M/1 queues. Extensive simulations are conducted to verify the analytical results.
Testbeds are a key element in the evaluation of wireless multi-hop networks. In order to relieve researchers from the hassle of deploying their own testbeds, remotely controllable testbeds, such as the FIT/IoT-LAB, are built. However, while the IoT-LAB has a high number of nodes, they are deployed in constraint areas. This, together with the complex nature of radio propagation, makes an ad-hoc construction of multi-hop topologies with a high number of hops difficult. This work presents a strategic approach to solve this problem and proposes algorithms to generate topologies with desired proper…
In wireless networks, stations can improve their received quality of service (QoS) by handling packets of source flows with higher priority. Additionally, in cooperative relay networks, the relays can handle transit flows with lower priority. We use game theory to model a two-hop relay network where each of the two involved stations can commit such selfish QoS manipulation. We design and evaluate a reputation-based incentive scheme called RISC2WIN, whereby a trusted third party (e.g., an access point) can limit selfish behavior and preserve appropriate QoS for both stations.
In this paper, we propose LMEEC, a cluster-based routing protocol with low energy consumption for wireless sensor networks. Our protocol is based on a strategy which aims to provide a more reasonable exploitation of the selected nodes (cluster-heads) energy. Simulation results show the effectiveness of LMEEC in decreasing the energy consumption, and in prolonging the network lifetime, compared to LEACH.
This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN applications having different types of data traffic with several priorities. The protocol achieves to increase Packet Reception Ratio (PRR) and reduce end-to-end delay while considering multi-queue priority policy, two-hop neighborhood information, link reliability and power efficiency. The protocol is modular and utilizes effective methods for estimating the link metrics. Numerical results show that the proposed protocol is a feasible solution t…
We present the multi-hop extensions of the recently proposed energy-efficient time synchronization scheme for wireless sensor networks, which is based on the asynchronous source clock frequency recovery and reversed two-way message exchanges. We consider two hierarchical extensions based on packet relaying and time-translating gateways, respectively, and analyze their performance with respect to the number of layers and the delay variations through simulations. The simulation results demonstrate that the time synchronization performance of the packet relaying, which has lower complexity, is cl…
Supporting real-time communications over Wireless networks (WSNs) is a tough challenge, due to packet collisions and the non-determinism of common channel access schemes like CSMA/CA. Real-time WSN communication is even more problematic in the general case of multi-hop mesh networks. For this reason, many real-time WSN solutions are limited to simple topologies, such as star networks. We propose a real-time multi-hop WSN MAC protocol built atop the IEEE 802.15.4 physical layer. By relying on precise clock synchronization and constructive interference-based flooding, the proposed MAC builds a c…
Designing energy-efficient all-to-all multicasting protocols is of of great importance for multi-hop wireless networks such as wireless sensor networks and wireless ad hoc networks. In an all-to-all multicast session, there exists a set of wireless destination nodes, and each destination node needs to send some data packets to all other destination nodes. We consider the problem of building a shared multicast tree spanning the destination nodes such that the total energy consumption of realizing an all-to-all multicast session using the shared multicast tree is minimized. Since building such a…
The link scheduling in wireless multi-hop networks is addressed. Different from most of work that adopt the protocol interference model which merely take consideration of packet collisions, our proposed algorithms use the physical interference model to reflect the aggregated signal to interference and noise ratio (SINR), which is a more accurate abstraction of the real scenario. We first propose a centralized scheduling method based on the Integer Linear Programming (ILP) and resolve it by an approximate solution based on the randomized rounding method. The probability bound of getting a guara…
Transmission Control Protocol (TCP) is the dominant reliable transport protocol utilized in the Internet. Improving the performance of TCP associated with the presence of multi-hop is one of the research challenges in wireless mesh networks. Wireless mesh networks have large round trip time variations and these variations are dependent on the number of hops. In wireless mesh network, when congestion loss and wireless loss are co-existed the number of packets dropped increases and will have adverse effects on TCP and its congestion control mechanism which leads to low throughput. Here we have d…
In this paper we consider security-related and energy-efficiency issues in multi-hop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multi-hop wireless networks. These areas are critical--they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that, in case of uniform traffic, guarantees that every node of the network…
Given the increasing demand from wireless applications, designing energy-efficient group communication protocols is of great importance to multi-hop wireless networks. A group communication session involves a set of member nodes, each of them needs to send a certain number of data packets to all other members. In this paper, we consider the problem of building a shared multicast tree spanning the member nodes such that the total energy consumption of a group communication session using the shared multicast tree is minimized. Since this problem was proven as NP-complete, we propose, under our M…
We quantify the throughput capacity of wireless multi-hop networks with several medium access schemes. We analyze pure ALOHA scheme where simultaneous transmitters are dispatched according to a uniform Poisson distribution and exclusion schemes where simultaneous transmitters are dispatched according to an exclusion rule such as node coloring and carrier sense based schemes. We consider both no-fading and standard Rayleigh fading channel models. Our results show that, under no-fading, slotted ALOHA can achieve at least one-third (or half under Rayleigh fading) of the throughput capacity of nod…
The increasing trend in wireless Internet access has been boosted by IEEE 802.11. However, the application scenarios are still limited by its short radio range. Stub Wireless Multi-hop Networks (WMNs) are a robust, flexible, and cost-effective solution to the problem. Yet, typically they are formed by single radio mesh nodes and suffer from hidden node, unfairness, and scalability problems. We propose a simple multi-radio, multi-channel WMN solution, named Wi-Fi network Infrastructure eXtension - Dual-Radio (WiFIX-DR), to overcome these problems. WiFIX-DR reuses IEEE 802.11 built-in mechanisms…
Wireless Sensor Networks (WSN) have severe energy constraints imposed by limited capacity of the internal battery of sensor nodes. These restrictions stimulate the development of energy-efficient strategies aimed at increasing the period of stability and lifetime of these networks. In this paper, we propose a centralized control to elect more appropriate Cluster Heads, assuming three levels of heterogeneity and multi-hop communication between Cluster Heads. The centralized control uses the k-means algorithm, responsible for the division of clusters and Fuzzy Logic to elect the Cluster Head and…
Several novel industrial applications involve human control of vehicles, cranes, or mobile robots through various high-throughput feedback systems, such as Virtual Reality (VR) and tactile/haptic signals. The near real-time interaction between the system and the operator requires strict latency constraints in packet exchange, which is difficult to guarantee over wireless communication links. In this work, we advocate that packet-level coding and packet scheduling over multiple parallel (unreliable) links have the potential to provide reliable, latency-bounded communication for applications wit…
In this paper, we introduce a new networking architecture called Group Centric Networking (GCN), which is designed to support the large number of devices expected with the emergence of the Internet of Things. GCN is designed to enable these devices to operate collaboratively in a highly efficient and resilient fashion, while not sacrificing their ability to communicate with one another. We do a full protocol implementation of GCN in NS3, and demonstrate that GCN utilizes up to an order of magnitude fewer network resources than traditional wireless networking schemes, while providing high conne…
Minimizing handoff latency and achieving near-zero packet loss is critical for delivering multimedia infotainment applications to fast-moving vehicles that are likely to encounter frequent handoffs. In this paper, we propose a dual-radio cross-layer handoff scheme for infrastructure-mode 802.11 Wireless Networks that achieve this goal. We present performance results of an implementation of our algorithm in a Linux-based On-Board-Unit prototype.
Packet transmission scheduling on multi-hop wireless sensor networks with 3-egress gateway linear topology is studied. Each node generates a data packet in every one cycle period and forwards it bounded for either of gateways at edges. We focus on centrally-managed Time Division Multiple Access (TDMA)-based slot allocations and provide the design of a packet transmission scheduling framework with static time-slot allocation and basic redundant transmission to reduce and recover packet losses. We proposed three general path models, which would represent all possible variations of this topology,…
We deal with the problem of streaming multiple video streams between pairs of nodes in a multi-hop wireless ad hoc network. The nodes are static, know their locations, and are synchronized (via GPS). We introduce a new interference model that uses variable interference radiuses. We present an algorithm for computing a frequency assignment and a schedule whose goal is to maximize throughput over all the video streams. In addition, we developed a localized flow-control mechanism to stabilize the queue lengths. We simulated traffic scheduled by the algorithm using OMNET++/MixiM (i.e., physical SI…
As wireless sensor networks grow larger, more complex and their role more significant, it becomes necessary to have an insight into the network traffic. For this purpose, sniffers play an irreplaceable role. Since a sniffer is a device of limited range, to cover a multi-hop network it is necessary to consider the deployment of multiple sniffers. This motivates the research on the optimal number and position of sniffers in the network. We present a solution based on a minimal dominant set from graph theory. We evaluate the proposed solution and implement it as an extension of the 6TiSCH simulat…
Broadcast is a fundamental network operation, widely used in wireless networks to disseminate messages. The energy-efficiency of broadcast is important particularly when devices in the network are energy constrained. To improve the efficiency of broadcast, different approaches have been taken in the literature. One of these approaches is broadcast with energy accumulation. Through simulations, it has been shown in the literature that broadcast with energy accumulation can result in energy saving. The amount of this saving, however, has only been analyzed for linear multi-hop wireless networks.…
Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Traditionally, clustering algorithms aim at generating a number of disjoint clusters that satisfy some criteria. In this paper, we formulate a novel clustering problem that aims at generating overlapping multi-hop clusters. Overlapping clusters are useful in many sensor network applications, including inter-cluster routing, node localization, and time synchronization protocols. We also propose a randomized, distributed multi-hop clustering algorithm (KOCA) for solving the overlapping…
Heterogeneous wireless networks with wireless devices supporting multitude of radio access technologies are witnessing increasing interest from network providers and consumers alike. Energy efficiency in such networks has become an important design consideration due to the limited battery life of mobile terminals on one side, and the ever increasing operational expenses pertaining to energy expenditure on the other. In this paper, we present a routing protocol for multi-radio multi-hop wireless networks, which aims to achieve a trade-off between energy consumption in the network and routing de…
Network coding is an effective idea to boost the capacity of wireless networks, and a variety of studies have explored its advantages in different scenarios. However, there is not much analytical study on throughput and end-to-end delay of network coding in multi-hop wireless networks considering the specifications of IEEE 802.11 Distributed Coordination Function. In this paper, we utilize queuing theory to propose an analytical framework for bidirectional unicast flows in multi-hop wireless mesh networks. We study the throughput and end-to-end delay of inter-flow network coding under the IEEE…
Wireless Sensor Networks (WSNs) emerge as underlying infrastructures for new classes of large scale net- worked embedded systems. However, WSNs system designers must fulfill the Quality-of-Service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness and system lifetime. The limited communication range of WSN nodes, link asymmetry and the characteristics of the physical environment lead to a …
In this work, we analyze the advantages of multi-hop data fragmentation in unattended wireless sensor networks (UWSN) and propose a lightweight protocol to achieve it. UWSN has recently become an important aspect in various areas of sensor networks where real-time data collection is difficult to manage. However, the characteristics of UWSN also poses new problems especially in data protection. For more efficient protection, data fragmentation has been proposed to fragment sensing data, which prevents attackers from successfully exploiting the data. However, there are currently minimal work on …
In multi-hop wireless networks, flow demands mean that some nodes have routing demands of transmitting their data to other nodes with a certain level of transmission rate. When a set of nodes have been deployed with flow demands, it is worth to know how to construct paths to satisfy these flow demands with nodes placed as few as possible. In this paper, we study this flow demands oriented node placement problem that has not been addressed before. In particular, we divide and conquer the problem by three steps: calculating the maximal flow for single routing demand, calculating the maximal flow…
In recent years, a significant amount of research has been conducted to explore the benefits of network coding in different scenarios, from both theoretical and simulation perspectives. In this paper, we utilize queueing theory to propose an analytical framework for bidirectional unicast flows in multi-hop wireless mesh networks, and study throughput of inter-flow network coding. We analytically determine performance metrics such as the probability of successful transmission in terms of collision probability, and feedback mechanism and retransmission. Regarding the coding process, our model us…
In this work, we propose a reliable, power efficient and high throughput routing protocol for Wireless Body Area Networks (WBANs). We use multi-hop topology to achieve minimum energy consumption and longer network lifetime. We propose a cost function to select parent node or forwarder. Proposed cost function selects a parent node which has high residual energy and minimum distance to sink. Residual energy parameter balances the energy consumption among the sensor nodes while distance parameter ensures successful packet delivery to sink. Simulation results show that our proposed protocol maximi…
In this poster paper we present a data dissemination transmission abstraction for over the air programming (OAP) protocol which is fundamentally different from the previous hop by hop transmission protocols. Instead of imposing the greedy requirement that at least one node in the ith hop receives all packets before transmitting packets to the next hop and its neighbours, we take advantage of the spatial diversity and broadcast nature of wireless transmission to adopt a cooperative approach in which node broadcast whatever packets it has received with the expectation that it will recover the lo…
With increase in ageing population, health care market keeps growing. There is a need for monitoring of health issues. Wireless Body Area Network (WBAN) consists of wireless sensors attached on or inside human body for monitoring vital health related problems e.g, Electro Cardiogram (ECG), Electro Encephalogram (EEG), ElectronyStagmography (ENG) etc. Due to life threatening situations, timely sending of data is essential. For data to reach health care center, there must be a proper way of sending data through reliable connection and with minimum delay. In this paper transmission delay of diffe…
The revolution of wireless sensors networks (WSNs) has highly augmented the expectations of people to get the work done efficiently, but there is little bit impediment to deal with deployed nodes in WSNs. The nature of used routing and medium access control (MAC) protocols in WSNs is completely different from wireless adhoc network protocols. Sensor nodes do not have enough capability to synchronize with robust way, in resulting causes of longer delay and waste of energy. In this paper, we deploy efficientenergy consuming sensors and to find one hop robust and efficient destination search in W…
In this paper, we study Coded relay (Crelay) in multi-hop wireless networks. Crelay exploits both partial packets and overhearing capabilities of the wireless nodes, and uses Forward Error Correction code in packet forwarding. When a node overhears a partial packet from an upstream node, it informs the upstream node about the number of parity bytes needed to correct the errors, such that the upstream node need only send a small amount of parity bytes instead of the complete packet, hence improving the network efficiency. Our main contributions include the following. First, we propose an effici…
In this paper, we compare and analyze performance of five quality link metrics forWireless Multi-hop Networks (WMhNs). The metrics are based on loss probability measurements; ETX, ETT, InvETX, ML and MD, in a distance vector routing protocol; DSDV. Among these selected metrics, we have implemented ML, MD, InvETX and ETT in DSDV which are previously implemented with different protocols; ML, MD, InvETX are implemented with OLSR, while ETT is implemented in MR-LQSR. For our comparison, we have selected Throughput, Normalized Routing Load (NRL) and End-to-End Delay (E2ED) as performance parameters…
In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distance between Alice and Willie(s), the performance of covert communication will be degraded. In this case, multi-hop message transmission via intermediate relays can help to improve performance. Hence, in this work multi-hop covert communication over a moderate size network and in the presence of multiple collaborating Willies is considered. The relays can transmit covertly using either a single key for all relays, or d…
Separation of control and data planes (SCDP) is a desirable paradigm for low-power multi-hop wireless networks requiring high network performance and manageability. Existing SCDP networks generally adopt an in-band control plane scheme in that the control-plane messages are delivered by their data-plane networks. The physical coupling of the two planes may lead to undesirable consequences. To advance the network architecture design, we propose to leverage on the long-range communication capability of the increasingly available low-power wide-area network (LPWAN) radios to form one-hop out-of-b…
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 O…
In Wireless Multi-hop Networks (WMhNs), routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models (LP_models) to assess and enhance reactive routing protocols. To practically examine constraints of respective LP_models over reactive protocols, we select AODV, DSR and DYMO. It is deduced from analytical simulations of LP_models in MATLAB that quick route repair reduces routing latency and optimizations of retransmission attempts results efficient energy utilization. To provide quick repair, we …
In this paper, we propose a new Quality Link Metric (QLM), ``Inverse Expected Transmission Count (InvETX)'' in Optimized Link State Routing (OLSR) protocol. Then we compare performance of three existing QLMs which are based on loss probability measurements; Expected Transmission Count (ETX), Minimum Delay (MD), Minimum Loss (ML) in Static Wireless Multi-hop Networks (SWMhNs). A novel contribution of this paper is enhancement in conventional OLSR to achieve high efficiency in terms of optimized routing load and routing latency. For this purpose, first we present a mathematical framework, and th…
The throughput efficiency of a wireless mesh network with potentially malicious external or internal interference can be significantly improved by equipping routers with multi-radio access over multiple channels. For reliably mitigating the effect of interference, frequency diversity (e.g., channel hopping) and time diversity (e.g., carrier sense multiple access) are conventionally leveraged to schedule communication channels. However, multi-radio scheduling over a limited set of channels to minimize the effect of interference and maximize network performance in the presence of concurrent netw…
In wireless multi-hop networks, such as wireless sensor networks, link quality (LQ) is one of the most important metrics and is widely used in higher-layer applications such as routing protocols. An accurate link quality prediction may greatly help to improve the performance of wireless multi-hop networks. Researchers have proposed a lot of link quality prediction models in recent years. However, due to the dynamic and stochastic nature of wireless transmission, the performance of link quality prediction remains challenging. In this article, we mainly analyze the influence of the stochastic na…
Network coding and opportunistic routing are two recognized innovative ideas to improve the performance of wireless networks by utilizing the broadcast nature of the wireless medium. In the last decade, there has been considerable research on how to synergize inter-flow network coding and opportunistic routing in a single joint protocol outperforming each in any scenario. This paper explains the motivation behind the integration of these two techniques, and highlights certain scenarios in which the joint approach may even degrade the performance, emphasizing the fact that their synergistic eff…
nTorrent is a BitTorrent-like application that is based on NDN (Named Data Networking). Ad hoc environments introduce additional challenges to the dissemination of files among peers. Some issues that we encounter are that not all peers in the neighborhood or environment run the nTorrent application or desire the same torrent file. These issues cause nTorrent interests to be unable to be processed or prevent peers from downloading their desired torrent files. In order to solve this issue, I implemented pure forwarding nodes that represent peers that do not run the nTorrent application and also …
The recent developments in self-interference (SI) cancellation techniques have led to the practical realization of full-duplex (FD) radios that can perform simultaneous transmission and reception. FD technology is attractive for various legacy communications standards. In this paper, after discussing the opportunities of FD technology at the network layer, we present a cross-layer aided routing protocol, termed as X-FDR, for multi-hop FD wireless networks. X-FDR exploits a Physical (PHY) layer model capturing imperfection of SI cancellation. At the medium access control (MAC) layer, X-FDR adop…
In this article, we investigate the transient behavior of a sequence of packets/bits traversing a multi-hop wireless network. Our work is motivated by novel applications from the domain of process automation, Machine-Type Communication (MTC) and cyber-physical systems, where short messages are communicated and statistical guarantees need to be provided on a per-message level. In order to optimize such a network, apart from understanding the stationary system dynamics, an understanding of the short-term dynamics (i.e., transient behavior) is also required. To this end, we derive novel Wireless …
In this paper, we propose a new quality link metric, interference and bandwidth adjusted ETX (IBETX) for wireless multi-hop networks. As MAC layer affects the link performance and consequently the route quality, the metric therefore, tackles the issue by achieving twofold MAC-awareness. Firstly, interference is calculated using cross-layered approach by sending probes to MAC layer. Secondly, the nominal bit rate information is provided to all nodes in the same contention domain by considering the bandwidth sharing mechanism of 802.11. Like ETX, our metric also calculates link delivery ratios t…
