Congestion Controlled d-Adapt-OR for Adhoc Networks

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 3

Abstract

 Abstract: Opportunistic routing scheme is used to route data packet from source to destination. Broadcasting nature of the wireless networks is utilized here to send data packets. A suitable forwarder node is selected from the neighboring node based on the rank ordering of the nodes. The nodes are ranked according to a score called Estimated Best Score (EBS). This score is calculated by considering the network congestion which is one of the major problems in adhoc networks. Probability of unsuccessful delivery of the packet become very less. Different types of packets are used to communicate between different nodes. A distributed and asynchronous routing scheme is introduced to route the packet. The proposed routing scheme doesn’t require any initial knowledge about the network topology. Another problem with adhoc wireless networks is the presence of selfish nodes. For the successful delivery of the packet at the destination we have to avoid the presence of selfish nodes in the networks. So each node calculate the selfishness of its neighboring nodes. The data packet is forwarded by considering the selfishness of the node.

Authors and Affiliations

Devika Haridas

Keywords

Related Articles

 Dynamic Process Scheduling and Sequencing Using Genetic Algorithm

 Abstract: This paper present the implementation of genetic algorithm for operating system process scheduling. Scheduling in operating systems has a significant role in overall system performance and throughput. An...

Mining High Utility Itemsets from its Concise and Lossless Representations

Abstract: Mining high utility items from databases using the utility of items is an emerging technology.Recent algorithms have a drawback in the performance level considering memory and time.Novel strategy proposed here...

 Multipath Routing in Wireless Sensor Networks: A Survey and Analysis

 Abstract: Due to restricted communication range and high density of sensor nodes in wireless sensor network, forwarding packets is an important field of research in sensor networks. Nowadays, multipath routing appr...

 An Improved Feature Vector storage metric for fast Android Malware Detection Framework

Abstract: Android based devices are rapidly flourishing day-by-day, due to its ease of use and popularity. As a result, the number of malware attacks on Android is also increasing. This paper is based on the Text Mininga...

 Load Balancing In Public Cloud

 In present days cloud computing is one of the greatestplatform which provides storage of data in very lowercost and available for all time over the internet.But ithas more critical issue like security, load man...

Download PDF file
  • EP ID EP131765
  • DOI 10.9790/0661-16371317
  • Views 86
  • Downloads 0

How To Cite

Devika Haridas (2014).  Congestion Controlled d-Adapt-OR for Adhoc Networks. IOSR Journals (IOSR Journal of Computer Engineering), 16(3), 13-17. https://europub.co.uk/articles/-A-131765