448 research outputs found
Cooperation Enforcement for Packet Forwarding Optimization in Multi-hop Ad-hoc Networks
Ad-hoc networks are independent of any infrastructure. The nodes are
autonomous and make their own decisions. They also have limited energy
resources. Thus, a node tends to behave selfishly when it is asked to forward
the packets of other nodes. Indeed, it would rather choose to reject a
forwarding request in order to save its energy. To overcome this problem, the
nodes need to be motivated to cooperate. To this end, we propose a
self-learning repeated game framework to enforce cooperation between the nodes
of a network. This framework is inspired by the concept of "The Weakest Link"
TV game. Each node has a utility function whose value depends on its
cooperation in forwarding packets on a route as well as the cooperation of all
the nodes that form this same route. The more these nodes cooperate the higher
is their utility value. This would establish a cooperative spirit within the
nodes of the networks. All the nodes will then more or less equally participate
to the forwarding tasks which would then eventually guarantee a more efficient
packets forwarding from sources to respective destinations. Simulations are run
and the results show that the proposed framework efficiently enforces nodes to
cooperate and outperforms two other self-learning repeated game frameworks
which we are interested in.Comment: Published in the proceedings of the IEEE Wireless Communications and
Networking Conference (WCNC 2012), Paris, France, 201
Enhancing Node Cooperation in Mobile Wireless Ad Hoc Networks with Selfish Nodes
In Mobile Ad Hoc Networks (MANETs), nodes depend on each other for routing and forwarding packets. However, to save power and other resources, nodes belonging to independent authorities may behave selfishly, and may not be willing to help other nodes. Such selfish behavior poses a real threat to the proper functioning of MANETs. One way to foster node cooperation is to introduce punishment for selfish nodes. Based on neighbor-monitoring techniques, a fully distributed solution to detect, punish, and re-admit selfish nodes, is proposed here. This solution provides nodes the same opportunity to serve/and be served by others. A light-weight solution regarding battery status is also proposed here. This solution requires neighbor monitoring only when necessary, thereby saving nodes battery power. Another effective way to solve the selfish-node problem is to reward nodes for their service according to their cost. To force nodes to show their true cost, truthful protocols are needed. A low overhead truthful routing protocol to find optimal routes is proposed in this thesis. The most prominent feature of this protocol is the reduction of overhead from existing solutions O(n3) to O(n2). A light-weight scalable truthful routing protocol (LSTOP) is further proposed, which finds near-least-cost paths in dense networks. LSTOP reduces overhead to O(n) on average, and O(n2) in worst case scenarios. Multiple path routing protocols are an effective alternative to single path routing protocols. A generic mechanism that can turn any table-driven multipath routing protocol into a truthful one, is outlined here. A truthful multipath routing protocol (TMRP), based on well-known AOMDV protocol, is presented as an example. TMRP incurs an only 2n message overhead for a route discovery, and can also achieve load balancing without compromising truthfulness. To cope with the selfish-node problem in the area of position-based routing, a truthful geographic forwarding (TGF) algorithm is presented. TGF utilizes three auction-based forwarding schemes to stimulate node cooperation. The truthfulness of these schemes is proven, and their performance is evaluated through statistical analysis and simulation studies
Hybrid FPMS: A New Fairness Protocol Management Scheme for Community Wireless Mesh Networks
Node cooperation during packet forwarding operations is critically important
for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In
a CoWMN, node cooperation is achieved by using fairness protocols specifically
designed to detect and isolate malicious nodes, discourage unfair behavior, and
encourage node participation in forwarding packets. In general, these protocols
can be split into two groups: Incentive-based ones, which are managed
centrally, and use credit allocation schemes. In contrast, reputation-based
protocols that are decentralized, and rely on information exchange among
neighboring nodes. Centrally managed protocols inevitably suffer from
scalability problems. The decentralized, reputation-based protocols lacks in
detection capability, suffer from false detections and error propagation
compared to the centralized, incentive-based protocols. In this study, we
present a new fairness protocol management scheme, called Hybrid FPMS that
captures the superior detection capability of incentive-based fairness
protocols without the scalability problems inherently expected from a
centralized management scheme as a network's size and density grows. Simulation
results show that Hybrid FPMS is more efficient than the current centralized
approach and significantly reduces the network delays and overhead.Comment: KSII Transactions on Internet and Information Systems, 201
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. 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. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
MPIFA: A Modified Protocol Independent Fairness Algorithm for Community Wireless Mesh Networks
Community Wireless Mesh Networks (WMN) is a paradigm in wireless
communication of 21st centuary as means of providing high speed braodband
access. Un-cooperative nodes, both selfish and malicious proves to be a
significant threat in Community WMN that require a solution independent of
routing protocols being used. We propose to implement Modified PIFA (MPIFA), an
Improved version of Protocol Independent Fairness Algorithm (PIFA) proposed by
Younghwan Yoo, Sanghyun and P. Agrawal [6] with ability to cater specific
requirements in Community WMN. MPIFA has malicious nodes detection rate
improvement of 50% when nodes demonstrate low probabilistic malicious behavior
of 10% to circumvent the security measures in place. Improvements were also
made to reduce false malicious node detections to 4% when node-to-node link
failures occur in Community WMN.Comment: Innovative Technologies in Intelligent Systems and Industrial
Applications(CITISIA) 200
Counteracting Selfish Nodes Using Reputation Based System in Mobile Ad Hoc Networks
A mobile ad hoc network (MANET) is a group of nodes constituting a network of mobile nodes without predefined and pre-established architecture where mobile nodes can communicate without any dedicated access points or base stations. In MANETs, a node may act as a host as well as a router. Nodes in the network can send and receive packets through intermediate nodes. However, the existence of malicious and selfish nodes in MANETs severely degrades network performance. The identification of such nodes in the network and their isolation from the network is a challenging problem. Therefore, in this paper, a simple reputation-based scheme is proposed which uses the consumption and contribution information for selfish node detection and cooperation enforcement. Nodes failing to cooperate are detached from the network to save resources of other nodes with good reputation. The simulation results show that our proposed scheme outperforms the benchmark scheme in terms of NRL (normalized routing load), PDF (packet delivery fraction), and packet drop in the presence of malicious and selfish attacks. Furthermore, our scheme identifies the selfish nodes quickly and accurately as compared to the benchmark scheme
- …