Accurate and fast packet delivery rate (PDR) estimation, used in evaluating wireless link quality, is a prerequisite to increase the performance of mobile, multi-hop and multi-rate wireless ad hoc networks. Unfortunately, contemporary PDR estimation methods, i.e. beacon-based packet counting in Estimated Transmission Time and Expected Transmission Count metrics, have unsatisfactory performance. Therefore, in this paper we propose a novel PDR estimation method based on SNR profiles. We classify all possible link quality estimation methods and compare them analytically against our design. Results show that it leads to a more efficient link quality estimation. Further investigations with the prototype implementation of our method in IEEE 802.11b/g testbeds reveal that the accuracy of PDR estimation in mobile scenarios can be improved up to 50% in comparison to generic packet-based PDR. Experiments with the same prototype on link and routing layers for different measurement scenarios show that it leads to a better rate adaptation and route selection in the form of end-to-end throughput increase compared to traditional packet counting methods.
In IEEE 802.11 networks, selfish stations can pursue a better quality of service (QoS) through selfish MAC-layer attacks. Such attacks are easy to perform, secure routing protocols do not prevent them, and their detection may be complex. Two-hop relay topologies allow a new angle of attack: a selfish relay can tamper with either source traffic, transit traffic, or both. We consider the applicability of selfish attacks and their variants in the two-hop relay topology, quantify their impact, and study defense measures.
The IEEE 802.15.4 standard allows for the deployment of cost-effective and energy-efficient multi-hop networks. This document features an in-depth presentation of an analytical model for assessing the performance of such networks. It considers a generic, static topology with Poisson distributed data-collection as well as data-dissemination traffic. The unslotted CSMA/CA MAC layer of IEEE 802.15.4 is closely modeled as well as an enhanced model of the neighborhood allows for consideration of collisions of packets including interferences with acknowledgements. The hidden node problem is taken in…
In IEEE 802.11 Wireless Local Area Networks (WLANs), network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Backoff algorithm. First step to design a an efficient backoff algorithm for multi-hop ad hoc network is to analysis of the existing backoff algorithms in multi-hop ad hoc networks. Thus, in this paper, we considered two important multi-hop adhoc network scenarios: (a) Node Mobility Scenario and (b) Transmission Range Scena…
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…
This paper proposes a hybrid architecture, namely VMaSC-LTE, combining IEEE 802.11p based multi-hop clustering and the fourth generation cellular system, Long Term Evolution (LTE), with the goal of achieving high data packet delivery ratio and low delay while keeping the usage of the cellular architecture at the minimum level. In VMaSC-LTE, vehicles are clustered based on a novel approach named VMaSC: Vehicular Multi-hop algorithm for Stable Clustering. From the clustered topology, elected cluster heads operate as dual-interface nodes with the functionality of IEEE 802.11p and LTE interface to…
We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beacon-less CSMA/CA as standardised in IEEE 802.15.4, a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, and relay nodes which only forward packets. We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling these analyses of the vario…
The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput, but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, MAC protocol properties, routing policy and nodes distribution. There hav…
Quality of Service provisioning is one of the major design goals of IEEE 802.16 mesh networks. In order to provide quality delivery of delay sensitive services such as voice, video etc., it is required to route such traffic over a minimum delay path. In this paper we propose a routing metric for delay sensitive services in IEEE 802.16 mesh networks. We design a new cross layer routing metric, namely Expected Scheduler Delay (ESD), based on HoldOff exponent and the current load at each node of the network. This proposed metric takes into account the expected theoretical end-to-end delay of rout…
We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beaconless IEEE 802.15.4, a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, relay nodes which only forward packets, and a data sink (base station). We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighboring nodes via certain time averaged unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling the analyses a…
Wireless communication is a key element in the realization of the Industrial Internet of Things for flexible and cost-efficient monitoring and control of industrial processes. Wireless mesh networks using IEEE 802.15.4 have a high potential for executing monitoring and control tasks with low energy consumption and low costs for deployment and maintenance. However, conventional medium access techniques based on carrier sensing cannot provide the required reliability for industrial applications. Therefore, the standard was extended with techniques for time-slotted medium access on multiple chann…
This study approaches the issues concerning the coexistence of the IEEE 802.11g wireless networks and the adhoc Bluetooth networks that operate within the same 2.4 GHz band. The performance of 802.11g is evaluated by simulating the PER (Packet Error Rate) parameter and coverage area. The simulation experiments are based on the worst case scenario presumption, which entails the transmission of HV1 packet which HV1 link requires transmission on 100% of the Bluetooth (BT) time slots using the maximum hop rate of 1600 hops per sec. The paper suggests a practical approach to mitigate the interferen…
Modern day's vehicles require advanced communication system on board to enable passengers benefit the most from available services. IEEE 802.11p is the new extension of IEEE 802.11 standards; especially proposed for the high vehicular environment. The WAVE documentation represents enhancements to the Media Access Control (MAC) and Physical (PHY) layer of IEEE 802.11 standards to work efficiently in high vehicular environment. In this research work, the main emphasis is on the new IEEE 802.11p enhancement of MAC and PHY layers. More specifically, the target of this research is to setup a simula…
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…
In this report, we first describe the problem that we are dealing with i.e. data dissemination in multi-hop cognitive radio networks. To address this problem, we propose a channel selection strategy named 'SURF'. We evaluate the proposed channel selection strategy in both single-hop and multi-hop scenarios and compared it with relevant approaches. So far, one technical report and a poster is published as part of this work, while two publications are under review; one is in IEEE Communications Letters and the second one is in IEEE WoWMoM conference. In on-going works sections, we first mention …
Communication protocols for mobile ad hoc networks (MANETs) follow either an Optimum Routing Approach (ORA) or the Least Overhead Routing Approach (LORA): With ORA, protocols tend to determine and use the optimal communication structure at every time instant; whereas with LORA, a protocol tends to use a chosen communication structure as long as it exists. In this paper, we study the impact of the ORA and LORA strategies on minimum hop routes and minimum connected dominating sets (MCDS) in MANETs. Our primary hypothesis is that the LORA strategy could yield routes with a larger time-averaged ho…
This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed in prior studies that the many-to-one throughput capacity is upper-bounded by the link capacity L. Throughput capacity L is not achievable under 802.11. This paper introduces the notion of "canonical networks", which is a class of regularly-structured networks whose capacities can be analyzed more easily than unstructured networks. We show that the throughput capacity of canonical networks under 802.11 has an analytical …
Industrial wireless sensor networks (WSNs) are being used to improve the efficiency, productivity and safety of industrial processes. An open standard that is commonly used in such cases is IEEE 802.15.4e. Its TSCH mode employs a time synchronized based MAC scheme together with channel hopping to alleviate the impact of channel fading. Until now, most of the industrial WSNs have been designed to only support static nodes and are not able to deal with mobility. In this paper, we show how a single-hop, multi-gateway IEEE 802.15.4e TSCH network architecture can tackle the mobility problem. We int…
Wi-Fi is among the most successful wireless technologies ever invented. As Wi-Fi becomes more and more present in public and private spaces, it becomes natural to leverage its ubiquitousness to implement groundbreaking wireless sensing applications such as human presence detection, activity recognition, and object tracking, just to name a few. This paper reports ongoing efforts by the IEEE 802.11bf Task Group (TGbf), which is defining the appropriate modifications to existing Wi-Fi standards to enhance sensing capabilities through 802.11-compliant waveforms. We summarize objectives and timelin…
In Heterogeneous mobile ad hoc networks (MANETs) congestion occurs with limited resources. Due to the shared wireless channel and dynamic topology, packet transmissions suffer from interference and fading. In heterogeneous ad hoc networks, throughput via a given route is depending on the minimum data rate of all its links. In a route of links with various data rates, if a high data rate node forwards more traffic to a low data rate node, there is a chance of congestion, which leads to long queuing delays in such routes. Since hop count is used as a routing metric in traditional routing, it do …
Our paper deals with a Dynamic Spectrum Access (DSA) and its implementation on a Software Defined Radio (SDR) for IEEE 802.15.4e Networks. The network nodes select the carrier frequency after Energy-Detection based Spectrum Sensing (SS). To ensure frequency hoping between two nodes in IEEE 802.15.4e Network, we propose a synchronization algorithm. We considerate the IEEE 802.15.4e Network is Secondary User (SU), and all other networks are Primary Users (PUs) in unlicensed 868/915 MHz and 2450 MHz bands of a Cognitive Radio (CR). However, the algorithm and the energy-sensor have been implemente…
Millimeter-wave (mmWave) with large spectrum available is considered as the most promising frequency band for future wireless communications. The IEEE 802.11ad and IEEE 802.11ay operating on 60 GHz mmWave are the two most expected wireless local area network (WLAN) technologies for ultra-high-speed communications. For the IEEE 802.11ay standard still under development, there are plenty of proposals from companies and researchers who are involved with the IEEE 802.11ay task group. In this survey, we conduct a comprehensive review on the medium access control layer (MAC) related issues for the I…
In this paper, we consider context-awareness to enhance route reliability and robustness in multi-hop cognitive networks. A novel context-aware route discovery protocol is presented to enable secondary users to select the route according to their QoS requirements. The protocol facilitates adjacent relay selection under different criteria, such as shortest available path, route reliability and relay reputation. New routing and security-based metrics are defined to measure route robustness in spatial, frequency and temporal domains. Secure throughput, defined as the percentage of traffic not bei…
MAC layer protocol design in a WSN is crucial due to the limitations on processing capacities and power of wireless sensors. The latest version of the IEEE 802.15.4, referenced to as IEEE 802.15.4e, was released by IEEE and outlines the mechanism of the Time Slotted Channel Hopping (TSCH). Hence, 6TiSCH working group has released a distributed algorithm for neighbour nodes to agree on a communication pattern driven by a minimal scheduling function. A slotframe contains a specific number of time slots, which are scheduled based on the application requirements and the routing topology. Sensors n…
The recently created IETF 6TiSCH working group combines the high reliability and low-energy consumption of IEEE 802.15.4e Time Slotted Channel Hopping with IPv6 for industrial Internet of Things. We propose a distributed link scheduling algorithm, called Local Voting, for 6TiSCH networks that adapts the schedule to the network conditions. The algorithm tries to equalize the link load (defined as the ratio of the queue length over the number of allocated cells) through cell reallocation. Local Voting calculates the number of cells to be added or released by the 6TiSCH Operation Sublayer (6top).…
State-of-the-art Internet traffic engineering uses source-based explicit routing via MPLS or Segment Routing. Though widely adopted in practice, source routing can face certain inefficiencies and operational issues, caused by its use of bandwidth reservations. In this work, we make the case for Hop-by-Hop (HBH) Traffic Engineering: splitting traffic among nexthops at every router, rather than splitting traffic among paths only at edge routers. We show that HBH traffic engineering can achieve the original goals of MPLS (i.e., efficient use of network resources), with a much simpler design that …
Collecting sensor data in industrial environments from up to some tenth of battery powered sensor nodes with sampling rates up to 100Hz requires energy aware protocols, which avoid collisions and long listening phases. The IEEE 802.15.4 standard focuses on energy aware wireless sensor networks (WSNs) and the Task Group 4e has published an amendment to fulfill up to 100 sensor value transmissions per second per sensor node (Low Latency Deterministic Network (LLDN) mode) to satisfy demands of factory automation. To improve the reliability of the data collection in the star topology of the LLDN m…
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis single-path minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint algorithms proposed in this paper can be used to arrive at benchmarks for the time between successive multi-path route discoveries, the number of disjoint paths per multi-path set and the hop count per multi-path set. We assume a multi-path set exists as long as at least one path i…
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.
Relaying is a promising enhancement to current radio technologies, which has been considered in IMT-Advanced candidate technologies such as 3GPP LTE-Advanced and IEEE 802.16m. Relay enhanced networks are expected to fulfill the demanding coverage and capacity requirements in a cost efficient way. Among various relaying architectures multi-hop moving relays can provide additional capacity for the cases when fixed relays are inaccessible or not able to provide adequate solutions in terms of cost. In this paper, an overview of multi-hop moving relays along with some of the envisioned deployment s…
We consider a tree network spanning a set of source nodes that generate measurement packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count. We assume that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive sufficient conditions for the tree network to approximately satisfy certain given QoS targets such as end-to-end delivery probability …
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…
Estimating the performance of multimedia traffic is important in numerous contexts, including routing and forwarding, QoS provisioning, and adaptive video streaming. This paper proposes a network performance estimator which aims at providing, in quasi real-time, network performance estimates for IoT multimedia traffic in IEEE 802.11 multihop wireless networks. To our knowledge, the proposed multimedia-aware performance estimator, or MAPE, is the first deterministic simulation-based estimator that provides real-time per-flow throughput, packet loss and delay estimates while considering inter-fl…
This paper revisits NDN deployment in the IoT with a special focus on the interaction of sensors and actuators. Such scenarios require high responsiveness and limited control state at the constrained nodes. We argue that the NDN request-response pattern which prevents data push is vital for IoT networks. We contribute HoP-and-Pull (HoPP), a robust publish-subscribe scheme for typical IoT scenarios that targets IoT networks consisting of hundreds of resource constrained devices at intermittent connectivity. Our approach limits the FIB tables to a minimum and naturally supports mobility, tempora…
In this paper we study information flow paths in a data network, where traffic generated by servers (or sources) takes a multi-hop path in order to reach its clients (destinations). Each node in the middle of this multi-hop path should route the incoming traffic and the traffic generated by itself to the next hop in such a way that the traffic reaches its destination while avoiding congestion in the links. For simplicity, we will assume the network only carries single commodity traffic, i.e., all of the traffic should be routed to a single destination.
Fundamental requirements of mmWave systems are peak data rates of multiple Gbps and latencies of the order of at most a few milliseconds. However, highly directional mmWave links are susceptible to frequent link failures under stress conditions such as mobility and human blockage. Under these conditions, multi-hop routing can achieve reliable and robust performance. In this paper, we consider multi-hop millimeter wave (mmWave) wireless systems and propose proactive route refinement schemes that are particularly important under dynamic scenarios. First, we consider the AODV-type protocols and p…
We consider single-hop topologies with saturated transmitting nodes, using IEEE~802.11 DCF for medium access. However, unlike the conventional WiFi, we study systems where one or more of the protocol parameters are different from the standard, and/or where the propagation delays among the nodes are not negligible compared to the duration of a backoff slot. We observe that for several classes of protocol parameters, and for large propagation delays, such systems exhibit a certain performance anomaly known as short term unfairness, which may lead to severe performance degradation. The standard f…
The emergence of connected vehicles paradigm has made secure communication a key concern amongst the connected vehicles. Communication between the vehicles and Road Side Units (RSUs) is critical to disseminate message among the vehicles. We focus on secure message transmission in connected vehicles using multi_hop social networks environment to deliver the message with varying trustworthiness. We proposed a Geographic Social Trust Routing (GSTR) approach; messages are propagated using multiple hops and by considering the various available users in the vehicular network. GSTR is proposed in an …
With the advent of Machine-to-Machine (M2M) communications, various networking consumer industrial and autonomous systems exchange messages in the real world in order to achieve their objectives. Parts of these systems are comprised of short-range wireless networks in the form of clusters that collectively cover a large geographical area. In these clusters, the nodes that represent the cluster heads need to deal with two types of communications: one is within the cluster and the other is from the cluster to the sink node. As the number of clusters increases, it takes multiple hops for the clus…
Community networks are prone to free-riders, i.e., participants who take advantage of cooperation from others' routers but do not contribute reciprocally. In this paper, we present HARPIA, a system for credit-based incentive mechanisms for data forwarding in community networks aimed to prevent selfish behavior. HARPIA does not require a trusted third-party or tamper-resistant security modules as in other incentive mechanisms. Instead, it uses a distributed accounting scheme (DPIFA) to estimate the balance of data forwarding contribution and consumption of each network router and settle corresp…
Mobile ad-hoc network (MANET) is infrastructureless, self-organizable, multi hop packet switched network. A number of routing protocols for MANETs have been proposed in recent years. Dynamic Source Routing (DSR) protocol is one of the most popular routing protocol for ad hoc networks. This paper presents a novel method to enhance route maintenance part of DSR protocol. Our proposed route maintenance significantly increases the efficiency of the protocol at the time of route failures.
A great number of Internet of Things (IoT) and machine-to-machine (M2M) based applications require energy efficient, long range and low data rate wireless communication links. In order to offer a competitive solution in these areas, IEEE 802.11 standardization group has defined the "ah" amendment, the first sub-1GHz WLAN standard, with flexible channel bandwidths, starting from 1MHz, up to 16MHz, and many other physical and link layer improvements, enabling long-range and energy efficient communications. However, for some regions, like Europe, the maximum transmitted power in dedicated frequen…
A Connected Dominating Set (CDS) based virtual backbone plays an important role in wireless ad hoc networks for efficient routing and broadcasting. Each node in the network can select some of its 1-hop neighbors as Multi Point Relay (MPR) to cover all its 2-hop neighbors. A MPR based CDS is a promising approach for broadcasting. A node in the CDS consumes more energy and the energy depletes quickly than non dominating nodes. Although previous CDS construction algorithms achieve good results in terms of the size of CDS, a minimum size CDS does not necessarily guarantee an optimal network perfor…
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…
Standard congestion control cannot detect link failure losses which occur due to mobility and power scarcity in multi-hop Ad-Hoc network (MANET). Moreover, successive executions of Back-off algorithm deficiently grow Retransmission Timeout (RTO) exponentially for new route. The importance of detecting and responding link failure losses is to prevent sender from remaining idle unnecessarily and manage number of packet retransmission overhead. In contrast to Cross-layer approaches which require feedback information from lower layers, this paper operates purely in Transport layer. This paper expl…
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…
We propose a self-organization scheme for cost-effective and load-balanced routing in multi-hop networks. To avoid overloading nodes that provide favourable routing conditions, we assign each node with a cost function that penalizes high loads. Thus, finding routes to sink nodes is formulated as an optimization problem in which the global objective function strikes a balance between route costs and node loads. We apply belief propagation (its min-sum version) to solve the network optimization problem and obtain a distributed algorithm whereby the nodes collectively discover globally optimal ro…
Critical and public safety operations require real-time data transfer from the incident area(s) to the distant operations command center going through the evacuation and medical support areas. Any delay in communication may cause significant loss. In some cases, it is anticipated that the existing communication infrastructures can be damaged or out-of-service. It is thus required to deploy tactical ad-hoc networks to cover the operation zones. Routing data over the deployed network is a significant challenge with consideration to the operations conditions. In this paper we evaluate the perform…
Electronic collaboration among devices in a geographically localized environment is made possible with the implementation of IEEE 802.11 based wireless ad hoc networks. Dynamic nature of mobile ad hoc networks(MANETs) may lead to unpredictable intervention of attacks or fault occurrence, which consequently may partition the network, degrade its performance, violate the QoS requirements and most importantly, affect bandwidth allocation to mobile nodes in the network. In this paper, we propose a new distributed cluster scheme for MANETs, especially in harsh environments, based on the concept of …
In an attempt to utilize spectrum resources more efficiently, protocols sharing licensed spectrum with unlicensed users are receiving increased attention. From the perspective of cellular networks, spectrum underutilization makes spatial reuse a feasible complement to existing standards. Interference management is a major component in designing these schemes as it is critical that licensed users maintain their expected quality of service. We develop a distributed dynamic spectrum protocol in which ad-hoc device-to-device users opportunistically access the spectrum actively in use by cellular u…
During route discovery of mobile ad hoc network, broadcasting of route request and route reply packets are the essential operations for finding the path between two ends. In such situations, intermediate node which may or may not belongs will participate in route discovery process, update routing table and rebroadcast the route discovery packets again to its neighboring nodes. Finally optimal path is found with minimum hops. This simply upsurges overhead and deteriorates the performance of routing. The proposed Petal Ant Routing (PAR) algorithm offers a low overhead by optimizing FANT and BANT…
We present the TDMH (Time Deterministc Multi-Hop) protocol, a complete stack for real-time wireless mesh networks. TDMH offers to applications a connection-oriented, bounded-latency communication model. Point-to-point data streams can be created and destroyed at any time. Path redundancy can be optionally introduced to improve reliability. TDMH exploits state-of-the-art low power clock synchronisation and constructive interference flooding to build a continuously updated graph of the network topology, onto which a centralized scheduler maps data streams using TDMA channel access. We realised T…
This paper presents a novel stochastic geometry approach to the connectivity of milimeter wave (mmWave) networks with multi-hop relaying. The random positions and shapes of obstacles in the radio environment are modeled as a Boolean model, whose germs are distributed according to a Poisson point process and grains are random rectangles. The derived analytical results shed light on how the connectivity of mmWave networks depends on key system parameters such as the density and size of obstacles as well as relaying route window -- the range of distances in which routing relays are selected. We f…
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…
Ad-hoc networks are independent of any infrastructure. The nodes are autonomous and make their own decisions. They also have limited energy resources. Thus, a node tends to behave selfishly when it is asked to forward the packets of other nodes. Indeed, it would rather choose to reject a forwarding request in order to save its energy. To overcome this problem, the nodes need to be motivated to cooperate. To this end, we propose a self-learning repeated game framework to enforce cooperation between the nodes of a network. This framework is inspired by the concept of "The Weakest Link" TV game. …
We consider the problem of minimizing age of information in multihop wireless networks and propose three classes of policies to solve the problem - stationary randomized, age difference, and age debt. For the unicast setting with fixed routes between each source-destination pair, we first develop a procedure to find age optimal Stationary Randomized policies. These policies are easy to implement and allow us to derive closed-form expression for average AoI. Next, for the same unicast setting, we develop a class of heuristic policies, called Age Difference, based on the idea that if neighboring…
The Internet can be made more efficient and robust with hop-by-hop multipath routing: Each router on the path can split packets between multiple nexthops in order to 1) avoid failed links and 2) reduce traffic on congested links. Before deciding how to split traffic, one first needs to decide which nexthops to allow at each step. In this paper, we investigate the requirements and trade-offs for making this choice. Most related work chooses the viable nexthops by applying the "Downward Criterion", i.e., only adding nexthops that lead closer to the destination; or more generally by creating a Di…
