Experimental Evaluation of Large Scale WiFi Multicast Rate Control

WiFi multicast to very large groups has gained attention as a solution for multimedia delivery in crowded areas. Yet, most recently proposed schemes do not provide performance guarantees and none have been tested at scale. To address the issue of providing high multicast throughput with performance guarantees, we present the design and experimental evaluation of the Multicast Dynamic Rate Adaptation (MuDRA) algorithm. MuDRA balances fast adaptation to channel conditions and stability, which is essential for multimedia applications. MuDRA relies on feedback from some nodes collected via a light-weight protocol and dynamically adjusts the rate adaptation response time. Our experimental evaluation of MuDRA on the ORBIT testbed with over 150 nodes shows that MuDRA outperforms other schemes and supports high throughput multicast flows to hundreds of receivers while meeting quality requirements. MuDRA can support multiple high quality video streams, where 90% of the nodes report excellent or very good video quality

Enabling Multipath and Multicast Data Transmission in Legacy and Future Internet

The quickly growing community of Internet users is requesting multiple applications and services. At the same time the structure of the network is changing. From the performance point of view, there is a tight interplay between the application and the network design. The network must be constructed to provide an adequate performance of the target application. In this thesis we consider how to improve the quality of users' experience concentrating on two popular and resource-consuming applications: bulk data transfer and real-time video streaming. We share our view on the techniques which enable feasibility and deployability of the network functionality leading to unquestionable performance improvement for the corresponding applications. Modern mobile devices, equipped with several network interfaces, as well as multihomed residential Internet hosts are capable of maintaining multiple simultaneous attachments to the network. We propose to enable simultaneous multipath data transmission in order to increase throughput and speed up such bandwidth-demanding applications as, for example, file download. We design an extension for Host Identity Protocol (mHIP), and propose a multipath data scheduling solution on a wedge layer between IP and transport, which effectively distributes packets from a TCP connection over available paths. We support our protocol with a congestion control scheme and prove its ability to compete in a friendly manner against the legacy network protocols. Moreover, applying game-theoretic analytical modelling we investigate how the multihomed HIP multipath-enabled hosts coexist in the shared network. The number of real-time applications grows quickly. Efficient and reliable transport of multimedia content is a critical issue of today's IP network design. In this thesis we solve scalability issues of the multicast dissemination trees controlled by the hybrid error correction. We propose a scalable multicast architecture for potentially large overlay networks. Our techniques address suboptimality of the adaptive hybrid error correction (AHEC) scheme in the multicast scenarios. A hierarchical multi-stage multicast tree topology is constructed in order to improve the performance of AHEC and guarantee QoS for the multicast clients. We choose an evolutionary networking approach that has the potential to lower the required resources for multimedia applications by utilizing the error-correction domain separation paradigm in combination with selective insertion of the supplementary data from parallel networks, when the corresponding content is available. Clearly both multipath data transmission and multicast content dissemination are the future Internet trends. We study multiple problems related to the deployment of these methods.Internetin nopeasti kasvava käyttäjäkunta vaatii verkolta yhä enemmän sovelluksia ja palveluita. Samaan aikaan verkon rakenne muuttuu. Suorituskyvyn näkökulmasta on olemassa selvä vuorovaikutussovellusten ja verkon suunnittelun välillä. Verkko on rakennettava siten, että se pystyy takaamaan riittävän suorituskyvyn halutuille palveluille. Tässä väitöskirjassa pohditaan, miten verkon käyttökokemusta voidaan parantaa keskittyen kahteen suosittuun ja resursseja vaativaan sovellukseen: tiedonsiirtoon ja reaaliaikaiseen videon suoratoistoon. Esitämme näkemyksemme tekniikoista, jotka mahdollistavat tarvittavien verkkotoiminnallisuuksien helpon toteuttavuuden sekä kiistatta parantavat sovelluksien suorityskykyä. Nykyaikaiset mobiililaitteet monine verkkoyhteyksineen, kuten myös kotitietokoneet, pystyvät ylläpitämään monta internet-yhteyttä samanaikaisesti. Siksi ehdotamme monikanavaisen tiedonsiirron käyttöä suorituskyvyn parantamiseksi ja etenkin vaativien verkkosovelluksien, kuten tiedostonsiirron, nopeuttamiseksi. Tässä väitöskirjassa suunnitellaan Host Identity Protocol (mHIP) -laajennus, sekä esitetään tiedonsiirron vuorotteluratkaisu, joka hajauttaa TCP-yhteyden tiedonsiirtopaketit käytettävissä oleville kanaville. Protokollamme tueksi luomme myös ruuhkautumishallinta-algoritmin ja näytämme sen pystyvän toimimaan yhteen nykyisien verkkoprotokollien kanssa. Tämän lisäksi tutkimme peliteoreettista mallinnusta käyttäen, miten monikanavaiset HIP-verkkopäätteet toimivat muiden kanssa jaetuissa verkoissa. Reaaliaikaisten sovellusten määrä kasvaa nopeasti. Tehokas ja luotettava multimediasisällön siirto on olennainen vaatimus nykypäivän IP-verkoissa. Tässä työssä ratkaistaan monilähetyksen (multicast) jakelustruktuurin skaalautuvuuteen liittyviä ongelmia. Ehdotamme skaalautuvaa monilähetysarkkitehtuuria suurille peiteverkoille. Ratkaisumme puuttuu adaptiivisen virhekorjauksen (Adaptive Hybrid Error Correction, AHEC) alioptimaalisuuteen monilähetystilanteissa. Luomme hierarkisen monivaiheisen monilähetyspuutopologian parantaaksemme AHECin suorituskykyä, sekä taataksemme monilähetysasiakkaiden palvelun laadun. Valitsimme evoluutiomaisen lähestymistavan, jolla on potentiaalia keventää multimediasovelluksien verkkoresurssivaatimuksia erottamalla virhekorjauksen omaksi verkkotunnuksekseen, sekä käyttämällä valikoivaa täydentävää tiedonlisäystä rinnakkaisverkoista vastaavan sisällön ollessa saatavilla. Sekä monikanava- että monilähetystiedonsiirto ovat selvästi osa internetin kehityssuuntaa. Tässä väitöskirjassa tutkimme monia ongelmia näiden tekniikoiden käyttöönottoon liittyen

