Data Mining - Concepts and Techniques.

Data Mining Practical Machine Learning Tools and Techniques

Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. We propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in O(1) iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.

/pdf/heed-a-hybrid-energy-efficient-distributed-clustering-4c3cjgsfv9.pdf

HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks

http://cpham.perso.univ-pau.fr/ENSEIGNEMENT/PAU-UPPA/RESA-M2/Clustering-abasi.pdf

A survey on clustering algorithms for wireless sensor networks

Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this article, we state several problems related to topology control in wireless ad hoc and sensor networks, and we survey state-of-the-art solutions which have been proposed to tackle them. We also outline several directions for further research which we hope will motivate researchers to undertake additional studies in this field.

/pdf/topology-control-in-wireless-ad-hoc-and-sensor-networks-3e17u396zt.pdf

Topology Control in Wireless Ad Hoc and Sensor Networks

Although it is well-known that TCP throughput is suboptimal in multihop wireless networks, little performance data is available for TCP in realistic wireless environments. In this paper, we present the results of an extensive experimental study of TCP performance on a 32-node wireless mesh network testbed deployed on the Purdue University campus. Contrary to prior work which considered a single topology with equal-length links and only 1-hop neighbors within transmission range of each other, our study considers more realistic heterogeneous topologies. We vary the maximum TCP window size, in correlation with two important MAC layer parameters: the use of RTS/CTS and the MAC data rate. Based on our TCP throughput results, wegive recommendations on configuring TCP and MAC parameters, which in many cases contradict previous proposals (which had themselves contradicted each other).

/pdf/on-tcp-throughput-and-window-size-in-a-multihop-wireless-at9zbhm5n9.pdf

On TCP throughput and window size in a multihop wireless network testbed

https://www.cse.wustl.edu/~jain/papers/ftp/comcom_genfair.pdf

General weighted fairness and its support in explicit rate switch algorithms

In this paper, we make a case for using lightweight containers for fine-grained resource flexing for Virtualized Network Functions (VNFs) to meet the demands of varying workloads. We quantitatively compare the VNF performance and infrastructure resource usage of three instantiations (bare metal, virtual machine, and container) of three selected VNFs. The three VNFs we experiment with are the Mobility Management Entity (MME) of the Evolved packet core (EPC) architecture for cellular networks, the Suricata multi-threaded Intrusion Detection System (IDS), and the Snort single-threaded IDS. Our results show that container-based instantiations not only incur lower resource usage but also have shorter boot time. This makes containers an attractive choice for fine-grained VNF resource flexing. The lessons learned from our empirical case studies with EPC and IDS provide important guidelines for building an elastic micro-service architecture for NFV deployments.

An empirical case for container-driven fine-grained VNF resource flexing

The available bit rate (ABR) service has been developed to support data applications over asynchronous transfer mode (ATM). It is hence interesting to study the performance of reliable data transport protocols like the "transport control protocol (TCP)" over ABR. We study the effect of running large unidirectional file transfer applications on TCP over ABR with an explicit rate algorithm (ERICA) implemented at the ATM switches. The paper shows that it is possible to get maximum TCP throughput when there are enough buffers at the switches. However, when the number of buffers is smaller, there is a large reduction in TCP throughput even though the cell loss ratio (CLR) is very small. We study the effect of various factors which affect TCP throughput and fairness. These factors include the TCP timer granularity, switch buffering, ABR parameters, and the cell drop policy at the switches.

http://ieeexplore.ieee.org/iel3/4477/12830/00594409.pdf

Performance of TCP/IP over ABR service on ATM networks

We study the performance of Selective Acknowledgments with TCP over the ATM-UBR service category. We examine various UBR drop policies, TCP mechanisms and network configurations to recommend optimal parameters for TCP over UBR. We discuss various TCP congestion control mechanisms compare their performance for LAN and WAN networks. We describe the effect of satellite delays on TCP performance over UBR and present simulation results for LAN, WAN and satellite networks. SACK TCP improves the performance of TCP over UBR, especially for large delay networks. Intelligent drop policies at the switches are an important factor for good performance in local area networks.

Sonia Fahmy

Papers

On TCP throughput and window size in a multihop wireless network testbed

General weighted fairness and its support in explicit rate switch algorithms

An empirical case for container-driven fine-grained VNF resource flexing

Performance of TCP/IP over ABR service on ATM networks

TCP Selective Acknowledgments and UBR Drop Policies to Improve ATM-UBR Performance over Terrestrial and Satellite Networks