The increasing popularity of some new mobile technologies (smartphones for example) has opened new interesting scenarios in communications because of the possibility of a device to communicate with another one without using the wireless (or wired) network interfaces but taking advantages of the mobility of all the devices. In this direction, one of the most important evolution of Mobile ad hoc networks are opportunistic networks, that are self-organizing networks where there are not any guarantee of two devices to be linked with complete multi-hop path in any time. What a node has to do to deliver a certain message, is to nd a space-time multi-hop path, that is portions of path that can carry on the message during the time until it reaches the destination. We can see an example in Figure 1: the source S has to deliver a message to the destination D; the message can arrive at D at time t3, even if in [t1,t3] S and D are not directly linked. As nodes do not have any knowledges of the network topology, but only of the destination the massage have to arrive to, this way of delivering needs at any time to make some decisions, that are to whom has to be sent message and how many copies has to be sent.
Intercontact times in opportunistic networks and their impact on forwarding convergence
Elisabetta Biondi;Andrea Passarella
2013
Abstract
The increasing popularity of some new mobile technologies (smartphones for example) has opened new interesting scenarios in communications because of the possibility of a device to communicate with another one without using the wireless (or wired) network interfaces but taking advantages of the mobility of all the devices. In this direction, one of the most important evolution of Mobile ad hoc networks are opportunistic networks, that are self-organizing networks where there are not any guarantee of two devices to be linked with complete multi-hop path in any time. What a node has to do to deliver a certain message, is to nd a space-time multi-hop path, that is portions of path that can carry on the message during the time until it reaches the destination. We can see an example in Figure 1: the source S has to deliver a message to the destination D; the message can arrive at D at time t3, even if in [t1,t3] S and D are not directly linked. As nodes do not have any knowledges of the network topology, but only of the destination the massage have to arrive to, this way of delivering needs at any time to make some decisions, that are to whom has to be sent message and how many copies has to be sent.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


