Location Aided Cluster based Geographical Routing

See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/262198698

Location Aided Cluster based Geographical Routing Protocol for Intermittently Connected MANET Article in International Review on Computers and Software · February 2014

CITATIONS

READS

5

1,815

1 author: Muthu Senthil Valliammai Engineering College 11 PUBLICATIONS 6 CITATIONS SEE PROFILE

All content following this page was uploaded by Muthu Senthil on 30 January 2015. The user has requested enhancement of the downloaded file.

International Review on

Computers and Software (IRECOS) Contents Location Aided Cluster Based Geographical Routing Protocol for Intermittently Connected MANET by B. Muthusenthil, S. Murugavalli

1

Eliminating False Data and Improving Network Lifetime Using Mobile Data Collector in Wireless Sensor Networks by Sandhya M. K., Murugan K.

9

Non Cooperative Power Control Game with New Pricing for Wireless Ad Hoc Networks by Sanjay Kumar Suman, Dhananjay Kumar, L. Bhagyalakshmi

18

Meta-Analysis of Ontology Software Development Process by Marzanah A. Jabar, Mustafa S. Khalefa, Rusli Hj. Abdullah, Salfarina Abdullah

29

Cluster Based AODV Protocol to Minimizing the Route Rediscovery Process and to Improve the Lifetime of Network in MANET by R. Senthil Kumar, C. Sureshkumar

38

An Efficient Autonomous Key Management with Verifiable Secret Sharing Schemes for Reduced Communication/Computation Costs in MANET by M. Devi, S. Chenthur Pandian

48

An Optimized Inference of Pattern Recognition Using Fuzzy Ant Based Clustering Algorithm by K. Sathesh Kumar, M. Hemalatha

54

Componentized Service Oriented Architectural Model for Power System Problems by V. Gomathi, V. Ramachandran

64

Design and Modeling of SMA Architecture Using MaSE Methodologies by R. Moussaoui, H. Medroumi, F. Moutaouakkil

74

Improved Parallel Pattern Growth Data Mining Algorithm by P. Asha, T. Jebarajan

80

Innovative Features in Pathological Tissues Segmentation and Classification of MRI Brain Images with Aid of Back Propagation Neural Network by J. C. Smitha, S. Suresh Babu

88

Services and Agents Based Mediation System Architecture (SAMED Architecture) by T. Rachad, S. Elghazi, J. Boutahar

101

A Technique for Web Security Using Mutual Authentication and Clicking-Cropping Based Image Captcha Technology by K. Suresh Kumar, T. Sasikala

110

An Efficient Secure Enhanced Routing Protocol for DDoS Attacks in MANET by K. Rama Abirami, M. G. Sumithra, J. Rajasekaran

119

Soap Communication Model for Video on Demand by R. Lavanya, V. Ramachandran

128

(continued) .

Copyright © 2014 Praise Worthy Prize S.r.l. - All rights reserved

Web Mining: the Demystification of Multifarious Aspects by M. Ambika, K. Latha

135

Image Processing on GPU: application of Integral Image by Marwa Chouchene, Fatma Sayadi, Mohamed Atri

142

An Efficient Image Clustering and Content Based Image Retrieval Using Fuzzy K Means Clustering Algorithm by K. Haridas, Antony Selvadoss Thanamani

147

CBIR Using Similarity Measure Analysis Based on Region Based Level Set Segmentation by R. V. Rajesh, S. Arif Abdul Rahuman, J. Veerappan

154

Image Reconstruction via Classification Using Fourier Synthesis and Prior Information in Bayesian Analysis by B. Mansouri, Z. Chama, A. M-Djafari

161

A Novel Approach for Face Recognition System Based on Rotational Invariant Transform and Artificial Neural Networks by P. Kannan, R. Shantha Selva Kumari

169

Hybrid Feature Analysis for Assessment of Glaucoma Using RNFL Defects by S. Karthikeyan, N. Rengarajan

178

A Modified Decision Tree Algorithm for Uncertain Data Classification by S. Meenakshi, V. Venkatachalam

188

Test Data Compression Using Multiple Run Length Code Technique by B. Manjurathi, R. Hari Kumar, P. Nirmal Kumar

