This paper studies the efficiency of Radio-frequency fingerprinting (RFF) on IEEE 802.15.4 networks using properties extracted by machine learning techniques. As a test case, we used the measurements of 33 wireless sensor devices to create a dataset with 640 complex samples from the signals' synchronization header of the frames transmitted by all sensors in two moving scenarios. This paper evaluates using an autoencoder (AE) neural network (NN) for extracting the RFF features. It addresses the challenge of identifying the performance of different AE NN architectures using varying numbers of features obtained from the AE latent state (LS). We compare the relative performance of the AE NN with varying types of NN (combining dense, convolutional, and recurrent layers) with five different LS dimensions (between 4 and 128), as well as two classifiers: a multi-layer perceptron (MLP) and a random forest (RF). An optimization for the encoder's LS, which uses the weights of the AE and a classifier NNs on an additional NN training phase, is also proposed. We show that a larger LS size does not always lead to better classification accuracy and that the AE loss is a bad predictor for the classifier performance. The best F1-score achieved was 93%, measured using the MLP classifier and the optimized one-dimensional convolutional AE with an LS dimension of 8, or 86% using the same configuration without the optimization. The RF classifier is much faster to train and still achieves an 88% F1-score for the optimized Gated Recurrent Unit (GRU) AE with an LS dimension of 16.

This paper studies what mechanisms a network must have to offer a very low-latency service to applications (featuring a maximum end-to-end packet delay). We assume very concrete requirements, not seen in the literature, that raise the challenge level: i) applications might be unresponsive to traffic warnings from the network; and ii) applications do not inform or require any network resources, exactly as the Internet works today (i.e., there is no admission control procedures). We present an architecture/algorithm with a minimum of state information and good scalability properties. Obviously, it is not applicable to the wide Internet. Even more, the architecture is not TCP-friendly (because control loops must be shorter than the Round Trip Time (RTT) magnitudes and oscillations, and packet losses are higher). Instead, it is appropriate to an end-to-end slice network based on a virtualization of the physical network with independent queues and line bandwidths. It is designed for interactive applications and for certain real-time ones. We use plain backpressure control supported by cooperation amongst the routers to isolate offending traffic. We are particularly concerned in situations of very high load, as they will be very common in the future. One objective is to reach a predictable network behaviour that in the limit (heavy network overload) is maintained, contrary to the current Internet. In the future, new pace-based congestion control algorithms for applications can be designed to take the most out of this type of network.

Vehicles need to locate other vehicles and network infrastructure elements on unmanned autonomous vehicle (UAV) systems. Human passengers also need to locate and be located by the vehicles, preferentially using a portable device, such as a smartphone. This paper analyses the accuracy of several localization algorithms in the remote location of entities running WiFi access points, using measurements collected in moving vehicles using a new application developed by us. The algorithms analysed include closed form estimators and one based on second order cone programming (SOCP) relaxation, which exhibits the best accuracy and is capable of estimating the path loss exponent and the transmission power. Although, due its lower complexity, the Levenberg-Marquardt algorithm was better suited for the stand-alone Android prototype application. The results show that real-time accurate positioning of static/slow moving remote entities is possible, even though the accuracy degrades when the measuring vehicle's speed increases.

Software defined networks (SDNs) reduce the complexity of implementing multi-commodity flow (MCF) optimization problems and several optimization based SDN Traffic Engineering (TE) schemes have been proposed. This approach has several limitations like the need to know or infer bandwidth demands, the number of forwarding rules needed to implement the solution and the cost of the control-loop communication between controller and switches. This usually results in systems that do not scale and need to adapt the problem formulation to an approximation of the optimal solution. In this work we propose an approach for TE in SDNs without optimization and no need for traffic demand knowledge. We propose a logically hierarchical controller architecture built on the premise of low rule space and sparse controller communication where TE is performed in two actions: the setting of stable paths in the core and the distribution of traffic among them in the access. Different algorithms can be used for these purposes. We start by studying the performance of using a shortest path algorithm for the calculation of the stable core paths and a concept from social networks analysis called betweenness centrality to measure congestion risk and support the traffic distribution decisions in the access.1

