192 ENERGY EFFICIENT ROUTING MODEL IN MOBILE AD-HOC NETWORKS USING DYNAMIC SOURCE ROUTING PROTOCOL

(1)

International Journal of Engineering Technology and Computer Research (IJETCR) Available Online at www.ijetcr.org

Volume 5; Issue 4; July-August: 2017; Page No. 192-199 Journal Approved by UGC

Corresponding author:S. SASIKALA

192

ENERGY EFFICIENT ROUTING MODEL IN MOBILE AD-HOC NETWORKS USING DYNAMIC SOURCE ROUTING PROTOCOL

S. SASIKALA

PhD. Research Scholar, SreeSaraswathithyagaraja College, Pollachi.

Dr. D. SUGANYADEVI

Assistant Professor, Govt. Arts College, Coimbatore.

Abstract

Mobile Ad hoc Networks (MANETs) consists of a set of wireless mobile nodes communicating to each other without any centralized control or fixed network infrastructure and can be deployed quickly. The potential applications include emergency disaster relief, battlefield situations, mine site operations, and wireless classrooms or meeting rooms in which participants wish to share information or to acquire data. Anycast is an important way of communication for replicated service applications in terms of resources, robustness and efficiency, when mobility and link disconnections are frequent. Anycast allows a source node to transmit packets to a single destination node out of set of several destination nodes. We propose a mobility and quality of service aware routing scheme in MANETs that employs node movement stability model. These models are used in the route discovery process to select nearest k-servers. A server among k-servers is selected based on less congestion, route expiry time, number of hops, and better stability. The simulation results indicate that proposed method demonstrates reduction in control overheads, path delays and improved packet delivery ratio compared to existing methods such as queue utilization, residual energy and node degree. Which in turn saves more energy; hence our proposed model proves to be more energy efficient.

Keywords: [Energy efficient Routing, MANET, DSR Protocol, Route discovery, Maintenance]

1. Introduction

Mobile Ad hoc Networks (MANETs) consists of a set of wireless mobile nodes communicating to each other without any centralized control or fixed network infrastructure and can be deployed quickly.

The potential applications include emergency disaster relief, battlefield situations, mine site operations, and wireless classrooms or meeting rooms in which participants wish to share information or to acquire data. Anycast is an important way of communication for replicated service applications in terms of resources, robustness and efficiency, when mobility and link disconnections are frequent. Anycast allows a source node to transmit packets to a single destination node out of set of several destination nodes. The idea behind anycast is that a client wants to send packets to any one of the nearest possible servers offering a particular service or application. The set of destination nodes is identified by anycast address. As compared to

unicast and multicast, anycast is a new type of communication defined in IPv6 that provides a service mainly in client server environment.

Constructing and maintaining anycast communication should be simple so as to keep minimum control overheads. It is a common practice in most of the anycast routing protocols, where in packets are sent along the shortest path.

This is because fewer nodes involved in transmission may save the power, network bandwidth and collisions during the message transmission.

The idea behind anycast is that a client wants to send packets to any one of the nearest possible servers offering a particular service or application.

The set of destination nodes is identified by anycast address. As compared to unicast and multicast, anycast is a new type of communication defined in IPv6 that provides a service mainly in client server environment. Constructing and maintaining anycast communication should be simple so as to keep

(2)

193

minimum control overheads. It is a common practice in most of the anycast routing protocols, where in packets are sent along the shortest path.

This is because fewer nodes involved in transmission may save the power, network bandwidth and collisions during the message transmission.

In existing we explore tremendous traffic demands for ubiquitous access and emerging multimedia applications significantly increase the energy consumption of battery-powered mobile devices.

This trend leads to that energy efficiency (EE) becomes an essential aspect of mobile ad hoc networks (MANETs). In this paper, we explore EE optimization as measured in bits per Joule for MANETs based on the cross-layer design paradigm.

We model this problem as a non convex mixed integer nonlinear programming (MINLP) formulation by jointly considering routing, traffic scheduling, and power control. Because the non convex MINLP problem is NP-hard in general, it is exceedingly difficult to globally optimize this problem.

With recent advances in information and communication technology (ICT), MANETs are able to support high network capacity and proliferating multimedia services, such as video on-demand, surveillance, remote education, and health monitoring, etc. MANET traffic produced for ubiquitous access and multimedia applications with quality of service (QoS) requirements considerably increase energy exhaustion of mobile devices.

Energy is a scarce resource for mobile devices, which are typically driven by batteries with limited capacities. Further, progress in battery technology is slow and expected to improve little in the near future.

2. Problems in existing work:

• Route computation is carried out at the cluster head nodes only; the movement of the cluster nodes adversely affects the performance of the protocol.

