Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10763
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorChen, H-
dc.creatorLou, W-
dc.date.accessioned2015-07-14T01:32:23Z-
dc.date.available2015-07-14T01:32:23Z-
dc.identifier.issn0140-3664-
dc.identifier.urihttp://hdl.handle.net/10397/10763-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.subjectCooperative routingen_US
dc.subjectGroup featureen_US
dc.subjectOpportunistic networksen_US
dc.subjectResource constraintsen_US
dc.titleGAR : Group aware cooperative routing protocol for resource-constraint opportunistic networksen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage20-
dc.identifier.epage29-
dc.identifier.volume48-
dc.identifier.doi10.1016/j.comcom.2014.03.022-
dcterms.abstractOpportunistic networks are a new evolution of mobile ad hoc networks composed of intermittently connected nodes, in which the routing based on the dynamic topology is a challenging issue. In opportunistic networks, the mobile nodes with common interest or close relationship may form into groups and move together, which brings us a good feature to employ when designing the routing protocol for the resource-constraint opportunistic networks. Our main idea in this paper is to maximize the message delivery probability with the consideration of the group feature in the opportunistic network under the constraints of bandwidth and buffer space. Embedded this idea, we propose a cooperative routing protocol called GAR, which includes a cooperative message transfer scheme and a buffer management strategy. In the cooperative message transfer scheme, the limited bandwidth is considered and the message transfer priorities are designed to maximize the improved delivery probability. In the buffer management strategy, by considering the constraint of buffer space, we propose a cooperative message caching scheme and the dropping order of the messages is designed to minimize the reduced delivery probability. We also propose an improved strategy to utilize the extra contact duration between each pair of encountering nodes to further improve the performance. Finally, we conduct the simulations to demonstrate the effectiveness of our proposed GAR protocol under different network parameters.-
dcterms.bibliographicCitationComputer communications, 2014, v. 48, p. 20-29-
dcterms.isPartOfComputer communications-
dcterms.issued2014-
dc.identifier.scopus2-s2.0-84901814414-
dc.identifier.eissn1873-703X-
dc.identifier.rosgroupidr68069-
dc.description.ros2013-2014 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

27
Last Week
0
Last month
0
Citations as of Aug 28, 2020

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
4
Citations as of Oct 21, 2020

Page view(s)

123
Last Week
0
Last month
Citations as of Oct 18, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.