Search results for "ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS"
showing 10 items of 449 documents
An automatic cooperative retransmission MAC protocol in wireless local area networks
2009
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Article also available from publisher: http://dx.doi.org/10.1109/EW.2009.5357992 Existing solutions for cooperation in wireless networks either require simultaneous transmission of source and relay nodes or impose major modifications to original MAC protocols. In this paper, a new efficient retransmission MAC protocol is proposed for IEEE 802.11 based cooperati…
An optimal energy efficient cooperative retransmission MAC scheme in wireless networks
2011
Accepted version of a paper in the book: 2011 2nd Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology (Wireless VITAE). Published version available from the IEEE: http://dx.doi.org/10.1109/WIRELESSVITAE.2011.5940871 While the benefits of cooperative diversity have been well studied in the literature, cooperative MAC protocol design has also attracted much attention recently. In the single-relay Cooperative Automatic Repeat reQuest (C-ARQ) protocol, the best relay node is selected in a distributed manner by relays using different backoff time before packet retransmission. However, this relay selection scheme does not work efficiently…
DNS Tunneling Detection Techniques – Classification, and Theoretical Comparison in Case of a Real APT Campaign
2017
Domain Name System (DNS) plays an important role as a translation protocol in everyday use of the Internet. The purpose of DNS is to translate domain names into IP addresses and vice versa. However, its simple architecture can easily be misused for malicious activities. One huge security threat concerning DNS is tunneling, which helps attackers bypass the security systems unnoticed. A DNS tunnel can be used for three purposes: as a command and control channel, for data exfiltration or even for tunneling another protocol through it. In this paper, we surveyed different techniques for DNS tunneling detection. We classified those first based on the type of data and then within the categories b…
dSDiVN: A Distributed Software-Defined Networking Architecture for Infrastructure-Less Vehicular Networks
2017
In the last few years, the emerging network architecture paradigm of Software-Defined Networking (SDN), has become one of the most important technology to manage large scale networks such as Vehicular Ad-hoc Networks (VANETs). Recently, several works have shown interest in the use of SDN paradigm in VANETs. SDN brings flexibility, scalability and management facility to current VANETs. However, almost all of proposed Software-Defined VANET (SDVN) architectures are infrastructure-based. This paper will focus on how to enable SDN in infrastructure-less vehicular environments. For this aim, we propose a novel distributed SDN-based architecture for uncovered infrastructure-less vehicular scenari…
Per-flow signalling extension across DiffServ domains
2003
This paper describes a framework devised to extend per-flow admission control operation across Differentiated Services domains. Although the specific case of interoperability with RSVP is under discussion, our proposal can be easily adapted to other hop-by-hop signalling protocols. In our framework, DiffSery border routers accomplish three tasks. First, during the set-up phase, flows are mapped onto PHB groups on the basis of their QoS and traffic specifications. Second, signalling packets are tunnelled into IP packets marked as “probes”, where the “probe” marking is a DCSP value associated to the considered PHB Group. Third, when the flow set-up is complete, flow data packets are marked as…
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
Dsdivn: A Distributed Software-Defined Networking Architecture for Infrastructure-Less Vehicular Networks
2017
International audience; In the last few years, the emerging network architecture paradigm of Software-Defined Networking (SDN), has become one of the most important technology to manage large scale networks such as Vehicular Ad-hoc Networks (VANETs). Recently, several works have shown interest in the use of SDN paradigm in VANETs. SDN brings flexibility, scalability and management facility to current VANETs. However, almost all of proposed Software-Defined VANET (SDVN) architectures are infrastructure-based. This paper will focus on how to enable SDN in infrastructure-less vehicular environments. For this aim, we propose a novel distributed SDN-based architecture for uncovered infrastructur…
TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks
2009
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based Routing Algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis an…
A flexible and tunable route discovery mechanism for on-demand protocols
2004
Mobile ad-hoc networks are characterized by multihop wireless links and absence of cellular infrastructure. For the last years, routing has been the area under most intensive research. In particular, on-demand routing protocols proposed are extremely attractive due to their low-overhead and efficiency. Currently, wireless ad-hoc networks lack multipath routing protocols. Multipath routing enables increased QoS support, load balancing and enhanced route stability. In this paper we present a new route discovery solution that increases the number of routes found, while reducing the routing overhead when compared to previous proposals. Simulation results show that the additional routing overhea…
A carbon sink-driven approach to estimate gross primary production from microwave satellite observations
2019
Abstract Global estimation of Gross Primary Production (GPP) - the uptake of atmospheric carbon dioxide by plants through photosynthesis - is commonly based on optical satellite remote sensing data. This presents a source-driven approach since it uses the amount of absorbed light, the main driver of photosynthesis, as a proxy for GPP. Vegetation Optical Depth (VOD) estimates obtained from microwave sensors provide an alternative and independent data source to estimate GPP on a global scale, which may complement existing GPP products. Recent studies have shown that VOD is related to aboveground biomass, and that both VOD and temporal changes in VOD relate to GPP. In this study, we build upon…