scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

A power aware multicast on-demand routing with load balancing

TL;DR: A routing algorithm for multicasting that ensures efficient utilization of power for each mobile node and the reliability issues are addressed within Power Aware Multicast on-demand Routing (PAMOR) through the provision of multipath between a pair of nodes.
Abstract: Energy efficient communication in mobile ad hoc networks (MANET) is a very stringent issue due to the power-constraint in each mobile node. Thus designing a suitable energy efficient multicast routing protocol for optimum use of existing power and to render good system performance simultaneously is a real challenge. In this paper, we proposed a routing algorithm for multicasting that ensures efficient utilization of power for each mobile node. The reliability issues are also addressed within Power Aware Multicast on-demand Routing (PAMOR) through the provision of multipath between a pair of nodes. Provision of multipath not only increases the reliability of the network but also helps to use equivalent paths for load balancing within MANET. Moreover, multipath can also serve as an alternative path in case of link breakage while avoiding an extra overhead for path discovery methods. Thus the proposed protocol PAMOR is expected to perform satisfactory in terms of power consumption as well as for bandwidth utilization.
Citations
More filters
Proceedings ArticleDOI
12 Jun 2015
TL;DR: In MANET during real time traffic multicasting, there is increased energy consumption and delay, so the proposed Node connectivity, Energy and Bandwidth Aware Clustering Routing Algorithm is designed to overcome this issue.
Abstract: Mobile ad hoc network (MANET) is a decentralized communication network‥ In MANET during real time traffic multicasting, there is increased energy consumption and delay. In order to overcome this issue we propose to design Node connectivity, Energy and Bandwidth Aware Clustering Routing Algorithm. An efficient ENB cluster head selection algorithm [1] based on the combination of important matrices Residual Energy (E), Node connectivity (C) and Available Bandwidth (B) is considered for election of the cluster head efficiently. The multimedia stream splits into multiple sub-streams prior to transmission using Top-N rule selection approach algorithm [2]. Shortest path multicast tree construction algorithm [3] to transmit the real time traffic effectively among the nodes in MANETS. Using the cluster head as group leaders and cluster members as leaf nodes, a shortest path multicast tree is established. With the help of constructed shortest path multicast tree we are proposing Node connectivity, Energy and Bandwidth Aware Clustering Routing Algorithm.

10 citations


Cites background from "A power aware multicast on-demand r..."

  • ...[12] Shilpa Banerjee, Piu Bera, S. Choudhury and Moitreyee Dasgupta, “A Power Aware Multicast On-demand Routing with Load Balancing”, IEEE 2nd International Conference on Computer Technology and Development (ICCTD 2010), 2010....

    [...]

  • ...Choudhury and Moitreyee Dasgupta [12] have proposed a routing algorithm where load balancing problem is achieved....

    [...]

  • ...Shilpa Banerjee, Piu Bera, S. Choudhury and Moitreyee Dasgupta [12] have proposed a routing algorithm where load balancing problem is achieved....

    [...]

Proceedings ArticleDOI
22 Mar 2017
TL;DR: This paper is proposing Trust value updation algorithm for cluster head were trust value has to be updated or refreshed for a time interval so as to select the new cluster head as the nodes are continuously moving.
Abstract: In a cluster based routing algorithm for mobile ad hoc network cluster head plays a very important role in communication between clusters. Selection of cluster head plays a very vital role. But if the selected cluster head node itself becomes selfish or malicious node, it will affect the performance of the entire cluster communication and hence hampers the throughput and efficiency of the MANET. Trust has to be established for the all the nodes in the cluster. Hence trust management plays a very important role. Clusters are formed based on 1-Hop distance. Within the clusters trust value of all the nodes are calculated using challenge evaluation algorithm to identify malicious node and selfish node. With the help of Rating friend's algorithm a node rates its nearest neighbors so as to make the network more robust in terms of reliability and gather data about each other to populate a friends list. Later trust value is calculated for each node depending upon the above mentioned algorithms and stored in friend list. Node with a highest trust value will be considered for cluster head selection. Then considering the bandwidth, power and connectivity of the node cluster head is selected. In this paper we are proposing Trust value updation algorithm for cluster head were trust value has to be updated or refreshed for a time interval so as to select the new cluster head as the nodes are continuously moving. The effectiveness of this proposed algorithm in comparison with Power Aware On-demand Multicast Routing (PAOMR) algorithms is evaluated through simulation. The proposed in comparison to previous technique alleviates the energy consumption and provides reduced delay.

