arXiv subjects

Cristina Cano

Publications and source records attributed to Cristina Cano.

24 records · Page 2Linked to original sources

arXiv2014

Modeling, Analysis and Impact of a Long Transitory Phase in Random Access Protocols

In random access protocols, the service rate depends on the number of stations with a packet buffered for transmission. We demonstrate via numerical analysis that this state-dependent rate along with the consideration of Poisson traffic and infinite (or large enough to be considered infinite) buffer size may cause a high-throughput and extremely long (in the order of hours) transitory phase when traffic arrivals are right above the stability limit. We also perform an experimental evaluation to provide further insight into the characterisation of this transitory phase of the network by analysing statistical properties of its duration. The identification of the presence as well as the characterisation of this behaviour is crucial to avoid misprediction, which has a significant potential impact on network performance and optimisation. Furthermore, we discuss practical implications of this finding and propose a distributed and low-complexity mechanism to keep the network operating in the high-throughput phase.

cs.NI↗

arXiv2013

Localization Procedure for Randomly Deployed Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are composed of nodes that gather metrics like temperature, pollution or pressure from events generated by external entities. Localization in WSNs is paramount, given that the collected metrics must be related to the place of occurrence. This document presents an alternative way towards localization in randomly deployed WSNs based on the composability of localization protocols. Results show a totally distributed localization procedure that achieves a higher number of located nodes than the conventional, individual execution of localization protocols while maintaining the same low levels of battery consumption.

cs.NI↗

arXiv2012

Hierarchical Range Sectoring and Bidirectional Link Quality Estimation for On-demand Collections in WSNs

The paper presents two mechanisms for designing an on-demand, reliable and efficient collection protocol for Wireless Sensor Networks. The former is the Bidirectional Link Quality Estimation, which allows nodes to easily and quickly compute the quality of a link between a pair of nodes. The latter, Hierarchical Range Sectoring, organizes sensors in different sectors based on their location within the network. Based on this organization, nodes from each sector are coordinated to transmit in specific periods of time to reduce the hidden terminal problem. To evaluate these two mechanisms, a protocol called HBCP (Hierarchical-Based Collection Protocol), that implements both mechanisms, has been implemented in TinyOS 2.1, and evaluated in a testbed using TelosB motes. The results show that the HBCP protocol is able to achieve a very high reliability, especially in large networks and in scenarios with bottlenecks.

cs.NI↗

arXiv2012

Bottom-up Broadband Initiatives in the Commons for Europe Project

This paper offers an overview of the Commons for Europe (C4EU) project and the role of Bottom-up Broadband (BuB) in developing the information society. BuB is characterized by the fact that the beneficiaries of the networks actively participate in the planning, deployment and maintenance tasks. For the beneficiaries, this represent a paradigm shift from a consumer-only position to an active-participant position. We summarize a representative set of the BuB pilot proposals that have been considered in the context of the C4EU project. A selection of these proposals will be executed and carefully documented to define good practices in BuB deployments. The documentation will include project templates, work plans, case studies, replicable success models and regulatory guidelines. The overall goal of the project is to assess the validity of the BuB model to effectively and efficiently complement exiting traditional deployments in satisfying the networking and technological needs of the European citizens and organizations.

cs.CY↗

arXiv2012

On the Distributed Construction of a Collision-Free Schedule in Multi-Hop Packet Radio Networks

This paper introduces a protocol that distributively constructs a collision-free schedule for multi-hop packet radio networks in the presence of hidden terminals. As a preliminary step, each wireless station computes the schedule length after gathering information about the number of flows in its neighbourhood. Then, a combination of deterministic and random backoffs are used to reach a collision-free schedule. A deterministic backoff is used after successful transmissions and a random backoff is used otherwise. It is explained that the short acknowledgement control packets can easily result in channel time fragmentation and, to avoid this, the use of link layer delayed acknowledgements is advocated and implemented. The performance results show that a collision-free protocol easily outperforms a collision-prone protocol such as Aloha. The time that is required for the network to converge to a collision-free schedule is assessed by means of simulation.

cs.NI↗

arXiv2010

Towards a Collision-Free WLAN: Dynamic Parameter Adjustment in CSMA/E2CA

Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a distributed MAC protocol that allows collision-free access to the medium in WLAN. The only difference between CSMA/ECA and the well-known CSMA/CA is that the former uses a deterministic backoff after successful transmissions. Collision-free operation is reached after a transient state during which some collisions may occur. This article shows that the duration of the transient state can be shortened by appropriately setting the contention parameters. Standard absorbing Markov Chain theory can be used to describe the behaviour of the system in the transient state and to predict the expected number of slots to reach the collision-free operation. The article also introduces CSMA/E2CA, in which a deterministic backoff is used two consecutive times after a successful transmission. CSMA/E2CA converges quicker to collision-free operation and delivers higher performance than CSMA/CA in harsh wireless scenarios with high frame error rates. To achieve collision-free operations when the number of contenders is large, it may be necessary to dynamically adjust the contention parameter. The last part of the article suggests an approach for such parameter adjustment which is validated by simulation results.

cs.NI↗