Survey on Performance of Multipath Routing Protocol in Wireless Sensor Network

As we know Wireless Sensor Network is the perfect solution for quick capturing, processing and transmission of critical data. Sensor nodes are often deployed in generous environment but nodes suffer from low battery power. So, energy efficiency and network life are main concerns in WSN. Zig Bee have low cost, low power consumption and is beneficial in wireless sensor networks by selecting adequate communication protocol. Routing protocols like AODV (Ad- hoc on demand distance vector routing), ZTR (Zig Bee tree routing), and STR (Shortcut tree routing) and ESTR (Extended Shortcut tree routing) are compared on the idea of various performance metrics like end to finish delay, routing overload, throughput, packet delivery ratio (PDR). The mathematical analysis and performance evaluation shows that ESTR achieves better performance as compared to other routing protocols. The overall evaluation shows that ESTR achieves better performance as compared to other routing protocols. But there are some limitations of ESTR method. Performance of packet delivery ratio of STR is less as compared to AODV. Performance of end to end delay of STR is poor as compared to AODV. Extended STR is proposed to represent new ZigBee network routing protocol with improved performance of Packet Delivery ratio (PDR) and delay against STR and AODV. We are introducing here Efficient Extended Shortcut Tree Routing method (ESTR) for further improvement of delays of ESTR method.

Obstacle aware delay optimized rectilinear steiner minimum tree routing

<p><span>This work presents a method to solve the problem of constructing Rectilinear Steiner Minimum Tree (RSMT) for a group of pins in the presence of obstacles. In modern </span><span>very large-scale integrated circuit</span><span> (VLSI) designs, the obstacles, generally blocks the metal and the device layer. Therefore routing on top of blockage is a possible solution but buffers cannot be placed over the obstacle. Modern VLSI design OARSMT construction has long wire length, which results in signal violation. To address this issue a slew constraint interconnect need to be considered in routing over obstacle. This is called the Obstacle-Avoiding Rectilinear Steiner minimum trees (OARSMT) problem with slew constraints over obstacles. The drawback of traditional OARSMT is that they only consider slew constraint, and delay constraints are neglected. It induces high routing resources overhead due to buffer insertion and does not solve global routing solution. This work presents an Obstacle Aware Delay Optimized Rectilinear Steiner Minimum Tree (OADORSMT) Routing to address the delay, slew constraint and reduce the routing resources. Experiments are conduced to evaluate the performance of proposed approach over existing approach in term of wire length and worst negative slack. The experiments are conducted for small and large nets considering fixed and varied obstacles and outcome shows the proposed efficiency over existing approaches. The OADORSMT is designed in such a way where it can be parallelized to obtain better efficiency.</span></p>

Subarea tree routing algorithm based infrastructure for mobile ad-hoc networks

Ad hoc networks are self-organizing and multi-hop networks for data communication. Subarea Tree Routing (STR) has used for multi-hop networks for network division into various subareas. The main objective of this paper is creating a dynamic sub-area tree infrastructure for Mobile Ad hoc Networks (MANET). The proposed architecture uses the hierarchical procedure to divide the whole network into many geographical sub-area networks. In addition, each sub-area has a selected root node, we can configure the root node manually due to small ad hoc network and uses auto-discovery procedure to select the roots for large networks. The root node is located at the center of sub-area with hop level zero. The root function is used to update the routing table and root table for sub-area. After sub-area created any interconnected node detects a new inefficient node for sending the invitation message to join the sub-area tree. In the same sub-area, proactive routing protocols are used between the sub-area root node and its interconnect nodes and reactive routing protocols are used between all sub-areas root nodes. The new sub-area tree provides an infrastructure to avoid the flooding procedures. Routing in the sub-area tree avoids the transmission collision to optimize the ad-hoc networks.