Service quality assurance for the IPTV networks

The objective of the proposed research is to design and evaluate end-to-end solutions to support the Quality of Experience (QoE) for the Internet Protocol Television (IPTV) service. IPTV is a system that integrates voice, video, and data delivery into a single Internet Protocol (IP) framework to enable interactive broadcasting services at the subscribers. It promises significant advantages for both service providers and subscribers. For instance, unlike conventional broadcasting systems, IPTV broadcasts will not be restricted by the limited number of channels in the broadcast/radio spectrum. Furthermore, IPTV will provide its subscribers with the opportunity to access and interact with a wide variety of high-quality on-demand video content over the Internet. However, these advantages come at the expense of stricter quality of service (QoS) requirements than traditional Internet applications. Since IPTV is considered as a real-time broadcast service over the Internet, the success of the IPTV service depends on the QoE perceived by the end-users. The characteristics of the video traffic as well as the high-quality requirements of the IPTV broadcast impose strict requirements on transmission delay. IPTV framework has to provide mechanisms to satisfy the stringent delay, jitter, and packet loss requirements of the IPTV service over lossy transmission channels with varying characteristics. The proposed research focuses on error recovery and channel change latency problems in IPTV networks. Our specific aim is to develop a content delivery framework that integrates content features, IPTV application requirements, and network characteristics in such a way that the network resource utilization can be optimized for the given constraints on the user perceived service quality. To achieve the desired QoE levels, the proposed research focuses on the design of resource optimal server-based and peer-assisted delivery techniques. First, by analyzing the tradeoffs on the use of proactive and reactive repair techniques, a solution that optimizes the error recovery overhead is proposed. Further analysis on the proposed solution is performed by also focusing on the use of multicast error recovery techniques. By investigating the tradeoffs on the use of network-assisted and client-based channel change solutions, distributed content delivery frameworks are proposed to optimize the error recovery performance. Next, bandwidth and latency tradeoffs associated with the use of concurrent delivery streams to support the IPTV channel change are analyzed, and the results are used to develop a resource-optimal channel change framework that greatly improves the latency performance in the network. For both problems studied in this research, scalability concerns for the IPTV service are addressed by properly integrating peer-based delivery techniques into server-based solutions.Ph.D

Measurement-Driven Algorithm and System Design for Wireless and Datacenter Networks

