Search results for "Network packet"
showing 10 items of 160 documents
Stability analysis and controller design for a class of T-S fuzzy Markov jump system with uncertain expectation of packet dropouts
2013
This paper is concerned with an H∞ control for a class of Takagi-Sugeno (T-S) fuzzy Markov jump system under unreliable communication links. It is assumed that the transition probabilities determining the dynamical behavior of the underlying system are partially unknown and the communication links between the plant and the controller are imperfect (the packet dropouts occur intermittently). In this paper, a more practical scenario is considered in the setting, i.e., the expectation of packet losses represented as a description of Bernoulli-distributed stochastic process is uncertain. Attention is focused on the design of H∞ controllers such that the closed-loop system is stochastically stab…
Energy Harvesting Powered Packet Transmissions in Duty-Cycled WSNs: A DTMC Analysis
2017
Energy harvesting (EH) promises an extended lifetime for wireless sensor networks (WSNs), supplying sensor nodes with accumulated energy from natural sources. Different from battery powered sensors, nodes in EH-enabled WSNs are equipped with an energy harvesting accessory in order to extract energy from surrounding sources. Based upon the harvested energy, sensor nodes perform data exchange activities. In this paper, we develop two discrete time Markov chain (DTMC) models to analyze the performance of packet transmissions in such a WSN while employing a generic synchronous medium access control (MAC) protocol. Using the proposed DTMC models, we investigate the effect of EH over a specific s…
Collision Avoidance in Wake-Up Radio Enabled WSNs: Protocol and Performance Evaluation
2018
In wake-up radio (WuR) enabled wireless sensor networks (WSNs), the envisaged application scenarios are primarily targeted at low traffic load conditions. When applying WuR to medium or heavy traffic load scenarios, however, collisions among wake-up calls (WuCs) may happen, resulting in a lower packet delivery ratio (PDR). In this paper, we propose a media access control protocol for WuR- enabled WSN that is capable of avoiding WuC collisions by activating a contention-based collision avoidance mechanism for WuC transmissions. The performance of the proposed protocol is evaluated by a Markov chain based mathematical model and is compared with a WuR protocol that performs only clear channel as…
Event-Triggered Sleeping for Synchronous DC MAC IN WSNs: Mechanism and DTMC Modeling
2016
Overhearing and idle listening are two primary sources for unnecessary energy consumption in wireless sensor networks. Although introducing duty cycling in medium access control (MAC) reduces idle listening, it cannot avoid overhearing in a network with multiple contending nodes. In this paper, we propose an event-triggered sleeping (ETS) mechanism for synchronous duty-cycled (DC) MAC protocols in order to avoid overhearing when a node is not active. This ETS mechanism applies to any synchronous DC MAC protocols and makes them more energy efficient. Furthermore, we develop a two dimensional discrete time Markov chain model to evaluate the performance of the proposed ETS mechanism by integra…
Energy Efficient Consecutive Packet Transmissions in Receiver-Initiated Wake-Up Radio Enabled WSNs
2018
In wake-up radio (WuR)-enabled wireless sensor networks, data communication among nodes is triggered in an on-demand manner, by either a sender or a receiver. For receiver-initiated WuR (RI-WuR), a receiving node wakes up sending nodes through a wake-up call. Correspondingly sending nodes transmit packets in a traditional way by competing with one another multiple times in a single operational cycle. In this paper, we propose a receiver-initiated consecutive packet transmission WuR (RI-CPT-WuR) medium access control (MAC) protocol, which eliminates multiple competitions to achieve higher energy efficiency. Furthermore, we develop two associated discrete time Markov chains (DTMCs) for evalua…
Power allocation in multi-channel cognitive radio networks with channel assembling
2011
Accepted version of a paper in the book: 2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). Published version available from the IEEE:http://dx.doi.org/10.1109/SPAWC.2011.5990485 Consider power allocation for Secondary User (SU) packet transmissions over multiple channels with variable Primary User (PU) arrival rates in cognitive radio networks. Two problems are studied in this paper: The first one is to minimize the collision probability with PUs and the second one is to maximize the data rate while keeping the collision probability bounded. It is shown that the optimal solution for the first problem is to allocate all power onto the bes…
Performance modeling of epidemic routing
2006
In this paper, we develop a rigorous, unified framework based on ordinary differential equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and the number of copies made for a packet can be tra…
Optimal Delay-Power Tradeoff in Sparse Delay Tolerant Networks: a preliminary study
2006
In this paper we present a first attempt to study analytically the tradeoff between delivery delay and resource consumption for epidemic routing in Delay Tolerant Networks. We assume that the nodes cooperate in order to minimize a common cost equal to a weighted sum of the packet delivery delay and the total number of copies, which is strongly related to the power consumption. In this framework we determine the best policy each node should deploy in a very simple scenario where all the nodes have perfect knowledge of the system status. The result is used as an ideal reference to evaluate the performance of some heuristics proposed, investigating potential performance improvements and config…
A Delay-Centric Dynamic Resource Allocation Algorithm for Wireless Communication Systems Based on HNN
2008
This paper proposes a dynamic resource-allocation (DRA) algorithm for packet data services in wireless communication systems based on Hopfleld neural networks (HNNs). The resource-allocation algorithm assumes a delay-centric approach in that it maximizes resource utilization of the overall system while minimizing the packet delay. The real-time (RT) working capability of HNN hardware implementation means that a very powerful scheduling DRA algorithm can be obtained. A generic formulation of the algorithm is presented to establish the optimal bit rate allocation. In addition, some illustrative examples of this formulation are given, considering specific wireless communication systems, such a…
MCMIPv6: Multicast Configuration-based Mobile IPv6 protocol
2010
International audience; Mobile IPv6 (MIPv6) and its basic extension for network mobility NEMO were initially designed to manage the mobility of device users and networks respectively while maintaining a permanent IP address. Nevertheless, the different MIPv6's experiments have shown many lacks in case of high mobility of nodes such as in vehicular networks. To overcome these lacks, many solutions have been proposed by the research community. The most famous ones are HMIPv6 and FMIPv6 tackling each a specific issue. On the one hand, FMIPv6 introduces a solution to effectively minimize the L2/L3 latency and avoid the packets losses during the handover procedure. On the other hand, HMIPv6 is e…