International Journal of Computer Information Systems, Vol. 3, No.

3, 2011

Multipath energy aware Optimized Link State Routing protocol and protocol verification using Multiple Regression based Modeling
Radhika D. Joshi
Dept. of Electronics and Telecommunication Engineering College of Engineering Pune, India rdj.extc@coep.ac.in

Priti P. Rege
Dept. of Electronics and Telecommunication Engineering College of Engineering Pune, India ppr.extc@coep.ac.in

Abstract For Mobile Ad Hoc Networks (MANET), being infrastructureless and resource constrained, extending the lifetime of batteries is important. Open media and mobility make wireless mobile communication more complicated and the key issue is to route packets efficiently. We have tried multipath and residual energy based routing concepts with Optimized Link State Routing (OLSR) Protocol. Route selection is done based on energy efficient as well as least hop route in our multipath OLSR (MPOLSR). Network performance is tested against variation in simulation time, pause time, speed and node density for MPOLSR and OLSR protocols. Results show effective node energy utilization in MPOLSR. In this paper, we have tried to model the network behavior based on multiple regression method and simulation output. The work describes analytical modeling of the protocol performance to predict correct network behavior for future instances quickly without carrying out simulations. This technique helps in efficiently estimating the performance of network with modified protocol under study. Keywords- MANET; OLSR; routing; modeling;

important design aspect. Power conservation within the wireless protocol stack remains a very crucial research area for the viability of wireless services in the future [2]. The power required by each host for transmission is classified in two categories: i) Communication related power (Power CR) or active communication energy that includes processing power and transceiver power, ii) Noncommunication related power (Power NCR) or inactive energy. For the network, power consumption computation [3] is calculated as represented by (1), = (Power CR)/ (Power NCR) (1) It is necessary to reduce entire power requirement of the node and in turn of the network. Related to Power CR, Transmission Power control (TPC) and load distribution approaches are used. Energy saving can be obtained by routing packets over energy-efficient paths in Power-Aware Routing (PAR). Energy efficient routing is possible by considering, Power aware routing - trying to minimize total power consumption by choosing well-positioned neighbors for relaying packets. Cost aware routing attempting to increase hosts lifetimes by favoring hosts with more remaining battery power. Power-cost routing - combining above two approaches, to minimize overall power needed and also to avoid hosts with low power levels.

I.

INTRODUCTION

Next generation of mobile communications will include both prestigious infrastructured wireless networks and novel infrastructureless Mobile Ad hoc Networks. Wireless multi hop ad hoc networks prove to be superior where it is inconvenient or impossible for wired cable networks or services to reach the locations. Wireless network enables users to setup a network quickly, provides advantage in deployment, cost, size and distributed intelligence over wired networks. Wireless networks are inherently resource-constrained as they have limited bandwidth, energy, and computational capacity. Other features such as open media and mobility also make wireless mobile communication more complicated. Hence the key issue is how to route packets efficiently. Since the mobile nodes have limited battery power, it is very important to use energy efficiently in ad hoc networks. Battery power being limited, extending the lifetime of batteries is an important issue, especially for MANETs [1]. Wireless services continue to add more capabilities such as multimedia and Quality of service (QoS), low power design remains an

Power efficient routing protocols should select the best path to minimize the total power needed to route the packets on the network and maximize the lifetime of nodes [4, 5]. II. A. LITERATURE SURVEY

Routing in MANET Routing is one of the important issues in MANET due to their highly dynamic and distributed nature. Classification of

September Issue

Page 48 of 75

ISSN 2229 5208

