BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Topic overview

Networking and Internet Architecture

3614 works9699 researchers
Open mapBrowse papers

Map preview

Start with the graph, then narrow the list

3614works
9699researchers

Next steps

Use the topic as a working map

Open the full map for clusters, then return here to scan ranked papers and people.

Topic graph

See the topic as a live network

Open full explorer

Inspect nearby papers, researchers, institutions and communities without opening a separate graph page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Papers in this area

24 paper(s) to start with

Showing a focused slice from 3614 total papers. Open the graph or search to expand the full area.

preprint2017arXiv

Interference Minimization in 5G Heterogeneous Networks

In this paper, we focus on one of the representative 5G network scenarios, namely multi-tier heterogeneous cellular networks. User association is investigated in order to reduce the down-link co-channel interference. Firstly, in order to analyze the multi-tier heterogeneous cellular networks where the base stations in different tiers usually adopt different transmission powers, we propose a Transmission Power Normalization Model (TPNM), which is able to convert a multi-tier cellular network into a single-tier network, such that all base stations have the same normalized transmission power. Then using TPNM, the signal and interference received at any point in the complex multi-tier environment can be analyzed by considering the same point in the equivalent single-tier cellular network model, thus significantly simplifying the analysis. On this basis, we propose a new user association scheme in heterogeneous cellular networks, where the base station that leads to the smallest interference to other co-channel mobile stations is chosen from a set of candidate base stations that satisfy the quality-of-service (QoS) constraint for an intended mobile station. Numerical results show that t

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Radio Tomography for Roadside Surveillance

Radio tomographic imaging (RTI) has recently been proposed for tracking object location via radio waves without requiring the objects to transmit or receive radio signals. The position is extracted by inferring which voxels are obstructing a subset of radio links in a dense wireless sensor network. This paper proposes a variety of modeling and algorithmic improvements to RTI for the scenario of roadside surveillance. These include the use of a more physically motivated weight matrix, a method for mitigating negative (aphysical) data due to noisy observations, and a method for combining frames of a moving vehicle into a single image. The proposed approaches are used to show improvement in both imaging (useful for human-in-the-loop target recognition) and automatic target recognition in a measured data set.

0 citations0 reviewsNo code linkedOpen access
preprint2017arXiv

EIP - Preventing DDoS with Ephemeral IP Identifiers Cryptographically Generated

Nowadays, denial of service (DoS) attacks represent a significant fraction of all attacks that take place in the Internet and their intensity is always growing. The main DoS attack methods consist of flooding their victims with bogus packets, queries or replies, so as to prevent them from fulfilling their roles. Preventing DoS attacks at network level would be simpler if end-to-end strong authentication in any packet exchange was mandatory. However, it is also likely that its mandatory adoption would introduce more harm than benefits. In this paper we present an end-point addressing scheme and a set of security procedures which satisfy most of network level DoS prevention requirements. Instead of being known by public stable IP addresses, hosts use ephemeral IP Identifiers cryptographically generated and bound to its usage context. Self-signed certificates and challenge-based protocols allow, without the need of any third parties, the implementation of defenses against DoS attacks. Communication in the open Internet while using these special IP addresses is supported by the so-called Map/Encap approaches, which in our point of view will be sooner or later required for the future In

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Study and Development of a New Symmetric Key Management Scheme for Wireless Sensor Networks

Wireless Sensor Network (WSN) is consisting of independent and distributed sensors to monitor physical or environmental conditions, such as temperature, sound, pressure, etc. However, the limited resources of sensors and hostile environments in which they could be deployed, make this type of networks vulnerable to several types of attacks similar to those occurring in ad hoc networks. The most crucial and fundamental challenge that WSN is facing is security. The primary subject of all my work is to address this issue. Due to minimum capacity in term of memory cost, processing and physical accessibility to sensors devices the security attacks are problematic. They are mostly deployed in open area so are more exposed to different kinds of attacks. They must be designed in a way to successfully recover itself from different kinds of attacks. In this paper, we proposed a new lightweight cryptography algorithm based on LEAP+. Our evaluations on TOSSIM give a precise and detailed idea of the extra cost of consumption of resources needed to ensure the high level of expected security.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Channel Measurements and Models for High-Speed Train Wireless Communication Systems in Tunnel Scenarios: A Survey

