Preview

The Average Number Of Hops To Reach The Sink Node Case Study

Good Essays
Open Document
Open Document
901 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
The Average Number Of Hops To Reach The Sink Node Case Study
The average number of hops to reach the sink node is shown in Figure [fig_M1]. In Sink-PathCC, the number of hops to reach the sink node does not change significantly with an increase on the node density. On the other hand, CoopSink increases the number of hops to reach the sink by over 40% when the number of nodes increases from 50 to 100. While Sink-PathCC demands for ≈7 hops to reach the sink, CoopSink requires nearly 17 hops when n = 100, an increase of nearly 142%. Clearly, Sink-PathCC provides a short path to reach the sink node as compared to CoopSink.
When using CoopSink, |Hi, j|+2 transmissions are needed to transpose a CC-link while |Hi, j|+1 are needed when using Sink-PathCC. Thus, Sink-PathCC reduces the number of transmissions
…show more content…
As already mentioned, CoopSink and Sink-PathCC use different strategies to establish CC-link. Figure [fig_M3] shows the performance of the CoopSink and Sink-PathCC in terms of connectivity to the sink node. The y-axis shows the connectivity with the sink node when employing CoopSink, Sink-PathCC and without the use of CC. On average, CoopSink increases the connectivity to the sink node by nearly 50% while Sink-PathCC attains an average of 44%. This results from the fact that the CC model used by Sink-PathCC does not allow the source node to take part in the second step of the CC. Hence, Sink-PathCC does not have as many nodes to improve the transmission range as the CoopSink. Nevertheless, the difference between the two strategies becomes negligible at higher node density. In fact, with 100 nodes, both strategies provide similar results, with a difference of ≈1% between the …show more content…
Figure [fig_M5] show the average energy cost of the helper nodes for different node density. For both techniques, as the node density increases, the cost of the helper nodes decrease significantly. As the topology gets denser, the source node improve the chance of selecting suitable helper nodes to compose the CC-link. When n = 50 nodes, CoopSink outperforms Sink-PathCC by less than 6%. With 100 nodes, CoopSink reduces the average cost of helper nodes by nearly 9% as compared to Sink-PathCC. Although Sink-PathCC demands more power of the helper nodes as compared to CooSink, Sink-PathCC provides higher energy savings for the source node. Clearly, there is a trade-off between reducing power consumption of the source node in detriment of the helper nodes. One may argue that with higher node density, the source node may have several helpers to select. Thus, even if some of its helper run out of batteries, the source node would still be able to select other helpers. On the other hand, the task of selecting suitable helpers is a time consuming task, particularly in CoopSink. Hence, this work seeks for an energy balance alternative that would not place a higher burden on the helpers or on the source

You May Also Find These Documents Helpful

  • Satisfactory Essays

    It would take 1 (hop) message to send a message from node A to node B. It would take 3 (hop) messages to send a message from node B to node A. One additional link is required to add a new node E between node C and node D. With the new node added, the number of messages to Travers from node B to node A would increase by one.…

    • 503 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    As we have seen that, for a wireless sensor networks, to determine the optimal number of sinks needed to meet a certain performance is very difficult task. As it depends on various metrics that was discussed in earlier chapters. We try to show that it is a function of hop-limit, K-covered, transmission range and area of the network.…

    • 614 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    There are many different types of network topologies. They each have their different strong points. They also have their own disadvantages. There are 3 main network topologies used today, hierarchical star, bus and ring. In the following paragraphs I will go into each of these topologies.…

    • 545 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Nt1330 Unit 4

    • 1313 Words
    • 6 Pages

    Which Layer 4 protocol does EIGRP use to provide reliability for the transmission of routing information?…

    • 1313 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Week 4 INDP NTC 362

    • 821 Words
    • 3 Pages

    There are a few requirements when building a network in order for the network to operate. There is the hardware components with the end nodes (i.e. the sending and receiving computers). The intermediate nodes that perform the data exchange (i.e. , switches, and hubs). And the telecommunication links (i.e. wired &…

    • 821 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Nt1310 Unit 7

    • 468 Words
    • 2 Pages

    Answer: Virtual circuit switching and circuit switching: Both require a link to be established before data is transferred and torn off once the transmission is over. Both have bandwidth efficiency.…

    • 468 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Nt1210 Chapter 6

    • 829 Words
    • 4 Pages

    2) Using link aggregation with two or three trunk lines ________ going to a single faster…

    • 829 Words
    • 4 Pages
    Satisfactory Essays
  • Good Essays

    Patton Fuller Networking

    • 659 Words
    • 3 Pages

    These nodes are connected via a bus topology, where each node shares a single transmission medium (“Networking Topologies,” 2012 ). An Ethernet backbone connects these nodes, utilizing a CAT 6 cable transmitting 1000 BaseT (“IT Network Diagrams- Top View,” 2012).…

    • 659 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Pre-Lab Computer Questions

    • 6462 Words
    • 26 Pages

    The bridge on each LAN that provides the minimum path cost to the root bridge…

    • 6462 Words
    • 26 Pages
    Satisfactory Essays
  • Good Essays

    Nt1310 Unit 9

    • 474 Words
    • 2 Pages

    Tree Topology – All nodes attached to separate lines that lead to the HUB. If one computer crashes the others are not effected.…

    • 474 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    Topology Diagram Topology

    • 349 Words
    • 2 Pages

    A network redundant topology where nodes are connected using two concentric rings with four branches.…

    • 349 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    From A to B it would take two message. The central hub would take two messages to get from A to B, when using the switch it would take one message from A to B. there would be very little effect when adding a node between C and D because it is connected to a central devices like A and B.…

    • 255 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    In this scenario, I would again recommend a star topology due to its manageability and scalability. In this model, one would need computers, server, cables, and operating systems. The nodes would go through the switch or router and then…

    • 350 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Network Case Flows

    • 689 Words
    • 3 Pages

    The following is a series of case studies on Network Flows. Network flows can be representative of many types of systems. Whether the network is used to transmit data from computer to computer or server to server, transfer goods across the county, or deliver liquid flows to the desired location, networks must be studied to find the most efficient path for the given media to travel across. Locating the most efficient path for media allows systems to run at maximum efficiency without overloading any particular portion of the network, which would slow or even inhibit delivery to the desired destination.…

    • 689 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    TRIP DISTRIBUTION

    • 2367 Words
    • 10 Pages

    method which respond only to relative growth rates at origins and destinations and this is suitable for shortterm trend extrapolation. In gravity model, we start from assumptions about trip making behavior and the…

    • 2367 Words
    • 10 Pages
    Powerful Essays