This paper presents a scalable solution for guaranteeing bandwidth to interactions/communications assuming no information is provided by the applications. The objective is to define and assess what the network can do with so little information both in terms of guaranteeing quality and preventing being throttled by overloads. The suggestion of having applications indicating their needs did not materialize in the past and it is not credible to happen in the future. Applications tend to adapt to the conditions of the network (instead of requiring resources), and can drive the network to a halt. With no explicit information, the network must firstly protect itself from being driven into an uncontrolled saturation situation with unacceptable delays, and secondly devise what kind of guarantees can still be provided to applications. In this paper, if interactions live enough time, they become flows without any disruption in traffic or initial delays for flow establishment. Traffic is aggregated in the core and all flows access the network up to a maximum rate that is calculated when they begin. When the network becomes loaded, traffic that was granted guarantees is protected. New traffic is never blocked from accessing the network and may even get guarantees.

Software Defined Networks (SDNs) provides a separation between the control plane and the forwarding plane of networks. The software implementation of the control plane and the built in data collection mechanisms of the OpenFlow protocol promise to be excellent tools to implement Machine Learning (ML) network control applications. A first step in that direction is to understand the type of data that can be collected in SDNs and how information can be learned from that data. In this work we describe a simple architecture deployed in an enterprise network that gathers traffic data using the OpenFlow protocol. We present the data-sets that can be obtained and show how several ML techniques can be applied to it for traffic classification. The results indicate that high accuracy classification can be obtained with the data-sets using supervised learning.

FTN (Faster Than Nyquist) signaling allows capacity gains but requires substantially complex equalization schemes, even for an ideal AWGN (Additive White Gaussian Noise) channel. Extending conventional FTN receivers for severely time- dispersive channels is not an option, since the receiver complexity becomes prohibitively high. In this paper we address the design of a receiver for FTN signaling over severely time-dispersive channels. To cope with the severe ISI (Inter-Symbol Interference) associated to the combined effects of FTN signaling and the time-dispersive channel we consider an iterative FDE scheme (Frequency-Domain Equalization) combined with a HARQ (Hybrid Automatic Repeat reQuest) especially designed taking into account the characteristics of FTN signals. We also present a simple, yet accurate model for the performance evaluation, considering multiple retransmissions per block. Our performance results show that we can have significant throughput gains, while maintaining essentially the receiver complexity of conventional, Nyquist-rate signaling schemes, even for severely time-dispersive channels.

Prefix-assisted direct-sequence code-division multiple access (DS-CDMA) is a viable transmission technique for high-data-rate wireless broadband systems, capable of coping with highly dispersive channels at the uplink. Packet combining (PC) ARQ with an iterative block decision feedback equalization (IB-DFE) technique can be used to cope with errors. However, extracting the IB-DFE's packet error rate (PER) for MAC-layer simulations can be time consuming. Most works that model the DS-CDMA behavior with PC ARQ use simplified asymptotic PER models in the study of the system performance, which are not precise for low signal-to-noise ratios and for a low number of mobile terminals (MTs). In this paper, the MAC performance is modeled using a discrete-time Markov chain that relies on a PER model. As an example, this paper describes a PER analytical model for an uncoded prefix-assisted DS-CDMA system with PC ARQ that considers the following inputs: the number of MTs accessing the channel, the MTs' number of transmissions, and the channel realizations for a given bit energy over noise ratio. The results show that the model portrays with better accuracy the simulations' results, compared with an alternative asymptotic model.

Multipath routing can provide a better solution for several of the current BGP's problems in the inter-domain scenario by allowing a cleaner separation between routing and traffic engineering and better failure containment. The separation between routing control logic and data forwarding, and the use of software defined networking principles open space to easier deployments of new routing protocols at the inter-domain level. This paper explores the potential of using a multipath policy based inter-domain routing algorithm based on an algebraic model. The algorithm establishes multiple paths to a destination following a policy-based architecture and works with simple destination-based hop-by-hop forwarding. We focus on the definition of algebraic models for the links, their composition and the resulting path's ranking. Our algorithm addresses the most common situations in the Internet and we include others not so common as backup links and sibling relations. We prove the correctness of the algorithm under conditions that open several implementation options and describe how it can use multipath for failure containment, using the extra paths to make each failure less important. The paper finishes with the presentation of some experimental results that illustrate the algorithm capabilities.

