Downlink resource auction in a tree topology structured wireless mesh network

We analyze the problem of downlink resource allocation in a non-cooperative multi-level tree topology structured wireless mesh network in which a selfish mesh router (MR) may refuse to relay other MRs' traffic so as to improve its own performance at the cost of overall system performance. Based on game theory, we propose an auction framework, where the parent MR serves as the auctioneer while its children MRs act as bidders and compete for time-slots. We derive a payment function from radio resource used for relaying traffic instead of money, so as to simplify the implementation and avoid the possible security problems from monetary payment. We prove the existence and uniqueness of Nash Equilibrium and propose a stochastic best response updating algorithm to allow the bids to iteratively converge to NE in a practical distributed fashion. Simulation results show the proposed auction algorithm greatly outperforms traditional algorithms in non-cooperative environments. © 2010 IEEE.published_or_final_versio

On Capacity and Delay of Multi-channel Wireless Networks with Infrastructure Support

In this paper, we propose a novel multi-channel network with infrastructure support, called an MC-IS network, which has not been studied in the literature. To the best of our knowledge, we are the first to study such an MC-IS network. Our proposed MC-IS network has a number of advantages over three existing conventional networks, namely a single-channel wireless ad hoc network (called an SC-AH network), a multi-channel wireless ad hoc network (called an MC-AH network) and a single-channel network with infrastructure support (called an SC-IS network). In particular, the network capacity of our proposed MC-IS network is $\sqrt{n \log n}$ times higher than that of an SC-AH network and an MC-AH network and the same as that of an SC-IS network, where $n$ is the number of nodes in the network. The average delay of our MC-IS network is $\sqrt{\log n/n}$ times lower than that of an SC-AH network and an MC-AH network, and $\min\{C_I,m\}$ times lower than the average delay of an SC-IS network, where $C_I$ and $m$ denote the number of channels dedicated for infrastructure communications and the number of interfaces mounted at each infrastructure node, respectively. Our analysis on an MC-IS network equipped with omni-directional antennas only has been extended to an MC-IS network equipped with directional antennas only, which are named as an MC-IS-DA network. We show that an MC-IS-DA network has an even lower delay of $\frac{c}{\lfloor \frac{2\pi}{\theta}\rfloor \cdot C_I}$ compared with an SC-IS network and our MC-IS network. For example, when $C_I=12$ and $\theta=\frac{\pi}{12}$, an MC-IS-DA network can further reduce the delay by 24 times lower that of an MC-IS network and reduce the delay by 288 times lower than that of an SC-IS network.Comment: accepted, IEEE Transactions on Vehicular Technology, 201

Messhu-gata musen nettowaku ni okeru supekutoramu kenchi to MAC-so purotokoru ni kansuru kenkyu

制度:新 ; 報告番号:甲3458号 ; 学位の種類:博士(国際情報通信学) ; 授与年月日:2011/11/16 ; 早大学位記番号:新578

Scaling Laws for Vehicular Networks

Equipping automobiles with wireless communications and networking capabilities is becoming the frontier in the evolution to the next generation intelligent transportation systems (ITS). By means of vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications, information generated by the vehicle-borne computer, vehicle control system, on-board sensors, or roadside infrastructure, can be effectively disseminated among vehicles/infrastructure in proximity or to vehicles/infrastructure multiple hops away, known as vehicular networks (VANETs), to enhance the situational awareness of vehicles and provide motorist/passengers with an information-rich travel environment. Scaling law for throughput capacity and delay in wireless networks has been considered as one of the most fundamental issues, which characterizes the trend of throughput/delay behavior when the network size increases. The study of scaling laws can lead to a better understanding of intrinsic properties of wireless networks and theoretical guidance on network design and deployment. Moreover, the results could also be applied to predict network performance, especially for the large-scale vehicular networks. However, map-restricted mobility and spatio-temporal dynamics of vehicle density dramatically complicate scaling laws studies for VANETs. As an effort to lay a scientific foundation of vehicular networking, my thesis investigates capacity scaling laws for vehicular networks with and without infrastructure, respectively. Firstly, the thesis studies scaling law of throughput capacity and end-to-end delay for a social-proximity vehicular network, where each vehicle has a restricted mobility region around a specific social spot and services are delivered in a store-carry-and-forward paradigm. It has been shown that although the throughput and delay may degrade in a high vehicle density area, it is still possible to achieve almost constant scaling for per vehicle throughput and end-to-end delay. Secondly, in addition to pure ad hoc vehicular networks, the thesis derives the capacity scaling laws for networks with wireless infrastructure, where services are delivered uniformly from infrastructure to all vehicles in the network. The V2V communication is also required to relay the downlink traffic to the vehicles outside the coverage of infrastructure. Three kinds of infrastructures have been considered, i.e., cellular base stations, wireless mesh backbones (a network of mesh nodes, including one mesh gateway), and roadside access points. The downlink capacity scaling is derived for each kind of infrastructure. Considering that the deployment/operation costs of different infrastructure are highly variable, the capacity-cost tradeoffs of different deployments are examined. The results from the thesis demonstrate the feasibility of deploying non-cellular infrastructure for supporting high-bandwidth vehicular applications. Thirdly, the fundamental impact of traffic signals at road intersection on drive-thru Internet access is particularly studied. The thesis analyzes the time-average throughput capacity of a typical vehicle driving through randomly deployed roadside Wi-Fi networks. Interestingly, we show a significant throughput gain for vehicles stopping at intersections due to red signals. The results provide a quick and efficient way of determining the Wi-Fi deployment scale according to required quality of services. In summary, the analysis developed and the scaling laws derived in the thesis provide should be very useful for understanding the fundamental performance of vehicular networks