The rapid developments of high-speed trains (HSTs) introduce new challenges to HST wireless communication systems. Realistic HST channel models play a critical role in designing and evaluating HST communication systems. Due to the length limitation, bounding of tunnel itself, and waveguide effect, channel characteristics in tunnel scenarios are very different from those in other HST scenarios. Therefore, accurate tunnel channel models considering both large-scale and small-scale fading characteristics are essential for HST communication systems. Moreover, certain characteristics of tunnel channels have not been investigated sufficiently. This article provides a comprehensive review of the measurement campaigns in tunnels and presents some tunnel channel models using various modeling methods. Finally, future directions in HST tunnel channel measurements and modeling are discussed.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

IEEE 802.11p-based Packet Broadcast in Radio Channels with Hidden Stations and Congestion Control

The Decentralized Congestion Control (DCC) algorithms specified in ETSI ITS standards [1] address the IEEE 802.11p MAC and provide reliability of periodic broadcast messages at high density of vehicles. However, the deterministic relation between controllable parameters, e.g. transmit power, frame duration, frame transmit rate and channel clear assessment threshold, and the effects of DCC algorithms, e.g. channel busy duration, frame interference-free reception probability and frame channel access delay, is still unknown since a correct mathematical analysis of the hidden station problem in CSMA networks is lacking. In this work, the hidden station problem in a linear IEEE 802.11p broadcast network is analyzed based on analytical results developed in [18] employing a modified MAC protocol model based on [3]. Simulation results validate the new analytical model for linear IEEE 802.11p networks w.r.t reliability and latency performances of Cooperative Awareness Message broadcast. Evidence is given that the model not only is valid for single-lane highways but also provides good approximate results for multi-lane highway scenarios. Our MAC layer analytical model of IEEE 802.11p broadca

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

A Comprehensive Survey of Potential Game Approaches to Wireless Networks

Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Capacity and Delay Tradeoff of Secondary Cellular Networks with Spectrum Aggregation

Cellular communication networks are plagued with redundant capacity, which results in low utilization and cost-effectiveness of network capital investments. The redundant capacity can be exploited to deliver secondary traffic that is ultra-elastic and delay-tolerant. In this paper, we propose an analytical framework to study the capacity-delay tradeoff of elastic/secondary traffic in large scale cellular networks with spectrum aggregation. Our framework integrates stochastic geometry and queueing theory models and gives analytical insights into the capacity-delay performance in the interference limited regime. Closed-form results are obtained to characterize the mean delay and delay distribution as functions of per user throughput capacity. The impacts of spectrum aggregation, user and base station (BS) densities, traffic session payload, and primary traffic dynamics on the capacity-delay tradeoff relationship are investigated. The fundamental capacity limit is derived and its scaling behavior is revealed. Our analysis shows the feasibility of providing secondary communication services over cellular networks and highlights some critical design issues.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Dynamic Clustering and User Association in Wireless Small Cell Networks with Social Considerations

In this paper, a novel social network-aware user association in wireless small cell networks with underlaid device-to-device (D2D) communication is investigated. The proposed approach exploits social strategic relationships between user equipments (UEs) and their physical proximity to optimize the overall network performance. This problem is formulated as a matching game between UEs and their serving nodes (SNs) in which, an SN can be a small cell base station (SCBS) or an important UE with D2D capabilities. The problem is cast as a many-to-one matching game in which UEs and SNs rank one another using preference relations that capture both the wireless aspects (i.e., received signal strength, traffic load, etc.) and users' social ties (e.g., UE proximity and social distance). Due to the combinatorial nature of the network-wide UE-SN matching, the problem is decomposed into a dynamic clustering problem in which SCBSs are grouped into disjoint clusters based on mutual interference. Subsequently, an UE-SN matching game is carried out per cluster. The game under consideration is shown to belong to a class of matching games with externalities arising from interference and peer effec

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Joint Network Coding and Machine Learning for Error-prone Wireless Broadcast