routing protocols in MANETs can be done in many ways. Mostly this is done depending on routing strategy and network structure [1]. Routing strategy categorizes protocols as tabledriven (Proactive) and on demand (Reactive) or source initiated. Depending on the network structure routing can be classified as flat routing, hierarchical routing and geographic position assisted routing. Both, the table-driven and on demand protocols come under Flat routing. Proactive protocols are based on routing tables, which store paths to all possible destinations i.e. they maintain consistent, up-to-date routing information from each node to every other node in the network. To guarantee that routing tables are up to date and reflect the actual network topology, nodes continuously exchange route updates and recalculate the paths. Nodes maintain routing tables and respond to the changes in the network topology by propagating updates throughout the network in order to maintain a consistent view of the network. The main advantage is that path to the destination is immediately available. Thus no delay is experienced when an application needs to send packets. However these protocols incur significantly high routing overhead and hence tend to increase the energy consumption. Destination Sequenced Distance Vector (DSDV) protocol [6], Optimized Link State Routing (OLSR) [7] protocol are some examples of proactive protocols. Mobility of nodes demands route updates in order to know the current status of the node position in the network. These applications are realized using table driven protocols. Source Initiated On-Demand Routing creates routes only when desired by the source node. When a node requires a route to a destination, it initiates a route discovery process within the network. The process is completed once a route is found or all possible route permutations have been examined. Once the route has been established, some form of route maintenance procedure maintains it until the route is no longer desired. The route maintenance is carried out to maintain the established routes until either the destination becomes unavailable or when the route is no longer required. Reactive routing protocols, execute the path finding process only when a path is required by a node to communicate with destination. In case of on demand protocol, control information transfer is limited and is not as frequently updated as in table driven protocols. This leads to less routing overheads and in turn more energy savings. Average end to end delay is high in reactive protocols as compared to table driven protocols as no periodic route updates. Ad Hoc On-Demand Distance Vector (AODV) [8] and Dynamic Source Routing (DSR) [6] are basically from this class. They are mainly used in situations where nodes move in groups. Source initiated protocol perform better than table driven protocols in terms of energy consumption. Multipath routing protocols have the advantage of sharing load of any flow on several paths, leading to a lesser consumption on the nodes of the selected paths. Multi-path routing techniques are proposed to minimize energy consumed per bit in discovering the least-required energy routing paths while reducing the computational complexity [9]. Multiple paths can be formed for both traffic sources and intermediate nodes with new routes being discovered only when needed, reducing route discovery latency and routing overheads.

International Journal of Computer Information Systems, Vol. 3, No. 3, 2011 Multiple paths can also balance network load by forwarding data packets on multiple paths at the same time [10]. Majority of routing protocols in mobile ad hoc networks use shortest path length routing [11] where the number of hops is the path length or route with the minimum hop count. Such min-hop routing protocols can use energy unevenly among the nodes and thus it can cause some nodes to spend their whole energy earlier. B. Existing power aware routing techniques Several routeselection algorithms, that use residual energy, transmission power or link distance as the metrics to select an optimal path. These algorithms try to achieve energy aware goals. In order to reduce energy consumption and increase the lifespan of the network, Power aware alteration (PAA) was proposed in [12]. The scheme needs traffic overhead to maintain the network connectivity and to assume data transmission in spite of congestion. Significant reduction in cost can be obtained by using shortest - cost routing as opposed to shortest hop routing. This power aware routing protocol for mobile ad hoc networks can be easily incorporated in existing routing protocol [13]. An Energy Efficient Coordination Algorithm proposed by Chen B, Morris R etc [14], a distributed coordination technique reduces energy consumption without significantly diminishing the capacity or connectivity of network. It adaptively elects coordinators and rotates them in time. In PA-VBS [15], battery capacity is used as a basis for developing a wireless mobile infrastructure, achieving load balancing and fair clustering. Selection of best neighbor is also a critical issue in ad hoc networks. High mobility of nodes results in rapid changes in the route. A K Sharma and A Goel in [16] proposed an algorithm called best neighbor node selection algorithm (BNNSA) which is designed for choosing the next best mobile node in such a manner that number of packets transmitted on network are drastically reduced. Geographical Adaptive Fidelity (GAF) [17] is an example of adaptive fidelity for extending the lifetime of self configuring systems by exploiting redundancy to conserve energy while maintaining application fidelity. COMPOW [18] protocol satisfies three objectives, maximizing the traffic carrying capacity, extending battery life through low power routes and reducing contention at the MAC layer. The power control can be achieved by using new route selection mechanisms like Energy Based Time Delay Routing (EBTDR) and Highest Energy Routing (HER) as explained by K. Murugan and S. Shanmugavel [19]. III. PROPOSED WORK

