LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Tasiopoulos, Argyrios; Tsiaras, Christos; Toumpis, Stavros (2012)
Languages: English
Types: Conference object
Subjects: Department of Informatics, 000 Computer science, knowledge & systems

Classified by OpenAIRE into

ACM Ref: ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS
Identifiers:doi:10.5167/uzh-61880
In Delay Tolerant Networks (DTNs), there is a fundamental tradeoff between the aggregate transport cost of a packet and the delay in its delivery. We study this tradeoff in the context of geographical routing in wireless DTNs.We ?rst specify the optimal cost/delay tradeoff, i.e., the tradeoff under optimal network operation, using a dynamic network construction termed the Cost/Delay Evolving Graph (C/DEG) and the Optimal Cost/Delay Curve (OC/DC), a function that gives the minimum possible aggregate transportation cost versus the maximum permitted delivery delay.We proceed to evaluate the performance of two known delay tolerant geographic routing rules, i.e., MOVE and AeroRP, a delay tolerant version of the geographic routing rule that selects as next relay the node for which the cost-per-progress ratio is minimized, and ?nally two novel rules, the Balanced Ratio Rule (BRR) and the Composite Rule (CR). The evaluation is in terms of the aggregate packet transmission cost as a function of the maximum permitted packet delivery delay. Simulations show that CR achieves a cost/delay tradeoff that is overall the closest to the optimal one speci?ed by the OC/DC, while BRR achieves the smallest aggregate transmission costs for large packet delays and a ?xed transmission cost model.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article