Reliable broadcasting data to multiple receivers over lossy wireless channels is challenging due to the heterogeneity of the wireless link conditions. Automatic Repeat-reQuest (ARQ) based retransmission schemes are bandwidth inefficient due to data duplication at receivers. Network coding (NC) has been shown to be a promising technique for improving network bandwidth efficiency by combining multiple lost data packets for retransmission. However, it is challenging to accurately determine which lost packets should be combined together due to disrupted feedback channels. This paper proposes an adaptive data encoding scheme at the transmitter by joining network coding and machine learning (NCML) for retransmission of lost packets. Our proposed NCML extracts the important features from historical feedback signals received by the transmitter to train a classifier. The constructed classifier is then used to predict states of transmitted data packets at different receivers based on their corrupted feedback signals for effective data mixing. We have conducted extensive simulations to collaborate the efficiency of our proposed approach. The simulation results show that our machine learning a

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Proactive QoE Provisioning in Heterogeneous Access Networks using Hidden Markov Models and Reinforcement Learning

Quality of Experience (QoE) provisioning in heterogeneous access networks (HANs) can be achieved via handoffs. The current approaches for QoE-aware handoffs either lack the availability of a network path probing method or lack the availability of efficient methods for QoE prediction. Further, the current approaches do not explore the benefits of proactive QoE-aware handoffs such that user's QoE is maximized by learning from past network conditions and by actions taken by the mobile device regarding handoffs. In this paper, our contributions are two-fold. First, we propose, develop and validate a novel method for QoE prediction based on passive probing. Our method is based on hidden Markov models and Multi-homed Mobility Management Protocol which eliminates the need for additional probe packets for QoE prediction. It achieves the average QoE prediction accuracy of 97%. Second, we propose, develop and validate a novel reinforcement learning based method for proactive QoE-aware handoffs. We show that our method outperforms existing approaches by reducing the number of vertical handoffs by 60.65% while maintaining high QoE levels and by extending crucial functionality such as passi

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

A Distributed Algorithm for Quality-of-Service Provisioning in Multihop Networks

We present a distributed algorithm for joint power control, routing and scheduling in multihop wireless networks. The algorithm also provides for Quality of Service (QoS) guarantees, namely, end-to-end mean delay guarantees and hard deadline guarantees, for different users. It is easily implementable and works by giving local dynamic priority to flows requiring QoS, the priority being a function of the queue length at the nodes. We provide theoretical bounds for the stability properties of the algorithm. We also compare the performance of the algorithm with other existing algorithms by means of extensive simulations, and demonstrate its efficacy in providing QoS on demand.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Reliability Modeling and Analysis of Communication Networks

In recent times, the functioning of various aspects of modern society---ranging from the various infrastructural utilities such as electrical power, water to socio-economical aspects such as telecommunications, business, commerce, education---has become critically reliant on communication networks, and particularly on the Internet. With the migration of critical facilities to the Internet, it has become vitally important to ensure the reliability and availability of networks. In this paper, we study various modeling and analysis techniques that can aid in the study of reliability of communication networks. In this regard, we provide background on the modeling techniques (such as reliability block diagrams, fault trees, Markov chains, etc.) and analysis techniques (such as mathematical analytical methods, simulation methods, and formal methods). Apart from providing the necessary background, we also critically evaluate the pros and cons of different approaches, and provide a detailed survey of their applications in communication networks. To the best of our knowledge, this is the first in-depth review of the application of reliability modeling and analysis techniques in communicatio

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

On the Design of MAC Protocol and Transmission Scheduling for Internet of Things