Ethernet is the Layer 2 infrastructure of choice for modern data center networks and service provider metro networks. These networks need to scale to a high number of end hosts and bridges, provide isolation between tenants and support host mobility with an efficient bandwidth use and reduced operating costs. Ethernet uses controlled flooding of frames and the spanning tree protocol, falling short on demands like scalability and full usage of the topology. Solutions at Layer 3 solve some of the problems but they are harder to configure, more expensive and pose difficulties to host mobility. Recent efforts try to bring some of the advantages of L3 to L2 by using equal cost multipath (ECMP) control planes to populate the bridges forwarding tables. In this paper we go beyond and propose a non-ECMP solution where the paths are selected by policy. This means that very different paths (in terms of the physical topology) can be considered equal. It provides an extra layer of flexibility in traffic distribution with a high utilization of the network in a single L2 Ethernet domain. Our design is based on routing algebra theory and its correct behaviour can be proved for both centralized and distributed implementations.

Random access approaches in Low Earth Orbit (LEO) satellite networks are usually incompatible with the Quality of Service (QoS) requirements for multimedia traffic, especially when hand-held terminals must operate with a very low signal-to-noise ratio. This paper proposes the Satellite Random Network Diversity Multiple Access (SR-NDMA) protocol that handles multimedia traffic under this context through the combination of a random and scheduled access scheme. The protocol uses a multi-packet receiver, for Single Carrier with Frequency Domain Equalization (SC-FDE) in the uplink, that gradually reduces the packet error rate with additional transmissions. The paper proposes analytical performance models for the throughput, delay and energy efficiency - as long as terminals have finite queues. System parameters are defined to enhance the energy efficiency while satisfying the QoS requirements for limited queue and bit-rate constraints. Results show that the proposed system is energy efficient and provides enough QoS to support multimedia services such as video telephony.

Algebra has made the tasks of defining routing algorithms and proving their correct operation very clear. However, current results in the modelling of multipath policy routing protocols only prove correct behaviour for models that exhibit a strict decrease in the preference of a path with every added link. This is very rigid for multipath routing. For instance it does not allow a link attribute to dominate the entire path classification or having equivalent paths with similar policy but a different number of links. This paper starts by defining the fundamental sufficient conditions for the correct operation of a multipath policy routing protocol with independent destination based hop-by-hop forwarding. We then study the sufficient properties that the protocol model should exhibit so that those conditions are met. We prove that correct operation is possible without the strict increase in preference, provided that the policies applied to links forming circuits in the network graph are restricted. We derive two conditions on the policies applied in the circuits of a network graph that assure correct behaviour and can serve as a tool in the design process.

Traditionally, Low Earth Orbit (LEO) satellite networks use hard handovers when a Mobile Terminal (MT) moves between the footprints of two satellites. Such approach introduces a transitory disconnection interval, which may limit the capacity to provide demanding real-time requirements. A soft- handover approach that applies distributed packet combining on a satellite diversity scenario is proposed in this paper. Considering inexpensive MT hardware and low transmission powers, the paper analyses the performance gains and the difficulties that are associated to different Doppler and time-of-arrival shifts when the MT signal is broadcast to two satellites during the short handover period where both satellite's footprint overlap. A Single-Carrier with Frequency Domain Equalization (SC-FDE) transmission technique is considered in this paper. It is shown that it is possible to have an inter-satellite handover almost without quality of service (QoS) degradation for a Satellite Network Diversity Multiple Access (S-NDMA) scheme.

