An Efficient on Demand Load Sharing Routing Protocol for Ad Hoc Networks using RSS with Cross Layer Design

International Journal of Emerging Technology and Advanced Engineering

27

An Efficient on Demand Load Sharing Routing Protocol for

Ad Hoc Networks using RSS with Cross Layer Design

Manmeet Kaur

, Rajeev Kumar

1_{Department of Computer Science & Engineering, Amritsar College of Engineering & Technology, PTU, Jalandhar, India}

2

Department of Information Technology, DAV Institute of Engineering & Technology, PTU, Jalandhar, India

Abstract: - Ad hoc networks are networks capable of communicating in a set of small, low cost, low power sensing devices. A wireless sensor networks is totally based on the limiting factor i.e. energy consumption. A wireless sensor network consists of large number of sensor nodes distributed or scattered in particular network region. Ad hoc networks consist of node that is highly mobile, so in particular the range of the nodes is very important. Each device in a Ad hoc networks is free to move independently in any direction, and will therefore change its links to other devices frequently. The energy and the bandwidth of such path are of major concern. The lifetime of the network depends upon these parameters. The load sharing is the issue of selection of such optimized paths that are economical, efficient as well as do not allow the network structure to break up in adverse condition. In this paper, we are working on the concept of performance optimization of load sharing routing protocol for Ad hoc networks. , AODV protocol and improved it by using NS-2 simulator. The formula and techniques given in this paper can be used to solve the problem regarding the transmission.

Keywords: - RSS, Receiver Processing Energy, Transmitter Energy, Routing Time.

I. INTRODUCTION

The network model has different nature as the protocol for this is to be designed in the manner that the infrastructure of the cellular network should be considered [1]. The main challenges regarding this are the mobility of nodes and the scalability of the network [2].

Also the performance measurements in terms of energy and the bandwidth efficiency are unknown [6]. In the wireless ad hoc networks all the nodes transmit data towards the source by passing them through the intermediate relaying nodes. The main concept regarding these relaying nodes is that these nodes require processing energy for their transmission success, thus more the number of nodes more is the requirement of the processing energy [6][3]. Whenever single link situation is considered, there is a tradeoff between the energy efficiency and the bandwidth efficiency for wireless multi hop ad hoc networks [1]. The issue for the multi hop network is regarding the scheduling at the link layer and relaying of data at the network layer.

It should always be clear that the data in the network is in the form of packets [6]. The whole network considered to be shared medium between all the nodes that can be source, destination or the relaying nodes. It has also been shown that the per node throughput capacity of ad hoc networks with nodes n decreases with n as Θ (1/n log n) 1/2 _{[3]. The issue regarding this has been shown as the}

International Journal of Emerging Technology and Advanced Engineering

28

We termed this protocol as An Efficient on Demand Load Sharing Routing Protocol for Ad hoc networks using RSS with cross layer design.

II. PROBLEM DEFINITION

The problem definition deals with the dead network structure due to over load of traffic through the particular node for longer duration. This leads to over consumption of the energy available to the node and thus, the amount of energy required goes on decreasing and ultimately its value gets lowered than the threshold value leading to dead network structure as shown in figure 1.

Figure 1

For the above stated problem, we formed a technique in which an new routing algorithm is designed for AODV routing protocol. The designing of an improved routing algorithm is based on the load sharing done using the received Signal Strength parameter (RSS). Also, the application of this algorithm is stated with cross layer design as the RSS value is not present on the network layer which is actually used for routing whereas it is fetched from the MAC layer using the data fetching technique for the cross layer. The value obtained from the MAC layer contains the RSS value that is used as a decision making value for allowing transmission from a particular path.

III. LOAD SHARING ROUTING PROTOCOL USING RSS

WITH CROSS LAYER DESIGN

The proposed algorithm allows network structure to work efficiently without leading to dead state. This is made possible by introducing the technique of load sharing. This is carried out using the RSS parameter. The algorithm works on basis of energy requirement calculations that calculates the energy requirement pre headedly. Thus, whenever, the energy of node is very much near to the threshold energy, load sharing is performed that allows the traffic to move through the next optimal path as well.