8 citations


Cites methods from "A power aware multicast on-demand r..."

  • ...The proposed trust based and Bandwidth Aware Clustering Algorithm (TEBACA) is compared with the Power Aware On-demand Multicast Routing (PAOMR) technique [10]....

    [...]

Dissertation
01 Dec 2012
TL;DR: Two techniques to enhance the lifetime of MANET are proposed: Distance Based Topology Control with Sleep Scheduling (DBSS), and Alternate Path based Power Management using Clustering (APMC).
Abstract: Now-a-days more and more devices are getting portable. This have encouraged the development of mobile ad hoc networks (MANET). In addition to device portability, MANET does not require, a pre-established network infrastructure. As a result they can be easily deployed in situations like emergency rescue and disaster management.However, there are certain issues that are inherent to MANET such as hidden and exposed terminal problem, limited bandwidth, limited processing and battery power.These issues need to be addressed for successful deployment of MANET.Nodes in MANET are run by battery power. Sometimes, it is difficult to replace and/or re-charge the battery. Therefore, to increase the longevity of the network, the available battery power must be judiciously used. In this thesis we have proposed two techniques to enhance the lifetime of MANET. They are: (i) Distance Based Topology Control with Sleep Scheduling (DBSS), and (ii) Alternate Path based Power Management using Clustering (APMC).DBSS is based on topology control method. In DBSS the network topology is modified by adjusting the node’s transmission power. Nodes that is geographically closer to the destination node is selected as the next-hop node for routing the traffic. Nodes that are not involved in on-going transmission are put to sleep state, to conserve energy. APMC is based on transmission power management method. In APMC node disjoint alternate paths are computed. The traffic is routed through k-alternate paths,so that no nodes on a path depletes its energy at a faster rate than other nodes. A clustering mechanism is employed to control the routing activity. The network is logically divided into number of clusters. A node within each cluster is selected as cluster-head. In the absence of traffic cluster-head put the nodes on that path to sleep state to conserve energy. We have compared the proposed schemes, with existing ones through simulation. It is observed that, the proposed scheme can enhance the longevity of the network. Simulation is performed using Qualnet simulator.

2 citations


Cites background from "A power aware multicast on-demand r..."

  • ...Power management is an important issue in MANET as devices are battery operated [28, 8]....

    [...]

Book ChapterDOI
01 Jan 2016
TL;DR: This paper proposes to design an energy and bandwidth aware clustering (EBAC) algorithm for real-time traffic multicasting in mobile ad hoc networks and shows that that proposed technique alleviates the energy consumption and provides a high delivery ratio with reduced delay and jitter.
Abstract: A mobile ad hoc network (MANET) is a collection of mobile wireless nodes that can dynamically form a network without using any pre-existing infrastructure. Due to characteristics such as temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In mobile ad hoc networks, during real-time traffic multicasting there is increased energy consumption and delay. MANETs are highly dynamic because of frequent node movements, therefore network connectivity has to be maintained during multicast routing. To improve the QoS (quality of service) metrics including delay and bandwidth, the residual energy and available bandwidth have to be estimated accurately. Our objective is to reduce and balance the useful energy consumption for multicast algorithms maintaining good connectivity among all participating mobile nodes, and to maximize the lifetime of the networks. In order to overcome this issue, in this paper we propose to design an energy and bandwidth aware clustering (EBAC) algorithm for real-time traffic multicasting in mobile ad hoc networks. An efficient ENB cluster head selection algorithm based on the combination of important matrices residual energy (E), node connectivity (C), and available bandwidth (B) is used for the selection of the cluster head efficiently in mobile ad hoc networks. Using the cluster heads as group leaders and members as leaf nodes, a shortest-path multicast tree is established using the shortest-path multicast tree construction algorithm. This helps in transmitting multimedia data to different receivers. The multimedia traffic stream is split into multiple substreams prior to transmission using the Top-N rule selection approach algorithm. By simulation results, we show that that proposed technique alleviates the energy consumption and provides a high delivery ratio with reduced delay and jitter.