197

A Multiplier-Less Lifting Scheme Based DWT Structure by A. Akilandeswari

203

Errata Corrige

211


International Review on Computers and Software (I.RE.CO.S.), Vol. 9, N. 1 ISSN 1828-6003 January 2014

Location Aided Cluster Based Geographical Routing Protocol for Intermittently Connected MANET B. Muthusenthil, S. Murugavalli Abstract – In mobile ad hoc network (MANET), the increased node mobility causes increased control overhead. The existing route discovery technique is not efficient for intermittently connected or Delay Tolerant Network (DTN). In order to overcome these issues, in this paper, we propose location aided cluster based geographical routing protocol for intermittently connected MANET. In this technique, cluster head is chosen based on node value which is estimated based on degree difference, node mobility and residual energy. The cluster consists of GPS enabled node and antenna equipped node. The cluster that contains atleast one G-Node considers the remaining energy, speed of the node along with the mobility of node to select the cluster head. Also the cluster maintenance is implemented in order to re-organize and re-configure the cluster dynamically due to the mobility of nodes in the ad hoc networks. Then a store-carry forward and geographical routing based routing protocol is employed. Finally, in order to prevent the location error caused during routing, a location update technique is executed. By simulation results, we show that proposed technique minimizes the control overhead and delay. Copyright © 2014 Praise Worthy Prize S.r.l. - All rights reserved.

Keyworks: Geographical Routing, Clustering, Location Based Information, Mobile Adhoc Networks

Nomenclature Δdi NDi z mi u1,v1 and u 2 , v2 Ei E(t) ntx and nrx α and β Eres μ x1, x2 and x3 μmax Ninti TIM DP

Routing protocols do not perform well in all types of configuration especially when the nodes rapidly move. Due to the advent of localization, new opportunities can be used by routing protocols to improve the performance [1]. When pre-established infrastructure that allows mobile applications to maintain dynamic connections is not required, MANET is used. Some of the applications of MANET are mobile conferencing, emergency services, personal area network, sensor dust and military communications [2]. For dynamic MANET, developing the robust routing protocol is the most difficult task. Geographical routing protocols are more scalable and reliable than conventional topology based routing protocol [3] [4].

Degree difference Node degree Size of the cluster Node mobility Coordinates of the node at time T2 and T1 Initial energy of a node Energy consumed by the node Number of data packets transmitted and received by the node after time t Constants Residual energy Node factor Weight values Maximum node value Intermediate node Re-broadcast timer randomly chosen for each transmission Data Packet

I.

I.2.

Routing plays a vital role in mobile adhoc network and hence many routing protocols are used to find a route for sending the data packets from a source node to a destination node [5] [6]. Particularly, the requirement for indoor positioning is increasing with the arrival of navigation applications. Location based routing protocols make use of the technology of Global Positioning System (GPS) or GALILEO [1] [7]. Geographic routing is the most important approach for wireless routing. The network member with a rich data type called location is provided by the geographic forwarding [8].

Introduction I.1.

Geographical Routing in MANET

MANET

Mobile Adhoc Network (MANET) is an ad hoc network with a group of wireless mobile nodes to form a network [1]-[22]. It does not have any central administration or configuration. Manuscript received and revised December 2013, accepted January 2014


1

B. Muthusenthil, S. Murugavalli

The location information allows context-sensitive computing and location specific applications such as service and resource discovery and mapping [9]. Location based routing protocol uses node’s location instead of links information for routing. It is also known as position based routing protocol [10]. Here, it is assumed that the packet source node has position information of itself and its neighbors and packet destination node [11]. The forwarding strategy depends on location information of the destination and the onehop neighbors may fail if there is no one-hop neighbor whose location is nearer to the destination than that of the forwarding node. Therefore, recovery strategies are used to handle such failures [12]. I.2.1.

