• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

nodes based Stable routing for mobile ad hoc network,UBICC Journal (0)

by A Kush V Rishiwal, Backbone S Verma
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

A Reliable routing algorithm for Mobile Adhoc Networks based on

by Arash Dana, Golnoosh Ghalav, Azadeh Ghalav, Fardad Farokhi
"... fuzzy logic ..."
Abstract - Add to MetaCart
fuzzy logic
(Show Context)

Citation Context

...n reaching their destinations. This is a good metric for comparing protocols and denotes how efficient the underlying routing algorithm is, because delay primarily depends on optimality of path chosen=-=[23]-=-. Throughput: It is defined as rate of successfully transmitted data per second in the network during the simulation. Throughput is calculated such that , it is the sum of successfully delivered paylo...

Stable Routing for achieving Quality of Service in wireless Sensor Networks

by Deepali Virmani, Satbir Jain
"... Networking in Wireless Sensor networks is a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Although lots of research has been done on supporting QoS in the Internet and other networks, but they are not suitable for wireless sensor ne ..."
Abstract - Add to MetaCart
Networking in Wireless Sensor networks is a challenging task due to the lack of resources in the network as well as the frequent changes in network topology. Although lots of research has been done on supporting QoS in the Internet and other networks, but they are not suitable for wireless sensor networks and still QoS support for such networks remains an open problem. In this paper, a new scheme has been proposed for achieving QoS in terms of packet delivery, multiple connections, better power management and stable routes in case of failure. It offers quick adaptation to distributed processing, dynamic linking, low processing overhead and loop freedom at all times. The proposed scheme has been incorporated using QDPRA protocol and by extensive simulation the performance has been studied, and it is clearly shown that the proposed scheme performs very well for different network scenarios.
(Show Context)

Citation Context

...at one hop distance from the said node. 2.1 Route Construction (RReq) Phase This scheme can be incorporated with reactive routing protocols that build routes on demand via a query and reply procedure =-=[13]-=- [14]. The scheme does not require any modification to the QDPRA’s[12] RReq (route request) propagation process. In this scheme when a source needs to initiate a data session to a destination but does...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University