Thus, this prevents the network structure from entering into dead state, and therefore increasing the network life time. This technique is not yet being used by AODV, thus on integrating this technique with AODV routing protocol, the performance of the network can be increased further as shown in figure 2.

Figure 2

A.Routing on basis of RSS:

The selective routing is based upon the amount of energy consumed for transmission of data by a node and the amount of energy left out for next session transmission. For this, we maintained a selection table along with the routing table is for routing. The packets transmitted in the network consume the energy in two formats one is the transmitter energy Tx and the second is the receiver processing energy Ep.

Figure 3

Table Maintained For Each Node

Head Node

Linked Node

Ep (in microns)

Energy Consumed (Ec)

0 1 0.25 1.22

3 0.25 1.12

International Journal of Emerging Technology and Advanced Engineering

29

The formulae used for calculation of the nodal energy are:

Ec = No. of packets transferred * Energy Required per Packet ………..(7)

Energy Left= Total Energy – Ec ……(8)

Energy table is maintained on the basis of calculation made using the above defined formulae. The path selection is made on basis of number of times the path is selected for transmission. Note that, energy consumed for transmission is directly proportional to number of times the path is chosen for transmission (Nt) i.e.

Ec ∞ Nt…….………. (9)

Thus, more the path traversed more is the energy consumed and the more is the load on that path therefore, more is the danger of network failure.

Load ∞ Ec ∞ Nt……… (10)

All these formulas are applied on the cross layer which is formed virtually between the network and the physical layer and serves as a platform for routing decision. This is how actual use of cross layer is followed in our technique. Thus, RSS parameter can easily be implemented using this virtual cross layer

total_routing_time=life_time+wait_time

net_trtime= node_trtime*hop_count

current_simulation_time=(no_of_packets*$net_trtime)/m axno_commonpaths

wait_time=2*net_trtime*no_of_attempts x=2*net_trtime*no_of_attempts y=2*hop_count*node_trtime

life_time=current_simulation_time+x-y

link_speed=no_ofPackets/ total_routing_time

routing_overheads =

(((no_of_packets- no_of_attempts)*hop_count)+((hop_count-1)*average_delays))/link_speed

energy_required_per_packet

=receiver_prcessenergy_perpacket+trans_energy_perpa cket

total_energy_consumed=

nodetotal*no_of_active_connections

Nodetotal( energy total)=no_of_packets* energy_required_per_packet

energy_left

=total_energyavilable-total_energy_consumed

rss(node)=energy_required_per_packet*no_of_packets

energy_required =rss*no_of_packets

Therefore, for load sharing the above defined parameters must be added to routing protocol for better and efficient transmission of data and more optimized network life. This selective routing can also be explained as algorithm defined as follows:

1. Perform Ring Search

2. Set Source and destination

3. Select protocol for routing : AODV

4. While transmission is not completed

5. Send RREQs and receive RREPs and maintain

routing table during transmission.

6. Compute RSS at senders node on basis of

acknowledgement received from currently relaying node.

7. If required energy<available energy

 Transmit packet

 Left out energy= total

energy-consumed

8. Else

 Select next optimal path

 Perform load sharing and

balance transmission

 Perform step 7

9. End of step 4 loop

10. Exit and end transmission

B. Performance Metrics:

We simulated the typical ad hoc network for hop and calculated the results for bandwidth, energy, throughput of the network structure taking mobility and the antenna range as the basis of the technique. Wehave takenvalues as constant to compute our results. The simulation has been performed for the area ranging over 1500x1500. Also, the values forthe transmitter energy are taken to be 0.32 µJ and that of receiver processing energy is 0.25 µJ. We concentrated on the following performance metrics:

IV. SIMULATION RESULTS AND ANALYSIS

International Journal of Emerging Technology and Advanced Engineering

30

Parameter Value

Dimensions 1500X1500 sq. m.

