Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Computer Science , 2013, Abstract: Energy efficient routing protocols are consistently cited as efficient solutions for Wireless Sensor Networks (WSNs) routing. The area of WSNs is one of the emerging and fast growing fields which brought low cost, low power and multi-functional sensor nodes. In this paper, we examine some protocols related to homogeneous and heterogeneous networks. To evaluate the efficiency of different clustering schemes, we compare five clustering routing protocols; Low Energy Adaptive Clustering Hierarchy (LEACH), Threshold Sensitive Energy Efficient Sensor Network (TEEN), Distributed Energy Efficient Clustering (DEEC) and two variants of TEEN which are Clustering and Multi-Hop Protocol in Threshold Sensitive Energy Efficient Sensor Network (CAMPTEEN) and Hierarchical Threshold Sensitive Energy Efficient Sensor Network (H-TEEN). The contribution of this paper is to introduce sink mobility to increase the network life time of hierarchal routing protocols. Two scenarios are discussed to compare the performances of routing protocols; in first scenario static sink is implanted and in later one mobile sink is used. We perform analytical simulations in MATLAB by using different performance metrics such as, number of alive nodes, number of dead nodes and throughput.
 Mathematics , 2007, Abstract: Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes and multihop routing can be increased from the $\Omega({1 \over \sqrt{n} \log n})$ scaling demonstrated in the seminal paper of Gupta and Kumar to $\Omega({1 \over \sqrt{n}})$. The goal of the present paper is to understand the dependence of this interesting result on the principal new features it introduced relative to Gupta-Kumar: (1) a capacity-based formula for link transmission bit-rates in terms of received signal-to-interference-and-noise ratio (SINR); (2) hierarchical routing from sources to destinations through a system of communal highways; and (3) cell-based routes constructed by percolation. The conclusion of the present paper is that the improved throughput scaling is principally due to the percolation-based routing, which enables shorter hops and, consequently, less interference. This is established by showing that throughput $\Omega({1 \over \sqrt{n}})$ can be attained by a system that does not employ highways, but instead uses percolation to establish, for each source-destination pair, a set of $\Theta(\log n)$ routes within a narrow routing corridor running from source to destination. As a result, highways are not essential. In addition, it is shown that throughput $\Omega({1 \over \sqrt{n}})$ can be attained with the original threshold transmission bit-rate model, provided that node transmission powers are permitted to grow with $n$. Thus, the benefit of the capacity bit-rate model is simply to permit the power to remain bounded, even as the network expands.
 Computer Science , 2013, DOI: 10.5121/ijcnc.2013.5614 Abstract: MANET is a collection of mobile devices with no centralized control and no pre-existing infrastructures. Due to the nodal mobility, supporting QoS during routing in this type of networks is a very challenging task. To tackle this type of overhead many routing algorithms with clustering approach have been proposed. Clustering is an effective method for resource management regarding network performance, routing protocol design, QoS etc. Most of the flat network architecture contains homogeneous capacity of nodes but in real time nodes are with heterogeneous capacity and transmission power. Hierarchical routing provides routing through this kind of heterogeneous nodes. Here, routes can be recorded hierarchically, across clusters to increase routing flexibility. Besides this, it increases scalability and robustness of routes. In this paper, a novel ant based QoS aware routing is proposed on a three level hierarchical cluster based topology in MANET which will be more scalable and efficient compared to flat architecture and will give better throughput.
 Indian Journal of Computer Science and Engineering , 2012, Abstract: The developments of micro and nano sensors lead the sensor networking technology to be used in all kinds of study. In underwater communications and study, wireless sensor network plays a major role. One among the characteristics of underwater communications is propagation delay that affects the network throughput. To increase the throughput, here we propose the local update routing. In this technique the end to end delay is minimized by using hierarchical WPANs. This is proved with reduced latency using Omnet++ simulator.