A Game-Theoretic Analysis of Multiple Protocol Data Flows in Hierarchical M2M Communication Networks | Zendy

Gang Wang | Zendy; Jie Leng | Zendy; Lin Bai | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Game-Theoretic Analysis of Multiple Protocol Data Flows in Hierarchical M2M Communication Networks

Author(s) -

Gang Wang,

Jie Leng,

Lin Bai

Publication year - 2013

Publication title -

international journal of distributed sensor networks

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.324

H-Index - 53

eISSN - 1550-1477

pISSN - 1550-1329

DOI - 10.1155/2013/584707

Subject(s) - computer science , linear network coding , computer network , routing protocol , distributed computing , coding (social sciences) , hierarchical routing , game theory , communications protocol , protocol (science) , routing (electronic design automation) , dynamic source routing , network packet , statistics , mathematics , economics , microeconomics , medicine , alternative medicine , pathology

A hierarchical machine-to-machine (M2M) communication network, where multiple heterogeneous devices compete for transmission on congested links, is considered. In such a network, the cluster headers gather the network coding and routing messages from multiple M2M devices and forward them to the cellular network. We propose a novel discriminatory user-based utility mechanism for network coding users and routing users. The price of anarchy (PoA), which is used to characterize the worst-case efficiency bounds, is analyzed. The simulation results show that network coding could promote the efficiency to a certain extent. © 2013 Gang Wang et al.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research