With the ubiquitous sensing enabled by wireless sensor network technologies, Internet of Things (IoT) is developed to many areas of modern day living. The inexpensive IoT devices and platforms capable of wireless communications enable the ability to measure, infer and understand environmental indicators, from delicate ecologies and natural resources to urban environments. In this paper, we firstly investigate a scalable multimode-based MAC protocol, IoT-MAC, which consists of a channel contention period and a data transmission period, to reduce contention of channel access due to coexist of many IoT devices. Secondly, we study a data transmission scheduling algorithm to maximise data collection under the constraints of radio link quality and remaining energy of the IoT node, while ensuring a fair access to the radio channel. To study the performance of data reception rate, packet loss rate and latency, we evaluate the IoT-MAC and scheduling algorithm with varying data rate and different network scale.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Connectivity based technique for localization of nodes in wireless sensor networks

We propose a localization algorithm for wireless sensor networks, which is simple in design, does not involve significant overhead and yet provides acceptable position estimates of sensor nodes. The algorithm uses settled nodes as beacon nodes so as to increase the number of beacon nodes. The algorithm is range free and does not need any additional piece of hardware for ranging. It also does not involve any significant communication overhead for localization. The simulation and results show that good localization accuracy is achieved for outdoor environments.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Optimal Resource Allocation for Cellular Networks with MATLAB Instructions

This report presents a more detailed description of the algorithm and simulations published in papers [1, 2]. It includes a step by step description of the algorithm and included the corresponding flow chart. In addition, detailed instructions of the MATLAB code used to simulate the proposed allocation algorithm in [1, 2] is presented. The report starts with a brief motivation of resource allocation problem in wireless networks. Then, some of the prior related work on the subject are mentioned. Finally, we provide the details instructions on MATLAB functions used in our algorithm. More rigorous analysis and proofs of the problem and algorithm are present in [1, 2] and further discussions presented in [3, 4].

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Compressed Sensing Algorithms for OFDM Channel Estimation

Radio channels are typically sparse in the delay domain, and ideal for compressed sensing. A new compressed sensing algorithm called eX-OMP is developed that yields performance similar to that of the optimal MMSE estimator. The new algorithm relies on a small amount additional data. Both eX-OMP and the MMSE estimator adaptively balance channel tracking and noise reduction. They perform better than simple estimators such as the linear-interpolator which fix this trade-off a priori. Some wideband measurements are examined, and the channels are found to be represented by a few delays.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Tracking mm-Wave Channel Dynamics: Fast Beam Training Strategies under Mobility

In order to cope with the severe path loss, millimeter-wave (mm-wave) systems exploit highly directional communication. As a consequence, even a slight beam misalignment between two communicating devices (for example, due to mobility) can generate a significant signal drop. This leads to frequent invocations of time-consuming mechanisms for beam re-alignment, which deteriorate system performance. In this paper, we propose smart beam training and tracking strategies for fast mm-wave link establishment and maintenance under node mobility. We leverage the ability of hybrid analog-digital transceivers to collect channel information from multiple spatial directions simultaneously and formulate a probabilistic optimization problem to model the temporal evolution of the mm-wave channel under mobility. In addition, we present for the first time a beam tracking algorithm that extracts information needed to update the steering directions directly from data packets, without the need for spatial scanning during the ongoing data transmission. Simulation results, obtained by a custom simulator based on ray tracing, demonstrate the ability of our beam training/tracking strategies to keep the comm

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Using UDP for Internet Transport Evolution

The increasing use of middleboxes (e.g., NATs, firewalls) in the Internet has made it harder and harder to deploy new transport or higher layer protocols, or even extensions to existing ones. Current work to address this Internet transport ossification has led to renewed interest in UDP as an encapsulation for making novel transport protocols deployable in the Internet. Examples include Google's QUIC and the WebRTC data channel. The common assumption made by these approaches is that encapsulation over UDP works in the present Internet. This paper presents a measurement study to examine this assumption, and provides guidance for protocol design based on our measurements. The key question is "can we run new transport protocols for the Internet over UDP?" We find that the answer is largely "yes": UDP works on most networks, and impairments are generally confined to access networks. This allows relatively simple fallback strategies to work around it. Our answer is based on a twofold methodology. First, we use the RIPE Atlas platform to basically check UDP connectivity and first-packet latency. Second, we deploy copycat, a new tool for comparing TCP loss, latency, an

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