2 citations

Proceedings ArticleDOI
04 May 2017
TL;DR: This work proposed method energy for routing in MANET and based on signal strength, where value of RSS is greater than Th_RSS than intermediate node, which will send RREQ packet next node otherwise drop the packet.
Abstract: MANET is kind of mobile ad hoc network. MANETs are having self organizing and self configuring network and there is no centralized base station. In routing forwarding the data packets on one node to another node is core problem in the networks. Overcome to this problem to build up challenging task an efficient routing algorithm in MANET. Here we proposed method energy for routing in MANET and based on signal strength. Received Signal Strength (RSS) measured distance between two nodes. If value of RSS is greater than Th_RSS than intermediate node compare value of RSS and Th_RSS then accepted RREQ packet otherwise drop the packet and send to the next node it calculate node energy. If value of RSS is greater than Th_RSS than intermediate node will compare the value of residual energy RE with Energy_ threshold and value of queue length QLen with threshold of squeue length Th_QLen, then send RREQ packet next node otherwise drop the packet. This method is increases in network lifetime.

2 citations

References
More filters
Book
01 Jan 1996
TL;DR: In this paper, the authors discuss the effects of RF interference on GPS Satellite Signal Receiver Tracking (GSRSR) performance and the integration of GPS with other Sensors, including the Russian GLONASS, Chinese Bediou, and Japanese QZSS systems.
Abstract: Fundamentals of Satellite Navigation. GPS Systems Segments. GPS Satellite Signal Characteristics and Message Formats. Satellite Signal Acquisitions and Tracking. Effects of RF Interference on GPS Satellite Signal Receiver Tracking. Performance of Standalone GPS. Differential GPS. Integration of GPS with other Sensors. Galileo. The Russian GLONASS, Chinese Bediou, and Japanese QZSS Systems. GNSS Markets and Applications.

4,475 citations

Journal ArticleDOI
TL;DR: A comprehensive summary of recent work addressing energy efficient and low-power design within all layers of the wireless network protocol stack of wireless networks is presented.
Abstract: Wireless networking has witnessed an explosion of interest from consumers in recent years for its applications in mobile and personal communications. As wireless networks become an integral component of the modern communication infrastructure, energy efficiency will be an important design consideration due to the limited battery life of mobile terminals. Power conservation techniques are commonly used in the hardware design of such systems. Since the network interface is a significant consumer of power, considerable research has been devoted to low-power design of the entire network protocol stack of wireless networks in an effort to enhance energy efficiency. This paper presents a comprehensive summary of recent work addressing energy efficient and low-power design within all layers of the wireless network protocol stack.

958 citations


"A power aware multicast on-demand r..." refers background in this paper

  • ...According to the [14] another way of minimizing power consumption is suggested in EC-MAC protocols [14] in which MAC layer collisions are minimized as much as possible since they results in retransmissions....

    [...]

  • ...Minimum energy broadcasting has been addressed as NP-hard problem [14] and there have been several works for finding heuristics for this problem ([14])....

    [...]

Proceedings ArticleDOI
21 Sep 1999
TL;DR: The protocol, termed ODMRP (on-demand multicast routing protocol), is a mesh-based, rather than a conventional tree-based multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding).
Abstract: This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (on-demand multicast routing protocol), is a mesh-based, rather than a conventional tree-based multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP's scalability and performance via simulation.

795 citations

Journal ArticleDOI
TL;DR: It is proved that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.
Abstract: A cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also proposed. We define a power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d/sup /spl alpha// dependence for /spl alpha/ /spl ges/ 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis, of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.

757 citations