tag:blogger.com,1999:blog-47174411348589033952023-11-15T05:33:20.393-08:00Wireless NetworkAdminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.comBlogger36125tag:blogger.com,1999:blog-4717441134858903395.post-23365564573629732432009-11-08T20:49:00.000-08:002009-11-08T20:50:34.835-08:00Key distribution in wireless sensor networksKey distribution is an important issue in wireless sensor network (WSN) design. It is a newly developing field due to the recent improvements in wireless communications.<br /><br />Wireless sensor networks are networks of small, battery-powered, memory-constraint devices named sensor nodes, which have the capability of wireless communication over a restricted area [1]. Due to memory and power constraints, they need to be well arranged to build a fully functional network.<br /><br />source:http://en.wikipedia.org/wiki/Key_distribution_in_wireless_sensor_networksAdminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-47863927478568551032009-11-08T20:46:00.000-08:002009-11-08T20:49:16.923-08:00Key distribution schemesKey predistribution is the method of distribution of keys onto nodes before deployment. Therefore, the nodes build up the network using their secret keys after deployment, that is, when they reach their target position.<br /><br />Key predistribution schemes are various methods that have been developed by academicians for a better maintenance of key management in WSNs. Basically a key predistribution scheme has 3 phases:<br />1.Key distribution<br />2.Shared key discovery<br />3.Path-key establishment<br />During these phases, secret keys are generated, placed in sensor nodes, and each sensor node searches the area in its communication range to find another node to communicate. A secure link is established when two nodes discover one or more common keys (this differs in each scheme), and communication is done on that link between those two nodes. Afterwards, paths are established connecting these links, to create a connected graph. The result is a wireless communication network functioning in its own way, according to the key predistribution scheme used in creation.<br /><br />There are a number of aspects of WSNs on which key predistribution schemes are competing to achieve a better result. The most critical ones are: local and global connectivity, and resiliency.<br /><br />Local connectivity means the probability that any two sensor nodes have a common key with which they can establish a secure link to communicate.<br /><br />Global connectivity is the fraction of nodes that are in the largest connected graph over the number of all nodes.<br /><br />Resiliency is the number of links that cannot be compromised when a number of nodes(therefore keys in them) are compromised. So it is basically the quality of resistance against the attempts to hack the network. Apart from these, two other critical issues in WSN design are computational cost and hardware cost. Computational cost is the amount of computation done during these phases. Hardware cost is generally the cost of the memory and battery in each node.<br /><br />There is a most-cited key predistribution scheme which is usually called "the main scheme" that introduced the ides of random key distribution, whereby the randomness factor drastically improves resiliency [2].<br /><br />source:http://en.wikipedia.org/wiki/Key_distribution_in_wireless_sensor_networksAdminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-87361740996313575662009-09-17T18:13:00.000-07:002009-09-17T18:14:57.396-07:00What is shortest path routingshortest path routing A form of ROUTING which attempts to send PACKETS of data over a network in such a way that the path taken from the sending computer to the recipient computer is minimized. The path can be measured in either physical distance or in the number of HOPS. This form of routing uses a NON-ADAPTIVE ROUTING ALGORITHM.<br /><br />Refrence:<a href="http://www.encyclopedia.com/doc/1O12-shortestpathrouting.html">http://www.encyclopedia.com/doc/1O12-shortestpathrouting.html</a>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-66434529076612458292009-09-17T18:09:00.000-07:002009-09-17T18:11:09.623-07:00Open Shortest Path First<div>Open Shortest Path First (OSPF) is a dynamic routing protocol for use in Internet Protocol (IP) networks. Specifically, it is a link-state routing protocol and falls into the group of interior gateway protocols, operating within a single autonomous system (AS). It is defined as OSPF Version 2 in RFC 2328 (1998) for IPv4.[1] The updates for IPv6 are specified as OSPF Version 3 in RFC 5340 (2008).[2]<br />OSPF is perhaps the most widely-used interior gateway protocol (IGP) in large enterprise networks; IS-IS, another link-state routing protocol, is more common in large service provider networks. The most widely-used exterior gateway protocol is the Border Gateway Protocol (BGP), the principal routing protocol between autonomous systems on the Internet.</div>
<br /><div> </div>
<br /><div>Refrence:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-35034225425081412472009-09-17T18:08:00.000-07:002009-09-17T18:11:09.626-07:00Neighbor relationships<div>Routers in the same broadcast domain or at each end of a point-to-point telecommunications link form adjacencies when they have detected each other. This detection occurs when a router identifies itself in a hello OSPF protocol packet. This is called a two way state and is the most basic relationship. The routers in an Ethernet or frame relay network select a designated router (DR) and a backup designated router (BDR) which act as a hub to reduce traffic between routers. OSPF uses both unicast and multicast to send "hello packets" and link state updates.<br />As a link state routing protocol, OSPF establishes and maintains neighbor relationships in order to exchange routing updates with other routers. The neighbor relationship table is called an adjacency database in OSPF. Provided that OSPF is configured correctly, OSPF forms neighbor relationships only with the routers directly connected to it. The routers that it forms a neighbor relationship with must be in the same area as the interface with which it is using to form a neighbor relationship. An interface can only belong to a single area.</div>
<br /><div> </div>
<br /><div>Refrence:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-3401819622198928062009-09-17T18:03:00.000-07:002009-09-17T18:11:09.629-07:00Area types<div>An OSPF network is divided into areas that are labeled with 32-bit area identifiers. The area identifiers are commonly, but not always, written in the dot-decimal notation of an IPv4 address. However, they are not IP addresses and may duplicate, without conflict, any IPv4 address. The area identifiers for IPv6 implementations of OSPF (OSPFv3) also use 32-bit identifiers written in the same notation. While most OSPF implementations will right-justify an area number written in other than dotted decimal format (e.g., area 1), it is wise to always use dotted-decimal formats. Most implementations expand area 1 to the area identifier 0.0.0.1, but some have been known to expand it as 1.0.0.0.<br />Areas are logical groupings of hosts and networks, including their routers having interfaces connected to any of the included networks. Each area maintains a separate link state database whose information may be summarized towards the rest of the network by the connecting router. Thus, the topology of an area is unknown outside of the area. This reduces the amount of routing traffic between parts of an autonomous system.<br />Several "special" area types are defined.</div>
<br /><div><strong></strong> </div>
<br /><div><strong>Backbone area</strong></div>
<br /><div>The backbone area (also known as area 0 or area 0.0.0.0) forms the core of an OSPF network. All other areas are connected to it, and inter-area routing happens via routers connected to the backbone area and to their own associated areas. It is the logical and physical structure for the 'OSPF domain' and is attached to all nonzero areas in the OSPF domain. Note that in OSPF the term Autonomous System Border Router (ASBR) is historic, in the sense that many OSPF domains can coexist in the same Internet-visible autonomous system, RFC1996 (ASGuidelines 1996, p. 25) [4].<br />The backbone area is responsible for distributing routing information between nonbackbone areas. The backbone must be contiguous, but it does not need to be physically contiguous; backbone connectivity can be established and maintained through the configuration of virtual links.<br />All OSPF areas must connect to the backbone area. This connection, however, can be through a virtual link. For example, assume area 0.0.0.1 has a physical connection to area 0.0.0.0. Further assume that area 0.0.0.2 has no direct connection to the backbone, but this area does have a connection to area 0.0.0.1. Area 0.0.0.2 can use a virtual link through the transit area 0.0.0.1 to reach the backbone. To be a transit area, an area has to have the transit attribute, so it cannot be stubby in any way.</div>
<br /><div><strong></strong> </div>
<br /><div><strong>Stub area</strong></div>
<br /><div>A stub area is an area which does not receive route advertisements external to the autonomous system (AS) and routing from within the area is based entirely on a default route. This reduces the size of the routing databases for the area's internal routers.<br />Modifications to the basic concept of stub areas exist in the not-so-stubby area (NSSA). In addition, several other proprietary variation have been implemented by systems vendors, such as the totally stubby area (TSA) and the NSSA totally stubby area, both an extension in Cisco Systems routing equipment.</div>
<br /><div> </div>
<br /><div><strong>Not-so-stubby area</strong></div>
<br /><div>A not-so-stubby area (NSSA) is a type of stub area that can import autonomous system external routes and send them to other areas, but still cannot receive AS external routes from other areas. NSSA is an extension of the stub area feature that allows the injection of external routes in a limited fashion into the stub area.</div>
<br /><div> </div>
<br /><div>Refrence:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-65020079643093228482009-09-17T17:59:00.000-07:002009-09-17T18:11:09.633-07:00Proprietary extensions<div><strong>Totally stubby area</strong> </div>
<br /><div>A totally stubby area in Cisco Systems routers,[5] is similar to a stub area. However, this area does not allow summary routes in addition to not having external routes, that is, inter-area (IA) routes are not summarized into totally stubby areas. The only way for traffic to get routed outside of the area is a default route which is the only Type-3 LSA advertised into the area. When there is only one route out of the area, fewer routing decisions have to be made by the route processor, which lowers system resource utilization. Occasionally, it is said that a TSA can have only one ABR.[citation needed] This is not true. If there are multiple ABRs, as might be required for high availability, routers interior to the TSA will send non-intra-area traffic to the ABR with the lowest intra-area metric (the "closest" ABR).</div>
<br /><div><strong></strong> </div>
<br /><div><strong>NSSA totally stubby area </strong><br />Cisco Systems also implements a proprietary version of NSSA, called a NSSA totally stubby area. It takes on the attributes of a TSA, meaning that type 3 and type 4 summary routes are not flooded into this type of area. It is also possible to declare an area both totally stubby and not-so-stubby, which means that the area will receive only the default route from area 0.0.0.0, but can also contain an autonomous system border router (ASBR) that accepts external routing information and injects it into the local area, and from the local area into area 0.0.0.0.<br />Redistribution into an NSSA area creates a special type of LSA known as TYPE 7, which can exist only in an NSSA area. An NSSA ASBR generates this LSA, and an NSSA ABR router translates it into type 5 LSA which gets propagated into the OSPF domain.<br />An area can simultaneously be not-so-stubby and totally stubby. This is done when the practical place to put an ASBR, as, for example, with a newly acquired subsidiary, is on the edge of a totally stubby area. In such a case, the ASBR does send externals into the totally stubby area, and they are available to OSPF speakers within that area. In Cisco's implementation, the external routes can be summarized before injecting them into the totally stubby area. In general, the ASBR should not advertise default into the TSA-NSSA, although this can work with extremely careful design and operation, for the limited special cases in which such an advertisement makes sense.<br />By declaring the totally stubby area as NSSA, no external routes from the backbone, except the default route, enter the area being discussed. The externals do reach area 0.0.0.0 via the TSA-NSSA, but no routes other than the default route enter the TSA-NSSA. Routers in the TSA-NSSA send all traffic to the ABR, except to routes advertised by ASBR.</div>
<br /><div> </div>
<br /><div><strong>Transit area</strong></div>
<br /><div>A transit area is an area with two or more OSPF border routers and is used to pass network traffic from one adjacent area to another. The transit area does not originate this traffic and is not the destination of such traffic.</div>
<br /><div> </div>
<br /><div>Refrence:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-42755504744797307422009-09-17T17:56:00.000-07:002009-09-17T18:11:09.636-07:00Path preference<div>OSPF uses path cost as its basic routing metric, which was defined by the standard not to equate to any standard value such as speed, so the network designer could pick a metric important to the design. In practice, it is determined by the speed (bandwidth) of the interface addressing the given route, although that tends to need network-specific scaling factors now that links faster than 100 Mbit/s are common. Cisco uses a metric like 10^8/bandwidth (the base value, 10^8 by default, can be adjusted). So, a 100Mbit/s link will have a cost of 1, a 10Mbit/s a cost of 10 and so on. But for links faster than 100Mbit/s, the cost would be <1.<br />Metrics, however, are only directly comparable when of the same type. There are four types of metrics, with the most preferred type listed in order below. An intra-area route is always preferred to an inter-area route regardless of metric, and so on for the other types.</div>
<br /><ol>
<br /><li>Intra-area </li>
<br /><li>Inter-area </li>
<br /><li>External Type 1, which includes both the external path cost and the sum of internal path costs to the ASBR that advertises the route, 4.</li>
<br /><li>External Type 2, the value of which is solely that of the external path cost.</li></ol>
<br /><p>Refrence:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></p>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-37795864040913589342009-09-17T17:54:00.000-07:002009-09-17T18:11:09.640-07:00Traffic engineering<div>OSPF-TE is an extension to OSPF extending the expressivity to allow for traffic engineering and use on non-IP networks (RFC 3630)[6]. More information about the topology can be exchanged using opaque LSA carrying type-length-value elements. These extensions allow OSPF-TE to run completely out of band of the data plane network. This means that it can also be used on non-IP networks, such as optical networks.<br />OSPF-TE is mainly used within GMPLS networks, as a means to describe the topology over which GMPLS paths can be established. GMPLS then uses its own path setup and forwarding protocols, once it has the full network map.</div>
<br /><div>Refrence:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-71753513351779448832009-09-17T17:47:00.000-07:002009-09-17T18:11:09.645-07:00OSPF router types<p>OSPF defines the following router types:</p>
<br /><ul>
<br /><li>Area border router (ABR) </li>
<br /><li>Autonomous system border router (ASBR)</li>
<br /><li>Internal router (IR) </li>
<br /><li>Backbone router (BR) </li></ul>
<br /><p>The router types are attributes of an OSPF process. A given physical router may have one or more OSPF processes. For example, a router that is connected to more than one area, and which receives routes from a BGP process connected to another AS, is both an ABR and an ASBR.<br />Each router has an identifier, customarily written in the dotted decimal format (e.g.: 1.2.3.4) of an IP address. This ID must be configured to an OSPF instance in order to be considered the ID. If not explicitly configured, the highest logical IP address will assume the router ID role. The router ID does not have to be a part of any routable subnet in the network and often isn't to avoid confusion.<br />Note: Do not confuse router types with designated router (DR), or backup designated router (BDR), which is an attribute of a router interface, not the router itself.<br /><strong>Area border router</strong></p>
<br /><div>An ABR is a router that connects one or more OSPF areas to the main backbone network. It is considered a member of all areas it is connected to. An ABR keeps multiple copies of the link-state database in memory, one for each area to which that router is connected.<br /><strong>Autonomous system boundary router</strong></div>
<br /><div>An ASBR is a router that is connected to more than one AS and that exchanges routing information with routers in other ASs. ASBRs typically also run a non-IGP routing protocol (e.g., BGP), or use static routes, or both. An ASBR is used to distribute routes received from other ASs throughout its own AS.<br /><strong>Internal router</strong></div>
<br /><div>An IR is a router that only has OSPF neighbor relationships with interfaces in the same area.<br /><strong>Backbone router</strong></div>
<br /><div><strong>Backbone Routers</strong>: These are routers that are part of the OSPF backbone. By definition, this includes all area border routers, since those routers pass routing information between areas. However, a backbone router may also be a router that connects only to other backbone (or area border) routers, and is therefore not part of any area (other than Area 0).<br />Note that: an area border router is always a backbone router, but a backbone router is not necessarily an area border router.</div>
<br /><div>source:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-38596734805758353682009-09-17T17:39:00.000-07:002009-09-17T18:11:09.648-07:00Designated router<p>A designated router (DR) is the router interface elected among all routers on a particular multiaccess network segment, generally assumed to be broadcast multiaccess. Special techniques, often vendor-dependent, may be needed to support the DR function on nonbroadcast multiaccess (NBMA) media. It is usually wise to configure the individual virtual circuits of a NBMA subnet as individual point-to-point lines; the techniques used are implementation-dependent.<br />Do not confuse the DR with an OSPF router type. A given physical router can have some interfaces that are designated (DR), others that are backup designated (BDR), and others that are non-designated. If no router is DR or BDR on a given subnet, the DR is first elected, and then a second election is held if there is more than one BDR. [8] The DR is elected based on the following default criteria:<br /></p>
<br /><ul>
<br /><li>If the priority setting on a OSPF router is set to 0, that means it can NEVER become a DR or BDR (Backup Designated Router).</li>
<br /><li>When a DR fails and the BDR takes over, there is another election to see who becomes the replacement BDR. </li>
<br /><li>The router sending the Hello packets with the highest priority wins the election. </li>
<br /><li>If two or more routers tie with the highest priority setting, the router sending the Hello with the highest RID (Router ID) wins. NOTE: a RID is the highest logical (loopback) IP address configured on a router, if no logical/loopback IP address is set then the Router uses the highest IP address configured on its active interfaces. (e.g. 192.168.0.1 would be higher than 10.1.1.2). </li>
<br /><li>Usually the router with the second highest priority number becomes the BDR.</li>
<br /><li>The priority values range between 0 - 254, with a higher value increasing its chances of becoming DR or BDR. </li>
<br /><li>IF a HIGHER priority OSPF router comes online AFTER the election has taken place, it will not become DR or BDR until (at least) the DR and BDR fail. </li>
<br /><li>If the current DR 'goes down' the current BDR becomes the new DR and a new election takes place to find another BDR. If the new DR then 'goes down' and the original DR is now available, it then becomes DR again, but no change is made to the current BDR. </li></ul>
<br /><p>DR's exist for the purpose of reducing network traffic by providing a source for routing updates, the DR maintains a complete topology table of the network and sends the updates to the other routers via multicast. All routers in an area will form a slave/master relationship with the DR. They will form adjacencies with the DR and BDR only. Every time a router sends an update, it sends it to the DR and BDR on the multicast address 224.0.0.6. The DR will then send the update out to all other routers in the area, to the multicast address 224.0.0.5. This way all the routers do not have to constantly update each other, and can rather get all their updates from a single source. The use of multicasting further reduces the network load. DRs and BDRs are always setup/elected on Broadcast networks (Ethernet). DR's can also be elected on NBMA (Non-Broadcast Multi-Access) networks such as Frame Relay or ATM. DRs or BDRs are not elected on point-to-point links (such as a point-to-point WAN connection) because the two routers on either sides of the link must become fully adjacent and the bandwidth between them cannot be further optimized.</p>
<br /><p>source:<a href="http://en.wikipedia.org/wiki/Open_Shortest_Path_First">http://en.wikipedia.org/wiki/Open_Shortest_Path_First</a></p>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-86205125624207387892009-09-17T08:09:00.000-07:002009-09-17T08:10:43.978-07:00Distance-Vector Routing ProtocolsThis type of routing protocol requires that each router simply inform its neighbors of its routing table. For each network path, the receiving routers pick the neighbor advertising the lowest cost, then add this entry into its routing table for re-advertisement. Hello and RIP are common D-V routing protocols. Common enhancements to D-V algorithms include split horizon, poison reverse, triggered updates, and holddown. You will find a good discussion of D-V, or Bellman-Ford algorithms in RIP's protocol specification, <a href="http://www.freesoft.org/CIE/RFC/1058/6.htm">RFC 1058</a>.<br /><br />source:<a href="http://www.freesoft.org/CIE/Topics/117.htm">http://www.freesoft.org/CIE/Topics/117.htm</a>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-88776826736089117852009-09-17T08:07:00.000-07:002009-09-17T08:08:51.914-07:00Distance-vector routing protocol<div>A distance-vector routing protocol is one of the two major classes of routing protocols used in packet-switched networks for computer communications, the other major class being the link-state protocol. A distance-vector routing protocol uses the Bellman-Ford algorithm to calculate paths.<br />Distance Vector algorithm is routing algorithm that has information of the routers attached to it.<br />Examples of distance-vector routing protocols include RIPv1 and 2 and IGRP. EGP and BGP are not pure distance-vector routing protocols, because a distance-vector protocol calculates routes based only on link costs whereas in BGP, for example, the local route preference value takes priority over the link cost. In many cases, EGP and BGP are considered DV (distance-vector) routing protocols.<br />A distance-vector routing protocol requires that a router informs its neighbors of topology changes periodically and, in some cases, when a change is detected in the topology of a network. Compared to link-state protocols, which require a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead</div>
<br /><div> </div>
<br /><div>source:<a href="http://en.wikipedia.org/wiki/Distance-vector_routing_protocol">http://en.wikipedia.org/wiki/Distance-vector_routing_protocol</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-1675649069994114142009-09-17T08:05:00.000-07:002009-09-17T08:08:51.918-07:00Method of Distance-vector routing protocol<div>The methods used to calculate the best path for a network are different between different routing protocols but the fundamental features of distance-vector algorithms are the same across all DV based protocols.<br />As the name suggests the DV protocol is based on calculating the direction and distance to any link in a network. The cost of reaching a destination is calculated using various route metrics. <a title="Routing Information Protocol" href="http://en.wikipedia.org/wiki/Routing_Information_Protocol">RIP</a> uses the hop count of the destination whereas <a class="mw-redirect" title="IGRP" href="http://en.wikipedia.org/wiki/IGRP">IGRP</a> takes into account other information such as node delay and available bandwidth.<br />Updates are performed periodically in a distance-vector protocol where all or part of a router's routing table is sent to all its neighbors that are configured to use the same distance-vector routing protocol. RIP supports cross-platform distance vector routing whereas IGRP is a Cisco Systems proprietary distance vector routing protocol. Once a router has this information it is able to amend its own routing table to reflect the changes and then inform its neighbors of the changes. This process has been described as ‘routing by rumor’ because routers are relying on the information they receive from other routers and cannot determine if the information is actually valid and true. There are a number of features which can be used to help with instability and inaccurate routing information</div>
<br /><div> </div>
<br /><div>source:<a href="http://en.wikipedia.org/wiki/Distance-vector_routing_protocol">http://en.wikipedia.org/wiki/Distance-vector_routing_protocol</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-8945343915005005542009-09-17T08:03:00.000-07:002009-09-17T08:08:51.921-07:00Limitations in Distance-vector routing protocol<div>The Bellman-Ford algorithm does not prevent routing loops from happening and suffers from the count-to-infinity problem. The core of the count-to-infinity problem is that if A tells B that it has a path somewhere, there is no way for B to know if the path has B as a part of it. To see the problem clearly, imagine a subnet connected like A-B-C-D-E-F, and let the metric between the routers be "number of jumps". Now suppose that A goes down (out of order). In the vector-update-process B notices that its once very short route of 1 to A is down - B does not receive the vector update from A. The problem is, B also gets an update from C, and C is still not aware of the fact that A is down - so it tells B that A is only two jumps from it, which is false. This slowly propagates through the network until it reaches infinity (in which case the algorithm corrects itself, due to the "Relax property" of Bellman Ford).</div>
<br /><div> </div>
<br /><div>source:<a href="http://en.wikipedia.org/wiki/Distance-vector_routing_protocol">http://en.wikipedia.org/wiki/Distance-vector_routing_protocol</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-51548744658280977872009-09-17T07:56:00.000-07:002009-09-17T08:02:29.950-07:00Partial solutions of Distance-vector routing protocolRIP uses Split Horizon with Poison Reverse technique to reduce the chance of forming loops and use a maximum number of hops to counter the count-to-infinity problem. These measures avoid the formation of routing loops in some, but not all, cases. The addition of a hold time (refusing route updates for a few minutes after a route retraction) avoids loop formation in virtually all cases, but causes a significant increase in convergence times.<br />A number of loop-free distance vector protocols, such as EIGRP and DSDV, have been developed. These avoid loop formation in all cases, but suffer from increased complexity, and their deployment has been slowed down by the success of link-state protocols such as OSPF.<br /><br />source:<a href="http://en.wikipedia.org/wiki/Distance-vector_routing_protocol">http://en.wikipedia.org/wiki/Distance-vector_routing_protocol</a>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-60926024426269608642009-09-17T04:42:00.000-07:002009-09-17T04:44:12.972-07:00On-demand routing protocols<div>Another in the family of routing protocols for mobile ad-hoc network is on-demand routing protocols. With on-demand protocols, if a source node requires a route to the destination for which it does not have route information, it initiates a route discovery process which goes from one node to the other until it reaches to the destination or an intermediate node has a route to the destination.<br />It is the responsibility of the route request receiver node to reply back to the source node about the possible route to the destination. The source node uses this route for data transmission to the destination node. Some of the better known on-demand protocols are Ad-hoc On-demand Distance Vector routing (AODV), Dynamic Source Routing (DSR) and Temporary Ordered Routing Algorithm (TORA).<br />These protocols differ on storing the previously known route information and on how they use the established route data. Again, in a network with many participating nodes we may suffer with same sort of problems what we have seen in table-driven protocols.<br />ConclusionIn conclusion, routing is one of the core issues in mobile ad-hoc network. An effective routing mechanism will be helpful to extend the successful deployment of mobile ad-hoc networks. Current routing protocols provide routing solutions up to a certain level, but are lacking the ability to handle other related issues.<br />Moreover most of these protocols have designed and implemented on small scale. If these protocols could be extended further by taking into accounts other routing related factors we may come out with a standard routing solution for mobile ad-hoc network.<br />Dr. Humayun Bakht completed his Ph.D at the School of Computing and Mathematics in Liverpool at John Moores University. Prior to his current course of studies, he has successfully completed his MSc Software Engineering and BSc Electronics Engineering from University of Liverpool UK and Sir Syed University of Engineering and Technology in Karachi, Pakistan. Humayun's research interest is mobile ad-hoc networks, in particular, the development of a new routing algorithm for this type of networking. He can be reached at <a href="mailto:humayunbakht@yahoo.co.uk"><a href="mailto:humayunbakht@yahoo.co.uk"><a href="mailto:humayunbakht@yahoo.co.uk">humayunbakht@yahoo.co.uk</a></a></a> and you can visit his Web site at <a href="http://www.geocities.com/humayunbakht/"><a href="http://www.geocities.com/humayunbakht/"><a href="http://www.geocities.com/humayunbakht/">http://www.geocities.com/humayunbakht/</a></a></a>.</div>
<br /><div> </div>
<br /><div>source:<a href="http://www.computingunplugged.com/issues/issue200407/00001326002">http://www.computingunplugged.com/issues/issue200407/00001326002</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-35252165779830044452009-09-17T04:35:00.000-07:002009-09-17T04:41:28.813-07:00Routing protocols for mobile ad-hoc networksWe continue our series on mobile ad-hoc networks with a discussion of routing protocols, or how the information is going to move throughout the network.<br />Mobile ad-hoc networks, also known as short-lived networks, are autonomous systems of mobile nodes forming network in the absence of any centralized support. This is a new form of network and might be able to provide services at places where it is not possible otherwise. Absence of fixed infrastructure poses several types of challenges for this type of networking. Among these challenges is routing.<br />By routing, we mean process of exchanging information from one station to the other stations of the network. Routing protocols of mobile ad-hoc network tend to need different approaches from existing Internet protocols, since most of the existing Internet protocols were designed to support routing in a network with fixed structure. In the academic and industrial world, those who think about such things have written quite a few papers proposing various routing solutions for mobile ad-hoc networks. Proposed solutions could be classified into six types: table-driven, on-demand, hierarchical, power-aware, geographical, and multicast protocols.<br />Table-driven protocolsTable-driven protocols are one of the old ways of acquiring routing in mobile ad-hoc networks. These protocols maintain consistent overview of the network. Each node uses routing tables to store the location information of other nodes in the network. This information is used to transfer data among various nodes of the network.<br />To ensure the freshness of the routing tables, these protocols adopts different sorts of mechanisms. One of the adopted methods is broadcasting "hello," a special message containing address information, at fixed intervals of time. On receiving this message, each node updates its routing tables with fresh locations information of other participating nodes. Destination Sequence Distance Vector routing protocol (DSDV), Wireless Routing Protocol (WRP) and Cluster-head Gateway Switch Routing (CGSR) are some of the popular table-driven protocols for mobile ad-hoc networks.<br />Table-driven protocols might not be considered an effective routing solution for mobile ad-hoc network. Nodes in mobile ad-hoc networks operate with low battery power and with limited bandwidth. Presence of high mobility, large routing tables and low scalability result in consumption of bandwidth and battery life of the nodes. Moreover continuous updates could create unnecessary network overhead.<br /><br />source:<a href="http://www.computingunplugged.com/issues/issue200407/00001326001.html">http://www.computingunplugged.com/issues/issue200407/00001326001.html</a>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-36125284046005368272009-09-17T04:31:00.000-07:002009-09-17T04:32:16.288-07:00Mobile ad hoc networkA mobile ad hoc network (MANET), sometimes called a mobile mesh network, is a self-configuring <a title="Computer network" href="http://en.wikipedia.org/wiki/Computer_network">network</a> of mobile devices connected by <a title="Wireless" href="http://en.wikipedia.org/wiki/Wireless">wireless</a> links.<a href="http://en.wikipedia.org/wiki/Mobile_ad-hoc_network#cite_note-0">[1]</a><br />Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a <a title="Router" href="http://en.wikipedia.org/wiki/Router">router</a>. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic.<br />Such networks may operate by themselves or may be connected to the larger <a title="Internet" href="http://en.wikipedia.org/wiki/Internet">Internet</a>.<br />MANETs are a kind of <a class="mw-redirect" title="Wireless ad hoc networks" href="http://en.wikipedia.org/wiki/Wireless_ad_hoc_networks">wireless ad hoc networks</a> that usually has a routeable networking environment on top of a <a title="Link Layer" href="http://en.wikipedia.org/wiki/Link_Layer">Link Layer</a> ad hoc network. They are also a type of <a class="mw-redirect" title="Mesh network" href="http://en.wikipedia.org/wiki/Mesh_network">mesh network</a>, but many mesh networks are <a title="Municipal wireless network" href="http://en.wikipedia.org/wiki/Municipal_wireless_network">not mobile</a> or not wireless.<br />The growth of <a title="Laptop" href="http://en.wikipedia.org/wiki/Laptop">laptops</a> and <a title="IEEE 802.11" href="http://en.wikipedia.org/wiki/IEEE_802.11">802.11/Wi-Fi</a> wireless networking have made MANETs a popular research topic since the mid- to late 1990s. Many academic papers evaluate <a class="mw-redirect" title="Network protocols" href="http://en.wikipedia.org/wiki/Network_protocols">protocols</a> and abilities assuming varying degrees of mobility within a bounded space, usually with all nodes within a few hops of each other and usually with nodes sending data at a constant rate. Different protocols are then evaluated based on the packet drop rate, the overhead introduced by the routing protocol, and other measures.<br />source:<a href="http://en.wikipedia.org/wiki/Mobile_ad-hoc_network">http://en.wikipedia.org/wiki/Mobile_ad-hoc_network</a>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-144215342153305432009-09-17T04:28:00.000-07:002009-09-17T04:31:10.736-07:00Types of MANET<ol><li><a class="mw-redirect" title="VANET" href="http://en.wikipedia.org/wiki/VANET">Vehicular Ad Hoc Networks</a> (VANETs) are used for communication among vehicles and between vehicles and roadside equipment. </li><li><a class="mw-redirect" title="Intelligent vehicular ad hoc network" href="http://en.wikipedia.org/wiki/Intelligent_vehicular_ad_hoc_network">Intelligent vehicular ad hoc networks</a> (InVANETs) are a kind of artificial intelligence that helps vehicles to behave in intelligent manners during vehicle-to-vehicle collisions, accidents, drunken driving etc. </li><li>Internet Based Mobile Ad-hoc Networks (iMANET) are ad-hoc networks that link mobile nodes and fixed Internet-gateway nodes. In such type of networks normal ad-hoc routing <a title="Algorithm" href="http://en.wikipedia.org/wiki/Algorithm">algorithms</a> don't apply directly. </li></ol>source:<a href="http://en.wikipedia.org/wiki/Mobile_ad-hoc_network">http://en.wikipedia.org/wiki/Mobile_ad-hoc_network</a>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-4199584853538026392009-09-17T04:27:00.000-07:002009-09-17T04:28:50.693-07:00Practical use<div><a title="One Laptop per Child" href="http://en.wikipedia.org/wiki/One_Laptop_per_Child">One Laptop per Child</a> program has developed a laptop making use of an <a title="IEEE 802.11s" href="http://en.wikipedia.org/wiki/IEEE_802.11s">IEEE 802.11s</a> based ad hoc <a title="Wireless mesh network" href="http://en.wikipedia.org/wiki/Wireless_mesh_network">wireless mesh networking</a> chip. It is the only such device sold to consumers.<br />In September 2007, the Swedish company <a title="TerraNet AB" href="http://en.wikipedia.org/wiki/TerraNet_AB">TerraNet AB</a> presented a mesh network of <a title="Mobile phone" href="http://en.wikipedia.org/wiki/Mobile_phone">mobile phones</a> that allowed calls and data to be routed between participating handsets, without <a title="Cell site" href="http://en.wikipedia.org/wiki/Cell_site">cell sites</a>.</div>
<br /><div>source:<a href="http://en.wikipedia.org/wiki/Mobile_ad-hoc_network">http://en.wikipedia.org/wiki/Mobile_ad-hoc_network</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-49310471395957696862009-09-16T10:31:00.000-07:002009-09-16T11:35:54.040-07:00Wireless Sensor Network Videos<p><br /><br /><iframe allowfullscreen='allowfullscreen' webkitallowfullscreen='webkitallowfullscreen' mozallowfullscreen='mozallowfullscreen' width='302' height='266' src='https://www.blogger.com/video.g?token=AD6v5dz9rlmUd9A2JxXXU2aXlWj7XrbMIgM3tkKz9YqmIaOyVLEksnV-Dw6BHpZIHD7lwusSDovzNKwO6dFGcbFskw' class='b-hbp-video b-uploaded' frameborder='0'></iframe><iframe allowfullscreen='allowfullscreen' webkitallowfullscreen='webkitallowfullscreen' mozallowfullscreen='mozallowfullscreen' width='302' height='266' src='https://www.blogger.com/video.g?token=AD6v5dwWXh1vuJkkhAgGawXa1NIpsS55YCg_DxDZDlALQDAXPuRVX1VBBaD6VtKMBQpEERsDrDzI_jqS310A0sZUSg' class='b-hbp-video b-uploaded' frameborder='0'></iframe><br /></p><p>source:http//www.youtube.com<br /></p>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-14320978538725553842009-09-16T10:10:00.000-07:002009-09-16T10:13:19.947-07:00What is Wireless ad hoc network?<div>A wireless ad hoc network is a decentralized wireless network.[1] The network is ad hoc because each node is willing to forward data for other nodes, and so the determination of which nodes forward data is made dynamically based on the network connectivity. This is in contrast to wired networks in which routers perform the task of routing. It is also in contrast to managed (infrastructure) wireless networks, in which a special node known as an access point manages communication among other nodes.</div>
<br /><div> </div>
<br /><div>Refrence:<a href="http://en.wikipedia.org/wiki/Wireless_ad_hoc_network">http://en.wikipedia.org/wiki/Wireless_ad_hoc_network</a></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-91587314799683334712009-09-16T09:38:00.000-07:002009-09-16T10:14:50.095-07:00Application of Wireless ad hoc networkThe decentralized nature of wireless ad hoc networks makes them suitable for a variety of applications where central nodes can't be relied on, and may improve the scalability of wireless ad hoc networks compared to wireless managed networks, though theoretical[2] and practical[3] limits to the overall capacity of such networks have been identified.<br />Minimal configuration and quick deployment make ad hoc networks suitable for emergency situations like natural disasters or military conflicts. The presence of a dynamic and adaptive routing protocol will enable ad hoc networks to be formed quickly.<br />Wireless ad hoc networks can be further classified by their application:<br />mobile ad hoc networks (MANETs) wireless mesh networks wireless sensor networks.<br /><br />Refrence:<a href="http://en.wikipedia.org/wiki/Wireless_ad_hoc_network">http://en.wikipedia.org/wiki/Wireless_ad_hoc_network</a>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0tag:blogger.com,1999:blog-4717441134858903395.post-49550239306360488162009-09-16T08:21:00.000-07:002009-09-16T08:58:07.628-07:00Wireless Ad Hoc Sensor Networks<a href="http://www.itl.nist.gov/div892/images/manetimag1.jpg"><img style="WIDTH: 128px; HEIGHT: 86px; CURSOR: hand" border="0" alt="" src="http://www.itl.nist.gov/div892/images/manetimag1.jpg" /></a> <a href="http://www.itl.nist.gov/div892/images/manetimag2.jpg"><img style="WIDTH: 107px; HEIGHT: 67px; CURSOR: hand" border="0" alt="" src="http://www.itl.nist.gov/div892/images/manetimag2.jpg" /></a> <a href="http://www.itl.nist.gov/div892/images/2hop2.jpg"><img style="WIDTH: 94px; HEIGHT: 72px; CURSOR: hand" border="0" alt="" src="http://www.itl.nist.gov/div892/images/2hop2.jpg" /></a> <a href="http://www.itl.nist.gov/div892/images/ripple2.jpg"><img style="WIDTH: 131px; HEIGHT: 85px; CURSOR: hand" border="0" alt="" src="http://www.itl.nist.gov/div892/images/ripple2.jpg" /></a><br /><br /><div><div><div><div><p align="justify">A wireless ad hoc sensor network consists of a number of sensors spread across a geographical area. Each sensor has wireless communication capability and some level of intelligence for signal processing and networking of the data. Some examples of wireless ad hoc sensor networks are the following:</p><div><ol><li>Military sensor networks to detect and gain as much information as possible about enemy movements, explosions, and other phenomena of interest.</li><li>Sensor networks to detect and characterize Chemical, Biological, Radiological, Nuclear, and Explosive (CBRNE) attacks and material. </li><li>Sensor networks to detect and monitor environmental changes in plains, forests, oceans, etc. </li><li>Wireless traffic sensor networks to monitor vehicle traffic on highways or in congested parts of a city.</li><li>Wireless surveillance sensor networks for providing security in shopping malls, parking garages, and other facilities.</li><li>Wireless parking lot sensor networks to determine which spots are occupied and which are free.</li></ol><p>The above list suggests that wireless ad hoc sensor networks offer certain capabilities and enhancements in operational efficiency in civilian applications as well as assist in the national effort to increase alertness to potential terrorist threats.Two ways to classify wireless ad hoc sensor networks are whether or not the nodes are individually addressable, and whether the data in the network is aggregated. The sensor nodes in a parking lot network should be individually addressable, so that one can determine the locations of all the free spaces. This application shows that it may be necessary to broadcast a message to all the nodes in the network. If one wants to determine the temperature in a corner of a room, then addressability may not be so important. Any node in the given region can respond. The ability of the sensor network to aggregate the data collected can greatly reduce the number of messages that need to be transmitted across the network. This function of data fusion is discussed more below.The basic goals of a wireless ad hoc sensor network generally depend upon the application, but the following tasks are common to many networks:</p><ol><li>Determine the value of some parameter at a given location: In an environmental network, one might one to know the temperature, atmospheric pressure, amount of sunlight, and the relative humidity at a number of locations. This example shows that a given sensor node may be connected to different types of sensors, each with a different sampling rate and range of allowed values. </li><li>Detect the occurrence of events of interest and estimate parameters of the detected event or events: In the traffic sensor network, one would like to detect a vehicle moving through an intersection and estimate the speed and direction of the vehicle. </li><li>Classify a detected object: Is a vehicle in a traffic sensor network a car, a mini-van, a light truck, a bus, etc.</li><li>Track an object: In a military sensor network, track an enemy tank as it moves through the geographic area covered by the network.</li></ol><p>In these four tasks, an important requirement of the sensor network is that the required data be disseminated to the proper end users. In some cases, there are fairly strict time requirements on this communication. For example, the detection of an intruder in a surveillance network should be immediately communicated to the police so that action can be taken.</p><p>Wireless ad hoc sensor network requirements include the following:</p><ol><li>Large number of (mostly stationary) sensors: Aside from the deployment of sensors on the ocean surface or the use of mobile, unmanned, robotic sensors in military operations, most nodes in a smart sensor network are stationary. Networks of 10,000 or even 100,000 nodes are envisioned, so scalability is a major issue.</li><li>Low energy use: Since in many applications the sensor nodes will be placed in a remote area, service of a node may not be possible. In this case, the lifetime of a node may be determined by the battery life, thereby requiring the minimization of energy expenditure. </li><li>Network self-organization: Given the large number of nodes and their potential placement in hostile locations, it is essential that the network be able to self-organize; manual configuration is not feasible. Moreover, nodes may fail (either from lack of energy or from physical destruction), and new nodes may join the network. Therefore, the network must be able to periodically reconfigure itself so that it can continue to function. Individual nodes may become disconnected from the rest of the network, but a high degree of connectivity must be maintained. </li><li>Collaborative signal processing: Yet another factor that distinguishes these networks from MANETs is that the end goal is detection/estimation of some events of interest, and not just communications. To improve the detection/estimation performance, it is often quite useful to fuse data from multiple sensors. This data fusion requires the transmission of data and control messages, and so it may put constraints on the network architecture.</li><li>Querying ability: A user may want to query an individual node or a group of nodes for information collected in the region. Depending on the amount of data fusion performed, it may not be feasible to transmit a large amount of the data across the network. Instead, various local sink nodes will collect the data from a given area and create summary messages. A query may be directed to the sink node nearest to the desired location. <strong></strong></li></ol><p><strong>Sensor types and system architecture:</strong></p><p>With the coming availability of low cost, short range radios along with advances in wireless networking, it is expected that wireless ad hoc sensor networks will become commonly deployed. In these networks, each node may be equipped with a variety of sensors, such as acoustic, seismic, infrared, still/motion videocamera, etc. These nodes may be organized in clusters such that a locally occurring event can be detected by most of, if not all, the nodes in a cluster. Each node may have sufficient processing power to make a decision, and it will be able to broadcast this decision to the other nodes in the cluster. One node may act as the cluster master, and it may also contain a longer range radio using a protocol such as IEEE 802.11 or Bluetooth.</p><p>source: itl.nist.gov/div892/wahn_ssn.shtml</p></div></div></div></div></div>Adminhttp://www.blogger.com/profile/13599137617292352690noreply@blogger.com0