II.

 Xiaojing Xiang et al, [3] have proposed two self-adaptive on demand geographic routing schemes for mobile ad hoc networks. These two protocols implement different schemes to obtain and maintain local topology information on data traffic demand. One of these protocols relies on one hop topology information for forwarding like other geographic routing schemes; the other one merges both the geographic and topologybased mechanisms for more proficient path building. Advantages: These protocols can efficiently adapt to different scenarios and perform better than the existing geographic routing protocols. In high mobility case, nearly four times delay reduction was observed. Disadvantages: The routing path is not much efficient and it is constrained to one hop information.  Dipankar Deb et al, [13], have proposed a new location aided routing protocol called Location Aided Cluster Based Energy-efficient Routing (LACBER) which is applicable in GPS scarce network. The positioning framework that this protocol uses is well suited for GPS scarce environment. The GPS enabled nodes wake up periodically to listen for changes and goes back to the sleep mode to conserve energy. The routing performance has been improved over Location aided routing (LAR) in terms of total energy consumption, mean hop count and the average energy of the network. Advantages: This protocol is low cost and energy efficient. The location information reduces the number of control message exchanges during the route discovery process that is used for better utilization of bandwidth. Disadvantages: This protocol has not discussed the issues of overhead in the mobile adhoc network.  Senthil Velmurugan Mangai and Angamuthu Tamilarasi, [17], have proposed an Improved Location aided Cluster based Routing Protocol (ILCRP) for GPS enabled MANETs. The use of location information in the m-hop cluster based routing forms the basis of ILCRP. The performance metrics such as end-to-end delay, control overhead, and packet delivery ratio are used here. Use of cluster based and exact location information of the nodes reduces the control overhead resulting in higher packet delivery ratio. It reduces the end-to-end delay even during its high mobility. Simulations are performed using NS2 by varying the mobility (speed) of nodes as well as number of the nodes. Advantages: The packet delivery ratio is high with reduced control overhead by makes the route, loop free. Location information keeps the exchange information and the end-to-end delay less compared to other protocols. Disadvantages: The technique that preserves the energy for resource constraint mobile adhoc network is not discussed.  Erik Kuiper and Simin Nadjm-Tehrani, [18], have proposed a geographical routing algorithm called Location Aware Routing for Delay-Tolerant Networks (LAROD) that is enhanced with a location service LoDiS

Issues of Geographical Routing in MANET

The issues related to geographical routing in MANET are as follows:  A routing protocol must overcome the resource constraints in mobile adhoc network.  Due to the size and weight constraints, devices used in MANETs require portability with power consumption [13].  Geographic forwarding can send the data only to the network clients whose location is known.  It is assumed that each computer on the network have the knowledge about its own position in order to make the forwarding decisions [9].  It does not operate fine with some network topologies [9].  The existence of communication voids may cause a serious problem. Hence, the method of handling the voids in an efficient manner for any viable geographic routing protocol is required [14].  It is hard to guess the occurrence of void due to the unpredictable patterns of node deployment and the uncertain dynamics of time varying wireless network environments [14]. I.3.

Literature Review

Cluster Based Geographic Routing in MANET

Clustering schemes or utilization of location information of the nodes solves the problem of many existing routing protocols. It also reduces the complexity of a flat structured routing [15]. Clustering is mainly used for enhancing the network performance parameters like routing delay, bandwidth consumption and throughput [16]. The network is divided into a group of nodes with a Cluster Head (CH) through clustering. These clusters are rearranged with some modification in topology of the network [17]. CH represents itself as a single entity and each CH has particular responsibilities. Cluster members are the nodes that join a cluster but gateway nodes are the nodes that belong to more than one cluster. If two clusters are at different transmission range i.e., non-overlapping, then each cluster will have separate gateway nodes. These nodes make the inter cluster head communication easy [17].


International Review on Computers and Software, Vol. 9, N. 1

2


