An Efficient Selfishness Aware Routing in Delay Tolerant Networks
Journal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.2, No. 5)Publication Date: 2013-05-30
Authors : N.Senthilkumar; T.V U. Kiran Kumar;
Page : 1279-1283
Keywords : Detection; Disruption Tolerant Networks; Mitigation; Routing Misbehavior; Security;
Abstract
Delay Tolerant Networks (DTNs) enable data transfer when mobile nodes are onlyintermittently connected. DTN routing usually follows store-carry-and-forward mechanism. Therefore,the willingness of nodes to relay messages for other nodes plays a significant role in the routing process.Moreover, since the resources in mobile devices are generally limited, carriers of mobile devices maybe unwilling to relay messages for other nodes in order to conserve their scarce resources. Whenconsidering routing in DTNs, such selfish nodes have to be considered. Existing routing algorithmsdetects routing misbehavior can be caused by selfish nodes that are unwilling to spend resources suchas power and buffer on forwarding packets of others, or caused by malicious nodes that drop packets tolaunch attacks. To mitigate routing misbehavior by limiting the number of packets forwarded to themisbehaving nodes. Many challenges considers of selfishness of users who prefer to relay data forothers with strong social ties. Such social selfishness of users is a new constraint in network protocoldesign. Proposed work carries Social Selfishness Aware Routing (SSAR) algorithm to allow userselfishness and provide better routing performance in an efficient way. SSAR considers both users’willingness to forward and their contact opportunity, resulting in a better forwarding strategy.
Other Latest Articles
- A Novel Method for Road Extraction from Satellite Images
- Improve Power Quality Problem Using Series Compensator
- Improved Shear Performance of Bent-Up Bars in Reinforced Concrete Beams
- Simulation of Proximity Effect in Transformer Due to Harmonic Loads
- A Heterogeneous Fleet Vehicle Waste Collection Problem with Various Zones and Intermediate Facilities
Last modified: 2014-10-18 18:47:05