The growing number of mobile devices and data-intensive applications pose unique challenges for wireless access networks as well as datacenter networks that enable modern cloud-based services. With the enormous increase in volume and complexity of traffic from applications such as video streaming and cloud computing, the interconnection networks have become a major performance bottleneck. In this thesis, we study algorithms and architectures spanning several layers of the networking protocol stack that enable and accelerate novel applications and that are easily deployable and scalable. The design of these algorithms and architectures is motivated by measurements and observations in real world or experimental testbeds. In the first part of this thesis, we address the challenge of wireless content delivery in crowded areas. We present the AMuSe system, whose objective is to enable scalable and adaptive WiFi multicast. AMuSe is based on accurate receiver feedback and incurs a small control overhead. This feedback information can be used by the multicast sender to optimize multicast service quality, e.g., by dynamically adjusting transmission bitrate. Specifically, we develop an algorithm for dynamic selection of a subset of the multicast receivers as feedback nodes which periodically send information about the channel quality to the multicast sender. Further, we describe the Multicast Dynamic Rate Adaptation (MuDRA) algorithm that utilizes AMuSe's feedback to optimally tune the physical layer multicast rate. MuDRA balances fast adaptation to channel conditions and stability, which is essential for multimedia applications. We implemented the AMuSe system on the ORBIT testbed and evaluated its performance in large groups with approximately 200 WiFi nodes. Our extensive experiments demonstrate that AMuSe can provide accurate feedback in a dense multicast environment. It outperforms several alternatives even in the case of external interference and changing network conditions. Further, our experimental evaluation of MuDRA on the ORBIT testbed shows that MuDRA outperforms other schemes and supports high throughput multicast flows to hundreds of nodes while meeting quality requirements. As an example application, MuDRA can support multiple high quality video streams, where 90% of the nodes report excellent or very good video quality. Next, we specifically focus on ensuring high Quality of Experience (QoE) for video streaming over WiFi multicast. We formulate the problem of joint adaptation of multicast transmission rate and video rate for ensuring high video QoE as a utility maximization problem and propose an online control algorithm called DYVR which is based on Lyapunov optimization techniques. We evaluated the performance of DYVR through analysis, simulations, and experiments using a testbed composed of Android devices and o the shelf APs. Our evaluation shows that DYVR can ensure high video rates while guaranteeing a low but acceptable number of segment losses, buffer underflows, and video rate switches. We leverage the lessons learnt from AMuSe for WiFi to address the performance issues with LTE evolved Multimedia Broadcast/Multicast Service (eMBMS). We present the Dynamic Monitoring (DyMo) system which provides low-overhead and real-time feedback about eMBMS performance. DyMo employs eMBMS for broadcasting instructions which indicate the reporting rates as a function of the observed Quality of Service (QoS) for each UE. This simple feedback mechanism collects very limited QoS reports which can be used for network optimization. We evaluated the performance of DyMo analytically and via simulations. DyMo infers the optimal eMBMS settings with extremely low overhead, while meeting strict QoS requirements under different UE mobility patterns and presence of network component failures. In the second part of the thesis, we study datacenter networks which are key enablers of the end-user applications such as video streaming and storage. Datacenter applications such as distributed file systems, one-to-many virtual machine migrations, and large-scale data processing involve bulk multicast flows. We propose a hardware and software system for enabling physical layer optical multicast in datacenter networks using passive optical splitters. We built a prototype and developed a simulation environment to evaluate the performance of the system for bulk multicasting. Our evaluation shows that the optical multicast architecture can achieve higher throughput and lower latency than IP multicast and peer-to-peer multicast schemes with lower switching energy consumption. Finally, we study the problem of congestion control in datacenter networks. Quantized Congestion Control (QCN), a switch-supported standard, utilizes direct multi-bit feedback from the network for hardware rate limiting. Although QCN has been shown to be fast-reacting and effective, being a Layer-2 technology limits its adoption in IP-routed Layer 3 datacenters. We address several design challenges to overcome QCN feedback's Layer- 2 limitation and use it to design window-based congestion control (QCN-CC) and load balancing (QCN-LB) schemes. Our extensive simulations, based on real world workloads, demonstrate the advantages of explicit, multi-bit congestion feedback, especially in a typical environment where intra-datacenter traffic with short Round Trip Times (RTT: tens of s) run in conjunction with web-facing traffic with long RTTs (tens of milliseconds)