together. Since location dissemination takes time, LAROD is designed to be able to route packets with only partial knowledge of geographic position. To achieve a low overhead LAROD, a beacon-less strategy combined with position-based resolution of bids is used when forwarding packets. LoDiS maintains a local database of node locations which is updated using broadcast gossip combined with routing overhearing. Advantages: LAROD-LoDiS gives a higher delivery rate with lower overhead compared to the efficient topological routing protocol, spray and wait at a node density relevant to a realistic UAV reconnaissance application. It has a better delivery ratio than Spray and Wait. Disadvantages: Some efficient method for efficient utilization of bandwidth and improving the performance of proposed protocol in dense area is required.  Dinesh Ramasamy et al., [19], have proposed a geographic routing scheme that contains an efficient position publish protocol and a routing protocol that can operate with imperfect information related to the destination’s location that scales to large mobile ad hoc networks. The traffic formed by their position publish protocol fits within the transport capacity with constant communication bandwidth allocated for routing overhead, even if the network size increases. It guarantees, with high probability, the route whose lengths are within a constant stretch factor of the shortest path. Spatial and temporal scaling of parameters is selected so as to guarantee scalability, route reliability and route stretch. Advantages: This is the first work that provides a provably scalable geographic routing protocol while providing assurance on route stretch. Disadvantages: The scalability is less, so the optimization of the proposed protocol is not possible when the distance to destination decreases.  Mohammad et al., [20], have proposed Energy Efficient Location Aided Routing (EELAR) Protocol for mobile adhoc network based on the Location Aided Routing (LAR). In EELAR, a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols. Advantages: EELAR makes reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead are reduced. Disadvantages: This protocol does not have a technique to adaptively use one of the forwarding methods of the position based routing protocol that is based on surrounding environment and dividing the network into a number of areas that changes dynamically based on node mobility pattern.

III. Problem Identification From the literature review section, we can say that except [13] and [17], no other works considered clustering in geographical routing. In [17], an Improved Location aided Cluster based Routing (ILCRP) protocol is proposed. The proposed protocol makes use of clustering along with the location information where the exact location information of the nodes is known to each other through GPS. But the following drawbacks are observed in the work:  The control overhead increases when the mobility of nodes increases.  The route discovery method is not efficient for intermittently connected or Delay Tolerant Network (DTN).  It assumes that each node is equipped with GPS to know its position, which is more expensive. In [13], though the usage of GPS is reduced and clustering is applied, it lacks the location update procedures and routing in high mobility So, there is a need of cluster based geographical routing protocol, which is cost effective, energy efficient and handles intermittent connectivity and location updates.

IV.

Proposed Solution IV.1. Overview

In this paper, we propose location aided cluster based geographical routing protocol for intermittently connected MANET. In this technique, cluster head is chosen based on node value which is estimated based on degree difference, node mobility and residual energy. The cluster consists of GPS enabled node and antenna equipped node. The cluster that contains atleast one GNode considers the remaining energy, speed of the node along with the mobility of node to select the cluster head. Also the cluster maintenance is implemented in order to re-organize and re-configure the cluster dynamically due to the mobility of nodes in the ad hoc networks. Then a store-carry forward and geographical routing based routing protocol is employed. Finally, in order to prevent the location error caused during routing, a location update technique is executed. IV.2.

Estimation of Metrics

IV.2.1. Degree Difference ( di ) The degree difference di is defined as the difference among the size of the cluster and node degree. This gives the estimate of residual number of nodes that can be handled by each node:

di | NDi  z |

(1)

where NDi = node degree:



3


z = size of the cluster (i.e the number of nodes within the cluster) [17]. IV.2.2.

The parameters in the Table I are estimated in section IV.2.1-IV.2.3. Here location information is obtained using GPS utility: 2) Based on the Hello Message, each node identifies itself and also maintains the neighbors list (NL). 3) Based on the obtained parameter values (Estimated in section IV.2.1-IV.2.3), each node estimates a node factor using the following Eq (5):

Node Mobility (mi)

The node mobility is computed using the formula: 1  u u 2  v v 2 mi    2 1   T  T  2 1  2 1

following

  

(2)

   x1 * di    x2 * mi    x3 * Eres 

where u1,v1 and u2,v2 are the coordinates of the node at time T2 and T1 [17]. IV.2.3.

where x1, x2 and x3 are weight values such that x1+ x2+ x3 = 1 If mi = NULL Then Maximum node value max can be obtained. End if 4) Following estimation of node factor, each node broadcasts  _mes to its one hop neighbors. 5) The node with highest  _mes value elects itself as cluster head (CH) (shown in Figure 1) and transmits cluster head election message (CH_Elect) to its neighbor nodes. CH_Elect message contains node ID and neighbor table of the node which is self-elected as CH. 6) Upon hearing the CH_Elect, the neighboring nodes in NL sends join reply (J_Rep) message to Ni to join the cluster. Fig. 1 demonstrates the cluster formation. It consists of three clusters C1, C2 and C3 and N2, N7, and N12 are chosen as cluster heads. Each cluster includes two nodes NG (NG3, NG4, NG8, NG10 and NG4) and NA (NA1, NA5, NA6, NA9, NA11, NA14, NA15).