TCP SIAD: Congestion Control supporting High Speed and Low Latency

Congestion control has been an open research issue for more than two decades. More and more applications with narrow latency requirements are emerging which are not well addressed by existing proposals. In this paper we present TCP Scalable Increase Adaptive Decrease (SIAD), a new congestion control scheme supporting both high speed and low latency. More precisely, our algorithm aims to provide high utilization under various networking conditions, and therefore would allow operators to configure small buffers for low latency support. To provide full scalability with high speed networks, we designed TCP SIAD based on a new approach that aims for a fixed feedback rate independent of the available bandwidth. Further, our approach provides a configuration knob for the feedback rate. This can be used by a higher layer control loop to impact the capacity share, potentially at the cost of higher congestion, e.g. for applications that need a minimum rate. We evaluated TCP SIAD against well-known high-speed congestion control schemes, such as Scalable TCP and High Speed TCP, as well as H-TCP that among other goals targets small buffers. We show that only SIAD is able to utilize the bottlene

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Cache peering in multi-tenant 5G networks

Building on the adoption of the Network Functions Virtualization (NFV) and Software Defined Networking (SDN) paradigms, 5G networks promise distinctive features includ- ing the capability to support multi-tenancy. Virtual network operators (VNOs) are expected to co-exist over the shared infrastructure, realizing their network functionality on top of virtualized resources. In this context, we observe the emerging opportunity for establishing synergies between co-located tenants of the infrastructure, in the form of cache peering relationships between co-located VNOs. Upon a cache miss, co-located caches benefit from content cached at their peers, taking advantage of the shared nature of the infrastructure in reducing latencies and traffic overheads. Our approach allows VNOs to autonomously manage their peering links without the involvement of the infrastructure operator.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

A Secure Multiple-Access Scheme for Rechargeable Wireless Sensors in the Presence of an Eavesdropper

We propose a simple yet efficient scheme for a set of energy-harvesting sensors to establish secure communication with a common destination (a master node). An eavesdropper attempts to decode the data sent from the sensors to their common destination. We assume a single modulation scheme that can be implemented efficiently for energy-limited applications. We design a multiple-access scheme for the sensors under secrecy and limited-energy constraints. In a given time slot, each energy-harvesting sensor chooses between sending its packet or remaining idle. The destination assigns a set of data time slots to each sensor. The optimization problem is formulated to maximize the secrecy sum-throughput.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Relieving Core Routers from Dynamic Routing with off-the-shelf Equipment and Protocols

To answer traffic engineering goals, current backbone networks use expensive and sophisticated equipments, that run distributed algorithms to imple- ment dynamic multi-path routing (e.g., MPLS tunnels and dynamic trunk rerout- ing). We think that the same goals can be fulfilled using a simpler approach, where the core of the backbone only implements many a priori computed paths, and most adaptation to traffic engineering goals only takes place at the edge of the network. In the vein of Software Defined Networking, edge adaptation should be driven by a logically centralized controller that leverages the available paths to adapt traffic load balancing to the current demands and network status. In this article we present two algorithms to help building this vision. The first one selects sets of paths able to support future load balancing needs and adaptation to network faults. As the total number of required paths is very important, and their continuous availability requires many FIB entries in core routers, we also present a second algorithm that aggregates these paths in a reduced number of trees. This second algorithm achieves better results than previously proposed algorithms for

0 citations0 reviewsNo code linkedOpen access

People in this topic

12 visible researcher(s)

Ranked from 9699 researcher records connected to this topic.