Number of Nodes 5,25,50,75

Simulation Time 200 s

Source Type UDP

Number of Connections 4,10,14,25

Packet Size 512 bytes

Mac Layer IEEE 802.11 b

Buffer Size 10,50,75,100 packets

Propagation Radio

Model

Two Ray Ground

Physique layer Band width as 2 Mb/s

Maximal Speed 10 m/s

Pause Time 10 s

Interval Time To send 2 packets /s

Graph 1

Graph 2

Graph 3

Graph 4

Graph 5

Graph 6

International Journal of Emerging Technology and Advanced Engineering

31

V. CONCLUSION

In this paper, we have worked upon load sharing using RSS with cross layer design. The technique solves the problem of dead state that rose due to over consumption of the same path for more number of traversals. This technique improves the lifetime, routing time, link speed and the overall consumption of energy. There has been improvement in terms of network overheads as overheads decreased with implementation of this technique in AODV protocol.

REFERENCES

[1 ] Sunil Taneja and Ashwani Kush, “A Survey of Routing Protocols

in Mobile ad hoc Networks”, International Journal of Innovation, Management and Technology, volume 1, no. 3, 2010.

[2 ] S.R. Lahane, G.R. Bamnote: “Cross Layer Design for Routing in

Multi-Hop Wireles Networks”, Journal of Computer Networks, 2010. Vol 2, pp.563-568.

[3 ] Lijun Chen, Steven H. Low, John C. Doyle: “Cross layer Design

in Multihop Wireless Network”, International Journal of Computer Networks, 2010, vol 4, pp. 433-438.

[4 ] Boumedjout Amel and Mekkakia Maaza Zoulikha: “Routing

Technique with Cross-layer Approach in Ad hoc Network”, IEEE-2009, vol 2, pp.4244-4249.

[5 ] Homa Hosseinmardi and Farshad Lahouti: “Multicast Lifetime

Maximization Using Network Coding: A Cross-layer Approach”, Iran Telecommunication Research Centre, IEEE-2009, vol 4, pp.3457-3462.

[6 ] Tzu-Chieh Tsai, Sung-Ta Tsai, Tsai-Feng Liu: “Cross-Layer

Design for Multi- Power, Multi-Interface Routing in Wireless Mesh Networks”, IEEE 2009, vol 3, pp. 563-568.

[7 ] Dr. Shuchita Upadhayaya and Charu Gandhi “Quality Of Service

Routing in WSNs Using Location And Energy Parameters” International Journal of Wireless and Mobile Networks (IJWMN) , Vol 1, No.2, November 2009.

[8 ] Lun Dong, Athina P. Petropulu and H. Vincent Poor: “A Cross-Layer Approach to Collaborative Beamforming for Wireless Ad Hoc Networks”, IEEE 2008, vol 56, pp.2981-2993.

[9 ] Natsuru Yamamura, Takuo Nakashima and Seiya Fukushima,

“Performance simulation of routing protocols in Ad hoc Wireless Network”, IEEE, 2008.

[10 ]Rekha Patil, Dr. A. Damodaram, “Cost Based Power Aware Cross Layer Routing Protocol for MANETs”, 2008 IJCSNS. [11 ]Arun Kumar B. R. ,Lokanatha C. Reddy, Prakash S. Hiremath,

“Performance Comparision Of Wireless Mobile ad Hoc Network Routing Protocols” IJCSNS International Journal Of Computer Science And Network Security Vol. 8,No.6., June 2008.

[12 ]Manika Vinay Rali, Min Song, and Sachin Shetty: “Virtual wired

transmission Scheme using directional antennas to improve energy efficiency in Wireless Mobile Ad Hoc Network”; 978-1-4244-2677-5, IEEE 2008.

[13 ]Changchun Bae and Wayne E. Stark: “A Tradeoff between

Energy and Bandwidth Efficiency in Wireless ad hoc Networks”; 2007 IEEE.

[14 ]N. Al-Khwildi, K. K. Loo And H. S. Al-Raweshidy: “An Efficient

