Related papers: Opportunistic Routing Based on Daily Routines
Real-time traffic information can be utilized to enhance the efficiency of transportation networks by dynamically updating routing plans to mitigate traffic jams. However, an interesting question is whether the network coordinator should…
In wireless sensor networks (WSNs), the opportunistic routing has better performances on packet delivery probability than the deterministic routing. For reducing the transmission delay and duplicate transmission in opportunistic routing,…
Over the past decade, online social networks (OSNs) such as Twitter and Facebook have thrived and experienced rapid growth to over 1 billion users. A major evolution would be to leverage the characteristics of OSNs to evaluate the…
This paper proposes a mobile pipeline computing concept in a Device-to-Device (D2D) communication setup and studies related issues, where D2D is likely based on millimeter-wave (mmWave) in the 5G mobile communication. The proposed…
We present a comparative study of the application of a recently introduced heuristic algorithm to the optimization of transport on three major types of complex networks. The algorithm balances network traffic iteratively by minimizing the…
Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…
This paper introduces GODDeS: a fully distributed self-organizing decision-theoretic routing algorithm designed to effectively exploit high quality paths in lossy ad-hoc wireless environments, typically with a large number of nodes. The…
In Manets Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility…
Routing is, arguably, the most fundamental task in computer networking, and the most extensively studied one. A key challenge for routing in real-world environments is the need to contend with uncertainty about future traffic demands. We…
Motivated by the massive deployment of power-hungry data centers for service provisioning, we examine the problem of routing in optical networks with the aim of minimizing traffic-driven power consumption. To tackle this issue, routing must…
By introducing a simple model based on two-dimensional cellular automata, we reveal the relationship between the routing strategies of individual vehicles and the global behavior of transportation networks. Specifically, we characterize the…
Spurred by the growth of transportation network companies and increasing data capabilities, vehicle routing and ride-matching algorithms can improve the efficiency of private transportation services. However, existing routing solutions do…
How can a system designer exploit system-level knowledge to derive incentives to optimally influence social behavior? The literature on network routing contains many results studying the application of monetary tolls to influence behavior…
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted demand. The novel idea is to…
Models of strategy evolution on static networks help us understand how population structure can promote the spread of traits like cooperation. One key mechanism is the formation of altruistic spatial clusters, where neighbors of a…
Transportation and distribution networks are a class of spatial networks that have been of interest in recent years. These networks are often characterized by the presence of complex structures such as central loops paired with peripheral…
Distributed resource allocation is a central task in network systems such as smart grids, water distribution networks, and urban transportation systems. When solving such problems in practice it is often important to have nonasymptotic…
Modern communication networks are increasingly equipped with in-network computational capabilities and services. Routing in such networks is significantly more complicated than the traditional routing. A legitimate route for a flow not only…
Polling systems with losses are useful mathematical objects that can model many practical systems like travelling salesman problem with recurrent requests. One of the less studied yet an important aspect in such systems is the disparity in…
We consider the resource allocation problem in cooperative wireless networks wherein nodes perform mutual information accumulation. We consider a unicast setting and arbitrary arrival processes at the source node. Source arrivals can be…