Residual Energy (Eresi)

Let Ei be the initial energy of a node. After the time period t, the energy consumed by the node (E(t)) is given using following equation [8]:

E  t   ntx    nrx  

(5)

(3)

where ntx and nrx are the number of data packets transmitted and received by the node after time t.  and  are constants in the range (0, 1). The residual energy (Eres) of a node at time t is computed using the following equation: Eresi = Ei – E(t) (4) IV.3. Location Aided Cluster Based Geographical Routing Protocol Our proposed technique involves two modules:  Module 1: Clustering.  Module 2: Routing and Location services. IV.3.1. Clustering Architecture We consider that the deployed network contains two types of nodes such as NG and NA. NG nodes are enabled with GPS which goes to sleep or wake-up mode periodically to save energy. NA is equipped with antennas and it has capacity to receive signals from other cluster members and to measure received signal strength (RSSI) and angle of arrival (AOA) of received signal from other cluster members. Also NA finds its location using NG nodes. The steps involved in clustering are as follows: 1) When the nodes are deployed in the network, it initially broadcasts Hello messages to its neighbors. The format of Hello message is shown in table below. It includes the parameters such as Node ID, Location, Degree Difference, node mobility and residual energy. Node ID

TABLE I FORMAT OF HELLO MESSAGES Location Degree Node Difference Mobility

Residual Energy Fig. 1. Cluster Formation



4


Cluster Maintenance This technique is executed to re-organize and reconfigure the cluster dynamically owing to node mobility. This involves the following three cases: 1) Reduction in Node value (  ) 2) Node Movement 3) CH Movement

Else The node floods hello message to its neighbors to indicate its presence. End if 3) After receiving the acknowledgement from nearby CH or any nodes, the node transmits its information 4) New CH then replies with neighbor list and updates all the cluster members regarding new node 5) The earlier CH updates the neighbor table after every time t and informs all the nodes.

Reduction in Node value (  ) The reduction in node value of the cluster head requires selection of new cluster head which involves the following steps: 1) Periodically CH estimates  value. 2) If  < threshold Then CH transmits release message (REL Mes) to all its cluster members End if 3) Each cluster member after receiving REL_Mes, estimates its  and transmits it to CH. 4) CH now decides the next subsequent CH and broadcast a new cluster head message (CH_New) that contains new cluster head ID.

IV.3.2.

Routing Technique

The proposed routing method merges the principle of store-carry forward and geographical routing. Let S and D be the source and destination node. Let DP be the data packet. Let Ninti be the intermediate node. Let TIM be the re-broadcast timer randomly chosen for each transmission (shown in Fig. 2). Let TIMd be the delay timer: 1) When S wants to transmit a DP to D, it obtains destination location from CH and broadcasts DP. Also S sets TIM for re-broadcasting the packet. 2) When any Ninti receives DP, it saves a copy of DP information and it updates CH with the location information of the packet. 3) When D receives DP, it verifies whether the data packet is received for the first time. If DP is received for first time Then D accepts the packet and broadcasts the acknowledgement packet. End if 4) Any Ninti upon receiving the acknowledgement packet broadcasts it towards S. 5) If Ninti is within the cluster area but does not have a copy of the packet, then TIMd is set up for rebroadcasting the packet. 6) The data packet is removed from transmission in the following condition. If (Niniti is within the cluster area and already contains a copy of data packet) & (TIM expires) Then DP is removed. Else Location information of DP is updated to respective CH and DP is broadcasted and TIM is set for re-broadcasts of DP. End if

Node Movement The cluster that contains atleast one NG-Node considers the residual energy, node speed along with the mobility of node to select the cluster head. When a node moves from one cluster to another, new cluster formation is required which involves the following steps: 1) The node broadcasts Hello message that contains the details in Table I 2) Upon receiving Hello message, CH verifies its threshold value of z. 3) If z < threshold Then CH sends a positive acknowledgement (+ve ACK) message to new node The new node transmits a link message along with its  CH broadcasts the new node information to its members Else CH sends negative acknowledgement message (-ve ACK) to new node End if Cluster head Movement When a cluster head moves from one cluster, new cluster head election is required which involves the following steps: 1) When the CH moves from the cluster, the farthest node in the cluster waits for Hello message for time t. 2) If the node receives the Hello message Then The node remains as cluster member.

Fig. 2. Location aware routing



5


IV.3.3.

Location Update

 Average end-to-end delay: The end-to-end-delay is averaged over all surviving data packets from the sources to the destinations.  Average Packet Delivery Ratio: It is the ratio of the number of packets received successfully and the total number of packets transmitted.  Residual Energy: It is the average residual energy of all the nodes in the network..  Overhead: It is the number of packets dropped during the data transmission.

In order to prevent the location error caused during routing, a location update technique is employed. In this technique, CH acts a location server and location data is updated through data exchanges as nodes encounter each other. The steps involved in this technique are as follows: 1) CH recurrently broadcasts the location (Loc_Info) information it contains in its location table. 2) Any Ni upon hearing Loc_Info combines its information with the location information in its local table. Further, when Ni performs location broadcast, it propagates the latest value. 3) In addition, CH accepts the location update from the routing protocol which contains the location information in the packet. The importance of this type of location service is that as the CH is location server, they can update in the database that in turn updates the entire node inside the cluster and hence leads to avoid any kind of delay in the information exchange and provides with accurate location information.

V.2.

A. Based on Rate In our initial experiment, we vary the transmission sending rate as 50, 100, 150,200and 250Kb for CBR traffic. From Fig. 3, we can see that the delay of our proposed LACBGR is 75% less than the existing ILCRP technique. From Fig. 4, we can see that the delivery ratio of our proposed LACBGR is 38% higher than the existing ILCRP technique.

Advantages of the Proposed Solution  The proposed method is efficient cluster based geographic routing protocol that determines the exact location and avoids any kind of overhead and delay in route discovery process.  The location service proposed here provides with accurate information about the location without any delay in the intermittently connected MANET or DTN.  The proposed method is also cost effective as it uses less GPS enabled nodes.

V.

Delay(sec)

Rate Vs Delay 2.5 2 1.5 1 0.5 0

LACBGR ILCRP

50

100

150

200

250

Rate(Kb)

Fig. 3. Rate Vs Delay

Simulation Results

Rate Vs Delivery Ratio

Delivery Ratio

Table I summarizes the simulation parameters used. TABLE I SIMULATION PARAMETERS No. of Nodes 20 to 100 Area Size 500 X 500 Mac 802.11 Routing protocol LACBGR Simulation Time 50 s Traffic Source CBR Packet Size 512 bytes Rate 50 to 250kb Transmit Power 0.375 w Receiving power 0.375 w Idle power 0.1 w Initial Energy 7.1 Joules Antenna OmniAntenna

1.5 1

LACBGR ILCRP

0.5 0 50

100

150

200

250

Rate(Kb)

Fig. 4. Rate Vs Delivery Ratio Rate Vs Residual Energy 4 Energy(J)

V.1.

Results

Performance Metrics

The performance of LACBGR technique is compared with Improved Location aided Cluster based Routing Protocol (ILCRP) technique [17]. The performance is evaluated mainly, according to the following metrics:

3 LACBGR

2

ILCRP

1 0 50

100

150

200

250

Rate(Kb)

Fig. 5. Rate Vs Energy



6


From Fig. 5, we can see that the packet drop of our proposed LACBGR is 19.6% less than the existing ILCRP technique. From Fig. 6, we can see that the energy consumption of our proposed LACBGR is 36% less than the existing ILCRP technique.

Nodes Vs Residual Energy

Energy(J)

4

Rate Vs Overhead

3 LACBGR

2

ILCRP

1

Overhead(pkts)

0 20

6000 5000 4000 3000 2000 1000 0

40

60

80

100

Nodes

LACBGR ILCRP

Fig. 9. Nodes Vs Energy 50

100

150

200

250

Nodes Vs Overhead

Rate(Kb) Overhead(pkts)

12000

Fig. 6. Rate Vs Overhead

B. Based on Nodes In our second experiment, we vary the nodes as 20, 40, 60, 80 and 100. From Fig. 7, we can see that the delay of our proposed LACBGR is 55% less than the existing ILCRP technique. From Fig. 8, we can see that the delivery ratio of our proposed LACBGR is 32% higher than the existing ILCRP technique. From Fig. 9, we can see that the packet drop of our proposed LACBGR is 46% less than the existing ILCRP technique. From Fig. 10, we can see that the energy consumption of our proposed LACBGR is 50% less than the existing ILCRP technique.

40

60

80

Delay(sec)

2000 0 40

60

80

100

Fig. 10. Nodes Vs Overhead

VI.

Conclusion

In this paper, we have proposed location aided cluster based geographical routing protocol for intermittently connected MANET. In this technique, cluster head is chosen based on node value, which is estimated based on degree difference, node mobility and residual energy. The cluster consists of GPS enabled node and antenna equipped node. The cluster that contains atleast one GNode considers the remaining energy, speed of the node along with the mobility of node to select the cluster head. Also the cluster maintenance is implemented in order to re-organize and re-configure the cluster dynamically due to the mobility of nodes in the ad hoc networks. Then a store-carry forward and geographical routing based routing protocol is employed. Finally, in order to prevent the location error caused during routing, a location update technique is executed. By simulation results, we have shown that the proposed technique minimizes the control overhead and delay.

ILCRP

20

ILCRP

Nodes

LACBGR

1.5 1 0.5 0

LACBGR

6000 4000

20

Node s Vs Delay 3 2.5 2

10000 8000

100

Nodes

Fig. 7. Nodes Vs Delay

Delivery Ratio

Nodes Vs Delivery Ratio 1.2 1

References

0.8 0.6

[1]

LACBGR ILCRP

0.4 0.2

[2]

0 20

40

60

80

100

Nodes

[3] Fig. 8. Nodes Vs Delivery Ratio


Lin, Hai, and Houda Labiod. "INGEO: indoor geographic routing protocol for MANETs." Proceedings of the 3rd International Conference on Mobile Computing and Ubiquitous Networking. 2006. Luan, Lan, Wen-Jing Hsu, and Rui Zhang. "Power-efficient geographic routing for MANETs." J. Inf. Sci. Eng. 20.1 (2004): 157-180. Xiang, Xiaojing, Zehua Zhou, and Xin Wang. "Self-adaptive on demand geographic routing protocols for mobile ad-hoc networks." INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE. IEEE, 2007.


7


[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

Amnai, M., Fakhri, Y., Abouchabaka, J., Adaptive fuzzy mobility for delay and throughput sensitive traffic in Ad Hoc networks, (2012) International Review on Computers and Software (IRECOS), 7 (3), pp. 965-971. Mangai, SenthilVelmurugan, and Angamuthu Tamilarasi. "A new approach to geographic routing for location aided cluster based MANETs." EURASIP Journal on Wireless Communications and Networking 2011.1 (2011): 1-10. Yan, G., Peng, Y., Huang, B., A hierarchical QoS routing algorithm based on VMN for MANET, (2013) International Review on Computers and Software (IRECOS), 8 (2), pp. 627631. Narayanan, S., Thottungal, R., Cross-layer based routing and rate control using fuzzy decision systems in MANET, (2013) International Review on Computers and Software (IRECOS), 8 (2), pp. 642-652. A. Shajin Nargunam, M. P. Sebastian, Fully Distributed Security Architecture for MANET, (2006) International Review on Computers and Software (IRECOS), 1. (2), pp. 164 - 172. Rathidevi, E., and N. Senthil Kumaran. "Geographical Routing in MANET using Flexible Combination of Push and Pull Algorithm." International Journal (2013). Kumar, J., Kulkarni, M., Gupta, D., Performance comparison of MANET routing protocols, (2010) International Review on Computers and Software (IRECOS), 5 (1), pp. 1-5. Kalpana, M. N., Mrs Sridevi KN, and Jitendranath Mungara. "Enhanced Energy Efficient Routing for Self Adapive Geographic Routing In Manet’s., International Journal of Computational Engineering Research, Vol, 03, Issue, 7, pp. 56-62. Mauve, Martin, A. Widmer, and Hannes Hartenstein. "A survey on position-based routing in mobile ad hoc networks." Network, IEEE 15.6 (2001): 30-39. Deb, Dipankar, Srijita Barman Roy, and Nabendu Chaki. "LACBER: a new location aided routing protocol for GPS scarce MANET." International Journal of Wireless & Mobile Networks (IJWMN) 1.1 (2009). Shri Alarmelu.V, R. Poonkuzhali, and Dr. M.Y. Sanavullah, “An Efficient Void Handling Technique for Geographic Routing in MANET: A Survey”, “International Journal of Advanced Research in Computer Science and Software Engineering”. Revathy, S., Parvathavarthini, B., Rough fuzzy clustering algorithm using Fuzzy Rough Correlation Factor, (2013) International Review on Computers and Software (IRECOS), 8 (9), pp. 2303-2308. Khetri, Gajanan Pandurangrao, and Satish L. Padme. "International Journal of Advanced Research in Computer Science and Software Engineering." International Journal 2.12 (2012). Mangai, SenthilVelmurugan, and Angamuthu Tamilarasi. "A new approach to geographic routing for location aided cluster based MANETs." EURASIP Journal on Wireless Communications and Networking 2011.1 (2011): 1-10. Kuiper, Erik, and Simin Nadjm-Tehrani. "Geographical routing with location service in intermittently connected MANETs." Vehicular Technology, IEEE Transactions on 60.2 (2011): 592604. Ramasamy, Dinesh, and Upamanyu Madhow. "Geographic Routing in Large-Scale MANETs." University of California, Santa Barbara, Tech. Rep (2012).Mikki, Mohammad A. "Energy efficient location aided routing protocol for wireless MANETs." arXiv preprint arXiv: 0909.0093 (2009). Vinay Rishiwal, S. Verma and S. K. Bajpai, “ QoS Based Power Aware Routing in MANETs” , International Journal of Computer Theory and Engineering, Vol. 1, No. 1, April 2009. Eduardo da Silva, Renan Fischer e Silva, Luiz Carlos Pessoa Albini, Security Through Virtualization on Mobile Ad Hoc Networks, (2012) International Journal on Communications Antenna and Propagation (IRECAP), 2 (4), pp. 270-275. O. A. Adeleke, M. F. M. Salleh, Wireless Adhoc Communications via Game Theory: Physical Layer Perspective – A Short Review, (2012) International Journal on Communications Antenna and Propagation (IRECAP), 2 (6), pp. 354-362.

Authors’ information B. Muthusenthil obtained his Bachelor’s degree in Electronics and Communication Engineering from University of Madras. Then he obtained his Master’s degree in Computer Science and Engineering from Satyabama University. Currently, he is a Assistant Professor (Senior Grade) at the Faculty of Computer Science and Engineering, Valliammai Engineering College , Chennai. His specializations include Wireless network, Adhoc networking, and Network Security. His current research interests are Attacks on Geographic Routing, Network Security, and Clustering Algorithms on Geographic Routing. Dr. Murugavalli Subramaniam is presently works as professor and Head in Panimalar Engineering College, Chennai. She received her Bachelor degree (1995) in Electronics and Communication Engineering ,Madurai Kamarajor University, Madurai, Master's degree (2000) in Computer Science and Engineering ,Manonmaniam Sundaranar University, Thirunelveli and Doctorate (2009) in Anna University, Chennai. She started her educational carrier in the year 1995 as a Lecturer. Her area of interest is Simulation of Image Processing, Soft Computing, Medical Imaging, Genetic algorithm and Fuzzy Logic and Mobile adhoc networks. She is an Institutional member of CSI and life member of ISTE. She published papers in international (6) and national journals (2), presented papers in national and International conferences (40) and published three books. Under her guidance 10 of them doing research work in Anna University and Sathyabama University.



8