Traditionally, an unsuccessful packet reception, either due to channel conditions or interference from multiple sources (collisions), is discarded and followed by a new reception of the same packet. Network diversity multiple access (NDMA) handles collisions by using time diversity multipacket reception: the base station forces terminals to transmit P copies of each packet when P terminals collide. This rigidity of having P copies is unsuitable for poor propagation conditions. It might be desirable to have more than P copies of a given packet, adopting a technique for single packet reception called hybrid-ARQ. Hybrid-ARQ effectively decreases the packet error rate. This paper proposes such mechanism for multi-packet reception, called hybrid-ARQ NDMA (H-NDMA), a gated slotted random access protocol, where the access mechanism forces the terminals involved in a collision with reception errors to transmit more than P times. Analytical models for the throughput, delay and energy per useful packet are proposed. The energy performance is analyzed for bounded average delay constraints. The proposed system's performance is evaluated for a single-carrier with frequency domain equalization (SC-FDE) scheme, and compared with the classical NDMA protocol. The comparison highlights that H- NDMA is scalable for an increasing number of terminals and network load.

This paper presents a Medium Access Control (MAC) protocol solution designed to properly handle collisions when in the presence of a multi-packet detection receiver for Single-Carrier (SC) modulations with Frequency-Domain Equalization (FDE). It is considered an iterative frequency-domain receiver that jointly performs equalization, multi-packet separation and channel decoding operations, for up to Qmaxmobile terminals transmitting in one slot. In this work, it is proposed and evaluated a p-persistent Network Diversity Multiple Access (NDMA) random MAC protocol designed to cope with a total number of mobile terminals J, for a maximum decoding capability of Qmaxsimultaneous packets. An accurate analytical model is presented to optimize two different scenarios: in the first one, a saturated network is considered and it is determined the packet transmission probability that maximizes the uplink throughput; the second represents a non-saturated network and the goal is to compute the optimal transmission probability associated to each mobile terminal that minimizes the packet transmission delay. In the end, analytical results obtained through physical and MAC layer simulations are discussed.

Traditionally, a packet with errors, either due to channel noise or collisions, is discarded and needs to be retransmitted, leading to performance losses. Hybrid Automatic Retransmission reQuest (H-ARQ) and time diversity multipacket reception approaches, such as Network Diversity Multiple Access(NDMA), improve the system performance by requesting additional retransmissions and combining all the signals received together. However, the high round trip delay time associated to satellite networks introduces limitations in the number of retransmission requests that may be issued by the terminals to fulfill the Quality of Service (QoS) requirements. This paper considers the design of hybrid protocols combining H-ARQ and NDMA for satellite networks with demand-assigned traffic. The satellite NDMA (S-NDMA) protocol is presented and analytical models are proposed for its performance. Energy efficient QoS provisioning is also analyzed. The proposed system's performance is evaluated for a Low Earth Orbit (LEO) network with a Single-Carrier with Frequency Domain Equalization (SCFDE) scheme, and compared to H-NDMA. Results show that the proposed system is energy efficient and can provide enough QoS to support high demand services such as video telephony.

The Quality of Service (QoS) requirements for modern broadband wireless systems can be very high, with small error rates and delays. Packets with errors are usually discarded and need to be retransmitted, leading to performance degradation. An alternative to simple retransmissions like Automatic Repeat reQuest (ARQ) schemes, that can minimize the degradation is to combine the signals associated to different transmission attempts, usually called diversity combining techniques. This paper considers the use of Single-Carrier (SC) modulations with Frequency-Domain Equalization (FDE) and low-complexity soft combining ARQ schemes. The time diversity combining technique presented in this paper, allows packets associated to different transmission attempts to be combined in a soft way so as to improve the performance. This technique is employed in a Time Division Multiple Access (TDMA) scheme. An accurate analytical model is proposed for the evaluation of the uplink packet delay in non-saturated traffic condition, and for the system's throughput (goodput) considering a generic packet arrival process. Physical (PHY) layer (packet error rates) and system-level (goodput and packet delay considering both PHY and Medium Access Control (MAC) layers) results are presented and validated by simulations for two distinctive arrival processes: Poisson and Geometric.