• Also, the cluster node update information could cause a significant amount of control overhead.

• Thus the main drawback of the tree based protocols is that they are not robust enough to operate in highly mobile environments.

2.1 PROPOSED SYSTEM

In our proposed work the scheme uses Dynamic Source Routing (DSR) as basic route finding protocol along with stability and QoS models. Our contributions as compared to existing works are as follows. (1) Designing a mathematical model for selecting stable nodes (with respect to position) based on node’s own stability, i.e., self-stability, and neighbor nodes stability. (2) Designing a mathematical model for selecting non congested nodes based on channel load and node buffer occupancy. (3) Designing a mathematical model for finding link expiry time between pair of nodes. (4) Design of route discovery process, which includes request phase to find routes to anycast servers through forwarding intermediate nodes which satisfy stability, congestion criteria and also meet the route expiry deadline; and reply phase to update routing cache and confirm the routes found in request phase, and (5) designing route maintenance procedure to handle node and link failures.

List of process Routing Phase - DSR Protocol

 Initialization

 Route Discovery

 Rote Maintenance

3. ROUTING PHASE - DSR PROTOCOL 3.1 Initialization

Dynamic source routing (DSR) is an on-demand reactive routing protocol designed to restrict the bandwidth consumed by control packets, by eliminating the periodic table update messages required in the table driven proactive approach. It uses source routing instead of relying on the routing table at each intermediate node. DSR is beaconless and hence does not require periodic hello packet transmissions. Route construction phase establishes a route by flooding route request (RR) packets in the network. An intermediate node, upon receiving a RR packet, checks the sequence number on the packet before forwarding it.

The packet is forwarded only if it is not duplicate RR. The sequence number on the packet is used to prevent loop formation. RR packet updates itself with traversed nodes address, which will facilitate in path construction. The destination node, on receiving a RR packet, responds by sending a route

(3)

194

reply (RP) packet to the source by using traversed addresses. Thus source will have the address to destination through intermediate nodes. Even though DSR protocol performs well in static and low mobility environment, the performance degrades rapidly with increasing mobility. To enhance the performance, we use modified DSR and call it as Mobility and QoS aware Anycast Routing in Mobile ad hoc Networks (MQAR). Our protocol (MQAR) works better under dynamic and high mobility environment, since we include stability model to identify more stable nodes, congestion model to check traffic on the channel dynamically and link expiry model to check duration of the link, so that selected path will stay for longer duration in anycast routing.

3.2 Route Discovery

We modify Dynamic Source routing (DSR) by applying parameters supported by stability, congestion and route expiry models in route establishment phase. Routing considers the parameters at each node for route request propagation and path(s) finding between client and servers. It also uses routing information cache (RIC) at each node that facilitates route finding by providing path information from the existing database. RIC will reduce route request propagation overheads. This section presents databases, route request (RR) packets, route reply (RP) packets, route error (RE) packets, and RIC. Each node maintains a link data base which contains destination servers id, next hop node id, distance from the node to anycast servers, Where C1,C2 and C3 are client machines that generate anycast packets. I1 to I9 are the intermediate nodes and S1 to S3 are server machines that have the same anycast address A1. Connectivity of the network indicates distance on each link.

RR, RP and RE Packets

To create an anycast shortest route in a MANET from client to server, various control packets such as route request (RR), route reply (RP) and route error (RE) packets are used. In this section, we describe some of the control packet components required to create stable and non congestion paths.

Some important fields of RR packet are as follows.

Client address: It is the address of the client from where the path needs to be established to one of nearest servers in the network.

Server address: It is the address of the server where packet has to be forwarded. It helps in accommodating the route created by RR packets and RP packets.

Next hop address: It is the address of the neighbor connected with in the transmission range for propagating RR.

The field is updated at every hop Sequence number:

The sequence number assigned to every packet delivered by the client uniquely identifies the packet. It is used to avoid multiple transmission of the same RR packet.

Route record: It has the addresses of the visited previous nodes recorded in visiting sequence. This information will be used during the return journey to RR packet originator by corresponding RP packet.

Number of hops: It is the number of hops travelled by RR packet to reach the destination server, which is updated by one at every hop.

Time to live: It is the number of hops RR packet can travel. The field is decremented by one after every hop.

Figure1: Network Topology

3.3 Route Maintenance

The packet format for anycast routing is almost similar to RR packet with few changes in RR packet.

The changes in RR packet to convert it into RP packet are as follows: When RR packet reaches the

(4)

195

