ISSN: 2250-3005 - ijcer

More documents

Recommendations

Info

International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 8Transmit: source to destination node packet transmitting,Receive: source to destination nodes packets received,Idle: the node is ready to transmit or receive packets,Sleep: it is the low power consumption mode state when a node cannot transmit or receive until woken up. The rest of the paperis organized as follows; in section 2, MANET Routing Protocols and their detail steps to design and implementing a networkmodel using QualNet. Section 3 Mobility and Energy Traffic, QualNet designed scenario dis cussed in section 4. and alsodescribes how the statistics in QualNet was collected. Section 5 describes the simulation results followed by section 4. Finallysection 5 concludes the research work with possible future work.2. Manet Routing Protocols:The routing of the information is the most challenging task due to the inherent characteristics of the wireless sensornetworks like dense deployment, mobility of nodes and energy constraint. The major issues related to this are: maximizingnetwork lifetime, minimum latency, resource awareness, topological changes, location awareness and scalability. We aretaking five routing protocols such as AODV, DYMO, OLSRv2-Niigata, OLSR-Inria and RIPng for our simulation andevaluation comparison [14].2.1. Ad-Hoc On Demand Distance Vector Protocol (AODV):The Ad hoc On Demand Distance Vector (AODV) [7] [8] is a routing protocol which is designed for ad hoc mobilenetworks. AODV is capable of both multicast as well as unicast routing. It builds and maintains routes between source nodes todesired destination nodes. AODV consists of a routing table which contains next hop information with sequence number.The protocol consists of two processes:(i) Route discovery(ii) Route maintenanceIn route discovery process a source node broadcasts a route request (RREQ) packet across the network. While thisRoute Request packet propagates in the network, a reverse route to the source is established along the way. RREQ packetcontains the source node's IP address, current sequence number, broadcast ID and the most recent sequence number for thedestination of which the source node is aware. When this packet reaches the destination (or a node having route to thedestination), a Route Reply packet is sent, in unicast, to the source node using this reverse path [9] [5]. The maintenance ofroutes is done only for the dynamic routes. A destination node after receiving the RREQ may send a route reply (RREP) reverseto the source node. The source node receives the RREP, and begins to forward data packets to the destination. A route isconsidered active as long as there are data packets intermittently travelling from the source node to the destination node alongthat path. Once the source stops sending data packets, the links will time out and ultimately be deleted from the intermediatenode routing tables. In route maintenance process if a link breaks occurs while the route is active; the node upstream of thebreaking link propagates a route error (RERR) message to the source node to inform it of the now unreachable destinations.After receiving the RERR, if the source node still requests the route, it can reinitiate route discovery.2.2. Dynamic MANET On-demand (DYMO):The DYMO [2] [6] [14] routing protocol enables reactive multihop unicast routing between source node toparticipating destination nodes. The working of DYMO is similar to AODV with small modification. The protocol also consistsof route discovery and route maintenance process. During route discovery, the source node initiates broadcasting of a RouteRequest (RREQ) throughout the network to find a route to the destination nodes. During this hop by-hop dissemination process,each intermediate node records a route to the source nodes. When the destination node receives the RREQ, it responds with aRoute Reply (RREP) sent hop-by-hop (multihop) toward the source node. Each intermediate node that receives the RREPcreates a route to the target, and then the RREP is unicast hop-by- hop toward the source. When the source node receives theRREP, routes have been established between the source node and destination node In route maintenance process this protocolmade two operations. In order to shield routes in use, node extends route life times upon successfully forwarding a packet. Inorder to reply to changes in the network topology, DYMO routers examine links over which traffic is flowing. When a datapacket is received and a route for the destination node is not known or the route is broken down, then the DYMO source routeris notified. A Route Error (RERR) is sent toward the source to indicate the current route to a particular destination is inva lid ormissing. When the source receives the RERR, it deletes the route, than the source node later receives a packet for forwarding tothe same inference, it will need to perform route discovery once more for that destination.||Issn 2250-3005(online) || ||December|| 2012 Page 323
International Journal Of Computational Engineering Research (ijceronline.com) Vol. 2 Issue. 82.3. Optimised Link State Routing Protocol (OLSR Inria)The Optimised Link Sate Routing Protocol (OLSR Inria) [7] [13] [14] is supports the large, dense mobile networks,with high nodal mobility and topological changes. It uses periodic messages to update the topological information of thenetwork among the respective nodes. It uses the concept of multi-point relays to calculate the route towards any source todestination in the network. The multi-point relays provide the optimal routes, and due the pro-active nature of the protocolbased on link state algorithm. OLSR Inria is an optimization over a pure link state protocol as it s queezes the size ofinformation send in the messages, and reduces the number of retransmissions. It provides optimal routes in terms of number ofhops. OLSR Inria is particularly suitable for large and dense networks [12]. The functioning of the OLSR Inria protocol isbased on periodically diffusing a topology control packet in the network. In OLSR Inria each node uses the most recentinformation to route a packet. Each node in the network selects a set of nodes in its neighborhood, which retransmits itspackets. This set of selected neighbor nodes is called the multipoint relays (MPR) of that node. The neighbors that do notbelong to MPR set read and process the packet but do not retransmit the broadcast packet received form node. For this purposeeach node maintains a set of its neighbors, which are called the MPR Selectors of that node.2.4. Optimized Link State Routing protocol v 2 Niigata (OLSRv2 Niigata)OLSRv2-Niigata also supports the QualNet simulator [8]. But two features have not been yet implemented; OLS Rpacket fragmentation, and multiple addresses and multiple interfaces handling.2.5. Routing Information Protocol next generation (RIPng)RIPng is a proactive Interior Gateway Protocol based on the distance-vector algorithm [15]. RIPng is intended for usewithin the IPv6-based Internet. As it is a distance-vector routing protocol, it forms routing tables by exchanging routing tableinformation with each router. There are two types of updates. One is a Regular update, which is periodically sent and containsthe whole routing table information. The other is a Triggered update, which is sent when a router's routing table changes andcontains only those routing entities which have been modified. When a router receives a packet, it updates its routing table andif its routing table has changed, it sends a triggered update to its neighbor router.3. Simulation Scenarios:We have using the QualNet 5.0.1 simulator for our analytical evaluation. In our simulation model, nodes are placedrandomly within a 1500m x 1500m physical terrain area so that the average node degree for 10-100 nodes is respectively. Inthis scenario wireless connection of varying network size (100 nodes) for MANET is used for analytical comparisonperformance of routing protocol AODV, DYMO, OLSRv2-Niigata, OLSR-Inria and RIPng over it data traffic of Constant BitRate (CBR) is applied between source and destination. The nodes are placed randomly over the region of 1500m x 1500m. Thenetwork of size 100 nodes. The Qualnet5.0.1 simulator network simulator is used to analyze the parametric performance of allprotocols defined above. We choose a square area in order to allow nodes to move more freely with equal node density. Wehave tested five different routing protocols and no. of different scenarios characterized by different network conditions. Eachdata point in the simulation graphs represent an average value obtained from 10 randomized simulation runs. The basicscenarios parameters are listed in table 1. The table 1 parameters implementing in the simu lator then analyze the performanceof AODV, DYMO, OLSRv2-Niigata, OLSR-Inria and RIPng routing protocols. The animated simulations of network size 100are shown in Figure 1.The performance is analyzed with varying network size keeping energy traffic load a nd random waypoint mobility constant. The metrics are used to study the protocols Average Jitter, Throughput , Average End to End delay,percentage efficiency of total Packet received , Energy consumed in transmit mode, Energy consumed in receive mode, an dEnergy consumed in Ideal mode. The results are shown in from Figure 2 to Figure 8. We evaluate the performances metrics inApplication and Physical layers of designed scenarios. The performance matrices are given below: Throughput Average Jitter End-to-End Delay Total Packet Received / Efficiency Energy Consumed in Transmit mode Energy Consumed in Receive Mode Energy Consumed in Idle ModeTable 1. Simulation Parameters for Energy Based Performance Analysis of AODV, DYMO, OLSRv2 -Niigata, OLSR-Inria andRIPng Routing Protocols||Issn 2250-3005(online) || ||December|| 2012 Page 324
Page 1 and 2:
ISSN: 2250-3005VOLUME 2 December 20
Page 3 and 4:
Meisam MahdaviQualification: Phd El
Page 5 and 6:
16. Implementation Of Serial Commun
Page 7 and 8:
45 Performance Evaluation Of Energy
Page 9 and 10:
International Journal Of Computatio
Page 11 and 12:
Page 13 and 14:
Page 15 and 16:
Page 17 and 18:
Page 19 and 20:
Page 21 and 22:
01 .048International Journal Of Com
Page 23 and 24:
Page 25 and 26:
Page 27 and 28:
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
Page 35 and 36:
Page 37 and 38:
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 48 and 49:
Page 50 and 51:
Page 52 and 53:
Page 54 and 55:
Page 56 and 57:
Page 58 and 59:
Page 60 and 61:
Page 62 and 63:
Page 64 and 65:
Page 66 and 67:
Page 68 and 69:
Page 70 and 71:
Page 72 and 73:
Page 74 and 75:
Page 76 and 77:
Page 78 and 79:
Page 80 and 81:
Page 82 and 83:
Page 84 and 85:
Page 86 and 87:
Page 88 and 89:
Page 90 and 91:
Page 92 and 93:
Page 94 and 95:
Page 96 and 97:
Page 98 and 99:
Page 100 and 101:
Page 102 and 103:
Page 104 and 105:
Page 106 and 107:
Page 108 and 109:
INTERNATIONAL JOURNAL OF COMPUTATIO
Page 110 and 111:
Page 112 and 113:
Page 114 and 115:
Page 116 and 117:
Page 118 and 119:
Page 120 and 121:
Page 122 and 123:
Page 124 and 125:
Page 126 and 127:
Page 128 and 129:
Page 130 and 131:
Page 132 and 133:
Page 134 and 135:
Page 136 and 137:
Page 138 and 139:
Page 140 and 141:
Page 142 and 143:
Page 144 and 145:
Page 146 and 147:
Page 148 and 149:
Page 150 and 151:
Page 152 and 153:
Page 154 and 155:
Page 156 and 157:
Page 158 and 159:
Page 160 and 161:
Page 162 and 163:
Page 164 and 165:
Page 166 and 167:
Page 168 and 169:
Page 170 and 171:
Page 172 and 173:
Page 174 and 175:
Page 176 and 177:
Page 178 and 179:
Page 180 and 181:
Page 182 and 183:
Page 184 and 185:
Page 186 and 187:
Body Acceleration (m/Sec2)Dynamic T
Page 188 and 189:
Page 190 and 191:
Page 192 and 193:
Page 194 and 195:
Page 196 and 197:
Page 198 and 199:
Page 200 and 201:
Page 202 and 203:
Page 204 and 205:
Page 206 and 207:
Page 208 and 209:
Page 210 and 211:
Page 212 and 213:
Page 214 and 215:
Page 216 and 217:
Page 218 and 219:
Page 220 and 221:
Page 222 and 223:
Page 224 and 225:
EigenvalueEigenvalueInternational J
Page 226 and 227:
Page 228 and 229:
Page 230 and 231:
Page 232 and 233:
Page 234 and 235:
Page 236 and 237:
Page 238 and 239:
Page 240 and 241:
Page 242 and 243:
Page 244 and 245:
Page 246 and 247:
Page 248 and 249:
Page 250 and 251:
Page 252 and 253:
Page 254 and 255:
Page 256 and 257:
Page 258 and 259:
Page 260 and 261:
Page 262 and 263:
Page 264 and 265:
Page 266 and 267:
Page 268 and 269:
Page 270 and 271:
Page 272 and 273:
Page 274 and 275:
Page 276 and 277:
Page 278 and 279:
Page 280 and 281: International Journal Of Computatio
Page 334 and 335: Average JitterThroughputInternation
Page 336 and 337: Energy Consumed in Received ModeEne
show all

ISSN: 2250-3005 - ijcer

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?