Traffic Engineering (TE) aims at distributing traffic through routes to suit a specific goal. BGP addresses TE in a very specific way: it is a single path system, and mixes traffic control and route dissemination by letting attributes influence the choice of the best path. Several techniques have been proposed but due to BGP characteristics they have high complexity requirements such as the need for coordination and information about the network that is not locally available. and, in most cases, the use of tunnelling. In a previous work we proposed an inter-domain routing architecture DTIA (Dynamic Topological Information Architecture) that builds a robust multipath routing system based on the inter-AS relationships and routing policies. DTIA separates traffic control from route dissemination and seems to have less complex requirements to provide TE. The aim of this paper is to assess the ability of such a system to provide TE maintaining the complexity overhead to a minimum. We propose a simple feedback protocol to avoid congestion and achieve better traffic distribution at inter-domain level using only local available traffic information and DTIA's routing information.

Traditionally, a packet with errors, either due to channel noise or collisions, is discarded and needs to be retransmitted, leading to performance losses. Network Diversity Multiple Access (NDMA) handles collisions by combining a multipacket detection scheme with time diversity. In NDMA, the base station (BS) forces mobile terminals (MTs) to transmit J copies of each packet when J MTs collide. Diversity combining is limited to J copies of the packets, not allowing it to adapt to severe errors due to channel noise. This paper considers a multipacket detection scheme recently proposed, which reduces the packet error rate (PER) when more than J copies of the packets are available. In this paper, an Hybrid-ARQ NDMA access mechanism is proposed. The access mechanisms forces MTs with reception errors during a collision resolution epoch to transmit more than J times. Analytical models are proposed for the goodput and delay, considering Poisson traffic. The proposed system's performance is evaluated for a Single-Carrier with Frequency Domain Equalization (SC-FDE) scheme, and compared to classical NDMA.

Traditionally, a packet with errors, either due to channel noise or collisions, is discarded and needs to be retransmitted, leading to performance losses. Two different approaches are considered to cope with lost packets, a low-complexity packet combining ARQ scheme (Automatic Repeat reQuest) and a multipacket detection scheme. These approaches are employed on a SC-FDE scheme (Single-Carrier with Frequency Domain Equalization). Suitable receiver structures are described, employing packet combining, multipacket detection and hybrid schemes. An accurate analytical tool is presented for predicting the performance of the different schemes.

In this paper we present a performance analysis of XOR1-based flat routing protocols in high mobility conditions, considering a vehicular ad hoc network (VANET) formed in a highway scenario. First, we describe an XOR-based protocol that incorporates several adaptations of the existing XOR-based routing algorithms for wired networks, in order to cope with the network mobility. Then we propose an improved version of it, XORi, which modifies the protocol's information gathering process to accommodate the specific dynamic nature of VANETs topology. Finally, we evaluate the performance of XOR-based protocols with other topology-based routing protocols. Simulation results allow us to characterize the performance of this class of protocols through the comparison of the packet delivery ratio, end-to-end path delay and average number of path hops2. When a moderate density of nodes is considered, simulations show that XOR-based algorithms achieve almost the same packet delivery rate as link state algorithms, such as OLSR, while for high density of nodes XOR-based algorithms scale better in terms of delay when compared to source routing algorithms, such as DSR3.

This paper considers the use of low-complexity diversity combining hybrid ARQ schemes (Automatic Repeat reQuest) on a TDMA (Time Division Multiple Access) system. Its low complexity makes it particularly interesting for battery-powered nodes of a wireless sensor network (WSN). TDMA is commonly used for WSNs applications that require high throughput or constrained packet delay. This paper analyzes the energy per useful packet, packet delay and goodput performances of the TDMA system. Analytical models were used to define a constrained energy optimization problem, where the minimum transmission power is calculated based on the goodput and delay constraints. Analytical results were validated through simulations.

Lost packets, either due to errors or collisions, are usually discarded and need to be retransmitted, leading to performance losses. In this paper we compare the performance of two different approaches to cope with lost packets. One alternative is a multi-packet detection approach able to separate up to Qmaxmobile terminals transmitting in one slot. The other alternative is a low-complexity soft combining ARQ scheme (Automatic Repeat reQuest) employed in a TDMA (Time Division Multiple Access) architecture. This paper evaluates the uplink non-saturated packet delay and goodput for a Poisson traffic generator. Our analytical results are validated by simulation using joint PHY (physical layer) and MAC (Medium Access Control) behavior.