server from the designated client, client address and server address are interchanged, RR packet contains the list of nodes along the route it has travelled (route record is reversed). RP packet from the server is sent to client on a route given in its route record. Next hop address will be picked from the route record at every hop. RE packet is generated when a node is unable to send the packets either due to link failure or congestion.

Some of the fields of this packet are client address, server address, route record and sequence number.

Whenever a node identifies link failure, it generates RE packet to either client or server. If link failure occurs in forward journey of a RR packet (from client to server), RE packet is sent to the client. On the other hand if link failure occurs during journey of the RP packet (from server to the client), RE packet is sent to the server. Intermediate nodes receiving RE packet updates their route information cache by removing paths having failed links and also examine its route cache for an alternate path. If an alternate path is found, it modifies the route, otherwise forwards RE packet to server.

3.2.1 Routing Information Cache (RIC)

RIC is used to store the latest routes to servers learned through RR and RP packets. This avoids unnecessary route discovery operation each time when a data packet is to be transmitted. This

reduces delay, bandwidth consumption, and route discovery overhead. A single route discovery may yield many routes to anycast server, due to intermediate nodes replying from local caches.

When client node learns that a route to server node is broken, it can use another route from its local cache, if such a route to server exists in its cache.

Otherwise, client node initiates route discovery by sending a route request. Use of RIC can speed up route discovery and it can reduce propagation of route requests. The contents of RIC will be removed at every periodic interval.

Anycast address: It is the anycast group address attached to different servers where packet has to be forwarded from required client (extracted from RP packet server address and route record). It helps in accommodating the routes for RR packets.

Path information: It represents a complete path (a sequence of links).

RET: It is the minimum value of LET of all intermediate nodes selected from client to the server.

Hops: It is number of hops required to reach the server via the path.

Recorded Timestamp: It contains the time at which RIC is updated by using RP packet.

Figure 2: Node initialization using DSR protocol Figure 3: Node Communication using DSR protocol

(5)

196

3. Results and Discussions

No of Users Accuracy(milli.secs)

2000 1.70

3000 4.50

4000 4.80

5000 4.90

Table 1: Counter Time Ratio

Figure 4: Counter time ratio

No of Users Reach ability(milli.secs)

1000 0.50

2000 0.90

3000 2.40

4000 3.40

Table 2: Reach Ability Ratio

(6)

197

Figure 5: Reach ability ratio

No of Users Random Trip Time(milli.secs)

1000 0.25

2000 1.90

3000 2.10

4000 3.80

5000 0.80

Table 3: Random Trip Time

Figure 6: Random Trip Time

No of Users Re-Transmission Time(milli.secs)

1000 0.20

2000 0.80

3000 2.20

4000 2.40

Table 4: Re-Transmission Time

Figure 7: Re-transmission Time

(7)

198 No of Users Scalability Ratio(milli.secs)

1000 0.30

2000 0.60

3000 1.50

4000 2.10

Table 5: Scalability Ratio

Figure 8: Scalability ratio

The above table (table 1 to table 5) and figures (figure 4 to figure 8) indicates that there is a significant improvement in the proposed method, the following factors are measured, Counter Time Ratio, reachability ratio, random trip time, scalability ratio, retransmission time. The above results prove that even when the number of users increases the efficiency of the method is stable.

Conclusions

Node’s movement stability, channel load, node congestion level and route expiry time are the important QoS metrics among several QoS parameters for providing an efficient, low overhead QoS support for anycast routing in MANETs. We proposed mobility and QoS based anycast routing in MANETs. In future, improve this process security as digital signature security frame work and our proposed security scheme for centralized topology networks, so in future we improve this security using digital signature security technique for decentralized large level networks topologies.

Simulation procedure for the proposed scheme is as follows. (1) Generate ad hoc network with given number of nodes. (2) Estimate neighbor stability

based on self-node movement stability and neighbor node movement stability. (3) Compute link congestion factor based on channel congestion and buffer congestion factors This frame work achieves high security, more energy efficiency, high packet delivery ratio, only less delay, comparing to previous frame works.

References

1. Y. Shi, Y. T. Hou, S. Kompella, and H. D. Sherali,

‘‘Maximizing capacity in multihop cognitive radio networks under the SINR model,’’ IEEE Trans. Mobile Comput., vol. 10, no. 7, pp. 954–

967, Jul. 2011.

2. Y. Shi, Y. T. Hou, and H. D. Sherali, ‘‘Cross-layer optimization for data rate utility problem in UWB-based ad hoc networks,’’ IEEE Trans.

Mobile Comput., vol. 7, no. 6, pp. 764–777, Jun.

2008.

3. Y. Shi, Y. T. Hou, J. Liu, and S. Kompella,

