Learn More
This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. Unlike some previous work, we assume that mobiles do not know the number of backlogged packets at other nodes. A Markov chain analysis is used to obtain optimal and equilibrium(More)
We investigate connectivity in the ad hoc network formed between vehicles that move on a typical highway. We use the common model in vehicular traffic theory in which a fixed point on the highway sees cars passing it separated by times with exponentially distributed duration. We obtain the distribution of the distances between cars, which allows us to use(More)
TCP performance degrades when end-to-end connections extend over wireless connections — links which are characterized by high bit error rate and intermittent connectivity. Such link characteristics can significantly degrade TCP performance as the TCP sender assumes wireless losses to be congestion losses resulting in unnecessary congestion control actions.(More)
—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically chooses both the power and the admission control to be adopted so as to maximize the expected throughput, which depends on the actions and states of all the players, given its power(More)
Multimedia data transmission over wireless networks often suffers from delay, jitter and packet loss. The main problem to implement a wireless network is the high and variable bit error rate in the radio link, making it necessary to use an additional error control mechanism. The traditional techniques for error control are ARQ (Automatic Repeat Request) and(More)
We consider a noncooperative interaction among a large population of mobiles that interfere with each other through many local interactions. The first objective of this paper is to extend the evolutionary game framework to allow an arbitrary number of mobiles that are involved in a local interaction. We allow for interactions between mobiles that are not(More)
We introduce Mean Field Markov games with N players, in which each individual in a large population interacts with other randomly selected players. The states and actions of each player in an interaction together determine the instantaneous payoff for all involved players. They also determine the transition probabilities to move to the next state. Each(More)
Connectivity in vehicular ad hoc networks may degrade dramatically in sparse traffic and also high speed highways. In this paper we study a way to improve the connectivity by adding some extra nodes with higher transmission range which we call mobile base-stations. These nodes can also offer commercial services (e.g. advertisement, video, audio, etc.) to(More)
We study the throughput of multi-hop routes and stability of forwarding queues in a wireless Ad-Hoc network with random access channel. We focuse on wireless with stationary nodes, such as community wireless networks. Our main result is charactrerization of stability condition and the end-to-end throughput using the balance. We also investigate the impact(More)
The goal of this paper is to study pricing of differentiated services and its impact on the choice of service priority at equilibrium. We consider both TCP connections as well as noncontrolled (real-time) connections. The performance measures (such as throughput and loss rates) are determined according to the operational parameters of a RED (Random Early(More)