11,147 research outputs found
Border Games in Cellular Networks
In each country today, cellular networks operate on carefully separated frequency bands. This separation is imposed by the regulators of the given country to avoid interference between these networks. But, the separation is only valid within the borders of a country, hence the operators are left on their own to resolve cross-border interference of their cellular networks. In this paper, we focus on the scenario of two operators, each located on one side of the border. We assume that they want to fine-tune the emitting power of the pilot signals (i.e., beacon signals) of their base stations. This operation is crucial, because the pilot signal power determines the number of users they can attract and hence the revenue they can obtain. In the case of no power costs, we show that there exists a motivation for the operators to be strategic, meaning to fine-tune the pilot signal powers of their base stations. In addition, we study Nash equilibrium conditions in an empirical model and investigate the efficiency of the Nash equilibria for different user densities. Finally, we modify our game model to take power costs into account. The game with power costs corresponds to the well-known Prisoner's Dilemma: The players are still motivated to adjust their pilot powers, but their strategic behavior leads to a sub-optimal Nash equilibrium
Recommended from our members
Incorporating Digital Repeaters into the Soft Handover Standard in Digital Video Broadcasting Handheld
Digital Video Broadcasting for Handhelds (DVB-H) is a standard for broadcasting IP data services to portable devices. Handover in unidirectional broadcast networks is a novel issue introduced by this technology. This paper proposes and analyses the Repeater Aided Soft Handover (RA_handover) algorithm for a DVB-H receiver with MIMO antennas and presents the benefits of implementing RA_handover compared with a handover process without repeaters. For network planning and optimisation purposes simulation models are developed to analyse the RA_handover approach. It is shown that RA_handover could greatly improve the quality of service and consume much less front-end battery power than a handover method without repeaters. In addition, the cost introduced by the algorithm is briefly estimated. In conclusion, curves are given that show the relationship between quality of service and consumed battery power, which provide further support for including RA_handover in the DVB-H soft handover standard. The paper provides valuable outcomes for service providers and standard policy makers
Imitation dynamics in a game of traffic
We study a model of traffic where drivers adopt different behavioral
strategies. These can be cooperative or defective according to a driver abiding
or not by a traffic rule. Drivers can change their strategy by imitating the
majority, with a rule that depends on the strategies with which they have
interacted. These interactions occur at intersections, where vehicles pay a
temporal cost according to their strategy. We analyze the conditions under
which different strategy compositions represent an advantage in the system
velocity. We found that the cooperators' mean speed is higher than the
defectors' even when the vehicle density is large. However, defectors can
obtain benefits in their mean speed when they are a minority in an essentially
cooperative population. The presence of a core of educated drivers, who persist
firmly in a cooperative behavior, optimizes the speed in the system, especially
for intermediate values of vehicular density and higher temporal costs
Prisoner's Dilemma cellular automata revisited: evolution of cooperation under environmental pressure
We propose an extension of the evolutionary Prisoner's Dilemma cellular
automata, introduced by Nowak and May \cite{nm92}, in which the pressure of the
environment is taken into account. This is implemented by requiring that
individuals need to collect a minimum score , representing
indispensable resources (nutrients, energy, money, etc.) to prosper in this
environment. So the agents, instead of evolving just by adopting the behaviour
of the most successful neighbour (who got ), also take into account if
is above or below the threshold . If an
individual has a probability of adopting the opposite behaviour from the one
used by its most successful neighbour. This modification allows the evolution
of cooperation for payoffs for which defection was the rule (as it happens, for
example, when the sucker's payoff is much worse than the punishment for mutual
defection). We also analyse a more sophisticated version of this model in which
the selective rule is supplemented with a "win-stay, lose-shift" criterion. The
cluster structure is analyzed and, for this more complex version we found
power-law scaling for a restricted region in the parameter space.Comment: 15 pages, 8 figures; added figures and revised tex
Energy saving market for mobile operators
Ensuring seamless coverage accounts for the lion's share of the energy
consumed in a mobile network. Overlapping coverage of three to five mobile
network operators (MNOs) results in enormous amount of energy waste which is
avoidable. The traffic demands of the mobile networks vary significantly
throughout the day. As the offered load for all networks are not same at a
given time and the differences in energy consumption at different loads are
significant, multi-MNO capacity/coverage sharing can dramatically reduce energy
consumption of mobile networks and provide the MNOs a cost effective means to
cope with the exponential growth of traffic. In this paper, we propose an
energy saving market for a multi-MNO network scenario. As the competing MNOs
are not comfortable with information sharing, we propose a double auction
clearinghouse market mechanism where MNOs sell and buy capacity in order to
minimize energy consumption. In our setting, each MNO proposes its bids and
asks simultaneously for buying and selling multi-unit capacities respectively
to an independent auctioneer, i.e., clearinghouse and ends up either as a buyer
or as a seller in each round. We show that the mechanism allows the MNOs to
save significant percentage of energy cost throughout a wide range of network
load. Different than other energy saving features such as cell sleep or antenna
muting which can not be enabled at heavy traffic load, dynamic capacity sharing
allows MNOs to handle traffic bursts with energy saving opportunity.Comment: 6 pages, 2 figures, to be published in ICC 2015 workshop on Next
Generation Green IC
Gaming security by obscurity
Shannon sought security against the attacker with unlimited computational
powers: *if an information source conveys some information, then Shannon's
attacker will surely extract that information*. Diffie and Hellman refined
Shannon's attacker model by taking into account the fact that the real
attackers are computationally limited. This idea became one of the greatest new
paradigms in computer science, and led to modern cryptography.
Shannon also sought security against the attacker with unlimited logical and
observational powers, expressed through the maxim that "the enemy knows the
system". This view is still endorsed in cryptography. The popular formulation,
going back to Kerckhoffs, is that "there is no security by obscurity", meaning
that the algorithms cannot be kept obscured from the attacker, and that
security should only rely upon the secret keys. In fact, modern cryptography
goes even further than Shannon or Kerckhoffs in tacitly assuming that *if there
is an algorithm that can break the system, then the attacker will surely find
that algorithm*. The attacker is not viewed as an omnipotent computer any more,
but he is still construed as an omnipotent programmer.
So the Diffie-Hellman step from unlimited to limited computational powers has
not been extended into a step from unlimited to limited logical or programming
powers. Is the assumption that all feasible algorithms will eventually be
discovered and implemented really different from the assumption that everything
that is computable will eventually be computed? The present paper explores some
ways to refine the current models of the attacker, and of the defender, by
taking into account their limited logical and programming powers. If the
adaptive attacker actively queries the system to seek out its vulnerabilities,
can the system gain some security by actively learning attacker's methods, and
adapting to them?Comment: 15 pages, 9 figures, 2 tables; final version appeared in the
Proceedings of New Security Paradigms Workshop 2011 (ACM 2011); typos
correcte
Assessing the Impact of Game Day Schedule and Opponents on Travel Patterns and Route Choice using Big Data Analytics
The transportation system is crucial for transferring people and goods from point A to point B. However, its reliability can be decreased by unanticipated congestion resulting from planned special events. For example, sporting events collect large crowds of people at specific venues on game days and disrupt normal traffic patterns.
The goal of this study was to understand issues related to road traffic management during major sporting events by using widely available INRIX data to compare travel patterns and behaviors on game days against those on normal days. A comprehensive analysis was conducted on the impact of all Nebraska Cornhuskers football games over five years on traffic congestion on five major routes in Nebraska. We attempted to identify hotspots, the unusually high-risk zones in a spatiotemporal space containing traffic congestion that occur on almost all game days. For hotspot detection, we utilized a method called Multi-EigenSpot, which is able to detect multiple hotspots in a spatiotemporal space. With this algorithm, we were able to detect traffic hotspot clusters on the five chosen routes in Nebraska. After detecting the hotspots, we identified the factors affecting the sizes of hotspots and other parameters. The start time of the game and the Cornhuskers’ opponent for a given game are two important factors affecting the number of people coming to Lincoln, Nebraska, on game days. Finally, the Dynamic Bayesian Networks (DBN) approach was applied to forecast the start times and locations of hotspot clusters in 2018 with a weighted mean absolute percentage error (WMAPE) of 13.8%
Media fusion and future TV: Examining multi-screen TV convergence in Singapore
This study examines Singapore's national media blueprint and industry stakeholders' coping strategies in response to multi-screen TV development. The findings show Singapore muti-screen TV development is still at a nascent stage after launching Media Fushion and FutureTV plans in mid 2009. The policymakers play a key role to follow national media blueprint to unify the inter-industry and cross-country collaboration. TV operators and telcos are found to remediate themselves by harnessing the power of internet and mobile technologies for content innovation and distribution. To tackle the complicated convergent issues in multi-screen TV industry, this study proposes to separately regulate the technology-neutral platforms and diverse audiovisual content. It also recommends a pro-innovative policy with the light-touch licensing scheme and loose content regulation to facilitate the development of the next TV. --three-screen TV,multi-screen TV,convergence,media fusion,IPTV,mobile TV,cross-platform,TV technologies,TV market,TV policy
- …