‘‘Bridging the gap between protocol and physical models for wireless networks,’’ IEEE Trans. Mobile Comput., vol. 12, no. 7, pp. 1404–

1416, Jul. 2013.

(8)

199

4. D. Feng, C. Jiang, G. Lim, L. J. Cimini, Jr., G. Feng, and G. Y. Li, ‘‘A survey of energy-efficient wireless communications,’’ IEEE Commun.

Surveys Tuts., vol. 15, no. 1, pp. 167–178, first quarter 2013.

5. C. Isheden, Z. Chong, E. Jorswieck, and G.

Fettweis, ‘‘Framework for link-level energy efficiency optimization with informed transmitter,’’ IEEE Trans. Wireless Commun., vol. 11, no. 8, pp. 2946–2957, Aug. 2012.

6. G. Miao, N. Himayat, and G. Y. Li, ‘‘Energy- efficient link adaptation in frequency-selective channels,’’ IEEE Trans. Commun., vol. 58, no. 2, pp. 545–554, Feb. 2010.

7. S. Gao, L. Qian, and D. Vaman, ‘‘Distributed energy efficient spectrum access in cognitive radio wireless ad hoc networks,’’ IEEE Trans.

Wireless Commun., vol. 8, no. 10, pp. 5202–

5213, Oct. 2009.

8. F. Meshkati, H. V. Poor, S. C. Schwartz, and N. B.

Mandayam, ‘‘An energy-efficient approach to power control and receiver design in wireless data networks,’’ IEEE Trans. Commun., vol. 53, no. 11, pp. 1885–1894, Nov. 2005.

9. F. Meshkati, H. V. Poor, S. C. Schwartz, and R. V.

Balan, ‘‘Energyefficient resource allocation in wireless networks with quality-of-service constraints,’’ IEEE Trans. Commun., vol. 57, no.

11, pp. 3406–3414, Nov. 2009.

10. C. U. Saraydar, N. B. Mandayam, and D. J.

Goodman, ‘‘Efficient power control via pricing in wireless data networks,’’ IEEE Trans.

Commun., vol. 50, no. 2, pp. 291–303, Feb.

2002.

11. D. W. K. Ng, E. S. Lo, and R. Schober, ‘‘Energy- efficient resource allocation in OFDMA systems with large numbers of base station antennas,’’

IEEE Trans. Wireless Commun., vol. 11, no. 9, pp. 3292–3304, Sep. 2012.

12. D. W. K. Ng, E. S. Lo, and R. Schober, ‘‘Energy- efficient resource allocation in multi-cell OFDMA systems with limited backhaul

capacity,’’ IEEE Trans. Wireless Commun., vol.

11, no. 10, pp. 3618–3631, Oct. 2012.

13. D. W. K. Ng, E. S. Lo, and R. Schober, ‘‘Wireless information and power transfer: Energy efficiency optimization in OFDMA systems,’’

IEEE Trans. Wireless Commun., vol. 12, no. 12, pp. 6352–6370, Dec. 2013.

14. K. T. K. Cheung, S. Yang, and L. Hanzo,

‘‘Achieving maximum energy-efficiency in multi- relay OFDMA cellular networks: A fractional programming approach,’’ IEEE Trans. Commun., vol. 61, no. 8, pp. 2746–2757, Jul. 2013.

15. Q. Zhao and L. Tong, ‘‘Energy efficiency of large- scale wireless networks: Proactive versus reactive networking,’’ IEEE J. Sel. Areas Commun., vol. 23, no. 5, pp. 1100–1112, May 2005.

16. J. Zhang, L. Fei, Q. Gao, and X.-H. Peng, ‘‘Energy- efficient multihop cooperative MISO transmission with optimal hop distance in wireless ad hoc networks,’’ IEEE Trans. Wireless Commun., vol. 10, no. 10, pp. 3426–3435, Oct.

2011

17. D. Yue, G. Guillén-Gosálbez, and F. You, ‘‘Global optimization of large-scale mixed-integer linear fractional programming problems: A reformulation-linearization method and process scheduling applications,’’ AIChE J., vol. 59, no.

11, pp. 4255–4272, 2013.

18. E. B. Bajalinov, Linear-Fractional Programming:

Theory, Methods, Applications and Software.

New York, NY, USA: Springer, 2003.

19. T. Clausen and P. Jacquet, Optimized Link State Routing Protocol (OLSR), document RFC 3626, IETF, Oct. 2003;. [Online]. Available:

http://www.ietf.org/rfc/rfc3626.txt.

20. D. Johnson, Y. Hu, and D. Maltz, The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4, document RFC 4728, IETF, Oct. 2003. [Online]. Available:

http://www.ietf.org/rfc/rfc4728.txt