A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach
2012
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
Other Versions
This paper studies the problem of computing Nash equilibrium in wireless networks modeled by Weighted Timed Automata. ...
Our contribution is a method for solving this problem using Statistical Model Checking. ...
The problem of computing Nash Equilibrium in wireless ad-hoc networks was first considered in [19] and surveid in [23] . ...
doi:10.4204/eptcs.78.1
fatcat:qznwcdl7zjde3lej3qkq6qey64
Game theoretic approach to location sharing with privacy in a community-based mobile safety application
2008
Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems - MSWiM '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
A new generation of community-based social networking mobile applications is emerging. ...
We investigate the convergence of two best response dynamics to achieve a nontrivial Nash equilibrium for this game. Further, we propose an algorithm that yields a Pareto optimal Nash equilibrium. ...
[33, 32] introduced the notion of packs to create a framework for providing privacy, security in mobile ad-hoc networks. ...
doi:10.1145/1454503.1454544
dblp:conf/mswim/LiuKA08
fatcat:g6ecuazdxfh3thetcy4ebbhab4
Game theoretic approach in routing protocol for wireless ad hoc networks
2009
Ad hoc networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This paper introduces a game theoretic method, called forwarding dilemma game (FDG), which controls routing overhead in dense multi-hop wireless ad hoc networks. ...
In order for NDP to function, a field is attached to the flooding packets (routing overhead packets). The mixed strategy Nash equilibrium is used as a solution for the FDG. ...
Conclusions This paper introduced a game theoretic approach, called forwarding dilemma game (FDG), for forwarding the flooding packets in wireless ad hoc networks. ...
doi:10.1016/j.adhoc.2008.07.003
fatcat:lpuxz33b35e2td7za3b5uakkce
A Collusion-Resistant Routing Scheme for Noncooperative Wireless Ad Hoc Networks
2010
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Index Terms-Collusion, routing, wireless ad hoc networks. Sheng Zhong (A'08) received the B.S. and M.E. degrees in computer ...
In this paper, we present a systematic study of collusion-resistant routing in noncooperative wireless ad hoc networks. ...
The functioning of a wireless ad hoc network depends on the cooperation of the nodes in the network. ...
doi:10.1109/tnet.2009.2030325
fatcat:tvk4yq5h7ja5rnq5gptmk6bgtu
Quality of Service (QoS) and Security Provisioning in Cooperative Mobile Ad Hoc Networks (MANETs)
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Cooperative communication can improve communication quality in wireless communication networks through strategic relay selection. ...
In this paper, a game theoretic approach is proposed to quantitatively analyze the attacking strategies of the attacker who chooses one relay to attack so as to make rational decision on relay selection ...
In this paper, we propose a static game theoretical approach for security and QoS co-design in cooperative wireless ad hoc networks. ...
arXiv:1610.00071v1
fatcat:xras5znxfbaiflcydcuqqrqpva
On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks
2007
Proceedings of the 13th annual ACM international conference on Mobile computing and networking - MobiCom '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In wireless ad hoc networks, routing requires cooperation of nodes. Since nodes often belong to different users, it is highly important to provide incentives for them to cooperate. ...
More specifically, we design a scheme that is guaranteed to converge to a Strong Nash Equilibrium. ...
The functioning of a wireless ad hoc network depends on the cooperation of the nodes in this network. ...
doi:10.1145/1287853.1287887
dblp:conf/mobicom/ZhongW07
fatcat:ccr7tloqqvetdd5bysf46cjada
Game theory models for IEEE 802.11 DCF in wireless ad hoc networks
2005
IEEE Communications Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our results show that game theory is an appropriate tool to research and analyze the performance of wireless ad hoc networks. ...
In addition, by designing a simple Nash equilibrium backoff strategy, we present a fairness game model that could improve TCP fairness almost perfectly. ...
Abstract Because wireless nodes decide their channel accesses independently in the IEEE 802.11-based ad hoc networks, and the channel access of a node has an influence on those of its neighboring nodes ...
doi:10.1109/mcom.2005.1404594
fatcat:zu2fqcbghvcwlazweoniyspgma
Game theoretic approach to medium access control in wireless networks
2013
2013 IEEE Wireless Communications and Networking Conference (WCNC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It is demonstrated that the proposed model can reach a Nash equilibrium that results in a relatively stable contention window, provided that a node adapts its behaviour to the idle rate of the broadcast ...
This dissertation presents a game-theoretic MAC layer implementation for single-cell networks and centralised DCF in the presence of hidden terminals to show how game theory can be applied to improve wireless ...
This type of architecture is also known as ad hoc networks. A typical ad hoc network is illustrated in Figure 1 .4. ...
doi:10.1109/wcnc.2013.6554678
dblp:conf/wcnc/NajafabadiC13
fatcat:pxrluuj7v5da7ai6s44swprj3a
Applications of Repeated Games in Wireless Networks: A Survey
[article]
2015
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. ...
In this paper, we survey the applications of repeated games in different wireless networks. ...
two wireless ad hoc networks through using a repeated game. ...
arXiv:1501.02886v1
fatcat:axzk6cml65c6ngsc2snujxzaey
Design of Incentive Compatible Protocols for Wireless Networks: A Game Theoretic Approach
2006
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Thus there is a need for truthful computing in this context. We call this problem the truthful broadcast problem for wireless ad hoc networks. ...
In a broadcasting task for wireless ad hoc networks, a source node sends the same message to all the nodes in the network. ...
We also propose a new protocol for broadcast in wireless ad hoc network with selfish nodes based on IPNPM. ...
doi:10.1109/infocom.2006.74
dblp:conf/infocom/Suri06
fatcat:nfkmyk5b7fblhpfei2oxsubwfq
Resisting Malicious Attacks via Secure Network Coding and Incentive Compatible Mechanism in Multihop Wireless Networks
2010
Journal of Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Network coding substantially improves the throughput of a network and possesses security superiority, but the security and performance of a network coding based wireless network are highly susceptible ...
This paper designs a secure network coding scheme that works in an adversarial environment, which can resist pollution attack, decrease the compromising probability of the message, and achieve tradeoff ...
[18] present a systematic study of collusion-resistant routing in noncooperative wireless ad hoc networks. ...
doi:10.4304/jcp.5.11.1706-1714
fatcat:qse37a6zdnd2jbf436ss6viioq
Cooperative Networking towards Maritime Cyber Physical Systems
2016
International Journal of Distributed Sensor Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The game theoretic procedure that converges to Nash equilibrium based on the utility and payoff function is illustrated. ...
with maximal-ratio combining (MRC) receiving mode in destination. ...
/shore mesh/ad hoc network. ...
doi:10.1155/2016/3906549
fatcat:nnhucdkpmbeebmuu7e4gogutke
Incentive Mechanism Design for Selfish Hybrid Wireless Relay Networks
2005
Journal on spesial topics in mobile networks and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Keywords: incentive mechanism design, hybrid multihop wireless relay networks, game theory, cooperation in mobile ad hoc networks ...
Therefore, we are inspired to design a novel incentive scheduler. By applying the proposed incentive scheduler, all selfish users relay cooperatively at the Nash Equilibrium. ...
Previously, researcher investigated several incentive schemes based on pricing to encourage cooperative relay in mobile ad hoc networks [5] [6] [7] [8] [9] . ...
doi:10.1007/s11036-005-4449-1
fatcat:aj7id6flynflxg2ujzifumc2cm
Analysis of required resources for a node using queue system in an ad hoc network
2013
2013 Fourth International Conference on Computing, Communications and Networking Technologies (ICCCNT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Required resource for nodes in an ad hoc network with specific parameters (e.g. node-count and topology) is one of the most important problems for the manufacturer. ...
In this paper, in the first phase, we showed that according to the proposed game model for the node behaviour, the network converge to a steady state and in the second phase, the process of a node in forwarding ...
INTRODUCTION A Mobile Ad hoc network is a decentralized type of wireless network and participation of nodes in packet forwarding is voluntary [1] . ...
doi:10.1109/icccnt.2013.6726696
fatcat:rxkl4de5cfhn3lt7bnk43xx3t4
Using Bayesian Game Model for Intrusion Detection in Wireless Ad Hoc Networks
2010
International Journal of Communications, Network and System Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Wireless ad hoc network is becoming a new research fronter, in which security is an important issue. ...
We solve the game by finding the Bayesian Nash equilibrium. The results of our analysis show that the IDS could work intermittently without compromising its effectiveness. ...
In the context of intrusion detection, several game theoretic approaches have been proposed to wired networks, sensor networks, and ad hoc networks. Yenumula B. ...
doi:10.4236/ijcns.2010.37080
fatcat:hxjwudca2jdp7geibiecvpzwwy
« Previous
Showing results 1 — 15 out of 1,362 results