A Coalitional Game Approach for Packet Delivery in Mobile Adhoc Network
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 1
Abstract
A coalitional game is residential to study the actions of the rational mobile nodes for supportive packet delivery. We consider the problem of supportive packet delivery to mobile nodes in a cross wireless mobile network, where both wired and wireless network communications are used. A group of mobile nodes makes a conclusion to join or to leave a coalition based on their creature payoffs . The individual payoff of each mobile node is a function of the usual delivery delay for packets transmitted to the mobile node from a base station and the cost incur by this mobile node for relay packets to other mobile nodes. We propose a solution based on a coalition formation among mobile nodes to cooperatively deliver packets among these mobile nodes in the similar coalition. To discover the payoff of each mobile node, a continuous time Markov chain model is formulated and the expected cost and packet delivery postponement are obtained when the mobile node is in a coalition. Because both the expected cost and packet delivery delay depend on the possibility that each mobile node will aid other mobile nodes in the same coalition to forward packets to the destination mobile node in the same coalition, a bargaining model game is used to find the best helping probabilities. Behind the payoff of every mobile node is obtained, we discover the resolutions of the coalitional game which are the constant coalitions. A distributed algorithm is reachable to obtain the constant coalitions and a Markov-chain-based analysis is used to estimate the constant coalitional structures obtained from the distributed algorithm. Performance estimate results show that when the constant coalitions are formed, the mobile nodes realize a higher payoff . With a coalition formation, the mobile nodes achieve superior payoff than that when every mobile node acts alone.
Authors and Affiliations
S. V. Karthik
Keywords
Related Articles
- EP ID EP136468
- DOI -
- Views 98
- Downloads 0
Heart Disease Detection using EKSTRAP Clustering with Statistical and Distance based Classifiers
Abstract : The heart is the most important organ in the human body which pumps blood to various parts of the body. If there is inefficient circulation of blood in body organs like brain will suffer. If heart stops pumpin...
Analysis of Rayleigh Quotient in Extrapolation Method to Accelerate the Computation Speed of PageRank
The development of techniques for computing PageRank efficiently for Web-scale graphs is very important since computing a PageRank vector of Web graphs containing a billion nodes can take several days. Previous m...
A Review on Diverse Ensemble Methods for Classification
Ensemble methods for different classifiers like Bagging and Boosting which combine the decisions of multiple hypotheses are some of the strongest existing machine learning methods. The diversity ofthe members of...
A Survey on Vehicular Ad hoc Networks
Vehicular Ad hoc Networks (VANETs), a subclass of mobile ad hoc network (MANET), is a promising approach for the intelligent transport system (ITS). VANET allows vehicles to form a self-organized network wi...
A Quantitative Measurement Methodology for calculating Risk related to Information Security
Nowadays, technology increases, so the risk related to technology is also increasing. Risk is the possibility of suffering loss. Therefore, we have to adopt some risk management methodology to reduce the number of ris...