scispace - formally typeset
Search or ask a question
Author

Fabio Mesiti

Bio: Fabio Mesiti is an academic researcher from Norwegian University of Science and Technology. The author has contributed to research in topics: IEEE 802.11 & Distributed coordination function. The author has an hindex of 11, co-authored 33 publications receiving 616 citations. Previous affiliations of Fabio Mesiti include Polytechnic University of Turin & University of Oslo.

Papers
More filters
Journal ArticleDOI
TL;DR: A throughput analysis of the IEEE 802.11 protocol at the data link layer in non-saturated traffic conditions taking into account the impact of both transmission channel and capture effects in Rayleigh fading environment is provided.
Abstract: In this paper, we provide a saturation throughput analysis of the IEEE 802.11 protocol at the data link layer by including the impact of both transmission channel and capture effects in Rayleigh fading environment. Impacts of both non-ideal channel and capture effects, specially in an environment of high interference, become important in terms of the actual observed throughput. As far as the 4-way handshaking mechanism is concerned, we extend the multi-dimensional Markovian state transition model characterizing the behavior at the MAC layer by including transmission states that account for packet transmission failures due to errors caused by propagation through the channel. This way, any channel model characterizing the physical transmission medium can be accommodated, including AWGN and fading channels. We also extend the Markov model in order to consider the behavior of the contention window when employing the basic 2-way handshaking mechanism. Under the usual assumptions regarding the traffic generated per node and independence of packet collisions, we solve for the stationary probabilities of the Markov chain and develop expressions for the saturation throughput as a function of the number of terminals, packet sizes, raw channel error rates, capture probability, and other key system parameters. The theoretical derivations are then compared to simulation results confirming the effectiveness of the proposed models.

305 citations

Journal ArticleDOI
TL;DR: The obtained results reveal that a controlled nanoscale stimulation induces apparently an oscillatory behavior in the neuronal activity and localized synchronization between neurons, which are expected to have the basis of important cognitive and behavioral functions such as learning and brain plasticity.
Abstract: The recent advancements in nanotechnology have been instrumental in initiating research and development of intelligent nanomachines, in a variety of different application domains including healthcare. The stimulation of the cerebral cortex to assist the treatment of brain diseases have been investigated with growing interest in the past, where nanotechnology offers a dramatic breakthrough. In this paper, we discuss the feasibility of a nanomachine-to-neuron interface to design a nanoscale stimulator device called synaptic nanomachine (SnM), compatible with the neuronal communication paradigm. An equivalent neuron-nanomachine model (EqNN) is proposed to describe the behavior of neurons excited by a network of SnMs. Sample populations of neurons are simulated under different stimulation scenarios. The assessment of the existing correlation between SnM stimulus and response, as well as between neurons and clusters of neurons, has been performed using statistical methods. The obtained results reveal that a controlled nanoscale stimulation induces apparently an oscillatory behavior in the neuronal activity and localized synchronization between neurons. Both effects are expected to have the basis of important cognitive and behavioral functions such as learning and brain plasticity.

48 citations

Journal ArticleDOI
TL;DR: The throughput allocation resulting from the proposed algorithm is able to greatly increase the aggregate throughput of the DCF, while ensuring fairness levels among the stations of the same order as the ones guaranteed by the classical PF criterion.
Abstract: This paper focuses on multirate IEEE 802.11 Wireless LAN employing the mandatory Distributed Coordination Function (DCF) option. Its aim is threefold. Upon starting from the multi-dimensional Markovian state transition model proposed by Malone et.al. for characterizing the behavior of the IEEE 802.11 protocol at the Medium Access Control layer, it presents an extension accounting for packet transmission failures due to channel errors. Second, it establishes the conditions under which a network constituted by N stations, each station transmitting with its own bit rate, Rd(s), and packet rate, λs, can be assumed loaded. Finally, it proposes a modified Proportional Fairness (PF) criterion, suitable for mitigating the rate anomaly problem of multirate loaded IEEE 802.11 Wireless LANs, employing the mandatory DCF option. Compared to the widely adopted assumption of saturated network, the proposed fairness criterion can be applied to general loaded networks. The throughput allocation resulting from the proposed algorithm is able to greatly increase the aggregate throughput of the DCF, while ensuring fairness levels among the stations of the same order as the ones guaranteed by the classical PF criterion. Simulation results are presented for some sample scenarios, confirming the effectiveness of the proposed criterion for optimized throughput allocation.