Scalable reliable on-demand media streaming protocols

This thesis considers the problem of delivering streaming media, on-demand, to potentially large numbers of concurrent clients. The problem has motivated the development in prior work of scalable protocols based on multicast or broadcast. However, previous protocols do not allow clients to efficiently: 1) recover from packet loss; 2) share bandwidth fairly with competing flows; or 3) maximize the playback quality at the client for any given client reception rate characteristics. In this work, new protocols, namely Reliable Periodic Broadcast (RPB) and Reliable Bandwidth Skimming (RBS), are developed that efficiently recover from packet loss and achieve close to the best possible server bandwidth scalability for a given set of client characteristics. To share bandwidth fairly with competing traffic such as TCP, these protocols can employ the Vegas Multicast Rate Control (VMRC) protocol proposed in this work. The VMRC protocol exhibits TCP Vegas-like behavior. In comparison to prior rate control protocols, VMRC provides less oscillatory reception rates to clients, and operates without inducing packet loss when the bottleneck link is lightly loaded. The VMRC protocol incorporates a new technique for dynamically adjusting the TCP Vegas threshold parameters based on measured characteristics of the network. This technique implements fair sharing of network resources with other types of competing flows, including widely deployed versions of TCP such as TCP Reno. This fair sharing is not possible with the previously defined static Vegas threshold parameters. The RPB protocol is extended to efficiently support quality adaptation. The Optimized Heterogeneous Periodic Broadcast (HPB) is designed to support a range of client reception rates and efficiently support static quality adaptation by allowing clients to work-ahead before beginning playback to receive a media file of the desired quality. A dynamic quality adaptation technique is developed and evaluated which allows clients to achieve more uniform playback quality given time-varying client reception rates

Traffic and mobility management in large-scale networks of small cells