Routing Protocol For Wireless Ad Hoc Networks”, 4th

International Conference Sciences of Electronic, Technologies of Information and Telecommunications, vol. 4, March 25- 29, 2007-Tunisia, pp.713-716.

[15 ]B. Rankov and A. Wittneben: “Spectral efficient protocols for half-duplex fading relay channels,” IEEE Journal on Selected Areas in Communications, vol. 25, pp.379-389: Feb. 2007.

[16 ]Changling Liu, Jorg Kaiser, “A Survey Of Mobile Ad Hoc

Network Routing Protocols”. IEEE, 2007.

[17 ]Mbarushimana, C. and A. Shahrabi: “Comparative Study of Reactive and Proactive Routing Protocols Performance in Mobile Ad Hoc Networks”, Proc. of The 21st _{International}

conference on Advanced Information Networking and Applications Workshops (AINAW’07), pp.679-684, 2007.

[18 ]A.N.Al-Khwildi, K.K.Loo and H.S.Al-Raweshidy “An Efficient

Routing Protocol for Wireless Ad hoc Networks”4th

International Conference: Sciences of Electronic, Technologies of Information and Telecommunications March 25-29, 2007-TUNISIA [19 ]C. Bae and W. E. Stark: “Energy and bandwidth efficiency in

wireless ad hoc networks,” in Proc. International Conference on Communications Circuits and Systems (ICCCAS’06): vol. 2, pp.1297-1302, June 2006.

[20 ]O. Oyman and S. Sandhu: “Non-Ergodic Power-Bandwidth

Tradeoff In Linear Multihop Wireless Networks,” in proc. IEEE International Symposium on Information Theory (ISIT’06): 2006. [21 ]H. Wang and W. E. Stark: “Transport efficiency for wireless

network”, IEEE Transaction Communications, 2004.

[22 ]Imrich Chlantac, Macro Conti, Jennifer J.-N. Liu, (2003) “Mobile

Ad hoc Networking imperatives and challenges” Ad Hoc Networks, Vol 1,pp.13-64

[23 ]L.Ouakil,S.senouci ,and G. Pujjole, “Performance Comparison of

Ad Hoc Routing Protocols Based on Energy Consumption”, Ambience Workshop 2002, Torino, Italy, September 2002.

[24 ]Lie Wang,Lianfang Zhang, Yantai Shu & Miao Dong

(2000), “Multipath source Routing in Wireless ad hoc Networks”, Proceedings of Canadian Conference on Electrical and Computer Engineering, Vol 1, pp.479-483.

[25 ]C.E. Perkins, E. M. Belding-Royer , and S. R. Das, “Ad hoc

On-Demand Distance Vector (AODV) Routing”,Proc. 2nd _IEEE

Wksp. Mobile Comp. And Apps. Feb. 1999,pp. 90-100.

[26 ]C.K Toh, “Long-lived ad hoc routing based on the concept of Associativity”, Internal Draft, IETF, March 1999.

[27 ]J. Broch et al. , “A Performance Comparison on Ad Hoc Multi hop Wireless Networks Routing Protocols”, Proc. IEEE/ACM MOBICOM ’98,Oct. 1998,pp.85-97.

[28 ]E.M. Royer , C-K Toh , “A Review of Current routing Protocols

for Ad Hoc Mobile Wireless ad hoc Networks”, IEEE Personal Communication Magazine, April 1999,pp 46-55.

[29 ]C.E. Perkins & P. Bhagwat (1994) “Highly Dynamic Destination

Sequenced Distance Vector Routing (DSDV) for Mobile Computers”, ACM SIGCOMM Conference on Communications Architectures, Protocols and Applications, Vol. 24,pp. 234-244.

[30 ]David B. Johnson, “Routing Ad Hoc Networks of Mobile Hosts,”

Proc. IEEE Wksp. Mobile Comp. and Apps, Dec. 1994, pp.158-163.

[31 ]Network simulator-2 www.isi.edu/nanam/ns/.