15,866 research outputs found
LPDQ: a self-scheduled TDMA MAC protocol for one-hop dynamic lowpower wireless networks
Current Medium Access Control (MAC) protocols for data collection scenarios with a large number of nodes that generate bursty traffic are based on Low-Power Listening (LPL) for network synchronization and Frame Slotted ALOHA (FSA) as the channel access mechanism. However, FSA has an efficiency bounded to 36.8% due to contention effects, which reduces packet throughput and increases energy consumption. In this paper, we target such scenarios by presenting Low-Power Distributed Queuing (LPDQ), a highly efficient and low-power MAC protocol. LPDQ is able to self-schedule data transmissions, acting as a FSA MAC under light traffic and seamlessly converging to a Time Division Multiple Access (TDMA) MAC under congestion. The paper presents the design principles and the implementation details of LPDQ using low-power commercial radio transceivers. Experiments demonstrate an efficiency close to 99% that is independent of the number of nodes and is fair in terms of resource allocation.Peer ReviewedPostprint (author’s final draft
Throughput Analysis of Primary and Secondary Networks in a Shared IEEE 802.11 System
In this paper, we analyze the coexistence of a primary and a secondary
(cognitive) network when both networks use the IEEE 802.11 based distributed
coordination function for medium access control. Specifically, we consider the
problem of channel capture by a secondary network that uses spectrum sensing to
determine the availability of the channel, and its impact on the primary
throughput. We integrate the notion of transmission slots in Bianchi's Markov
model with the physical time slots, to derive the transmission probability of
the secondary network as a function of its scan duration. This is used to
obtain analytical expressions for the throughput achievable by the primary and
secondary networks. Our analysis considers both saturated and unsaturated
networks. By performing a numerical search, the secondary network parameters
are selected to maximize its throughput for a given level of protection of the
primary network throughput. The theoretical expressions are validated using
extensive simulations carried out in the Network Simulator 2. Our results
provide critical insights into the performance and robustness of different
schemes for medium access by the secondary network. In particular, we find that
the channel captures by the secondary network does not significantly impact the
primary throughput, and that simply increasing the secondary contention window
size is only marginally inferior to silent-period based methods in terms of its
throughput performance.Comment: To appear in IEEE Transactions on Wireless Communication
Unsaturated Throughput Analysis of IEEE 802.11 in Presence of Non Ideal Transmission Channel and Capture Effects
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. The impact 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, especially 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.
Finally, we derive a linear model of the throughput along with its interval of
validity.
Simulation results closely match the theoretical derivations confirming the
effectiveness of the proposed model.Comment: To appear on IEEE Transactions on Wireless Communications, 200
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
A Unifying Framework for Local Throughput in Wireless Networks
With the increased competition for the electromagnetic spectrum, it is
important to characterize the impact of interference in the performance of a
wireless network, which is traditionally measured by its throughput. This paper
presents a unifying framework for characterizing the local throughput in
wireless networks. We first analyze the throughput of a probe link from a
connectivity perspective, in which a packet is successfully received if it does
not collide with other packets from nodes within its reach (called the audible
interferers). We then characterize the throughput from a
signal-to-interference-plus-noise ratio (SINR) perspective, in which a packet
is successfully received if the SINR exceeds some threshold, considering the
interference from all emitting nodes in the network. Our main contribution is
to generalize and unify various results scattered throughout the literature. In
particular, the proposed framework encompasses arbitrary wireless propagation
effects (e.g, Nakagami-m fading, Rician fading, or log-normal shadowing), as
well as arbitrary traffic patterns (e.g., slotted-synchronous,
slotted-asynchronous, or exponential-interarrivals traffic), allowing us to
draw more general conclusions about network performance than previously
available in the literature.Comment: Submitted for journal publicatio
Saturation Throughput Analysis of IEEE 802.11 in Presence of Non Ideal Transmission Channel and Capture Effects
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.Comment: To appear on IEEE Transactions on Communications, 200
ISMA-DS/CDMA MAC protocol for mobile packet radio networks
In this paper an ISMA-DS/CDMA MAC protocol for a packet transmission network is presented. The main feature of this protocol is its ability to retain the inherent flexibility of random access protocols while at the same time reducing to some extent the randomness in the access in order to increase the system capacity. In this framework, the protocol is adapted to a frame structure similar to that specified in the UTRA ETSI proposal for third generation mobile communication systems. Additionally, some adaptive mechanisms are proposed that improve protocol performance by means of varying the transmission bit rate according to the channel load that is broadcast by the base station. As a result, an adaptive bit rate algorithm is presented that reaches a throughput value close to the optimumPeer ReviewedPostprint (published version
- …