Professional Documents
Culture Documents
2012-2013
CONTENTS
Introduction to Data Communications. Five Components of Data Communication. NETWORKS Type of Connection Definition of various mesh topology. History Full Mesh Topology. A partial mesh topology Wired mesh Wireless mesh Advantages & Disadvantage
The term telecommunication means communication at a distance. The word data refers to information presented in whatever form is agreed upon by the parties creating and using the data. Data communications are the exchange of data between two devices via some form of transmission medium such as a wire cable.
Message:
text,
Transmission medium
Physical
Protocol
Set
NETWORKS
A network is a set of devices (often referred to as nodes) connected by communication links. A node can be a computer, printer, or any other device capable of sending and/or receiving data generated by other nodes on the network.
NETWORK CRITERIA
Performance
Mostly
Reliability
The
Security
Protecting
Damage
data from
access
unauthorized
TYPE OF CONNECTION
Point-to-Point Multipoint (multi-drop)
PHYSICAL TOPOLOGY
Mesh topology Star topology Bus topology Ring topology Hybrid topology
HISTORY
Originally sponsored by the Department of Defense for military use Goal was to provide packet-switched network in mobile elements of a battlefield in an infrastructureless environment Used a combination of ALOHA and CSMA and distance vector routing
WIRED MESH
It is possible to have a fully wired mesh network, however this is very expensive Advantages
Reliable
Offers
redundancy
Disadvantages
- Expensive- large number of cables and connections required
WIRELESS MESH
Definition- a wireless co-operative communication infrastructure between multiple individual wireless tranceivers that have Ethernet capabilities Can either be centralized for highly scalable applications, or can be decentralized
Advantages
Reliable- each node is connected to several others; when a node fails its neighbors find other routes Scalable- capacity can be added simply by adding nodes Nodes act as repeaters to transmit data from nearby nodes to peers too far away to reach- this results in a network that can span large distances over rough terrain Each node only transmits as far as the next node
TYPES OF PROTOCOLS
Pro-active- distribute routing tables to the network periodically to maintain fresh lists of destinations Disadvantages
Wasted
bandwidth for transmitting routing tables Maintains routes that will never be used Some algorithms never converge in large networks
Re-active- also known as On-Demand these protocols find routes on demand by flooding the network with Route Request packets Disadvantages
Delays
EXAMPLE: ADDV
ADDV- Ad-hoc On-demand Distance Vector Establishes a route to a destination only on demand Contrast to the most popular pro-active protocols
CONT..
When a node that already has a route to the desired node gets the message it sends a message back through the temporary route to the requesting node The needy node then uses the route with the least hops to connect
FAILURES
When a node fails, a routing error is passed back to the transmitting node and the process repeats Also, note that unused entries in the routing tables are recycled after a time, so unused paths are not kept
DRAWBACKS
More time to establish a connection Initial communication to establish a route is heavy
Hierarchical- network orders itself into a tree or other hierarchy and sends requests through the structure
The network orders itself into a tree Each node periodically sends hello to its neighbors Each neighbor tells how many neighbors and connections it has and who its mother node is Each node picks the node with the largest access to links to be its mother node When two nodes pick each other as mother nodes, that is the top of the tree
ROUTING
When a node needs a connection with another node and a route doesnt exist it sends a request to its mother node This node then forwards the message to its mother node and so on until the original node is connected at the root to the node it wanted Next the algorithm tries to cut corners to optimize the path
Each node on the route floods its neighbors with routing requests When a faster route is found, the unused part of the previous route is erased and flooding ceases on that route
ADVANTAGES
Produces fairly good routes while reducing the number of messages required to keep the network connected Uses only small amounts of memory at each node The network has a reliable way to establish that a node is not in the network
DISADVANTAGES
Central mother nodes have an extra burden Eventually ceases to be scalable Link propagation time establishes a limit on the speed the network can find its root May use more power and bandwidth than other link-state protocols
THANK YOU
ANY QUERIES ?