This paper considers the use of a code combining hybrid ARQ scheme (Automatic Repeat reQuest) on a TDMA (Time Division Multiple Access) system. A multi-rate turbo-code is proposed to implement the H-ARQ scheme, allowing improved performances. This paper analyzes the energy per packet successfully received, the packet delay and goodput performances for the TDMA system on a HAP (High Altitude Platform). Analytical models were used to define a constrained energy optimization problem, where the minimum transmission power is calculated based on the goodput and delay constraints. Analytical results were validated through simulations for a typical HAP Network uplink channel.

This paper proposes the Mobile MH-MAC (Multimode Hybrid - Medium Access Control) protocol, an extension of MH-MAC with enhanced support for mobility on wireless sensor networks. It provides an asynchronous mode for energy efficiency during idle (unconnected) periods, and a synchronous mode for high throughput periods. Mode change is controlled by the application in a cross-layer approach. MMH-MAC was specially designed to tolerate asynchronous mobile nodes in the neighborhood of synchronous nodes, providing fast transition and interference mitigation mechanisms. Current MAC protocols rely on a passive method to associate a mobile node to a static cluster, triggered by the reception of a beacon. We propose an active approach that allows a mobile node to start sending data packets shortly after entering into data range of a static node, with negligible data loss in existing synchronous data connections. MMH-MAC was implemented in TinyOS and tested on TelosB motes and TOSSIM simulator.

Several routing protocols for Mobile Ad Hoc Networks (MANETS), including the well known Ad hoc On-Demand Distance Vector Routing (AODV) and Optimized Link State Routing (OLSR), propose the use of periodic messages (Hello messages) to detect neighbor nodes. After receiving the first Hello message from one of its neighbors, a node starts the link sensing task by setting up a sensing timer. Each time a new Hello message is received from the same neighbor, the sensing timer is restarted and the link duration is prolonged. If the sensing timer expires, it indicates a long time interval without receiving an Hello message and, consequently, the link is considered broken. The transmission frequency of the Hello messages and the expiration value of the sensing timer truly depends on node's mobility: if the nodes are moving quickly and the Hello messages are rarely transmitted, the neighbor nodes can be in communication range but they are not detected; in the same scenario, if the expiration value of the sensing timer is too high, a link is sensed broken too late. In this paper, we consider a MANET under the Random Waypoint mobility model. We investigate the relationship between the transmission frequency of the Hello messages and the sensing timer expiration value with the network node's mobility. We formally deduce the probability of link existence after β periods of transmission of the Hello message. The probability is later used to define the sensing timer expiration value, considering a given probability that the Hello message transmission fails. Finally, we evaluate our study through both numerically analysis and simulations, which confirms the effectiveness and accuracy of our approach.

This paper deals with multi-packet detection for SC modulations (Single-Carrier) with FDE (Frequency- Domain Equalization). We consider iterative frequency-domain receivers that jointly perform equalization, multi-packet separation and channel decoding operations, for up to Qmaxmobile terminals transmitting in one slot. In this paper we propose an accurate analytical model for a p-persistent random access MAC protocol, designed to handle a total number of mobile terminals J above Qmax. It evaluates the uplink non-saturated packet delay and calculates the optimal configuration for the packet transmission probability associated to each mobile terminal that minimizes the delay. Our analytical results are validated using physical and MAC layer simulations.

This paper considers the use of SC modulations (Single-Carrier) with FDE (Frequency-Domain Equalization) with low-complexity soft combining ARQ schemes (Automatic Repeat reQuest). With our technique, packets associated to different transmission attempts are combined in a soft way, allowing improved performances. Its low complexity makes it particularly interesting for the uplink of wireless systems. This paper proposes an accurate analytical model for a TDMA (Time Division Multiple Access) scheme where packet combining ARQ is applied. It evaluates the uplink non-saturated packet delay and goodput for a generic message arrival process. Our analytical results are validated using physical and MAC layer simulations.

