Report the ad
CAMF: Context-Aware Message Forwarding In Selfish Mobile Social Networks - Coimbatore
Tuesday, 1 December, 2015Item details
City:
Coimbatore, Tamil Nadu
Offer type:
Offer
Item description
ABSTRACT:
Nodes may exhibit selfish behaviors in mobile social networks (MSN) selfish nodes refuse to forward messages for all or some nodes in a network to conserve limited resources. Previous work mainly focuses on promoting selfish nodes transmit messages for others. In this paper, we consider selfishness from a different viewpoint; we regard selfishness as a basic requirement of systems and allow nodes to behave selfish behaviors. However, selfishness has a profound influence on routing performance. To achieve a good routing performance when node selfishness is considered, we first put forward a stateless approach which does not need collecting and storing state information to measure the similarity of nodes, and then evaluate the forwarding capability of nodes by combining the acquired similarity with node selfishness. We then quantify the receiving capability of nodes based on their available buffer size and energy. Incorporating forwarding and receiving capability, we present a forwarding set mechanism, which formulates the forwarding set optimization problem as a multiple knapsack problem to maximize the forwarding profit. Consequently, we take all the results above into our context-aware message forwarding design. Extensive trace-driven simulations show that our proposed algorithm achieves good routing performance with low transmission cost and resource consumption in selfish MSN.
For more details, Contact
ph:9095395333,9159115969
Office Address:
LansA Informatics Pvt Ltd,
165, 5th Street, Cross cut road,
Gandhipuram, Coimbatore-641012
Nodes may exhibit selfish behaviors in mobile social networks (MSN) selfish nodes refuse to forward messages for all or some nodes in a network to conserve limited resources. Previous work mainly focuses on promoting selfish nodes transmit messages for others. In this paper, we consider selfishness from a different viewpoint; we regard selfishness as a basic requirement of systems and allow nodes to behave selfish behaviors. However, selfishness has a profound influence on routing performance. To achieve a good routing performance when node selfishness is considered, we first put forward a stateless approach which does not need collecting and storing state information to measure the similarity of nodes, and then evaluate the forwarding capability of nodes by combining the acquired similarity with node selfishness. We then quantify the receiving capability of nodes based on their available buffer size and energy. Incorporating forwarding and receiving capability, we present a forwarding set mechanism, which formulates the forwarding set optimization problem as a multiple knapsack problem to maximize the forwarding profit. Consequently, we take all the results above into our context-aware message forwarding design. Extensive trace-driven simulations show that our proposed algorithm achieves good routing performance with low transmission cost and resource consumption in selfish MSN.
For more details, Contact
ph:9095395333,9159115969
Office Address:
LansA Informatics Pvt Ltd,
165, 5th Street, Cross cut road,
Gandhipuram, Coimbatore-641012