In order to make wireless communication energy efficient, a need is felt to propose a scheme to optimize the performance of a network. We have considered Power Aware Routing by considering multipath approach and selecting a path which contains nodes with higher remaining energy. This technique is based on Power Cost routing. Main focus for protocol modification was on energy saving. For power conservation,

September Issue

Page 49 of 75

ISSN 2229 5208

proactive OLSR protocol is considered as energy saving can be achieved. OLSR is designed to work in a completely distributed manner and does not depend on any central entity It is table driven proactive protocol and exchanges topology information with other nodes of the network regularly. OLSR is an optimization of the classical link state algorithm, adapted to the requirements of a MANET. It periodically sends control packets to build and update the topology. The key concept used in OLSR is of MPR (Multi Point Relays) [7]. Each node in the network selects a set of nodes in its 1-hop symmetric neighborhood which may retransmit its messages. We are extending the one hop neighbor concept to 2 to 3 hops. A. Approaches towards achieving the objectives Router consumes larger energy. Therefore, whether node will continue to be a router or not is to be specifically indicated by means of setting of a flag in the header field. This flag, therefore, indicates the willingness. The flag is set in the Reserved bit field in the header. Willingness is set at either MAC layer or data link layer. The routing procedures will be modified by taking proper cognizance of the flag bit. The dissipation of energy can be evaluated under different conditions such as residual battery, hop count, drain rate, multipath or combination of above techniques. B. Multipath OLSR (MPOLSR) protocol To maximize number of nodes alive and less end to end delay we have modified HELLO and Topology Control (TC) packets in existing OLSR protocol. The reserved bits in these packets are replaced by the field residual energy corresponding to node energy of one hop neighboring nodes. For each neighbor node its last address is checked recursively until the destination node is reached. Complete path information is recorded in the routing table using TC message. The loop tuple entries are discarded. TC conveys the residual energy of each node to the entire network, all the paths for given source-destination pair are obtained. C. Modifications in OLSR for Multi-path Source routing method is used to get multiple paths. In MPOLSR, the routing table gets modified and includes more than 1-hop neighbors along with the nodes residual energies. Paths can select neighbors which are at the distance of two or three hops instead of single hop. The process is recursive till we get the destination by eliminating loop path i.e. discarding entries for same source and destination. Thus, multiple paths with the nodes' residual energies are added in the routing tables of the respective nodes. D. Algorithm for MPOLSR Clear Routing Table of all nodes. Maintain all one hop neighboring nodes in one vector for each node using modified HELLO message. This will add the residual energy of the node to the one hop neighboring nodes.

International Journal of Computer Information Systems, Vol. 3, No. 3, 2011 Based on its one hop neighbor table, insert the appropriate entries to its routing table. Based on the nodes topology set; maintain intermediate (temporary) set same as topology set. Match the entries with topology set and add to the routing table. For each neighbor node, see recursively its last address until reached to the destination node, record the complete path information (along with residual energy of the nodes) in the routing table using modified TC message format. Discard the loop tuple entries. Delete the relative node and link information in neighbor and intermediate (temporary) topology set. Get all the paths for given source-destination pair, Topology Control (TC) conveys the residual energy of each node to the entire network. Select all the paths, for given source-destination pair. Find out minimum energy of node Emin, on each selected paths Find out maximum energy of node Emax, from that Emin values Use this Emax and selected path. The path having Emax and shortest hops between source and destination is selected. IV. EXPERIMENTATION AND SIMULATION DETAILS

The development of work is carried out using software available in Public domain like NS-2 Simulator and latest tool boxes. The performance of different protocols is compared using NS-2 [20], this is a discrete event driven network simulator and support various mobile ad hoc network routing algorithms. NS-2 provides substantial support for simulation of TCP, UDP, routing and multicast protocols. A. Experimentation Network scenario is defined by means of various components like, simulation time, pause time, number of nodes, topography, speed, packet sent rate and number of connections. Range and typical values for these components are decided by considering practical situations as well as limitation of simulation software. 1) Simulation Time (ST) indicates duration for which trial is carried out. Large simulation time shows larger observation interval for parameter checking. 2) Speed (Sp) indicates nodes mobility; we have assumed that each node moves in random direction with constant predefined speed. Speeds considered for experimentation is varied in the range of 0 m/s to 30 m/s in steps of 5 m/s. Former represents stationary state