DTIA (Dynamic Topological Information Architecture), an inter-domain routing architecture, assumed the existence of "regions of domains" to offer a scalable solution for the Internet. The way regions can be connected and how traffic flow amongst them is not a trivial aspect and can jeopardize the solution proposed for intra-region traffic. This paper covers the inter-region case showing that it can be performed by using a smaller set of valid paths than for the intra-region case in the source region, but still featuring multipath to the destination and taking advantage of multi-homing. The routing is based on a monotone algebra to converge without the need to change the IP headers or introduce additional signaling or state in the network. The overall system complies with the current business model of the Internet, and it also features one tendency that has been increasingly used: the fact that Autonomous Systems (ASes) are each time more connected with direct (or semi-direct) links instead of in a pure hierarchical structure up to tier-1 ASes.

This paper proposes an architecture for inter-domain routing, called DTIA - Dynamic Topological Information Architecture. DTIA separates the issues of reachability and routing, and this paper addresses the first one. One major requirement has been not to change IP packets and the commercial relations in the Internet. DTIA is based on the knowledge of a static network formed by the Autonomous Systems (AS) and an algorithm to manage link failures. We use the concept of a region as a mechanism to sustain scale. DTIA supports the most important functionalities of BGP: some of them are built in and others can be implemented on top of the reachability level or the routing level. The main concerns we aim to solve are taking advantage of multihoming, increase the robustness in terms of convergence, reduce the churn rate and range of routing events, and due to forwarding packets by AS identifiers and topologic links (as opposed to prefix policy defined) reduce the growth of the routing table.

This paper deals with multi-packet detection for SC modulations (Single-Carrier) with FDE (Frequency-Domain Equalization). We consider iterative frequency- domain receivers that jointly perform the equalization, multi-packet separation and channel decoding operations. Our receivers allow a high throughput provided that the number of mobile terminals that is trying to access a given slot is equal to or below the multi-packet detection capacity Qmax. We propose a new MAC protocol that allows a total number of mobile terminals J above Qmaxby controlling the number of mobile terminals contending to transmit. The paper evaluates the uplink saturated system throughput and proposes an optimal configuration for the packet transmission probability associated to each mobile terminal. Our analytical results are validated using physical and MAC layer simulations.

The traditional approach to cope with collisions is to discard the packets involved in it and to ask for their retransmission. However, since the signal associated to a collision has important information concerning the packets involved, we can efficiently resolve collisions with proper retransmissions. In this paper we consider severely time-dispersive channels and we propose a technique that allows efficient packet separation. We employ SC-FDE schemes (single-carrier with frequency-domain equalization) and we propose an iterative frequency-domain multi-packet detection. Since our technique requires uncorrelated channels for different retransmissions, we also propose an SP technique (Shifted Packets) for retransmissions in fixed channels. Since the total number of transmissions is equal to the number of packets involved in the collision (even when the channel remains fixed for the retransmissions), our technique allows high throughputs. The analysis of our detection technique combined with the NMDA (network-assisted diversity multiple access) MAC (medium access control) protocol shows significant throughput and delay improvements for low Eb/N0values compared to a TDMA (time division multiple access) approach, where collisions are avoided. This technique is particularly appealing for the uplink of broadband wireless systems, since we consider SC-FDE schemes and the complexity is concentrated in the receiver. By employing the SP scheme we can use the same channel for the retransmissions, with only a small performance degradation.

This paper proposes an architecture for inter-domain routing, called DTIA -- Dynamic Topological Information Architecture. It is designed to address current limitations of BGP like: scalability of the routing tables, multihoming problems, churn rate, range of routing events and policy coordination. Still it supports the most important functionalities of BGP, and maintains the current Internet routing distribution model based on Inter-AS business relationships. The architecture is based on the knowledge of a static network graph formed by the Autonomous Systems (AS) and an algorithm to manage link failures. We use the concept of a region as a mechanism to sustain scale. New possible features like multi-path routing and enhanced Traffic Engineering capabilities might benefit with DTIA's usage.

