In cyber-physical systems such as automobiles, measurement data from sensor nodes should be delivered to other consumer nodes such as actuators in a regular fashion. But, in practical systems over unreliable media such as wireless, it is a significant challenge to guarantee small enough inter-delivery times for different clients with heterogeneous channel conditions and inter-delivery requirements. In this paper, we design scheduling policies aiming at satisfying the inter-delivery requirements of such clients. We formulate the problem as a risk-sensitive Markov Decision Process (MDP). Although the resulting problem involves an infinite state space, we first prove that there is an equivalent MDP involving only a finite number of states. Then we prove the existence of a stationary optimal policy and establish an algorithm to compute it in a finite number of steps.
However, the bane of this and many similar problems is the resulting complexity, and, in an attempt to make fundamental progress, we further propose a new high reliability asymptotic approach. In essence, this approach considers the scenario when the channel failure probabilities for different clients are of the same order, and asymptotically approach zero. We thus proceed to determine the asymptotically optimal policy: in a two-client scenario, we show that the asymptotically optimal policy is a "modified least time-to-go" policy, which is intuitively appealing and easily implementable; in the general multi-client scenario, we are led to an SN policy, and we develop an algorithm of low computational complexity to obtain it. Simulation results show that the resulting policies perform well even in the pre-asymptotic regime with moderate failure probabilities.
In this paper, we study in-order packet delivery in instantly decodable network coded systems for wireless broadcast networks. We are interested in applications, in which the successful delivery of a packet depends on the correct reception of this packet and all its preceding packets. We formulate the problem of minimizing the number of undelivered packets to all receivers over all transmissions until completion as a stochastic shortest path (SSP) problem. Although finding the optimal packet selection policy using SSP is computationally complex, it allows us to systematically exploit the probl…
In this paper, the proposed methodology for conducting experiments on a small number of devices for evaluating systems with a large number of devices. A software package for assessing the performance of LPWAN (Long Range Wide Area Networks, LoRaWAN) networks is presented. An example of the operation of this software system as applied to the LoRaWAN network for estimating the probability of message delivery from a number of devices to a base station when implementing this technique is shown. This technique can be used to evaluate the performance of other LPWAN networks.
Energy consumption and delay incurred in packet delivery are the two important metrics for measuring the performance of geographic routing protocols for Wireless Adhoc and Sensor Networks (WASN). A protocol capable of ensuring both lesser energy consumption and experiencing lesser delay in packet delivery is thus suitable for networks which are delay sensitive and energy hungry at the same time. Thus a smart packet forwarding technique addressing both the issues is thus the one looked for by any geographic routing protocol. In the present paper we have proposed a Fermat point based forwarding …
We present an efficient routing approach for delivering packets in complex networks. On delivering a message from a node to a destination, a node forwards the message to a neighbor by estimating the waiting time along the shortest path from each of its neighbors to the destination. This projected waiting time is dynamical in nature and the path through which a message is delivered would be adapted to the distribution of messages in the network. Implementing the approach on scale-free networks, we show that the present approach performs better than the shortest-path approach and another approac…
Many routing protocols have been proposed to handle reliability and real-time routing energy efficiency for wireless sensor networks. In this paper we propose a new routing protocol with QoS based capabilities for WSNs. We used priority queues for improve real-time and non-real-time packets forwarding according to deadline of them. The protocol finds a best-cost, time-sensitive packet forwarding mechanism for real-time data with minimum consumption of the energy. In order to avoid of congestion in network our protocol drops those packets who can't reach their destination in specified time. For…
Voice over IP (VOIP) has strict Quality of Service (QoS) constraints and requires real-time packet delivery, which poses a major challenge to IP networks. The Cognitive Packet Network (CPN) has been designed as a QoS-driven protocol that addresses user-oriented QoS demands by adaptively routing packets based on online sensing and measurement. This paper presents our design, implementation and evaluation of a "Voice over CPN" system where an extension of the CPN routing algorithm has been developed to support the needs of voice packet delivery in the presence of other background traffic flows w…
A problem of much current practical interest is the replacement of the wiring infrastructure connecting approximately 200 sensor and actuator nodes in automobiles by an access point. This is motivated by the considerable savings in automobile weight, simplification of manufacturability, and future upgradability. A key issue is how to schedule the nodes on the shared access point so as to provide regular packet delivery. In this and other similar applications, the mean of the inter-delivery times of packets, i.e., throughput, is not sufficient to guarantee service-regularity. The time-averaged …
We consider the transmission of packets across a lossy end-to-end network path so as to achieve low in-order delivery delay. This can be formulated as a decision problem, namely deciding whether the next packet to send should be an information packet or a coded packet. Importantly, this decision is made based on delayed feedback from the receiver. While an exact solution to this decision problem is challenging, we exploit ideas from queueing theory to derive scheduling policies based on prediction of a receiver queue length that, while suboptimal, can be efficiently implemented and offer subst…
For delay analysis of packet delivery over a wireless link, several novel ideas are introduced. One is to construct an equivalent $G/G/1$ non-lossy queueing model to ease the analysis, enabled by exploiting empirical models of packet error rate, packet service time and packet loss rate obtained from measurement. The second is to exploit a classical queueing theory result to approximate the mean delay. For estimating the delay distribution, the newly developed stochastic network calculus (SNC) theory is made use of, forming the third idea. To enable this SNC based analysis, a stochastic service…
Broadcast routing has become an important research field for vehicular ad-hoc networks (VANETs) recently. However, the packet delivery rate is generally low in existing VANET broadcast routing protocols. Therefore, the design of an appropriate broadcast protocol based on the features of VANET has become a crucial part of the development of VANET. This paper analyzes the disadvantage of existing broadcast routing protocols in VANETs, and proposes an improved algorithm (namely ODAM-C) based on the ODAM (Optimized Dissemination of Alarm Messages) protocol. The ODAM-C algorithm improves the packet…
Real-time industrial application requires routing protocol that guarantees data delivery with reliable, efficient and low end-to-end delay. Existing Routing(THVR) [13] is based velocity of Two-Hop Velocity and protocol relates two-hop velocity to delay to select the next forwarding node, that has overhead of exchanging control packets, and depleting the available energy in nodes. We propose a Real-Time Reliable Data delivery based on Virtual Coordinates Routing (RRDVCR) algorithm, based on the number of hops to the destination rather than geographic distance. Selection of forwarding node is ba…
We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time of packets sent down each edge to each destination and the time since an edge last transmitted a packet. On scale-free networks all our algorithms are considerably more efficient and can handle a larger load than the random walk algorithm. We consider in detail various attributes of our algorithms, for instance we show that an algorithm that bases its decisi…
Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, the secondary transmission may be interrupted by the primary user's transmission. To facilitate the packet delay analysis of such secondary transmission, we study the resulting extended delivery time that includes both transmission time and waiting time. In particular, we derive the exact distribution function of extended delivery time of a fixed-size secondary packet with non-work-preserving strategy i.e. interrupt…
A large number of streaming applications use reliable transport protocols such as TCP to deliver content over the Internet. However, head-of-line blocking due to packet loss recovery can often result in unwanted behavior and poor application layer performance. Transport layer coding can help mitigate this issue by helping to recover from lost packets without waiting for retransmissions. We consider the use of an on-line network code that inserts coded packets at strategic locations within the underlying packet stream. If retransmissions are necessary, additional coding packets are transmitted …
Packet loss recovery in wireless broadcast is challenging, particularly for real-time applications which have strict and short delivery deadline. To recover the maximum number of lost packets within a short time, existing packet recovery solutions often rely on instantly decodable network coding (IDNC). Some of these solutions can recover nearly the maximum number of lost packets possible at the cost of collecting feedback from all (or a large percentage of) users. This is impractical in dense networks. In addition, their runtime grows with the number of users, which is not desirable due to th…
Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interleave implementation, the secondary transmission may be interrupted by the primary user's transmission. To facilitate the delay analysis of such secondary transmission for a fixed-size secondary packet, we study the resulting extended delivery time that includes both transmission time and waiting time. In particular, we derive the exact distribution function of extended delivery time of secondary transmission for both continuous sensing and period…
Wireless sensor networks sense and monitor real-time events. They supervise a geographic area where a phenomenon is to be monitored. The data in sensor networks have different levels of priority and hence their criticality differs. In order to keep up the real time commitment, the applications need higher transmission rates and reliability in information delivery. In this work we propose a multipath routing algorithm which enables the reliable delivery of data. By controlling the scheduling rate, it is possible to prevent congestion and packet loss in the network. The algorithm provides an eff…
Mobile nodes of various routing protocols in Mobile Ad hoc Networks follow different strategies in transmission and receiving of data. Security, packet delivery and routing overhead are important concerns for any protocol during designing them. The presence and absence of malicious nodes in the network affect a lot on the performance of the protocol. This research is mainly focused on the study of the threats, attacks and reasons for malicious behavior of nodes in the network for reactive routing protocols in MANETS. DSR and AODV are the two reactive routing protocols that were considered for …
In this work we investigate Named Data Networking's (NDN's) architectural properties and features, such as content caching and intelligent packet forwarding, in the context of a Content Delivery Network (CDN) workflows. More specifically, we evaluate NDN's properties for PoP (Point of Presence) to PoP and PoP to device connectivity. We use the Apache Traffic Server (ATS) platform to create an HTTP, CDN-like caching hierarchy in order to compare NDN with HTTP-based content delivery. Overall, our work demonstrates that properties inherent to NDN can benefit content providers and users alike. Our…
Several emerging classes of applications that run over wireless networks have a need for mathematical models and tools to systematically characterize the reliability of the network. We propose two metrics for measuring the reliability of wireless mesh routing topologies, one for flooding and one for unicast routing. The Flooding Path Probability (FPP) metric measures the end-to-end packet delivery probability when each node broadcasts a packet after hearing from all its upstream neighbors. The Unicast Retransmission Flow (URF) metric measures the end-to-end packet delivery probability when a r…
Achieving cyber-physical control over a wireless channel requires satisfying both the timeliness of a single packet and preserving the latency reliability across several consecutive packets. To satisfy those requirements as an ubiquitous service requires big infrastructural developments, or flexible on-demand equipment such as UAVs. To avoid the upfront cost in terms of finance and energy, this paper analyzes the capability of UAV access points (UAVAPs) to satisfy the requirements for cyber-physical traffic. To investigate this, we perform a Gilbert-Eliott burst-error analysis that is analytic…
Emergency communications requires reliability and flexibility for disaster recovery and relief operation. Based upon existing commercial portable devices (e.g., smartphones, tablets, laptops), we propose a network architecture that uses cellular networks and WiFi connections to deliver large files in emergency scenarios under the impairments of wireless channel such as packet losses and intermittent connection issues. Network coding (NC) is exploited to improve the delivery probability. We first review the state-of-the-art of NC for emergency communications. Then, we present the proposed netwo…
We consider the problem of broadcasting data streams over a wireless network for multiple receivers with reliability and timely delivery guarantees. In our framework, we consider packets that need to be delivered within a given time interval, after which the packet is no longer useful at the application layer. We set the notion of critical packet and, based on periodic feedback from the receivers, we propose a retransmission scheme that will guarantee timely delivery of such packets, as well as packets that are innovative for other receivers. Our solution provides a trade-off between packet de…
University of California, Riverside（加州大学河滨分校）；Lawrence Berkeley National Laboratory（劳伦斯伯克利国家实验室）
Traffic optimization challenges, such as load balancing, flow scheduling, and improving packet delivery time, are difficult online decision-making problems in wide area networks (WAN). Complex heuristics are needed for instance to find optimal paths that improve packet delivery time and minimize interruptions which may be caused by link failures or congestion. The recent success of reinforcement learning (RL) algorithms can provide useful solutions to build better robust systems that learn from experience in model-free settings. In this work, we consider a path optimization problem, specifical…
This paper proposes a hybrid architecture, namely VMaSC-LTE, combining IEEE 802.11p based multi-hop clustering and the fourth generation cellular system, Long Term Evolution (LTE), with the goal of achieving high data packet delivery ratio and low delay while keeping the usage of the cellular architecture at the minimum level. In VMaSC-LTE, vehicles are clustered based on a novel approach named VMaSC: Vehicular Multi-hop algorithm for Stable Clustering. From the clustered topology, elected cluster heads operate as dual-interface nodes with the functionality of IEEE 802.11p and LTE interface to…
We study the problem of broadcasting packets in wireless networks. At each time slot, a network controller activates non-interfering links and forwards packets to all nodes at a common rate; the maximum rate is referred to as the broadcast capacity of the wireless network. Existing policies achieve the broadcast capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying wireless network. We propose a new dynamic algorithm that achieves the broadcast capacity when the underlying network topology is a directed acyclic graph (DAG). This…
Across many real-time video applications, we see a growing need (especially in long delays and dynamic bandwidth) to allow clients to decode each frame once any (non-empty) subset of its packets is received and improve quality with each new packet. We call it data-scalable delivery. Unfortunately, existing techniques (e.g., FEC, RS and Fountain Codes) fall short: they require either delivery of a minimum number of packets to decode frames, and/or pad video data with redundancy in anticipation of packet losses, which hurts video quality if no packets get lost. This work explores a new approach,…
In recent years, the wireless sensor network (WSN) is playing a key role in sensing, collecting and disseminating information in various applications. An important feature associated with WSN is to develop an efficient data distribution and routing scheme to ensure better quality of service (QoS) that reduces the power consumption and the end-to-end data delivery time. In this work, we propose an adaptive framework to transmit data packets from a source to the sink in WSN across multiples paths with strategically distributed data packets so as to minimize the power consumption as well as the e…
Age of Information is an interesting metric that captures the freshness of information in the underlying applications. It is a combination of both packets inter-arrival time and packet transmission delay. In recent times, advanced real-time systems rely on this metric for delivering status updates as timely as possible. This paper aims to accomplish optimal transmission scheduling policy to maintain the information freshness of real-time updates in the industrial cyber-physical systems. Here the coexistence of both cyber and physical units and their individual requirements to provide the quali…
Hou et al have introduced a framework to serve clients over wireless channels when there are hard deadline constraints along with a minimum delivery ratio for each client's flow. Policies based on "debt," called maximum debt first policies (MDF) were introduced, and shown to be throughput optimal. By "throughput optimality" it is meant that if there exists a policy that fulfils a set of clients with a given vector of delivery ratios and a vector of channel reliabilities, then the MDF policy will also fulfill them. The debt of a user is the difference between the number of packets that should h…
Fifth generation (5G) networks are expected to connect a huge number of Internet of Things (IoT) devices in many usage scenarios. The challenges of typical massive IoT applications with sporadic and short packet uplink transmissions are well studied, while not enough attention is given to the delivery of content of common interest, such as software/firmware updates and remote control, towards IoT devices in emerging point-to-multipoint scenarios. Moreover, the delivery of delay-sensitive IoT traffic is not sufficiently addressed in the literature. In this work we (i) identify the drawbacks of …
In this paper, we focus on the performance of vehicle-to-vehicle (V2V) communication adopting the Dedicated Short Range Communication (DSRC) application in periodic broadcast mode. An analytical model is studied and a fixed point method is used to analyze the packet delivery ratio (PDR) and mean delay based on the IEEE 802.11p standard in a fully connected network under the assumption of perfect PHY performance. With the characteristics of V2V communication, we develop the Semi-persistent Contention Density Control (SpCDC) scheme to improve the DSRC performance. We use Monte Carlo simulation t…
This paper proposes and demonstrates a PHY-layer design of a real-time prototype that supports Ultra-Reliable Communication (URC) in wireless infrastructure networks. The design makes use of Orthogonal Frequency Division Multiple Access (OFDMA) as a means to achieve URC. Compared with Time-Division Multiple Access (TDMA), OFDMA concentrates the transmit power to a narrower bandwidth, resulting in higher effective SNR. Compared with Frequency-Division Multiple Access (FDMA), OFDMA has higher spectrum efficiency thanks to the smaller subcarrier spacing. Although OFDMA has been introduced in 802.…
Distributed computing (cloud) networks, e.g., mobile edge computing (MEC), are playing an increasingly important role in the efficient hosting, running, and delivery of real-time stream-processing applications such as industrial automation, immersive video, and augmented reality. While such applications require timely processing of real-time streams that are simultaneously useful for multiple users/devices, existing technologies lack efficient mechanisms to handle their increasingly multicast nature, leading to unnecessary traffic redundancy and associated network congestion. In this paper, we…
The routing of packets are generally performed based on the destination address and forward link channel available from the instantaneous Router without sufficient cognizance of either the performance of the forward Router or forward channel characteristics. The lack of awareness of forward channel property can lead to packet loss or delayed delivery leading to multipleretransmissions or routing to an underperforming pathway. This paper describes an application of Cognitive Network to improve the network performance by implementing a Hidden Markov Model (HMM) algorithm for learning and predict…
Vehicular Ad-hoc Network (VANET) has emerged as a promising solution for enhancing road safety. Routing of messages in VANET is challenging due to packet delays arising from high mobility of vehicles, frequently changing topology, and high density of vehicles, leading to frequent route breakages and packet losses. Previous researchers have used either mobility in vehicular fog computing or cloud computing to solve the routing issue, but they suffer from large packet delays and frequent packet losses. We propose Dynamic Fog for Connected Vehicles (DFCV), a fog computing based scheme which dynam…
In this work, we combine the two notions of timely delivery of information in order to study their interplay; namely, deadline-constrained packet delivery due to latency constraints and freshness of information at the destination. More specifically, we consider a two-user multiple access setup with random access, in which user 1 is a wireless device with a queue and has external bursty traffic which is deadline-constrained, while user 2 monitors a sensor and transmits status updates to the destination. For this simple, yet meaningful setup, we provide analytical expressions for the throughput …
Data communication in sensor networks can have timing constraints like end to end deadlines. If the deadlines are not met either a catastrophe can happen in hard real time systems or performance deterioration can occur in soft real time systems. In real time sensor networks, the recovery of data through retransmission should be minimized due to the stringent requirements on the worst case time delays. This paper presents the application of Stop and Go Multihop protocol (SGMH) at node level in wireless sensor networks for scheduling and hence to meet the hard real time routing requirements. SGM…
We consider a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links. The receiving nodes are divided into two groups: one priority group consists of $k$ nodes that require the reception of every update packet, the other non-priority group consists of all other nodes without the delivery requirement. Using age of information as a freshness metric, we analyze the time-averaged age at both priority and non-priority nodes. For shifted-exponential link delay distributions, the average age at…
Wireless mesh networks (WMNs) are evolving as a key technology for next-generation wireless networks showing raid progress and numerous applications. These networks have the potential to provide robust and high-throughput data delivery to wireless users. In a WMN, high speed routers equipped with advanced antennas, communicate with each other in a multi-hop fashion over wireless channels and form a broadband backhaul. However, the throughput of a WMN may be severely degraded due to presence of some selfish routers that avoid forwarding packets for other nodes even as they send their own traffi…