September Issue

Page 50 of 75

ISSN 2229 5208

and later represents moving vehicle at the speed of 108 km/hr for Indian road scenario conditions. 3) Pause time (PT) is additional parameter for mobility of a node. It is assumed that the node which is mobile travels certain distance depending upon speed of movement and then halts at a place for pause duration. After specified pause interval, it again starts moving further. Minimum value of pause time is 0 sec while maximum value can be half of simulation time. 4) Number of nodes represents user of the system. For same area under consideration sparse or dense network situations can be realized with few or large number of nodes. Performance analysis of wireless ad hoc networks is a challenging task as it must take into account the interactions between wireless physical layer, radio propagation, multiple accesses, random topology, routing and the characteristics of the application that generates the traffic carried by the network. Application variations impose certain limits on selection of proper Quality of Service (QoS) parameters. The performance of the modified protocols has been examined and evaluated with existing routing protocol in terms of different network parameters as well as energy aware metrics. The metrics are categorized as: a) Network performance metrics: packet delivery ratio, average end to end delay, normalized routing load, normalized MAC load, route discovery frequency and throughput. b) Energy aware parameters: energy consumption per successful data delivery, variance of residual battery energy, number of nodes alive and network life time. The parameters selected for protocol comparison from above metrics groups are defined as: 1) Average end to end delay (AVD):- This includes all possible delays caused by buffering during route discovery, queuing delay at the interface, propagation and transfer time. It is the average source-todestination data packet delay including propagation and queuing delay. It is important for best effort traffic. 2) Normalized routing load (NRL): - The total number of routing packets transmitted for each delivered data packet. Each hop-wise transmission of these packets is counted as one transmission. The routing load metric evaluates the efficiency of the routing protocol. 3) Throughput: It is the number of bytes received by a destination in a fixed time window T. It is a function of time and permits consideration of the capability of the protocol to send out data packets towards the destination. A higher throughput will directly impact the users perception of the quality of service (QoS) [21]. 4) The Variance of Residual Battery Energy (VRBE in Joules): The VRBE of mobile nodes is a simple indication of energy balance and can be used to extend network lifetime. The computed value reflects whether the routing scheme overused any number of nodes or

International Journal of Computer Information Systems, Vol. 3, No. 3, 2011 not i.e. it is a measure of protocol fairness.It is defined as the average of square of the difference of mean of the residual energy of all nodes in the network and the individual node residual energy at the end of simulation. 5) Number of Node Alive: This is one of important metrics to evaluate the energy efficiency of the routing protocol. It expresses the network life and the network connectivity. The number of active nodes permits to observe as the energy is drain out [21]. 6) Dropped Packets: These are number of drop packets during communication. Lesser the value of this parameter better is the communication. V. RESULTS

Number of nodes alive being energy related parameter; rigorous experimentation with variation in Simulation time, pause time, speed and number of nodes is carried out as given in Table I. For understanding the effect of one parameter under consideration other parameters are held constant while that parameter is varied.
TABLE I. SIMULATION PARAMETER TABLE GIVING DETAILS OF SET UP
USED FOR DIFFERENT TRIALS

Parameters Value Number of nodes 30, 40,50,60 Network Size 1000(m) x 1000(m) Simulation Time 400 - 1000 seconds Pause time 200, 300, 400, 500, 600, 700 sec Mobility 1, 5, 10, 15, 20, 30 m/s Traffic type CBR(constant bit rate) Packet size 512 Bytes/Sec Propagation Models Two Ray Ground Routing protocol OLSR, OLSRM Keeping simulation time as common reference one set of result per parameter for Number of nodes alive is presented in Table II. Table III, IV and V gives dropped packets, variance and routing overheads for both the protocols. Observations: Table II: Number of nodes alive are better for modified protocol for speed, pause time and simulation time variation. Ideally pause time should be less than half of the simulation time. As the pause time reaches to simulation time, the network becomes static and we get similar results for modified protocol as that of OLSR. MPOLSR works well for higher number of nodes. Observations: Table III: There is very slight variation in number of dropped packets for MPOLSR as compared to OLSR for all three parameter variation. Observations: Table IV: It is observed that for various node velocities, variance of residual energy in MPOLSR is less. It implies that nearly uniform energy distribution can be attained. There is no effect of various simulation time and pause time on variance of residual energy.