The growth in user demand for higher mobile data rates is driving Mobile Network Operators (MNOs) and network infrastructure vendors towards the adoption of innovative solutions in areas that span from physical layer techniques (e.g., carrier aggregation, massive MIMO, etc.) to the Radio Access Network and the Evolved Packet Core, amongst other. In terms of network capacity, out of a millionfold increase since 1957, the use of wider spectrum (25x increase), the division of spectrum into smaller resources (5x), and the introduction of advanced modulation and coding schemes (5x) have played a less significant role than the improvements in system capacity due to cell size reduction (1600x). This justifies the academic and industrial interest in short-range, low-power cellular base stations, such as small cells. The shift from traditional macrocell-based deployments towards heterogeneous cellular networks raises the need for new architectural and procedural frameworks capable of providing a seamless integration of massive deployments of small cells into the existing cellular network infrastructure. This is particularly challenging for large-scale, all-wireless networks of small cells (NoS), where connectivity amongst base stations is provided via a wireless multi-hop backhaul. Networks of small cells are a cost-effective solution for improving network coverage and capacity in high user-density scenarios, such as transportation hubs, sports venues, convention centres, dense urban areas, shopping malls, corporate premises, university campuses, theme parks, etc. This Ph.D. Thesis provides an answer to the following research question: What is the architectural and procedural framework needed to support efficient traffic and mobility management mechanisms in massive deployments of all-wireless 3GPP Long-Term Evolution networks of small cells? In order to do so, we address three key research challenges in NoS. First, we present a 3GPP network architecture capable of supporting large-scale, all-wireless NoS deployments in the Evolved Packet System. This involves delegating core network functions onto new functional entities in the network of small cells, as well as adapting Transport Network Layer functionalities to the characteristics of a NoS in order to support key cellular services. Secondly, we address the issue of local location management, i.e., determining the approximate location of a mobile terminal in the NoS upon arrival of an incoming connection from the core network. This entails the design, implementation, and evaluation of efficient paging and Tracking Area Update mechanisms that can keep track of mobile terminals in the complex scenario of an all-wireless NoS whilst mitigating the impact on signalling traffic throughout the local NoS domain and towards the core network. Finally, we deal with the issue of traffic management in large-scale networks of small cells. On the one hand, we propose new 3GPP network procedures to support direct unicast communication between LTE terminals camped on the same NoS with minimal involvement from functional entities in the Evolved Packet Core. On the other hand, we define a set of extensions to the standard 3GPP Multicast/Broadcast Multimedia Service (MBMS) in order to improve the quality of experience of multicast/broadcast traffic services in high user-density scenarios.El crecimiento de la demanda de tasas de transmisión más altas está empujando a los operadores de redes móviles y a los fabricantes de equipos de red a la adopción de soluciones innovadoras en áreas que se extienden desde técnicas avanzadas de capa física (agregación de portadoras, esquemas MIMO masivos, etc.) hasta la red de acceso radio y troncal, entre otras. Desde 1957 la capacidad de las redes celulares se ha multiplicado por un millón. La utilización de mayor espectro radioeléctrico (incremento en factor 25), la división de dicho espectro en recursos más pequeños (factor 5) y la introducción de esquemas avanzados de modulación y codificación (factor 5) han desempeñado un papel menos significativo que las mejoras en la capacidad del sistema debidas a la reducción del tamaño de las celdas (factor 1600). Este hecho justifica el interés del mundo académico y de la industria en estaciones base de corto alcance y baja potencia, conocidas comúnmente como small cells. La transición de despliegues tradicionales de redes celulares basados en macroceldas hacia redes heterogéneas pone de manifiesto la necesidad de adoptar esquemas arquitecturales y de procedimientos capaces de proporcionar una integración transparente de despliegues masivos de small cells en la actual infraestructura de red celular. Este aspecto es particularmente complejo en el caso de despliegues a gran escala de redes inalámbricas de small cells (NoS, en sus siglas en inglés), donde la conectividad entre estaciones base se proporciona a través de una conexión troncal inalámbrica multi-salto. En general, las redes de small cells son una solución eficiente para mejorar la cobertura y la capacidad de la red celular en entornos de alta densidad de usuarios, como núcleos de transporte, sedes de eventos deportivos, palacios de congresos, áreas urbanas densas, centros comerciales, edificios corporativos, campus universitarios, parques temáticos, etc. El objetivo de esta Tesis de Doctorado es proporcionar una respuesta a la siguiente pregunta de investigación: ¿Cuál es el esquema arquitectural y de procedimientos de red necesario para soportar mecanismos eficientes de gestión de tráfico y movilidad en despliegues masivos de redes inalámbricas de small cells LTE? Para responder a esta pregunta nos centramos en tres desafíos clave en NoS. En primer lugar, presentamos una arquitectura de red 3GPP capaz de soportar despliegues a gran escala de redes inalámbricas de small cells en el Evolved Packet System, esto es, el sistema global de comunicaciones celulares LTE. Esto implica delegar funciones de red troncal en nuevas entidades funcionales desplegadas en la red de small cells, así como adaptar funcionalidades de la red de transporte a las características de una NoS para soportar servicios celulares clave. En segundo lugar, nos centramos en el problema de la gestión de movilidad local, es decir, determinar la localización aproximada de un terminal móvil en la NoS a la llegada de una solicitud de conexión desde la red troncal. Esto incluye el diseño, la implementación y la evaluación de mecanismos eficientes de paging y Tracking Area Update capaces de monitorizar terminales móviles en el complejo escenario de redes de small cells inalámbricas que, a la vez, mitiguen el impacto sobre el tráfico de señalización en el dominio local de la NoS y hacia la red troncal. Finalmente, estudiamos el problema de gestión de tráfico en despliegues a gran escala de redes inalámbricas de small cells. Por un lado, proponemos nuevos procedimientos de red 3GPP para soportar comunicaciones unicast directas entre terminales LTE registrados en la misma NoS con mínima intervención por parte de entidades funcionales en la red troncal. Por otro lado, definimos un conjunto de extensiones para mejorar la calidad de la experiencia del servicio estándar 3GPP de transmisión multicast/broadcast de tráfico multimedia (MBMS, en sus siglas en inglés) en entornos de alta densidad de usuarios

Learning for Network Applications and Control

