Infrastructure Mode Based Opportunistic Networks on Android Devices

Ippisch, Andre; Graffi, Kálmán

doi:10.1109/aina.2017.32

Cited by 16 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, based on the similarity calculation Equation (11), the similarity between nodes s and j is calculated, which is denoted as SI M sj .…”

Section: Algorithm Designmentioning

confidence: 99%

“…Due to the restrictions of various factors such as application characteristics, environment, and cost, OppNet can exactly meet the needs of certain specific applications [9]. Nowadays, the typical applications of the OppNet include the field data collection [10], the message communication in remote districts [11], the vehicle network [12], the ad hoc network under various environment [13], and so on.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes

Lin

Chen

et al. 2018

Algorithms

View full text Add to dashboard Cite

The mobility of nodes leads to dynamic changes in topology structure, which makes the traditional routing algorithms of a wireless network difficult to apply to the opportunistic network. In view of the problems existing in the process of information forwarding, this paper proposed a routing algorithm based on the cosine similarity of data packets between nodes (cosSim). The cosine distance, an algorithm for calculating the similarity between text data, is used to calculate the cosine similarity of data packets between nodes. The data packet set of nodes are expressed in the form of vectors, thereby facilitating the calculation of the similarity between the nodes. Through the definition of the upper and lower thresholds, the similarity between the nodes is filtered according to certain rules, and finally obtains a plurality of relatively reliable transmission paths. Simulation experiments show that compared with the traditional opportunistic network routing algorithm, such as the Spray and Wait (S&W) algorithm and Epidemic algorithm, the cosSim algorithm has a better transmission effect, which can not only improve the delivery ratio, but also reduce the network transmission delay and decline the routing overhead.

show abstract

“…Then, based on the similarity calculation Equation (11), the similarity between nodes s and j is calculated, which is denoted as SI M sj .…”

Section: Algorithm Designmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes

Lin

Chen

et al. 2018

Algorithms

View full text Add to dashboard Cite

show abstract

“…Other routing methods intended to reduce flooding of message copies include a method that creates routing tables from encounter history [9], a method that calculates the probability at which messages reach their destination nodes based on encounter probability and uses routing tables that hold this information [10], and a method that creates routing tables based on the profiles and behavior history of individuals (called "social-context-awareness" [11] in this paper).…”

Section: Dtn Routingmentioning

confidence: 99%

“…Message ferry [7] and routing based on traveling route information [8] are proactive methods and are both the fixed type. There is a method in which information about a node located two hops away from the encountered node is exchanged as meta information [9,10]. Passing-by methods include PRoPHET [11] and HiBOp [14].…”

Section: Creation Of a Routingmentioning

confidence: 99%

See 1 more Smart Citation

Development of a Social DTN for Message Communication between SNS Group Members

2018

View full text Add to dashboard Cite

Smartphones have the ability to communicate with other terminals through ad hoc connections. A variety of applications have been developed to exploit this ability. The authors have developed an Android OS (operating system) application (called "social DTN manager") that builds a DTN (delay, disruption, disconnection tolerant networking) among members of a social networking service (SNS) community using a community token. The members can exchange messages over this network. Control messages for building a DTN are forwarded to only those nodes that use the same community token in order to reduce flooding of message copies. When a source node sends a communication request to its destination node, they exchange control messages to establish a communication route. Relay nodes use these messages to create and hold routing information for these nodes in their routing tables. Thereafter, relay nodes can forward data messages based on their routing tables. This again reduces flooding of message copies. The social DTN manager incorporates these functions, Facebook Graph API and Google Nearby Connections API. The authors have installed it in Android terminals and confirmed that a social DTN can successfully be built using this application and that data messages can be exchanged between terminals via reactive routes.

show abstract