September Issue

Page 51 of 75

ISSN 2229 5208

International Journal of Computer Information Systems, Vol. 3, No. 3, 2011

TABLE II. NUMBER OF NODES ALIVE FOR OLSR AND MPOLSR FOR SPEED, NODES AND PAUSE TIME VARIATIONS

Parameter ST 750 800 850 900 950 1000

Speed= 30 m/s OLSR MPOLSR 34 35 34 34 30 32 29 30 27 29 26 28

TABLE III.

Number of nodes alive Nodes =40 OLSR MPOLSR 39 36 29 29 27 27 25 25 23 23 21 23

Pause time = 200 sec OLSR MPOLSR 34 36 33 35 30 32 24 30 23 27 23 26

DROPPED PACKETS FOR OLSR AND MPOLSR FOR SIMULATION TIME, SPEED AND PAUSE TIME VARIATIONS

Parameter ST 400 500 600 700 800 900 1000

OLSR 8500 11000 13000 15000 17000 20000 21800

TABLE IV.

MPOLSR 8500 11000 13000 15000 17000 20000 21800

Speed 0 5 10 15 20 25 30

Dropped packets OLSR MPOLSR 9100 9200 9150 9140 8850 8975 9150 9100 9200 9190 8840 8850 8800 8820

PT 200 300 400 500 600 700

OLSR 17380 17900 18000 17700 18300 17000

MPOLSR 17400 18000 17850 17700 18300 17000

VARIANCE FOR OLSR AND MPOLSR FOR SIMULATION TIME, SPEED AND PAUSE TIME VARIATIONS

Parameter ST 400 500 600 700 800 900 1000

OLSR 0.1 0.025 0.05 0.2 1.6 0.2 0.57

TABLE V.

MPOLSR 0.15 0.025 0.05 0.21 1.5 0.2 0.6

Speed 0 5 10 15 20 25 30

Variance OLSR MPOLSR 0.85 0.85 3.4 1.45 2.25 2.25 2.7 1.75 1.2 0.5 2.1 1.9 0.8 0.8

PT 200 300 400 500 600 700

OLSR 0.23 0.1 0.25 0.28 0.1 1

MPOLSR 0.24 0.12 0.25 0.28 0.1 1

ROUTING OVERHEADS FOR OLSR AND MPOLSR FOR SIMULATION TIME, SPEED AND PAUSE TIME VARIATIONS

Parameter ST 400 500 600 700 800 900 1000

OLSR 39 33 45 19 12 37 14

MPOLSR 47 39 59 20 15 47 14

Speed 0 5 10 15 20 25 30

Routing overheads OLSR MPOLSR 110 112 100 115 35 45 90 110 105 120 44 50 43 46

PT 200 300 400 500 600 700 VI.

OLSR 19 35 38 25 75 15

MPOLSR 20 45 40 28 100 15

Observations: Table V: Control overheads are more for modified protocol due to routing mechanism selected for MPOLSR. End to end delay and average throughput are also tested for above parameter variations. It is found that for both the protocols results are same. Routing modifications in MPOLSR are not causing any additional delay. Throughput same indicates no additional data loss takes place in MPOLSR.

ANLYTICAL MODEL

Analyzing the results of simulation models is certainly an area of utmost importance. The highly auto correlated nature of responses has challenged simulation analysis to propose ever more innovative approaches. Analytical model gives concise description of the system. Using the model, the performance at any state of the network in the existing range as well as the behavior to a certain extent can be predicted.

September Issue

Page 52 of 75

ISSN 2229 5208

International Journal of Computer Information Systems, Vol. 3, No. 3, 2011

