scispace - formally typeset
Search or ask a question
Author

Taieb Znati

Bio: Taieb Znati is an academic researcher from University of Pittsburgh. The author has contributed to research in topics: Wireless sensor network & Wireless network. The author has an hindex of 31, co-authored 254 publications receiving 7873 citations. Previous affiliations of Taieb Znati include National Science Foundation & Michigan State University.


Papers
More filters
Journal ArticleDOI
TL;DR: The state-of-the-art protocol for WSN protocol stack is explored for transport, routing, data link and physical layers, and the open research issues are discussed for each of the protocol layers.

2,111 citations

Book
01 Apr 2007
TL;DR: This paper describes the development of Wireless Sensors Networks and its applications, and some of the applications can be found in the Commercial and Scientific Applications of Wireless Sensor Networks and Performance and Traffic Management Issues.
Abstract: Chapter 1. Introduction and Overview of Wireless Sensor Networks. Chapter 2. Commercial and Scientific Applications of Wireless Sensor Networks. Chapter 3. Basic Wireless Sensor Technology. Chapter 4. Wireless Sensors Networks Protocols: Physical Layer. Chapter 5. Medium Access Control Protocols for Wireless Sensor Networks. Chapter 6. Sensors Network Protocols: Routing Protocols. Chapter 7. Transport Control Protocols for Wireless Sensors Networks. Chapter 8. Middleware for Sensor Networks. Chapter 9. Network Management for Wireless Sensor Networks. Chapter 10. Operating Systems for Sensor Networks. Chapter 11. Performance and Traffic Management Issues. Appendix A: Analysis. Appendix B: Discussions. Index.

1,088 citations

Journal ArticleDOI
TL;DR: A novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded is presented, which supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when Mobility rates are high.
Abstract: This paper presents a novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded. The purpose of the (/spl alpha/, t) cluster is to help minimize the far-reaching effects of topological changes while balancing the need to support more optimal routing. A mobility model for ad hoc networks is developed and is used to derive expressions for the probability of path availability as a function of time. It is shown how this model provides the basis for dynamically grouping nodes into clusters using an efficient distributed clustering algorithm. Since the criteria for cluster organization depends directly upon path availability, the structure of the cluster topology is adaptive with respect to node mobility. Consequently, this framework supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when mobility rates are high.

747 citations

Book
01 Jan 2007
TL;DR: In this paper, a wireless sensor network comprises at least one sensor unit which comprises a sensor for sensing a parameter and at least an interrogating node, which is arranged to transmit an interrogation message periodically to the sensor unit and to receive a reply message from said sensor unit.
Abstract: A wireless sensor network comprises at least one sensor unit which comprises a sensor for sensing a parameter and at least one interrogating node. The interrogating node is arranged to transmit an interrogation message periodically to said sensor unit and to receive a reply message from said sensor unit. The sensor unit is arranged to transmit said reply message after a predetermined deliberate delay unless the sensor unit determines that an alarm condition has been met, in which case the sensor unit is arranged to transmit said reply message before the end of the deliberate delay.

448 citations

Proceedings ArticleDOI
21 Sep 1999
TL;DR: A novel routing metric is proposed, which defines a probabilistic measure of the availability of network paths that are subject to link failures caused by node mobility in ad-hoc networks, and it is shown how this measure can be used to select more stable paths and reduce the routing overhead caused by nodes mobility.
Abstract: Ad-hoc networks are expected to play an important role in future commercial and military communications systems. As such, scalable routing strategies capable of supporting greater user mobility and a wide range of applications are needed. This paper proposes a novel routing metric, which defines a probabilistic measure of the availability of network paths that are subject to link failures caused by node mobility in ad-hoc networks. It is shown how this measure can be used to select more stable paths and reduce the routing overhead caused by node mobility. A mobility model is first proposed and used to characterize the movement of ad-hoc network nodes. This model is then used to derive expressions for link and path availability. Finally, simulation results are reported which validate the proposed analytical model.

247 citations


Cited by
More filters
01 May 1993
TL;DR: Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems.
Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

29,323 citations

Journal ArticleDOI
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

10,296 citations

Journal ArticleDOI
TL;DR: It is proved that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks.
Abstract: Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. We propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in O(1) iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.

4,889 citations

Journal ArticleDOI
TL;DR: A comprehensive review of existing piezoelectric generators is presented in this paper, including impact coupled, resonant and human-based devices, including large scale discrete devices and wafer-scale integrated versions.
Abstract: This paper reviews the state-of-the art in vibration energy harvesting for wireless, self-powered microsystems. Vibration-powered generators are typically, although not exclusively, inertial spring and mass systems. The characteristic equations for inertial-based generators are presented, along with the specific damping equations that relate to the three main transduction mechanisms employed to extract energy from the system. These transduction mechanisms are: piezoelectric, electromagnetic and electrostatic. Piezoelectric generators employ active materials that generate a charge when mechanically stressed. A comprehensive review of existing piezoelectric generators is presented, including impact coupled, resonant and human-based devices. Electromagnetic generators employ electromagnetic induction arising from the relative motion between a magnetic flux gradient and a conductor. Electromagnetic generators presented in the literature are reviewed including large scale discrete devices and wafer-scale integrated versions. Electrostatic generators utilize the relative movement between electrically isolated charged capacitor plates to generate energy. The work done against the electrostatic force between the plates provides the harvested energy. Electrostatic-based generators are reviewed under the classifications of in-plane overlap varying, in-plane gap closing and out-of-plane gap closing; the Coulomb force parametric generator and electret-based generators are also covered. The coupling factor of each transduction mechanism is discussed and all the devices presented in the literature are summarized in tables classified by transduction type; conclusions are drawn as to the suitability of the various techniques.

2,834 citations

Journal ArticleDOI
01 May 2009
TL;DR: This paper breaks down the energy consumption for the components of a typical sensor node, and discusses the main directions to energy conservation in WSNs, and presents a systematic and comprehensive taxonomy of the energy conservation schemes.
Abstract: In the last years, wireless sensor networks (WSNs) have gained increasing attention from both the research community and actual users. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. In this paper we first break down the energy consumption for the components of a typical sensor node, and discuss the main directions to energy conservation in WSNs. Then, we present a systematic and comprehensive taxonomy of the energy conservation schemes, which are subsequently discussed in depth. Special attention has been devoted to promising solutions which have not yet obtained a wide attention in the literature, such as techniques for energy efficient data acquisition. Finally we conclude the paper with insights for research directions about energy conservation in WSNs.

2,546 citations