• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Social Network Analysis for Routing in Disconnected Delay-tolerant MANETs (2007)

Cached

  • Download as a PDF

Download Links

  • [www.cs.tcd.ie]
  • [www.scss.tcd.ie]
  • [reality.media.mit.edu]
  • [www.eecis.udel.edu]
  • [www.cis.udel.edu]
  • [realitycommons.media.mit.edu]
  • [www.cse.psu.edu]
  • [delab.csd.auth.gr]
  • [www.cis.temple.edu]
  • [delivery.acm.org]
  • [www.diit.unict.it]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Elizabeth Daly , Mads Haahr
Citations:276 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Daly07socialnetwork,
    author = {Elizabeth Daly and Mads Haahr},
    title = {Social Network Analysis for Routing in Disconnected Delay-tolerant MANETs},
    year = {2007}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Message delivery in sparse Mobile Ad hoc Networks (MANETs) is difficult due to the fact that the network graph is rarely (if ever) connected. A key challenge is to find a route that can provide good delivery performance and low end-to-end delay in a disconnected network graph where nodes may move freely. This paper presents a multidisciplinary solution based on the consideration of the socalled small world dynamics which have been proposed for economy and social studies and have recently revealed to be a successful approach to be exploited for characterising information propagation in wireless networks. To this purpose, some bridge nodes are identified based on their centrality characteristics, i.e., on their capability to broker information exchange among otherwise disconnected nodes. Due to the complexity of the centrality metrics in populated networks the concept of ego networks is exploited where nodes are not required to exchange information about the entire network topology, but only locally available information is considered. Then SimBet Routing is proposed which exploits the exchange of pre-estimated ‘betweenness’ centrality metrics and locally determined social ‘similarity’ to the destination node. We present simulations using real trace data to demonstrate that SimBet Routing results in delivery performance close to Epidemic Routing but with significantly reduced overhead. Additionally, we show that Sim-Bet Routing outperforms PRoPHET Routing, particularly when the sending and receiving nodes have low connectivity.

Keyphrases

social network analysis    present simulation    successful approach    epidemic routing    disconnected network graph    destination node    small world dynamic    pre-estimated betweenness centrality metric    social study    information exchange    prophet routing    sim-bet routing    social similarity    multidisciplinary solution    bridge node    low connectivity    delivery performance close    simbet routing result    low end-to-end delay    populated network    entire network topology    available information    key challenge    ego network    simbet routing    centrality characteristic    information propagation    real trace data    network graph    good delivery performance    wireless network    centrality metric    message delivery    sparse mobile ad hoc network   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University