TABLE VI. NO. OF DROPPED PACKETS OBSERVED AND CALCULATED VALUES WITH ST, PT AND SP

ST 200 300 400 500 600 700

PT 200 300 400 500 600 700

TABLE VII.

Speed 0 5 10 15 20 25

No. of Dropped packets MPOLSR (Observed) MPOLSR (Computed) 10133.33 10156.438 10713.33 10916.208 11775 11675.978 12600 12435.748 13496.67 13195.518 13616.67 13955.288

OPEN STAT FILE OUTPUT FOR DEPENDENT VARIABLE PACKET DROP BASED ON PT,ST AND SP

Variable ST PT Sp Intercept SOURCE Regression Residual Total R2 = 0.9727,

Beta 3.268 3.268 -5.550 0.000 DF 3 2 5

B 25.177 25.177 -855.126 85.638 SS 10101708.179 283832.210 10385540.389 D.F. = 3 2,

Std.Err. 0.671 0.671 42.914 4.295 MS 3367236.060 141916.105

t 37.511 37.511 -19.926 19.940

Prob.>t 0.001 0.001 0.003 0.003 F 23.727

VIF 0.111 0.111 0.111

TOL 9.000 9.000 9.000

Prob.>F 0.0407

F = 23.73,

Prob>F = 0.0407

Adjusted R2 = 0.9317 Standard Error of Estimate = 376.72 F = 23.727 with probability = 0.041 No. of Dropped packets = 85.638 + 25.177*ST + 25.177*PT - 855.126*Sp Variance = 0.002 + 0.001*ST + 0.001*PT - 0.012*Sp Routing overhead=0.008 + 0.617*ST - 0.317*PT - 0.093*Sp
TABLE VIII. VARIANCE OF RESIDUAL ENERGY OBSERVED AND CALCULATED VALUES WITH ST,PT AND SP

(2) (3) (4)

ST 200 300 400 500 600 700

PT 200 300 400 500 600 700

TABLE IX.

Speed 0 2.5 5 7.5 10 12.5

Variance of residual energy MPOLSR (Observed) MPOLSR (Computed) 0.33 0.40 0.49 0.572 0.61667 0.742 0.735 0.912 0.8 1.082 1.07 1.252

ROUTING OVERHEAD OBSERVED AND CALCULATED VALUES WITH ST,PT AND SP

ST 200 250 300 350 400 450

Pause time 200 300 400 500 600 700

Speed 0 5 10 15 20 25

Routing overhead MPOLSR (Observed) MPOLSR (Computed) 64 60.008 65.33 58.228 30.33 57.378 55.33 56.063 89 54.748 35.33 54.433

September Issue

Page 53 of 75

ISSN 2229 5208

Regression models are the mainstay of predictive analytics. The focus lies on establishing a mathematical equation as a model to represent the relation between the different variables in consideration. Classical regression is often insufficient for explaining all of the interesting dynamics of data sequence. Modeling helps in understanding the network better. The model is considered valid if it gives results fitting empirical observations, and also to situations beyond those originally described in the model. The eventual goal for the models presented herein is that of enabling real-time protocol adaptation to continually provide the best possible performance, even under changing environmental conditions. Multiple regression Modeling The general purpose of multiple regressions is to learn more about the relationship between several independent (predictor) and a dependent (criterion) variable [22]. Multiple regression model is realized using Open Stat software. This software can analyze data with multiple independent variables. There are certain terms which allow us to understand the results of this statistical technique [23]. Prominent terms responsible for predicting results in Open Stat software are explained 1) B (estimates of coefficients): This value is a measure of how strongly each predictor variable influences the criterion variable. It is measured in units of standard deviation. Higher the B value, greater the impact of the predictor variable on the criterion variable. It is used to assess the strength of the relationship between each predictor variable to the criterion variable. 2) An Adjusted R Square value is calculated which takes into account the number of variables in the model and the number of observations (participants), our model is based on. This value gives the most useful measure of the success of our model. Modeling can also be done by representing a dependent variable in terms of multiple independent variables considered simultaneously. This is tried for modified protocol parameters upto three independent variables in the form of analytical model. The results obtained using this method are compared with simulation results. B. Model based Results In open stat the regression coefficients can be obtained by giving data series input i. e. contents in Table VI, VIII and IX except the values in computed column. Training data is contents in colums ST, PT, Sp and MPOLSR (Observed) A.

