Results 1 
4 of
4
An entropybased stability QoS routing with priority scheduler in MANET using fuzzy controllers *
"... Abstract: This paper proposes an Entropybased Stability QoS Routing with Priority scheduler in MANET using fuzzy controllers (ESQRP). The key idea of ESQRP algorithm is to construct the new metricentropy and select the stability path with the help of entropy metric to reduce the number of route re ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract: This paper proposes an Entropybased Stability QoS Routing with Priority scheduler in MANET using fuzzy controllers (ESQRP). The key idea of ESQRP algorithm is to construct the new metricentropy and select the stability path with the help of entropy metric to reduce the number of route reconstruction so as to provide QoS guarantee in the ad hoc network. The simulation results show that the ESQRP approach provides an accurate and efficient method to estimate and evaluate the route stability in dynamic mobile networks. Key words: mobile ad hoc network; quality of service; fuzzy controllers; entropy; routing 1.
EnergyEfficient Routing in Wireless Sensor Networks to Improve the Life Time of Sensor Nodes
"... AbstractEnergyefficient routing is a critical problem in multihop WSN due to the severe power consumption of wireless nodes, the research on routing algorithm is pivotal in the architecture of WSN. This paper analyzes the implementation and existing issues in LEACH. Specifically for node energy an ..."
Abstract
 Add to MetaCart
(Show Context)
AbstractEnergyefficient routing is a critical problem in multihop WSN due to the severe power consumption of wireless nodes, the research on routing algorithm is pivotal in the architecture of WSN. This paper analyzes the implementation and existing issues in LEACH. Specifically for node energy and the network lifetime, it proposes an energyefficient routing algorithm based on cycleswitching cluster head. It improves node energy efficiency, balances energy consumption of all sensor nodes, enhances reliability of data transmission and increase network lifetime in comparison to LEACH. Simulation results showed that the algorithm is efficient. Moreover, the protocol increases the balance of energy dissipation, scalability and reliability of WSN. Applications of Sensor Networks In the recent past, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics [6][8]. The sensor networks can be used in Disaster Relief, Emergency
An Efficient Distributed Broadcasting Algorithm based on Cross Layer Design for Ad Hoc Networks*
"... Abstract In this paper we propose a broadcast algorithm for Ad hoc Networks based on CrossLayer design concept. It improves the broadcasting mechanism in the wireless Ad hoc networks. We modify Joint Distance Counter Threshold (JDCT) protocol to implement our algorithm called Adaptive Distance Cou ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract In this paper we propose a broadcast algorithm for Ad hoc Networks based on CrossLayer design concept. It improves the broadcasting mechanism in the wireless Ad hoc networks. We modify Joint Distance Counter Threshold (JDCT) protocol to implement our algorithm called Adaptive Distance Counter Threshold Algorithm (ADCT). The algorithm runs in a distributed manner by each node in the network without needing any global information. Each node in an ad hoc network uses the parameters of Physical layer and Network layer and makes a scheduling decision by using these parameters. Local adaptation of these parameters to achieve required results improves broadcasting decisions by altering the directed topology graph, feasible transmission schedules, and payload transmission rates. The simulations results demonstrate that ADCT algorithm based on the CrossLayer information has better reachability, less latency and greater throughput
A Localized Algorithm for Reducing the Size of Dominating Set in Mobile Ad Hoc Networks
"... Connected dominating set based routing is a promising approach for enhancing the routing efficiency in the mobile ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is an NPcomplete problem. Restricted Rule k is a localized algorithm for finding a small dominating se ..."
Abstract
 Add to MetaCart
(Show Context)
Connected dominating set based routing is a promising approach for enhancing the routing efficiency in the mobile ad hoc networks. However, finding the minimum dominating set in an arbitrary graph is an NPcomplete problem. Restricted Rule k is a localized algorithm for finding a small dominating set in mobile ad hoc networks. It starts with a large initial dominating set and uses the local information of all neighbors of a node to attempt to remove the node from the set. In this paper, instead of using a large initial set, we use a rather small number of nodes as the initial set and then reduce the size of the set with Rule k algorithm. The small initial set is generated by a distributed NLogN algorithm with lower computational complexity than Rule k. The simulation results show that using the small set generated with NLogN algorithm as the initial set can make Rule k algorithm to achieve better performance. 1.