41 citations

Proceedings ArticleDOI
26 Dec 2007
TL;DR: In this paper, a throughput analysis of the IEEE 802.11 protocol at the data link layer in non- saturated traffic conditions taking into account the impact of both transmission channel and capture effects in Rayleigh fading environment is provided.
Abstract: In this paper, we provide a throughput analysis of the IEEE 802.11 protocol at the data link layer in non- saturated traffic conditions taking into account the impact of both transmission channel and capture effects in Rayleigh fading environment. Impacts of both non-ideal channel and capture become important in terms of the actual observed throughput in typical network conditions whereby traffic is mainly unsaturated, specially in an environment of high interference. We extend the multi-dimensional Markovian state transition model characterizing the behavior at the MAC layer by including transmission states that account for packet transmission failures due to errors caused by propagation through the channel, along with a state characterizing the system when there are no packets to be transmitted in the buffer of a station.

32 citations

Journal ArticleDOI
TL;DR: Simulation results closely match the theoretical derivations, confirming the effectiveness of the proposed linear model of the throughput of the IEEE 802.11 distributed coordination function (DCF) protocol at the data link layer in non-saturated traffic conditions.
Abstract: We propose a linear model of the throughput of the IEEE 802.11 distributed coordination function (DCF) protocol at the data link layer in non-saturated traffic conditions. We show that the throughput is a linear function of the packet arrival rate (PAR) lambda with a slope depending on both the number of contending stations and the average payload length. We also derive the interval of validity of the proposed model by showing the presence of a critical lambda, above which the station begins operating in saturated traffic conditions. The analysis is based on the multi-dimensional Markovian state transition model proposed by Liaw et al. with the aim of describing the behaviour of the MAC layer in unsaturated traffic conditions. Simulation results closely match the theoretical derivations, confirming the effectiveness of the proposed linear model.

30 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: Models of Network Growth All networks, whether they are social, technological, or biological, are the result of a growth process, and many continue to grow for prolonged periods of time, continually modifying their connectivity structure throughout their entire existence.
Abstract: Models of Network Growth All networks, whether they are social, technological, or biological, are the result of a growth process. Many of these networks continue to grow for prolonged periods of time, continually modifying their connectivity structure throughout their entire existence. For example, the World Wide Web has grown from a small number of cross-linked documents in the early 1 990s to an estimated 30 billion indexed web pages in 2009.3 The extraordinary growth of the Web continues unabated and has occurred without any top-down design, yet the topology of its hyperlink structure exhibits characteristic statistical patterns (Pastor-Satorras and Vespig­ nani, 2004). Other technological networks such as the power grid, global transportation networks, or mobile communication networks continue to grow and evolve, each displaying characteristic patterns of expansion and elaboration. Growth and change in social and organizational

691 citations

Journal ArticleDOI
TL;DR: This article presents a general view of fairness studies, and poses three core questions that help to delineate the nuances in defining fairness, and looks into the major fairness research domains in wireless networks such as fair energy consumption control, power control, topology control, link and flow scheduling, channel assignment, rate allocation, congestion control and routing protocols.
Abstract: The pervasiveness of wireless technology has indeed created massive opportunity to integrate almost everything into the Internet fabric. This can be seen with the advent of Internet of Things and Cyber Physical Systems, which involves cooperation of massive number of intelligent devices to provide intelligent services. Fairness amongst these devices is an important issue that can be analysed from several dimensions, e.g., energy usage, achieving required quality of services, spectrum sharing, and so on. This article focusses on these viewpoints while looking at fairness research. To generalize, mainly wireless networks are considered. First, we present a general view of fairness studies, and pose three core questions that help us delineate the nuances in defining fairness. Then, the existing fairness models are summarized and compared. We also look into the major fairness research domains in wireless networks such as fair energy consumption control, power control, topology control, link and flow scheduling, channel assignment, rate allocation, congestion control and routing protocols. We make a distinction amongst fairness, utility and resource allocation to begin with. Later, we present their inter-relation. At the end of this article, we list the common properties of fairness and give an example of fairness management. Several open research challenges that point to further work on fairness in wireless networks are also discussed. Indeed, the research on fairness is entangled with many other aspects such as performance, utility, optimization and throughput at the network and node levels. While consolidating the contributions in the literature, this article tries to explain the niceties of all these aspects in the domain of wireless networking.