International Journal of Computer Information Systems, Vol. 3, No. 3, 2011 values. The output thus obtained using Open Stat is shown in Table VII, for Packet drop variable. Using these coefficients (like B, Adjusted R square) the analytical model equation can be formulated as shown in Table VII. The coefficients used in (2) are from column of B and are shown in bold face. Similarly based on open stat output results for other parameters, (3) and (4) can be obtained. Computed results in Table VI, VIII and IX for different parameters are based on (2), (3) and (4). Equation (2) shows that B value for speed (Sp) is higher and shows influence on number of dropped packet parameter, while simulation time (ST) and pause time (PT) has equal value and show less dependence. Adjusted R square value is close to 1, gives better match between observed and calculated value of the parameter. Variance, computed values are close to simulated values as adjusted R square value is 0.9247, i.e. close to one. All coefficients are of small value and in this case also Sp shows dominance as shown in (3). Routing overhead simulation and computed result are based on (4), and illustrated in Table IX. VII. CONCLUSION Comparing simulation results of MPOLSR and OLSR, it is observed that multipath and residual battery based route selection results in energy efficient behavior of the network. Following points summarizes the effects, i) Number of nodes alive are better for modified protocol for speed, pause time and simulation time variation. ii) There is very slight variation in number of dropped packets for MPOLSR as compared to OLSR. iii) Uniform energy distribution can be attained with MPOLSR. There is no effect of various simulation time and pause time on variance of residual energy. iv) Control overheads are more for modified protocol while end to end delay and throughput results for both protocols are same. Analytical model developed gives close match between observed and calculated values for all protocols. Modeling provides insight beyond what is already known from direct investigation of the phenomenon being studied. These analytical models will provide feedback with regard to the impact of implementation decisions on overall deployment performance. In real-time decision making approach, this modeling will help in selecting a routing protocol, in reasonable amount of time and resources.

REFERENCES
[1] Tseng, Yu-Chee, Hsieh ,Ten-Yueng, Fully power aware and location aware protocols for wireless multi-hop ad hoc networks, Proceedings of Eleventh International Conference on Computer communications and networks, 2002. Christine E. Jones, Krishna M. Sivalingam, Prathima Agarwal, and Jyh Cheng Chen, A Survey of Energy Efficient Network Protocols for Wireless Networks, Wireless Networks, vol. 7, Issue 4, pp. 343-358, August 2001. C.K.Toh, Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks, IEEE Communication Magazine, pp.138-147, June 2001.

[3]

[2]

September Issue

Page 54 of 75

ISSN 2229 5208

International Journal of Computer Information Systems, Vol. 3, No. 3, 2011

