Name
Abstract | ||
|---|---|---|
This paper presents an improved routing algorithm based on the social link awareness. In this algorithm, multiple social features of the nodes' behaviors are utilized to quantify the nodes pairs' social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and the overhead, and increases the successful delivery ratio, thereby improving the routing efficiency. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/VTCSpring.2013.6691872 | VTC Spring |
Keywords | Field | DocType |
routing delay,social features,routing efficiency,intra-community forwarding mechanisms,routing algorithm,social link awareness,transmission delay,node behaviors,awareness,delay tolerant networks,dtns(delay tolerant networks),inter-community forwarding mechanisms,telecommunication network routing,social networking (online),nodes pairs social links,dtn,social awareness,efficient routing algorithm,algorithm design and analysis,routing,nickel,simulation | Equal-cost multi-path routing,Multipath routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Policy-based routing,Computer science,Destination-Sequenced Distance Vector routing,Computer network,Distributed computing,Zone Routing Protocol | Conference |
Volume | Issue | ISSN |
null | null | 1550-2252 |
Citations | PageRank | References |
1 | 0.35 | 8 |
Authors | ||
5 | ||