369 citations

Journal ArticleDOI
TL;DR: A layered architecture approach is applied to molecular communication, decomposes complex molecular communication functionality into a set of manageable layers, identifies basic functionalities of each layer, and develops a descriptive model consisting of key components of the layer for each layer.
Abstract: Molecular communication is an emerging communication paradigm for biological nanomachines. It allows biological nanomachines to communicate through exchanging molecules in an aqueous environment and to perform collaborative tasks through integrating functionalities of individual biological nanomachines. This paper develops the layered architecture of molecular communication and describes research issues that molecular communication faces at each layer of the architecture. Specifically, this paper applies a layered architecture approach, traditionally used in communication networks, to molecular communication, decomposes complex molecular communication functionality into a set of manageable layers, identifies basic functionalities of each layer, and develops a descriptive model consisting of key components of the layer for each layer. This paper also discusses open research issues that need to be addressed at each layer. In addition, this paper provides an example design of targeted drug delivery, a nanomedical application, to illustrate how the layered architecture helps design an application of molecular communication. The primary contribution of this paper is to provide an in-depth architectural view of molecular communication. Establishing a layered architecture of molecular communication helps organize various research issues and design concerns into layers that are relatively independent of each other, and thus accelerates research in each layer and facilitates the design and development of applications of molecular communication.

230 citations

Proceedings ArticleDOI
17 May 2011
TL;DR: An analytical framework is established that relates its key design parameters to performance and cost and demonstrates CBT's significant throughput improvement over the legacy ZigBee protocol, with negligible performance loss to WiFi.
Abstract: The ISM spectrum is becoming increasingly populated by emerging wireless networks. Spectrum sharing among the same network of devices can be arbitrated by MAC protocols (e.g., CSMA), but the coexistence between heterogeneous networks remains a challenge. The disparate power levels, asynchronous time slots, and incompatible PHY layers of heterogeneous networks severely degrade the effectiveness of traditional MAC. In this paper, we propose a new mechanism, called the Cooperative Busy Tone (CBT), that enables the reliable coexistence between two such networks, ZigBee and WiFi. CBT allows a separate ZigBee node to schedule a busy tone concurrently with the desired transmission, thereby improving the visibility of ZigBee devices to WiFi. Its core components include a frequency flip scheme that prevents the mutual interference between cooperative ZigBee nodes, and a busy tone scheduler that minimizes the interference to WiFi, for both CSMA and TDMA packets. To optimize CBT, we establish an analytical framework that relates its key design parameters to performance and cost. Both the analytical and detailed simulation results demonstrate CBT's significant throughput improvement over the legacy ZigBee protocol, with negligible performance loss to WiFi. The results are validated further by implementing CBT on sensor motes and software radios.

166 citations

Journal ArticleDOI
TL;DR: The relationship between backoff parameters, contention level, and channel BER is identified in order to propose a simple, but yet well-performing distributed algorithm that allows a station to dynamically adjust its contention window size based on turn-around-time measurement of channel status.
Abstract: According to the latest version of the IEEE 802.11 standard, the backoff parameters of its collision avoidance mechanism are far from optimal, especially in a heavy load or error-prone WLAN environment. This strategy has a high collision probability and channel utilization is degraded in bursty arrivals or congested scenarios. Besides, the standard backoff mechanism may treat noise corruption as packet collisions. In this paper, we identify the relationship between backoff parameters, contention level, and channel BER in order to propose a simple, but yet well-performing distributed algorithm that allows a station to dynamically adjust its contention window size based on turn-around-time measurement of channel status. In addition to theoretical analysis, simulations are conducted to evaluate its performance. The proposed scheme works very well in providing a substantial performance improvement in heavy loaded and error-prone WLAN environments.

155 citations