Your SlideShare is downloading. ×
DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Cooperative packet delivery in hybrid wireless mobile networks a coalitional game approach
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Introducing the official SlideShare app

Stunning, full-screen experience for iPhone and Android

Text the download link to your phone

Standard text messaging rates apply

DOTNET 2013 IEEE MOBILECOMPUTING PROJECT Cooperative packet delivery in hybrid wireless mobile networks a coalitional game approach

568
views

Published on

To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

To Get any Project for CSE, IT ECE, EEE Contact Me @ 09849539085, 09966235788 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

Published in: Technology, Business

0 Comments
1 Like
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
568
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
8
Comments
0
Likes
1
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Cooperative Packet Delivery in Hybrid Wireless Mobile Networks: A Coalitional Game Approach ABSTRACT: We consider the problem of cooperative packet delivery to mobile nodes in a hybrid wireless mobile network, where both infrastructure-based and infrastructure-less (i.e., ad hoc mode or peer-to-peer mode) communications are used. We propose a solution based on a coalition formation among mobile nodes to cooperatively deliver packets among these mobile nodes in the same coalition. A coalitional game is developed to analyze the behavior of the rational mobile nodes for cooperative packet delivery. A group of mobile nodes makes a decision to join or to leave a coalition based on their individual payoffs. The individual payoff of each mobile node is a function of the average delivery delay for packets transmitted to the mobile node from a base station and the cost incurred by this mobile node for relaying packets to other mobile nodes. To find the payoff of each mobile node, a Markov chain model is formulated and the expected cost and packet delivery delay are obtained when the mobile node is in a coalition. Since both the expected cost and packet delivery delay depend on the probability that each mobile node will help other mobile nodes in the same coalition to forward packets to the destination mobile node in the same coalition, a bargaining game is used to find the optimal helping probabilities. After the payoff of each mobile node is obtained, we find the solutions of the coalitional game which are the stable coalitions. A distributed algorithm is presented to GLOBALSOFT TECHNOLOGIES IEEE PROJECTS & SOFTWARE DEVELOPMENTS IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401 Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
  • 2. obtain the stable coalitions and a Markov-chain-based analysis is used to evaluate the stable coalitional structures obtained from the distributed algorithm. Performance evaluation results show that when the stable coalitions are formed, the mobile nodes achieve a nonzero payoff (i.e., utility is higher than the cost). With a coalition formation, the mobile nodes achieve higher payoff than that when each mobile node acts alone. EXISTING SYSTEM: A few works in the literature proposed communication models for wireless networks with relay- based schemes to reduce the delay of data delivery. In these schemes, mobile nodes in a group (i.e., cluster) cooperatively deliver data packets among each other. However, the key assumption here is that the mobile nodes in the same group always help each other for data delivery. Since a tradeoff exists between performance improvement (i.e., smaller packet delivery delay) and transmission cost (i.e., bandwidth and energy-consumption) for such cooperative data delivery, this assumption may not be always true. For example, when a mobile node has limited transmission bandwidth and is of self-interest, it may not join a group for cooperative data delivery. DISADVANTAGES OF EXISTING SYSTEM: Since a tradeoff exists between performance improvement (i.e., smaller packet delivery delay) and transmission cost (i.e., bandwidth and energy-consumption) for such cooperative data delivery, this assumption may not be always true. For example, when a mobile node has limited transmission bandwidth and is of self-interest, it may not join a group for cooperative data delivery. In this context, the theory of coalitional game can be applied to analyze the dynamics of coalition (or group) formation among mobile nodes. PROPOSED SYSTEM: The proposed scheme consists of three interrelated steps are included in this paper. We first use a social network analysis (SNA)-based approach to identify which mobile nodes have the
  • 3. potential to help other mobile nodes for data delivery in the same group or coalition. After the SNA based mobile node grouping is done, the mobile nodes in each group play a coalitional game to obtain a stable coalitional structure. The payoff of each mobile node is a function of cost incurred by the mobile node in relaying packets and the delivery delay for packets transmitted to this mobile node from a BS. A continuous-time Markov chain (CTMC) model is formulated to obtain the expected cost and packet delivery delay for each mobile node in the same coalition. Since the expected cost and packet delivery delay vary with the probability that each mobile node helps other mobile nodes deliver packets, a bargaining game is used to find the optimal helping probabilities for all the mobile nodes in a coalition. For each mobile node, after the optimal probability of helping other mobile nodes is obtained, we can determine the payoff of each mobile node when it is a member of its current coalition. The payoffs obtained from the bargaining game are used to determine the solution of the coalitional game in terms of stable coalitional structure (i.e., a group of stable coalitions). A distributed algorithm is used to obtain the solution of the coalitional game and a Markov chain-based analysis is presented to evaluate the stable coalitional structures obtained from the distributed algorithm. ADVANTAGES OF PROPOSED SYSTEM:  The proposed framework will be useful for supporting various mobile applications based on distributed cooperative packet delivery.  In a mobile nodes (e.g., vehicular users) form coalitions and cooperatively share the limited bandwidth of vehicle-to-roadside links to achieve high spectrum utilization.
  • 4. SYSTEM ARCHITECTURE: SYSTEM REQUIREMENTS: HARDWARE REQUIREMENTS: System : Pentium IV 2.4 GHz. Hard Disk : 40 GB. Monitor : 15 inch VGA Colour. Mouse : Logitech Mouse. Ram : 512 MB Keyboard : Standard Keyboard SOFTWARE REQUIREMENTS: Operating System : Windows XP. Coding Language : ASP.NET, C#.Net. Database : SQL Server 2005
  • 5. REFERENCE: Khajonpong Akkarajitsakul,Member, IEEE, Ekram Hossain,Senior Member, IEEE, and Dusit Niyato, Member, IEEE “Cooperative Packet Delivery in Hybrid Wireless Mobile Networks: A Coalitional Game Approach” - IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 12, NO. 5, MAY 2013.