6,012 research outputs found
Two-Hop Routing with Traffic-Differentiation for QoS Guarantee in Wireless Sensor Networks
This paper proposes a Traffic-Differentiated Two-Hop Routing protocol for
Quality of Service (QoS) in Wireless Sensor Networks (WSNs). It targets WSN
applications having different types of data traffic with several priorities.
The protocol achieves to increase Packet Reception Ratio (PRR) and reduce
end-to-end delay while considering multi-queue priority policy, two-hop
neighborhood information, link reliability and power efficiency. The protocol
is modular and utilizes effective methods for estimating the link metrics.
Numerical results show that the proposed protocol is a feasible solution to
addresses QoS service differenti- ation for traffic with different priorities.Comment: 13 page
Unified clustering and communication protocol for wireless sensor networks
In this paper we present an energy-efficient cross layer protocol for providing application specific reservations in wireless senor networks called the “Unified Clustering and Communication Protocol ” (UCCP). Our modular cross layered framework satisfies three wireless sensor network requirements, namely, the QoS requirement of heterogeneous applications, energy aware clustering and data forwarding by relay sensor nodes. Our unified design approach is motivated by providing an integrated and viable solution for self organization and end-to-end communication is wireless sensor networks. Dynamic QoS based reservation guarantees are provided using a reservation-based TDMA approach. Our novel energy-efficient clustering approach employs a multi-objective optimization technique based on OR (operations research) practices. We adopt a simple hierarchy in which relay nodes forward data messages from cluster head to the sink, thus eliminating the overheads needed to maintain a routing protocol. Simulation results demonstrate that UCCP provides an energy-efficient and scalable solution to meet the application specific QoS demands in resource constrained sensor nodes. Index Terms — wireless sensor networks, unified communication, optimization, clustering and quality of service
Analysis of energy efficient connected target coverage algorithm for static and dynamic nodes in IWSNs
Today breakthroughs in wireless technologies have greatly spurred the emergence of industrial wireless sensor networks (IWSNs).To facilitate the adaptation of IWSNs to industrial applications, concerns about networks full coverage and connectivity must be addressed to fulfill reliability and real time requirements. Although connected target coverage algorithms have been studied notice both limitations and applicability of various coverage areas from an industry viewpoint. In this paper is discuss the two energy efficiency connected target coverage (CTC) algorithms CWGC(Communication Weighted Greedy Cover) and OTTC(Overlapped Target and Connected Coverage) algorithm based on dynamic node to resolve the problem of Coverage improvement. This paper uses the simulation in MATLAB represent the performance of two CTC algorithms with Dynamic node to improve network lifetime and low energy consumption and quality of service. Compare the dynamic nodes results with static nodes result
Overlapping Multi-hop Clustering for Wireless Sensor Networks
Clustering is a standard approach for achieving efficient and scalable
performance in wireless sensor networks. Traditionally, clustering algorithms
aim at generating a number of disjoint clusters that satisfy some criteria. In
this paper, we formulate a novel clustering problem that aims at generating
overlapping multi-hop clusters. Overlapping clusters are useful in many sensor
network applications, including inter-cluster routing, node localization, and
time synchronization protocols. We also propose a randomized, distributed
multi-hop clustering algorithm (KOCA) for solving the overlapping clustering
problem. KOCA aims at generating connected overlapping clusters that cover the
entire sensor network with a specific average overlapping degree. Through
analysis and simulation experiments we show how to select the different values
of the parameters to achieve the clustering process objectives. Moreover, the
results show that KOCA produces approximately equal-sized clusters, which
allows distributing the load evenly over different clusters. In addition, KOCA
is scalable; the clustering formation terminates in a constant time regardless
of the network size
- …