Jeffrey E. Wieselthier

Bio: Jeffrey E. Wieselthier is an academic researcher from Silver Spring Networks. The author has contributed to research in topics: Wireless network & Throughput. The author has an hindex of 30, co-authored 117 publications receiving 5112 citations. Previous affiliations of Jeffrey E. Wieselthier include United States Naval Research Laboratory.

On the construction of energy-efficient broadcast and multicast trees in wireless networks

Abstract: The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. After addressing the characteristics of wireless networks that distinguish them from wired networks, we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energy-efficiency. We develop the broadcast incremental power algorithm, and adapt it to multicast operation as well. This algorithm exploits the broadcast nature of the wireless communication environment, and addresses the need for energy-efficient operation. We demonstrate that our algorithm provides better performance than algorithms that have been developed for the link-based, wired environment.

A design concept for reliable mobile radio networks with frequency hopping signaling

Abstract: The design of a packet radio network must reflect the operational requirements and environmental constraints to which it is subject. In this paper, we outline those features that distinguish the High Frequency (HF) Intra Task Force (ITF) Network from other packet radio networks, and we present a design concept for this network that encompasses organizational structure, waveform design, and channel access. Network survivability is achieved through the use of distributed network control and frequency hopping spread-spectrum signaling. We demonstrate how the execution of the fully distributed Linked Cluster Algorithm can enable a network to reconfigure itself when it is affected by connectivity changes such as those resulting from jamming. Additional resistance against jamming is provided by frequency hopping, which leads naturally to the use of code division mutiple access (CDMA) techniques that permit the simultaneous successful transmission by several users. Distributed algorithms that exploit CDMA properties have been developed to schedule contention-free transmissions for much of the channel access in this network. Contention-based channel access protocols can also be implemented in conjunction with the Linked Cluster network structure. The design concept presented in this paper provides a high degree of survivability and flexibility, to accommodate changing environmental conditions and user demands.

Energy-efficient broadcast and multicast trees in wireless networks

Abstract: The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. In this paper we focus on the problem of multicast tree construction, and we introduce and evaluate algorithms for tree construction in infrastructureless, all-wireless applications. The performance metric used to evaluate broadcast and multicast trees is energy-efficiency. We develop the Broadcast Incremental Power (BIP) algorithm, and adapt it to multicast operation by introducing the Multicast Incremental Power (MIP) algorithm. These algorithms exploit the broadcast nature of the wireless communication environment, and address the need for energy-efficient operation. We demonstrate that our algorithms provide better performance than algorithms that have been developed for the link-based, wired environment.

Algorithms for energy-efficient multicasting in static ad hoc wireless networks

Abstract: In this paper we address the problem of multicasting in ad hoc wireless networks from the viewpoint of energy efficiency. We discuss the impact of hte wireless medium on the multicasting problem and the fundamental trade-offs that arise. We propose and evaluate several algorithms for defining multicast trees for session (or connection-oriented) traffic when transceiver resources are limited. The algorithms select the relay nodes and the corresponding transmission power levels, and achieve different degrees of scalability and performance. We demonstrate that the incorporation of energy considerations into multicast algorithms can, indeed, result in improved energy efficiency.

On the Age of Information With Packet Deadlines

Abstract: We study the age of information , which is a measure of the freshness of a continually updated piece of information as observed at a remote monitor. The age of information metric has been studied for a variety of different queueing systems, and in this paper, we introduce a packet deadline as a control mechanism to study its impact on the average age of information for an M/M/1/2 queueing system. We analyze the system for the cases of a fixed deadline and a random exponential deadline and derive closed-form expressions for the average age. We also derive a closed-form expression for the optimal average deadline for the random exponential case. Our numerical results show the relationship of the age performance to that of the M/M/1/1 and M/M/1/2 systems, and we demonstrate that using a deadline can outperform both the M/M/1/1 and M/M/1/2 without deadline.

The vision of autonomic computing

Abstract: A 2001 IBM manifesto observed that a looming software complexity crisis -caused by applications and environments that number into the tens of millions of lines of code - threatened to halt progress in computing. The manifesto noted the almost impossible difficulty of managing current and planned computing systems, which require integrating several heterogeneous environments into corporate-wide computing systems that extend into the Internet. Autonomic computing, perhaps the most attractive approach to solving this problem, creates systems that can manage themselves when given high-level objectives from administrators. Systems manage themselves according to an administrator's goals. New components integrate as effortlessly as a new cell establishes itself in the human body. These ideas are not science fiction, but elements of the grand challenge to create self-managing computing systems.

Securing ad hoc networks

Abstract: Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. Military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in the design of these networks is their vulnerability to security attacks. In this article, we study the threats on ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks. We also use replication and new cryptographic schemes, such as threshold cryptography, to build a highly secure and highly available key management service, which terms the core of our security framework.

An energy efficient hierarchical clustering algorithm for wireless sensor networks

Abstract: A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passing process must be designed to conserve the limited energy resources of the sensors. Clustering sensors into groups, so that sensors communicate information only to clusterheads and then the clusterheads communicate the aggregated information to the processing center, may save energy. In this paper, we propose a distributed, randomized clustering algorithm to organize the sensors in a wireless sensor network into clusters. We then extend this algorithm to generate a hierarchy of clusterheads and observe that the energy savings increase with the number of levels in the hierarchy. Results in stochastic geometry are used to derive solutions for the values of parameters of our algorithm that minimize the total energy spent in the network when all sensors report data through the clusterheads to the processing center.