[4] Christine E. Jones, Krishna M. Sivalingam, Prathima Agarwal, and Jyh Cheng Chen, A Survey of Energy Efficient Network Protocols for Wireless Networks, Wireless Networks, vol. 7, Issue 4, pp. 343-358, August 2001. Myung Jong Lee, Jianling Zheng, Xuhui Hu, Hsin-hui Juan, Chunhui Zhu, Yong Liu, June Seung Yoon, and Tarek N. Saadawi, A New Taxonomy of Routing Algorithms for Wireless Mobile Ad Hoc Networks: The Component Approach, IEEE Communications Magazine,vol. 44, no.11, pp. 116-123, November 2006. Sampo Naski, Performance of Ad Hoc Routing Protocols: Characteristics and Comparison, Seminar on Internetworking, Sjokulla, 2004. T. Clausen and P. Jacquet, rfc3626.txt, Network working group DRAFT for OLSR protocol, October 2003. Charles E. Perkins, Ad hoc On-Demand Distance Vector (AODV) Routing, INTERNET DRAFT, Mobile Ad Hoc Networking Working Group, 17 February 2003. Mustafa K. Gurcan, Hadhrami Ab Ghani, Jihai Zhou and Anusorn Chungtragarn, Bit Energy Consumption Minimization for Multi-path Routing in Ad Hoc Networks, Computer Journal , Volume 54, Issue 6, pp. 944-959, 2011. S. R. Biradar, Koushik Majumder, Subir Kumar Sarkar and Puttamadappa, Performance Evaluation and Comparison of AODV and AOMDV, International Journal on Computer Science and Engineering (IJCSE), Vol. 02, No. 02, pp. 373-377, 2010. D. Johnson, D. A. Maltz, Dynamic source routing in ad hoc wireless networks, Mobile Computing, Chapter 5, pp.153-181, Kluwer Academic publishers, 1996. Hanen Idoudi, Miklos Molnar, Abdelfatteh Belghith, Power Aware Alteration: a novel power saving mechanism for ad hoc networks, WP03, pp. 1-6. Suresh Singh, Mike Woo, C. S. Raghavendra, Power Aware Routing in Mobile Ad Hoc Networks, Proceedings of Forth Annual ACM International Conf. Mobile Computing and Networking, pp.181-190, 1998. Chen B, Jamieson K, Morris R, Balakrishnan H., Span: An Energy Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks, Proceedings of International Conference on Mobile Computing and Networking (MobiCom2001), vol. 8, Issue 5, pp. 481 494, September 2002. Ahmed Safwat, Hossam Hassanein, Hussein Mouftah, Power Aware Fair Infrastructure Formation for Wireless Mobile Ad Hoc Communications, Global Telecommunication Conference, IEEE, Globecomm01, vol. 5, pp. 2832 2836, November 2001. A. K. Sharma, A. Goel, Best Neighbor Node Selection Algorithm for Mobile Ad hoc Networks, IE (I) Journal ET, vol.86, pp. 79-83, January 2006. Xu Y, Heidemann J, Estrin D, Geography informed Energy Conservation for Ad Hoc Routing, Proceedings of seventh International Conference on Mobile Computing and Networking (MobiCom2001), pp. 70 84, July 2001. [18] Narayanaswamy S, Kawadia V, Sreenivas R. S., Kumar P. R., Power Control in Ad Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol, Proceedings of European Wireless, 2002. [19] K. Murugan, S. Shanmugavel. Traffic dependent & energy based time delay Routing algorithms for improving energy efficiency in MANET, EURASIP Journal on Wireless Communiations and Networking 2005. [20] ISI The Network Simulator: ns-2 http://www.isi.edu/nanam/ns/, University of Southern California.. [21] Md. Anisur Rahman, Md. Shohidul Islam, Alex Talevski, Performance Measurement of Various Routing Protocols in Ad-hoc Network, 2009. [22] www.statsoft.com/textbook [23] www.unesco.org/webworld/idams/advguide/Chapt5_2.htm AUTHORS PROFILE

[5]

[6]

[7] [8]

[9]

[10]

[11]

[12]

[13]

Radhika D Joshi received the BE degree in 1993 from Pune University and ME Degree from Pune University in 2002. She is currently a PhD student at the University of Pune. She is pursuing research in the field of Wireless Mobile Ad hoc networks energy management issues. At present she is serving as Assistant Professor at Electronics and Telecommunication Engineering department of College of Engineering Pune, which is an autonomous institute of Government of Maharashtra. Her areas of interests are wireless communication, signal processing and electronic devices and circuits. She has received grants for two research proposals from two funding agencies recently. She has published several papers in journals and international conferences.

[14]

[15]

[16]

[17]

Priti P. Rege received her Bachelors and Masters Degrees from Devi Ahilya University Indore. She received a gold medal for her ME and received PhD from the University of Pune in 2002. She was recipient of Nagarkar Fellowship given by Dattatraya Pratisthan of Pune for carrying out research on: Subband coding of Images. In 1993, she joined Electronics and Telecommunication Engineering Department of College of engineering Pune, which is an autonomous institute of Government of Maharashtra. She is currently serving as Professor (Electronics Engineering) in the department of Electronics and Telecommunication Engineering. Her interests are in signal processing, image processing, simulation and modeling. Several of her papers have appeared in leading journals and conferences.

September Issue

Page 55 of 75

ISSN 2229 5208