1st review final1

20
Energy-Efficient Reliable Routing Considering Residual Energy in Wireless Ad-hoc Networks Guided by, Mrs.M.JEYA SUNDARI, Asst Prof/CSE DEPT, VPMMECW. Presented by, G.ANANTHI, K.ILLAKIYA.

Transcript of 1st review final1

Page 1: 1st review final1

Energy-Efficient Reliable Routing Considering Residual

Energy in Wireless Ad-hoc Networks

Guided by,Mrs.M.JEYA SUNDARI,Asst Prof/CSE DEPT,VPMMECW.

Presented by, G.ANANTHI, K.ILLAKIYA.

Page 2: 1st review final1

ENERGY SAVING Energy saving is the

meaning of energy conservation.

Conserving is a critical concern in the design of routing protocols for ad hoc networks.

Page 3: 1st review final1

Energy conservation refers to reducing energy consumption through using less of an energy service.

Because most of nodes operate with limited battery capacity and energy.

• For example : driving less is an example of energy

conservation.

Page 4: 1st review final1

Energy conservation and efficiency are both

energy reduction techniques.

Even though energy conservation reduces

energy services.

It can result to increase the reliability

Page 5: 1st review final1

ABSTRACT• The two novel energy-aware routing

algorithms for wireless ad hoc networks, called RMECR and RMER.

• RMECR is able to find energy-efficient and reliable routes.

• These algorithms used to increase the lifetime of the node .

Page 6: 1st review final1

Analysis

1.Existing system2.Proposed system

Page 7: 1st review final1

EXISTING SYSTEM It should not result in

finding less reliable routes or overusing a specific set of nodes in the network.

It does not consider the remaining battery energy.

Page 8: 1st review final1

Disadvantages

It has less reliable.

It can’t increase the operational life time of the

network.

Overusing the specific node.

Page 9: 1st review final1

PROPOSED SYSTEM We proposed a new

routing algorithm for wireless ad hoc networks namely RMECR.

It increase the battery life time.

Page 10: 1st review final1

We proposed networks for retransmission:

Hop-by-hop (or)

End-to-end

Page 11: 1st review final1

ALGORITHM RMECR

It finds routes which require least amount of energy for reliable packet transfer.

The remaining battery energy which is consumed by a node to forward a packet.

Include the energy consumed for retransmission of the packets as well,

When the packet (or) its acknowledgement is lost.

Page 12: 1st review final1

Advantages We used a detailed energy consumption model

for packet transfer.

It extends the network lifetime.

It also having more amount of battery energy.

It ensure the reliablity and retransmission.

Page 13: 1st review final1

LITERATURE SURVEY MINIMUM ENERGY PATHS FOR RELIABLE COMMUNICATION IN MULTI-HOP WIRELESS NETWORK

Minimum-energy routing in wireless network a typically select minimum-cost multi-hop paths.

The transmission power is fixed.

Page 14: 1st review final1

We are using the energy aware routing

algorithm.

These algorithm select a path with a large

number of small distance hops.

A formulation based on solely on the energy

spent in a single transmission is misleading.

Page 15: 1st review final1

Characteristics The battery power available on the constituent

lightweight mobile nodes.

Communication costs are often much higher

than computing costs.

To ensure the reliable packet delivery.

Page 16: 1st review final1

Advantage It reliably delivering the packet to final

destination.

That have identical error rates.

It will frequently used to forward packets.

Page 17: 1st review final1

Disadvantage Less number of retransmission.

Nodes along this method will fail quickly.

The life time of the battery is to low.

Do not considered the remaining battery

energy.

Overusing of nodes.

Page 18: 1st review final1

REFERENCE [1] D.S.J. De Couto, D. Aguayo, J. Bicket, and R.

Morris, “A HighThroughput Path Metric for Multi-Hop Wireless Routing,” Proc. ACM MobiCom, pp. 134-146, 2003.

[2] S. Singh and C. Raghavendra, “PAMAS—Power Aware MultiAccess Protocol with Signalling for Ad Hoc Networks,” ACM Computer Comm. Rev., vol. 28, pp. 5-26, 1999.

[3] S. Banerjee and A. Misra, “Minimum Energy Paths for Reliable

Communication in Multi-Hop Wireless Networks,” Proc. ACM in 2012.

Page 19: 1st review final1

[4] J. Gomez, A.T. Campbell, M. Naghshineh, and C. Bisdikian,

“PARO: Supporting Dynamic Power Controlled Routing in

Wireless Ad Hoc Networks,” Wireless Networks, vol. 9, no.5,

pp. 443-460, 2003. [5] S. Banerjee and A. Misra, “Minimum Energy Paths

for Reliable Communication in Multi-Hop Wireless Networks,”

Proc. ACM MobiHoc, pp. 146-156, June 2002.

Page 20: 1st review final1

Thank You