Usually, packets involved in a collision are lost, requiring their retransmission. However, the signal associated to collisions has important information concerning the packets involved. In fact, with proper retransmissions we can efficiently resolve collisions. In this paper we propose a frequency-domain multi- packet detection technique for SC-FDE schemes (Single- Carrier with Frequency-Domain Equalization) that allows an efficient packet separation in the presence of successive collisions. This technique allows high throughputs, since the total number of transmissions is equal to the number of packets involved in the collision, even when the channel remains fixed for the retransmissions. Since we consider SC-FDE schemes and the complexity is concentrated in the receiver, this technique particularly appealing for the uplink of broadband wireless systems.

This paper proposes MH-MAC, a new MAC protocol for wireless sensor networks capable of handling applications that generate infrequent huge peaks of traffic. Existing protocols are not adapted to this kind of applications. Asynchronous protocols are energy efficient for the long inactive periods, but fail to cope with the bandwidth and latency requirements of the traffic peaks when more than two nodes are sending data to a common sink. Synchronous protocols that support contention free slots provide good throughput for handling the load peaks, but consume unnecessary energy maintaining clocks synchronized for very long idle periods. MH-MAC is a multimode hybrid protocol that can be configured by the application to run in asynchronous mode or in synchronous mode, with or without contention, providing the best possible trade-off. MH-MAC is a single-hop MAC, which supports multi-hop applications through a cross-layering API. The paper includes simulation results with the energy consumption, latency and throughput for the operation modes of MH-MAC, showing the asynchronous-synchronous trade-offs and the state transition overhead.

The strong research on the performance of the IEEE 802.11 standard seen lately contributes to a better understanding of the network and as a starting point for the design of future networks (specially in the ad-hoc area). Oliveira et al. proposed a model to study the IEEE 802.11 DCF delay assuming saturated or non-saturated broadcast and unicast traffic. Oliveira et al. assumes that all nodes generate frames having the same length. This paper extends Oliveira et al. supporting variable frame's length and both unicast basic and RTS/CTS multirate transmission schemes. The 802.11 MAC average time overhead per frame is deduced. Several simulations scenarios are described to validate the theoretical analysis. The validation results confirm that the MAC transmission delay is strongly dependent on the amount of broadcast traffic in the network. For high transmission data rates the MAC delay increases when the broadcast traffic also increases. However when high data rates are not possible the broadcast traffic increase can have the reverse effect.

The existing models for IEEE 802.11 DCF networks only consider unicast frames, ignoring the existence of broadcast traffic. In a real scenario, the stations are most of the times non-saturated and unicast and broadcast frames exist. These specific characteristics influence the service time which consequently affects the queue behaviour. In this paper, the authors model the total frame's delay for IEEE 802.11 DCF networks in presence of both unicast and broadcast traffic. Our theoretical analysis proposes a model able to compute the time between the instant when a new frame is inserted on the transmission queue and the instant when its transmission finishes. The time needed to serve a frame (service time) is formally deduced from the IEEE 802.11 transmission procedure, conceptually using the view of one network's node. The authors use an M/M/1/K queue model in order to model each frame's queueing delay. The authors validate the total frame's delay using several simulations and present some results. These are analysed for different scenarios of broadcast/unicast network loads and different number of nodes.

Most studies on performance of IEEE 802.11 DCF networks do not contemplate the existence of broadcast traffic. They model network behaviour in presence of unicast traffic alone. In a real scenario, broadcast frames exist, and they will influence the overall network behaviour. This work presents a new traffic generalized model for CSMA/CA saturated single-hop networks able to describe the network behaviour in presence of both unicast and broadcast frames. Interesting statistics like station transmission probability, average time needed to complete a frame transmission, and network aggregate throughput are deduced from the model. The paper compares the performance of our model with other models proposed only for unicast traffic. Our model is validated for broadcast and unicast traffic through simulations, using an IEEE 802.11 DCF network scenario. Results are presented and analysed for different scenarios of broadcast/unicast network loads, different number of nodes and different frame data lengths

No abstract available.