The emergence of new Internet applications and technologies have resulted in an increased complexity as well as a need for lower latency, higher bandwidth, and increased reliability. This ultimately results in an increased complexity of network operation and management. Manual management is not sufficient to meet these new requirements. There is a need for data driven techniques to advance from manual management to autonomous management of network systems. One such technique, Machine Learning (ML), can use data to create models from hidden patterns in the data and make autonomous modifications. This approach has shown significant improvements in other domains (e.g., image recognition and natural language processing). The use of ML, along with advances in programmable control of Software- Defined Networks (SDNs), will alleviate manual network intervention and ultimately aid in autonomous network operations. However, realizing a data driven system that can not only understand what is happening in the network but also operate autonomously requires advances in the networking domain, as well as in ML algorithms. In this thesis, we focus on developing ML-based network architectures and data driven net- working algorithms whose objective is to improve the performance and management of future networks and network applications. We focus on problems spanning across the network protocol stack from the application layer to the physical layer. We design algorithms and architectures that are motivated by measurements and observations in real world or experimental testbeds. In Part I we focus on the challenge of monitoring and estimating user video quality of experience (QoE) of encrypted video traffic for network operators. We develop a system for REal-time QUality of experience metric detection for Encrypted Traffic, Requet. Requet uses a detection algorithm to identify video and audio chunks from the IP headers of encrypted traffic. Features extracted from the chunk statistics are used as input to a random forest ML model to predict QoE metrics. We evaluate Requet on a YouTube dataset we collected, consisting of diverse video assets delivered over various WiFi and LTE network conditions. We then extend Requet, and present a study on YouTube TV live streaming traffic behavior over WiFi and cellular networks covering a 9-month period. We observed pipelined chunk requests, a reduced buffer capacity, and a more stable chunk duration across various video resolutions compared to prior studies of on-demand streaming services. We develop a YouTube TV analysis tool using chunks statistics detected from the extracted data as input to a ML model to infer user QoE metrics. In Part II we consider allocating end-to-end resources in cellular networks. Future cellular networks will utilize SDN and Network Function Virtualization (NFV) to offer increased flexibility for network infrastructure operators to utilize network resources. Combining these technologies with real-time network load prediction will enable efficient use of network resources. Specifically, we leverage a type of recurrent neural network, Long Short-Term Memory (LSTM) neural networks, for (i) service specific traffic load prediction for network slicing, and (ii) Baseband Unit (BBU) pool traffic load prediction in a 5G cloud Radio Access Network (RAN). We show that leveraging a system with better accuracy to predict service requirements results in a reduction of operation costs. We focus on addressing the optical physical layer in Part III. Greater network flexibility through SDN and the growth of high bandwidth services are motivating faster service provisioning and capacity management in the optical layer. These functionalities require increased capacity along with rapid reconfiguration of network resources. Recent advances in optical hardware can enable a dramatic reduction in wavelength provisioning times in optical circuit switched networks. To support such operations, it is imperative to reconfigure the network without causing a drop in service quality to existing users. Therefore, we present a ML system that uses feedforward neural networks to predict the dynamic response of an optically circuit-switched 90-channel multi-hop Reconfigurable Optical Add-Drop Multiplexer (ROADM) network. We show that the trained deep neural network can recommend wavelength assignments for wavelength switching with minimal power excursions. We extend the performance of the ML system by implementing and testing a Hybrid Machine Learning (HML) model, which combines an analytical model with a neural network machine learning model to achieve higher prediction accuracy. In Part IV, we use a data-driven approach to address the challenge of wireless content delivery in crowded areas. We present the Adaptive Multicast Services (AMuSe) system, whose objective is to enable scalable and adaptive WiFi multicast. Specifically, we develop an algorithm for dynamic selection of a subset of the multicast receivers as feedback nodes. Further, we describe the Multicast Dynamic Rate Adaptation (MuDRA) algorithm that utilizes AMuSe’s feedback to optimally tune the physical layer multicast rate. Our experimental evaluation of MuDRA on the ORBIT testbed shows that MuDRA outperforms other schemes and supports high throughput multicast flows to hundreds of nodes while meeting quality requirements. We leverage the lessons learned from AMuSe for WiFi and use order statistics to address the performance issues with LTE evolved Multimedia Broadcast/Multicast Service (eMBMS). We present the Dynamic Monitoring (DyMo) system which provides low-overhead and real-time feedback about eMBMS performance to be used for network optimization. We focus on the Quality of Service (QoS) Evaluation module and develop a Two-step estimation algorithm which can efficiently identify the SNR Threshold as a one time estimation. DyMo significantly outperforms alternative schemes based on the Order-Statistics estimation method which relies on random or periodic sampling

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets