Perforemance Analysis Of Consistent Topological Computer Science Essay

Published Date: 02 Nov 2017

INTRODUCTION

Mobile Ad hoc networks (MANET) are a new pattern of wireless network, contribution unrestricted mobility without any underlying infrastructure such as base station or mobile switching centers. Essentially ad hoc network is a collection of nodes communicating with each other by forming a multi-hop network. A Mobile Ad-hoc Network (MANET) is a self-organizing, distributed, co operative infrastructure fewer networks of mobile devices connected.

Every mechanism in a MANET is liberated to shift separately in any way, and will consequently alter its relations to other plans regularly. Each must onward traffic unconnected to its own use, and consequently be a router. The primary confront in building a MANET is equipping each device to incessantly preserve the information necessary to correctly route traffic. Such networks might function by themselves or might be associated to the better Internet. MANET is a type of wireless ad hoc networks that frequently has a routable networking environment on summit of a Link Layer ad hoc network.

The incentive of this commentary is to elucidate and assist to decide the gap flanked by the link concept used in traditional wireless networking. Its a great deal broader definition used in the context of supportive communications, which has conventional significant concentration as an unexploited income for humanizing presentation of communicate broadcast systems in commission over the ever-challenging wireless medium. The normal theme of the majority research in this region is to optimize physical layer presentation measures. There is no bearing in mind of how collaboration interacts with higher layers and improves network performance measures.

Supportive communication (SC) talented method to improve broadcast reliability over wireless medium exploit user diversity to reproduce multiple-antenna systems creation use of transmit nature by relaying overhead messages from source to destination and raises grave security issues. There is possiblity for hateful nodes to join network and converse unnecessary information to destination compromising network.

Authentication is dangerous for security design. Multiple-hop communications are used in mobile ad hoc networks with SC not only end-to-end also hop-by-hop (HBH) authentication message integrity necessary to protect network from tampering with and forging of packets by malicious nodes. Security issue open shared access medium is vulnerable to attacks wireless resources are stringently constrained.

Supportive relays are centrally controlled by cluster heads. In architecture without explicit clustering, cooperative links are formed by request of a source node in an ad hoc, decentralized fashion. In either case, supportive communication considerably improves the network connectivity. Although far from a complete study, these architectures provide customized wireless link abstractions and suggest tradeoffs in complexity at the physical and higher layers. Numerous opportunities and challenges stay, counting dispersed harmonization, coding, and signal processing between multiple radios; modeling of new link abstractions at higher layers; and multi-access and steering protocols for networks of cooperative links.

1.1 PROBLEM DEFINITION

In the Link-stAbility and Energy aware Routing protocols (LAER) have the dissimilar node density which disturbs the stable path. The available employment has the numerous heterogeneous mobile nodes with diverse speed by diminish data throughput and augment data loss. The Sparse and dense population of mobile nodes in a variety of position of the ad hoc network diminish delay of route discovery.

An optimization routing model within MANET minimizes concurrently mobile node energy consumption and maximizes link stability of transmission paths. To choose shorter routes, high efficiency is necessary in by means of wireless bandwidth and increase path stability but shorter routes suffer higher energy consumption. Originally, the work obtainable a Node Mobility and Density Classifier Model is to intend more link stability and less energy preserved ad hoc routing protocol.

Topology control attempts to make a decision for every node the smallest amount broadcast power that sufficiently guarantees connectivity of the node. In static networks, it is sufficient to protect network connectivity because the node movement is not taken into deliberation. However, in MANET, network topology varies and fluctuates owing to mobility, and thus, it might not be able to protect the network connectivity. This is a well-known problem, but is yet to be solved efficiently. Although topology control has received much attention in stationary sensor networks by effectively minimizing energy consumption, reducing interference, and shortening end-to-end delay, the transience of mobile nodes in Mobile Ad hoc Networks (MANET) renders topology control a great challenge.

A cooperative authentication and topology control (CATC) scheme is proposed to improve the throughput of the consistent topological control. CATC is formulated as a discrete stochastic optimization problem, which does not require prior perfect channel status but only channel estimate.

We also mathematically prove the tracking convergence property and the convergence rate of the discrete stochastic optimization approach. Recently, supportive communication (SC) has been considered as a promising technique to improve transmission reliability over the ever-challenging wireless medium. SC exploits user diversity to emulate multiple-antenna systems, making use of the broadcast nature of the wireless medium by relaying the overheard messages from the source to the destination.

Although SC brings significant benefits, it also raises serious security issues. For example, it is possible for malicious nodes to join the network and relay unsolicited information to the destination, thereby compromising the network. Proposed Channel Bandwidth Enhancement to CATC for wireless network is arrived to appropriate channel bandwidth. It allows the operators to express different requirements in terms of throughput and availability.

The aim of the present research is

To handle dynamic topology of MANET with ZRP protocol, Lifetime Forecast Routing (LFR) is designed which extends service life of mobile nodes

Increase the link path stability in varied mobility rates in ad hoc networks with the minimal data loss.

Present a strong Consistent Topology Control (CTC) in MANET with Minimal overhead and nullify inter node coordination.

Channel bandwidth enhancement scheme to CTCP in MANET minimizes channel bandwidth on topology control with improved authentication and integrity.

1.2 ORGANIZATION OF THE THESIS

The thesis is organized as follows.

Chapter 1 gives introduction about the Mobile Ad-hoc Network (MANET), Topology control mechanism, Supportive communication, path stability, Sensor Node Transmission, routing protocols

Chapter 2 furnishes the review about Existence of Data and Multi user Diversities in Non cooperative Mobile Info station Networks, LTRT: an efficient and reliable topology control algorithm for ad-hoc networks, On Performance Evaluation of Reliable Topology Control Algorithms in Mobile Ad Hoc Networks, Service-based asynchronous flow control algorithm for wireless sensor networks.

Chapter 3 offers Lifetime Forecast Routing (LFR) to identify the life time routing and estimate the battery lifetime.

Chapter 4 tells about the Consistent Topology Control (CTC) for MANET. It Provide mobile management for weak consistency link to form reliable links.

Chapter 5 describes the Cooperative Authentication and Topology Control (CATC) scheme authenticates the system and reduces the communication overhead.

Chapter 6 and 7 presents the experimental results evaluation and discussion of Cooperative Authentication and Topology Control (CATC) in Mobile Ad-hoc Network

Chapter 8 confers a conclusion by conveying that CATC architecture provides fairness for all nodes in the mobile sensor networks to obtain the finest communication rate.

LITERATURE REVIEW

Dissemination in the background of ad-hoc networks, is a expensive operation, and thus topology control has been proposed by K. Miyao, et.Al., 2009 to attain efficient broadcasting with low intrusion and low energy consumption. By topology control, each node optimizes its transmission power by maintaining network connectivity in a restricted manner. Local Minimum Spanning Tree (LMST) is the state-of-the-art topology control algorithm, which has been established to offer acceptable performance. Local Tree-based Reliable Topology (LTRT), which is exactly established to guarantee.

Floriano De Rango., et.Al., 2012 tries to explanation for link stability and for smallest amount drain rate energy consumption. In order to confirm the correctness of the proposed solution bi-object optimization formulation has been designed and a novel routing protocol called Link-stAbility and Energy aware Routing protocols (LAER) is proposed.

Energy consumption and network connectivity are two of the important research issues that are yet to be determined in mobile ad hoc networks. As taken advantage of in static networks, dependable topology control algorithms are also measured to be a high-quality move toward for mobile networks. Ngo Duc Thuan.,et.Al., 2010 assess the performance of a number of well-known topology control algorithms with a variety of scenarios and measurements. The results demonstrate that Local Treebased Reliable Topology (LTRT), a lately proposed algorithm, is the majority scalable method and provides the most bene???t in terms of redundant connectivity.

J. Chen,et,Al., 2010 devise a flow control optimization problem for wireless sensor networks with lifetime restraint and link interference in an asynchronous setting. Our formulation is based on the network service maximization framework, in which a general service function is used to characterize the network performance such as throughput. The proposed algorithm can attain the maximum service. Extensive simulations are conducted to show the efficiency of our algorithm and authenticate the logical results.

J. Liu, et.AL., 2011 considers a universal two-hop relay with f-cast (2HR-f), where each packet is delivered to at most f different relay nodes and should be conventional in order at its destination. Based on our models, one can honestly get the matching arrange sense results. Extensive simulation studies are as well conducted to show the competence of these new models.

Hassan Artail.,et.Al., 2008 introduces a cooperation-based database caching system for Mobile Ad Hoc Networks. The spirit of the system is the nodes that cache submitted queries. The queries are used as indexes to data cached in nodes that formerly requested them. Sunho Lim., et.AL., 2009 proposes a new message mechanism, called RandomCast, via which a sender can identify the preferred height of overhearing, creation a careful equilibrium between energy and routing performance. In addition, it reduces redundant rebroadcasts for a broadcast packet, and thus, saves more energy.

Wing Ho Yuen., et.Al., 2009 propose opportunistic cooperation in the background of argument distribution in self-centered mobile info station networks. First, all nodes have an ordinary interest in all files. Then specify a social contract such that a bilateral file swap over takes place only when either node obtains amazing it needs from the exchange. Resulting capacity depends on mobility, the figure of files being dispersed, and node density.

For target tracking applications, wireless sensor nodes offer precise information because they can be deployed and operated close to the occurrence. These sensing devices have the occasion of collaboration in the middle of themselves to get better the target localization and tracking accuracies. An energy-efficient collaborative target tracking paradigm is developed by Tolga Onel.,et.Al., 2009 for wireless sensor networks (WSNs).

A mutual-information-based sensor selection (MISS) algorithm is adopted for contribution in the synthesis process. MISS allows the sensor nodes with the uppermost mutual information concerning the target state to broadcast data so that the energy consumption is abridged while the preferred target position estimation correctness is meeting. In addition, a narrative approach to power savings in WSN is devised in the information-controlled transmission power (ICTP) adjustment, where nodes with additional information use higher transmission powers than those that are less educational to share their target state information with the neighboring nodes.

Using the lively approach, it was lately shown that local broadcast algorithms can attain a constant estimate factor to the optimum solution when (approximate) position information is available. However, by means of position information Majid Khabbazian., etAl., 2011 can make simpler the problem. Also, in some applications it may not be practical to have position information. Therefore, we desire to know whether local broadcast algorithms based on the dynamic approach can achieve a constant approximation factor without using location information with lower mobility.

Tom H. Luan.,et.AL., 2011 incorporates the high node mobility with the modeling of DCF and unveils the impacts of mobility (characterized by node velocity and moving directions) on the ensuing throughput. Quansheng Guan., et.Al., 2012 jointly believe authentication and topology control. Specially, we examine the effectual throughput with upper layer authentication schemes and physical-layer schemes connected to channel conditions and relay selections for CCs.

Vaskar Raychoudhurya., et.Al., 2011 can assurance network-wide service accessibility by the quorum intersection property. To additional reduce the service detection cost; it divides the entire network into one or more tree-structured domains. Since, the K-directory community is the heart of our approach, to keep the index community intact, it considers substituting unsuccessful directories using an incremental selection policy. Hiroki Nishiyama., et.Al., 2012 efficiently utilize k-edge connected topology control algorithms in MANETs. The proposed method mechanically determines the suitable value of k for each local graph based on local information while ensuring the necessary connectivity ratio of the whole network.

LIFETIME FORECAST ROUTING WITH NODE MOBILITY AND DENSITY CLASSIFIER FOR MANET

Lifetime Forecast routing (LFR) with node mobility and Density Classifier Model are designed to stabilize the most of the link and to conserve the energy in the routing protocol. The node mobility classifier set contains the three steps. They are

Slow State

Medium State

High mobile nodes State

Non linear programming set is applied based on the types of node mobility to identify stable link path and to minimize the energy conserved on the routes for the transmission. Node density classifier is done by segregating zonal areas based on optimized grid nodal size. Grid nodal threshold is evaluated with heuristic approach by examining regions of ad hoc network for better path stability and minimum energy drain rate of mobile nodes.

To handle dynamic topology of MANET with ZRP protocol, Lifetime Forecast Routing (LFR) is designed to extend service life of mobile nodes and identify the path with maximal lifetime. Each node estimate its battery lifetime based on its past activities. Simple Touching Average (STA) forecaster keep track of ast N values of residual energy and corresponding time instances for the last N packets received/relayed by each mobile node.

Information is recorded and stored in each node. Simulation carried with varied topology of mobile node density and node mobility rate. Performance evaluated in terms of data packet delivery ratio, normalized control overhead, link duration, nodes lifetime, average energy consumption, node density and mobility rates. Thus the proposed LFR with node mobility and Density Classifier Model increases the link path stability in varied mobility rates and able to delivery better transmission to inappropriate node density ad hoc networks.

3.1 Node Mobility and Density Classifier

Node mobility classifier sets three states i.e., slow, medium, and high mobile nodes by applying non linear programming to identify stable link path and minimum energy conserved routes. Segregate zonal areas with predefined number of nodes are used for the classification of nodes. The Optimality of the zonal nodes is varied based on the sparse and dense populated regions of the mobile ad-hoc network. The Heuristic approach is made to evaluate grid nodal and ensure the regions for better path stability and energy drain rate.

3.2 Lifetime Forecast Routing (LFR)

Lifetime Forecast Routing (LFR) is done in two phases with ZRP routing protocol

Lifetime Forecast Route discovery

Lifetime Forecast Route maintenance

3.2.1 Lifetime Forecast Route Discovery

LFR discovery calculates their predicted lifetime in all the nodes except the destination node. It replaces the minimum lifetime in the header with current calculated minimum lifetime. If calculated value is lower than minimum lifetime value in the header, destination waits for a threshold number (Ti) of seconds after the first RREQ packet arrives. Till then, destination examines cost of the route of each arrived RREQ packet.

As timer (Ti) expires destination node selects the route with the minimum cost and replies. Therefore received RREQs packets are dropped and cost of chosen path is appended to RREPs. Every node hears this route reply and adds this route all along with its cost to its route cache table. The result of the LFR is that it considerably saves the power. LPR has route invalidation timer and removes the old routes. It also avoids over usage of particular routes in cases of low mobility.

3.2.1 Lifetime Forecast Route Maintenance

LFR maintenance is essential due to mobility of the nodes. This mobility of nodes may lead to the path lost when the node movement occurs and also changes in predicted lifetime. To handle mobility issues, new RREQ is sent out and the entry in the route. The cache corresponding to the node that has moved out of range is purged. To handle changes in predicted lifetime, weakest node in the path is monitored with its lessening battery lifetime.

The threshold stage decreases in which the node sends a route error support to the destination and the destination send this route error message to the source. Route error message forces the resource to start route discovery again depending on remaining battery capacity of the present node and its release rate in the short account. LFR adopts local approach to diminish control traffic.

As a result, Link-stAbility and Energy aware Routing protocols (LAER) disturbs the stable path with the different node density. Thus proposed Lifetime Forecast Routing (LFR) is explained with stable path discovery and Consistent Topology Control (CTC) for Mobility Impact MANET is elucidating in next section.

CONSISTENT TOPOLOGY CONTROL (CTC) FOR MOBILITY IMPACT IN MANET

The Lifetime Forecast Routing (LFR) in the previous section contains the inconsistent local views for selection of a correct set of logical neighbors. So, Consistent Topology Control (CTC) in MANET is presented for weak consistency using Mobile Supervision Mechanism. This mechanism needs no inter-nodal coordination and produces the minimal overhead. Range of Consistent Topology Control (CTC) enhances to ensure correct decisions based on local views that are weakly consistent.

CTC mechanism contains two current Hello messages from each node which are adequate to build weakly consistent local views and each node updates its local views immediately. Three recent Hello messages are sufficient when each node updates its local view once per Hello interval.

Weak Consistent links

The weak consistent links is maintained based on completely asynchronous restricted views to protect the traditional decisions. This systematic scheme for creation traditional decisions in topology control somewhat growing the number of logical neighbors and establish to protect logical topology connectivity.

On implementing of weak consistency among each local view contains k recent Hello messages of each neighbor. The value of k depends on Hello interval and maximal cut width. The local view of each node contains two recent Hello messages sent by it and each 1-hop neighbor. The enhanced link removal conditions develop history information to preserve connectivity.

Weak consistent links comprises of two view updating strategies named immediate updating strategy and periodical updating strategy. Instantaneous updating strategy of every node updates its local view by re computing its set of logical neighbors whenever it receives a new ???Hello??? message. Periodical updating strategy of each node updates its local view once per Hello interval. It assumes reliable Hello message misplaced due to collision and mobility. Storing more Hello messages from each sender enhances the likelihood of building weakly consistent local views.

Consistent Topology Control

Weak consistency for location-based scheme handles the link reliability in which the both link distance and relative node direction are concerned in selecting logical neighbors. Each node has multiple locations in each local view and distances are computed for each link. This topology has numerous directions for each neighbor in each local view with maximal or minimal relative direction of a neighbor. It enhances location-based link removal in which a condition preserves the connectivity and provides the corresponding definition of weak consistency.

Location based link removal conditions depend on properties of 2-D geometric graphs by using stronger definition of connected inventive topology. CTC constructs a virtual network by arbitrarily selecting a location for each node in which the multiple locations advertised within a cut resultant network. Number of Hello messages required from each node to build weakly consistent local views Weak consistency is guaranteed when two or three recent Hello messages available for local view construction.

CTC mechanism overcomes the inconsistency in selecting the logical set. It selects the correct set of logical neighbors from the weak and strong consistent local views and minimizes the overhead of global synchronization. It also reduces radio interference loss in data transmission and minimizes local broadcast latency

Thus the Consistent Topology Control (CTC) in MANET is discussed and Cooperative Authentication and Topology Control (CATC) scheme is explained in next section.

CHANNEL BANDWIDTH ENHANCEMENT TO COOPERATIVE AUTHENTICATION AND TOPOLOGY CONTROL (CATC) SCHEME IN MANET

The proposed work presents a Channel Bandwidth Enhancement to CATC for wireless network. The service functions are arrived to appropriate channel bandwidth matching by allowing the operators to express different requirements in terms of throughput and availability. Defines the node pair having the communication link to improve the information gain of the network and reduces bandwidth consumption on topology control.

Supportive communication (SC) is a talented method to get better broadcast reliability over wireless medium and exploits user diversity to imitate multiple-antenna systems. It makes use of the broadcast environment by relaying overhead messages from source to destination and raises severe security issues.

It minimizes the network overhead due to authentication and integrity checks of assign channels to nodes. Service is a function of channel bandwidth and throughput of links between nodes depends on the total throughput achieved by links between two nodes. Network???s aggregate service is the sum of logarithm value placed on node pairs with a small throughput. Extended with addition of weights in terms of bandwidth capacity which re???ects the relative importance of links.

The below architecture diagram describes the Channel Bandwidth Enhancement to Cooperative Authentication and Topology Control in MANET.

Node mobility Occurs

Sensor Nodes

MANET

Density Classifier Model

Inconsistent view for selecting logical neighbors

using

LFR

Consistent Topology Control

CA Topology Control

Stable path discovery

Ensures correct decisions based on local views

Channel Bandwidth Enhancement

Using

Service Function

Fig 5.1 Architecture Diagram of proposed CATC Mechanism

CATC Mechanism of topology control with bandwidth adaptation reduce channel the bandwidth usage. Data loss arise due to dynamic topology is minimized and maintains minimal authentication and integration overhead.

Channel Assignment and Topology control

Cooperative Channel Assignment and Topology control consists of throughput estimation module for exact channel assignment and node connectivity. The estimation module considers the rate variety, position of mesh nodes, gateways, channel model, transmission power and receiver sensitivity. The channel and link selection module captures both path loss and neighboring channel interference.

Channel task defines node connectivity an interface???s transmission rate depends on the destination. Transmission rate in turn influences the throughput achieved by that link all other links in the transmission range function on the same channel. The set of links flanked by nodes contains fundamentals of the form denoting a link between nodes i and j operating on channel k. Existing multiple links flanked by two mesh nodes, operating on different channels where K is the number of assigned channels and i is the number of interfaces in node. The channel and topology control objective is to maximize the aggregate service.

Service Function and channel bandwidth

Service for node pair depends only on total throughput achieved by links between two nodes i and j. Network???s aggregate service is the sum of logarithms, in which more value, is placed on node pairs with small throughput.

Throughput judgment is based on link conflict graph, and maximal cliques. All links belonging to same maximal clique have equal throughput share. Links belonging to more than one clique are assigned the throughput of the most crowded one. Throughput opinion for each clique depends on time for each link belonging to the clique to broadcast one packet inversely proportional to its transmission rate. Estimation procedure profits by transmission throughputs with increasing values and follows a max-min distribution of wireless resources.

Thus, CATC is developed and the next section describes the resultant performance and discussion of the proposed CATC.

PERFORMANCE OF COOPERATIVE AUTHENTICATION AND TOPOLOGY CONTROL (CATC) IN MANET

The proposed Cooperative Authentication and Topology Control Scheme in a wireless sensor network use ns-2 network simulator. In this simulation, set up n nodes consistently at randomly surrounded by 900 ?? 900 squares, with n changeable among 100 and 1000 determining the mobile sensor node movement patterns. In particular, to exactly estimate the presentation of the system in which each node progress to an randomly selected position with an randomly chosen speed among a predefined minimum and maximum speed.

The moving mobile sensor networks stays there for a predefined pause time. After the pause time, it then randomly chooses and moves to another location. This random progression is constant during the simulation period. All simulations were performed for 1,000 simulation seconds, fixed a pause time of 25 simulation seconds and a minimum moving speed of 1.2 m/s of each node.

The performance of the proposed Cooperative Authentication and Topology control is measured in terms of

Nodes Lifetime

Location Information latency

Information loss rate

Throughput

Performance result of Node lifetime in LFR

In the field of networks, Node Lifetime refers to the unpredicted loss of life in the nodes. In MANET, the nodes lifetime increases in the Lifetime Forecast Routing protocol.

Mobility rate

Node Lifetime (%)

Lifetime Forecast Routing

Existing LAER

100

91

75

200

93

78

300

95

80

400

96

77

500

96

79

600

97

82

700

98

77

Table 6.1 Mobility rate vs. Node Lifetime

The above table (Table 6.1) describes the nodes lifetime obtained when mobility rate increases in the MANET environment. The outcome of the proposed Life Forecast Routing Protocol with nodes density and density classifier in MANET is compared with an existing Link-stAbility and Energy aware Routing protocols (LAER) for detecting nodes lifetime.

Fig 6.1 Mobility rate vs. Node Lifetime

Fig 6.1 describes the nodes lifetime occurred when mobility rate increases in the Mobile Ad-hoc network. The network lifetime in the LFR is high when we use the density classifier model. If the mobility rate exceeds the limit, then the lifetime of nodes from the MANET is high. Compared to an existing Link-stAbility and Energy aware Routing protocols (LAER) for nodes lifetime, the proposed Lifetime Forecast Routing Scheme outperforms approximately 50 ??? 70 % well in MANET.

Performance result of Location Information Latency in CTC

Information Location Latency is a measure of time taken to arrives the location information in the precise definition of which depends on the system and the time being measured. It is measured in terms of seconds (sec).

No. of nodes

Location information Latency (sec)

Proposed Consistent Topology Control

Existing k-edge Connected Topology Model

10

20

64

20

28

78

30

42

92

40

49

103

50

55

124

60

62

135

70

69

142

80

75

175

Table 6.2 No. of nodes vs. Location Information latency

The above table (Table 6.2) describes the location information latency needed for selection of a correct set of logical neighbors in local views. The location information latency by the proposed Consistent Topological Control Scheme in MANET is compared with the previous works k-edge Connected Topology Model.

Fig 6.2 No. of nodes vs. Location Information latency

Fig 6.2 describes the location information latency needed for selection of a correct set of logical neighbors in local views in MANET. The number of nodes varies from 10 to 80. Compared to the k-edge Connected Topology Model, the proposed CTC scheme consumes approximately 40 -45 % less time taken to locate the information.

Performance result of Information loss rate in CATC

In the field of information technology, Information Loss rate refers to the unexpected loss of data or information. Data loss is an error condition in which information is destroyed by failures or neglect in storage, transmission and processing.

No. of nodes

Information Loss rate (%)

Proposed CATC

JATC Scheme

k-edge Connected Topology

50

2

8

22

100

4

15

45

150

5

26

48

200

7

32

50

250

8

37

55

300

9

46

59

350

11

55

65

400

11

59

72

450

12

62

77

Table 6.3 No. of nodes vs. Information Loss rate

Table 6.3 describes the Information loss rate to perform an efficient data packet transmission in the wireless sensor networks. The information loss rate of the proposed Cooperative Authentication and Topology Control scheme in MANET is compared with the previous works JATC and k-edge Connected Topology Model.

The data loss in the wireless network is high when we use the k-edge Connected Topology Model. If the number of query processing exceeds the limit, then the chance of losing the data from the ad-hoc network is high. To protect the data from lost, in this work, used the service function to utilize the resources efficiently.

Fig 6.3 No. of nodes vs. Information Loss rate

Fig 6.1 describes the information loss rate occurred when number of nodes increases in the Mobile Ad-hoc network. Compared to an existing Joint Cooperative Topological Model and k-edge Connected Topology Model, the proposed Cooperative Authentication and Topology Control Scheme (CATC) outperform 70 ??? 80 % well in MANET.

Performance result of Throughput in CATC Scheme

Throughput is defined as the average rate of successful message delivery over a communication channel from one group to another group in MANET. The throughput is generally calculated in bits per second.

No. of packets

Throughput (%)

Proposed CATC

JATC Scheme

k-edge Connected Topology Model

100

91

75

60

200

92

78

62

300

93

79

64

400

94

76

65

500

95

75

65

600

96

75

67

700

95

79

68

800

98

80

69

Table 6.4 No. of packets vs. Throughput

Table 6.4 describes the throughput occurred when more number of packets to transfer data in Mobile Ad-hoc Network environment.

Fig 6.4 No. of packets vs. Throughput

Fig 6.4 describes the throughput raised over the data which are ready to pass onto the network. The proposed Cooperative Authentication and Topology Control Scheme (CATC) in MANET performed the throughput efficiently in sensor networks. Since the topology control scheme is carried over with the mobile ad-hoc network, the throughput in transmission is high. The throughput is measured in terms of percentage (%) meant that a bit of data that can be transmitted over the network in a less interval of time with higher throughput.

Compared to an existing Joint Authentication and Topology Control Scheme (JATC), and k-edge Connected Topology Model the transmission of data in network by enhancing the query, in this, there is a great extent of delay if more number of queries is waiting in the queue for transmission. But in the proposed CATC, the topology control scheme is taken place to control the loss of data and produce the higher throughput. The throughput is 25 ??? 35 % high in the proposed Cooperative Authentication and Topology Control Scheme.

CONCLUSION

A Cooperative Authentication and Topology Control Scheme (CATC) in MANET that seeks to minimize the channel bandwidth on topology control and reduction of information loss in dynamic topology. The CATC mechanism provides a significant solution to the security issues by providing the Cooperative Authentication Scheme. The authentication is done based on channel bandwidth does not require predicting the channel status but only the channel estimation.

Simulations are performed on the Cooperative Authentication and Topology Control scheme under a random relationship attack strategy in which it process the packet transmission range of the network. Thus the proposed cooperative authentication controls the sequence of the packet data arrives. The results indicate that the proposed authentication control mechanism accomplish gradually high good position, is capable to achieve efficient channel bandwidth authentication in the mobile ad-hoc network.

Performance Cooperative Authentication and Topology Control Scheme in a mobile ad-hoc network is compared with Link-stAbility and Energy aware Routing protocols (LAER), Joint Authentication and Topology Control Scheme (JATC), and k-edge Connected Topology Model and it produces 50 ??? 70 % more node lifetime, 70 ??? 80 % lesser information loss rate, 40 - 45 % less location information latency, 25 ??? 35 % high throughput for data transmission.