Comparison of Botanical Composition, Soil Carbon Content, and Root Distribution of Subirrigated Meadows in The Nebraska Sandhills

Characterizing vegetation composition, carbon/nitrogen (C/N) content of soils, and root-mass distribution is critical to understanding carbon sequestration potential of subirrigated meadows in the Nebraska Sandhills. Five subirrigated meadows dominated by cool-season (C3) graminoids and five meadows dominated by warm-season (C4) grasses were selected throughout the Nebraska Sandhills. Vegetation, soil carbon and nitrogen, and root-mass density distribution were sampled in each meadow. Meadows dominated by C3 vegetation had 12% greater (P < 0.1) yields than meadows dominated by C4 vegetation. Total root-mass density was 30% greater (P < 0.1) in C4-dominated meadows than C3-dominated meadows. Total carbon and nitrogen content was 65% and 53% greater (P < 0.1), respectively, in the A horizon of C3-dominated meadows, but was 43% and 52% greater (P < 0.1), respectively, in the C horizon of C4-dominated meadows. Although meadows dominated by C3 vegetation had more carbon in the soil profile, much of the carbon in C3-dominated meadows appeared to be recalcitrant C4 carbon from historic vegetation.

A New Cryptographic Scheme for Securing Dynamic Conferences in Data Networks

Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.

A load-balancing spare capacity reallocation approach in service-rich SONET metro mesh networks

The next-generation SONET metro network is evolving into a service-rich infrastructure. At the edge of such a network, multi-service provisioning platforms (MSPPs) provide efficient data mapping enabled by Generic Framing Procedure (GFP) and Virtual Concatenation (VC). The core of the network tends to be a meshed architecture equipped with Multi-Service Switches (MSSs). In the context of these emerging technologies, we propose a load-balancing spare capacity reallocation approach to improve network utilization in the next-generation SONET metro networks. Using our approach, carriers can postpone network upgrades, resulting in increased revenue with reduced capital expenditures (CAPEX). For the first time, we consider the spare capacity reallocation problem from a capacity upgrade and network planning perspective. Our approach can operate in the context of shared-path protection (with backup multiplexing) because it reallocates spare capacity without disrupting working services. Unlike previous spare capacity reallocation approaches which aim at minimizing total spare capacity, our load-balancing approach minimizes the network load vector (NLV), which is a novel metric that reflects the network load distribution. Because NLV takes into consideration both uniform and non-uniform link capacity distribution, our approach can benefit both uniform and non-uniform networks. We develop a greedy loadbalancing spare capacity reallocation (GLB-SCR) heuristic algorithm to implement this approach. Our experimental results show that GLB-SCR outperforms a previously proposed algorithm (SSR) in terms of established connection capacity and total network capacity in both uniform and non-uniform networks.

A Load-Balancing Shared-Protection-Path Reconfiguration Approach in WDM Wavelength-Routed Networks

Wavelength-routed networks (WRN) are very promising candidates for next-generation Internet and telecommunication backbones. In such a network, optical-layer protection is of paramount importance due to the risk of losing large amounts of data under a failure. To protect the network against this risk, service providers usually provide a pair of risk-independent working and protection paths for each optical connection. However, the investment made for the optical-layer protection increases network cost. To reduce the capital expenditure, service providers need to efficiently utilize their network resources. Among all the existing approaches, shared-path protection has proven to be practical and cost-efficient [1]. In shared-path protection, several protection paths can share a wavelength on a fiber link if their working paths are risk-independent. In real-world networks, provisioning is usually implemented without the knowledge of future network resource utilization status. As the network changes with the addition and deletion of connections, the network utilization will become sub-optimal. Reconfiguration, which is referred to as the method of re-provisioning the existing connections, is an attractive solution to fill in the gap between the current network utilization and its optimal value [2]. In this paper, we propose a new shared-protection-path reconfiguration approach. Unlike some of previous reconfiguration approaches that alter the working paths, our approach only changes protection paths, and hence does not interfere with the ongoing services on the working paths, and is therefore risk-free. Previous studies have verified the benefits arising from the reconfiguration of existing connections [2] [3] [4]. Most of them are aimed at minimizing the total used wavelength-links or ports. However, this objective does not directly relate to cost saving because minimizing the total network resource consumption does not necessarily maximize the capability of accommodating future connections. As a result, service providers may still need to pay for early network upgrades. Alternatively, our proposed shared-protection-path reconfiguration approach is based on a load-balancing objective, which minimizes the network load distribution vector (LDV, see Section 2). This new objective is designed to postpone network upgrades, thus bringing extra cost savings to service providers. In other words, by using the new objective, service providers can establish as many connections as possible before network upgrades, resulting in increased revenue. We develop a heuristic load-balancing (LB) reconfiguration approach based on this new objective and compare its performance with an approach previously introduced in [2] and [4], whose objective is minimizing the total network resource consumption.

A Security Framework for Wireless Sensor Networks Utilizing a Unique Session Key

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Many key management protocols have been specifically designed for wireless sensor networks. However, most of the key management protocols focus on the establishment of the required keys or the removal of the compromised keys. The design of these key management protocols does not consider the support of higher level security applications. When the applications are integrated later in sensor networks, new mechanisms must be designed. In this paper, we propose a security framework, uKeying, for wireless sensor networks. This framework can be easily extended to support many security applications. It includes three components: a security mechanism to provide secrecy for communications in sensor networks, an efficient session key distribution scheme, and a centralized key revocation scheme. The proposed framework does not depend on a specific key distribution scheme and can be used to support many security applications, such as secure group communications. Our analysis shows that the framework is secure, efficient, and extensible. The simulation and results also reveal for the first time that a centralized key revocation scheme can also attain a high efficiency.

KeyRev: An Efficient Key Revocation Scheme for Wireless Sensor Networks

Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Key distribution has been extensively studied in the context of sensor networks. However, key revocation has received relatively little attention. Existing key revocation schemes can be divided into two categories: centralized key revocation scheme and distributed key revocation scheme. In this paper, we first summarize the current key revocation schemes for sensor networks. Then, we propose an efficient centralized key revocation scheme, KeyRev, for wireless sensor networks. Unlike most proposed key revocation schemes focusing on removing the compromised keys, we propose to use key updating techniques to obsolesce the keys owned by the compromised sensor nodes and thus remove the nodes from the network. Our analyses show that the KeyRev scheme is secure inspite of not removing the pre-distributed key materials at compromised sensor nodes. Simulation results also indicate that the KeyRev scheme is scalable and performs very well in wireless sensor networks.

A Key Management Protocol for Wireless Sensor Networks with Multiple Base Stations

Most of the proposed key management protocols for wireless sensor networks (WSNs) in the literature assume that a single base station is used and that the base station is trustworthy. However, there are applications in which multiple base stations are used and the security of the base stations must be considered. This paper investigates a key management protocol in wireless sensor networks which include multiple base stations. We consider the situations in which both the base stations and the sensor nodes can be compromised. The proposed key management protocol, mKeying, includes two schemes, a key distribution scheme, mKeyDist, supporting multiple base stations in the network, and a key revocation scheme, mKeyRev, used to efficiently remove the compromised nodes from the network. Our analyses show that the proposed protocol is efficient and secure against the compromise of the base stations and the sensor nodes.

Provisioning Strategies of Antarctic Fur Seals and Chinstrap Penguins Produce Different Responses to Distribution of Common Prey and Habitat

Central-place foragers that must return to a breeding site to deliver food to offspring are faced with trade-offs between prey patch quality and distance from the colony. Among colonial animals, pinnipeds and seabirds may have different provisioning strategies, due to differences in their ability to travel and store energy. We compared the foraging areas of lactating Antarctic fur seals and chinstrap penguins breeding at Seal Island, Antarctica, to investigate whether they responded differently to the distribution of their prey (Antarctic krill and myctophid fish) and spatial heterogeneity in their habitat. Dense krill concentrations occurred in the shelf region near the colony. However, only brooding penguins, which are expected to be time-minimizers because they must return frequently with whole food for their chicks, foraged mainly in this proximal shelf region. Lactating fur seals and incubating penguins, which can make longer trips to increase energy gain per trip, and so are expected to be energy-maximizers, foraged in the more distant (>20 km from the island) slope and oceanic regions. The shelf region was characterized by more abundant, but lower-energy-content immature krill, whereas the slope and oceanic regions had less abundant but higher-energy-content gravid krill, as well as high-energy-content myctophids. Furthermore, krill in the shelf region undertook diurnal vertical migration, whereas those in the slope and oceanic regions stayed near the surface throughout the day, which may enhance the capture rate for visual predators. Therefore, we sug- gest that the energy-maximizers foraged in distant, but potentially more profitable feeding regions, while the time-minimizers foraged in closer, but potentially less profitable regions. Thus, time and energy constraints derived from different provisioning strategies may result in sympatric colonial predator species using different foraging areas, and as a result, some central-place foragers use sub- optimal foraging habitats, in terms of the quality or quantity of available prey.

Distribution of Dioecious Eastern Red Cedar (Juniperus virginiana) along an Environmental Gradient in Ogallala, NE.

Abstract The purpose of this research was to study the sex distribution and energy allocation of dioecious Eastern Red Cedars (Juniperus virginiana) along an environmental resource gradient. The trees surveyed were growing in a canyon located at the University of Nebraska’s Cedar Point Biological Research Station in Ogallala, Nebraska. Due to the geography of this canyon, environmental factors necessary for plant growth should vary depending on the tree’s location within the canyon. These factors include water availability, sun exposure, ground slope, and soil nitrogen content, all of which are necessary for carbon acquisition. Juniperus virginiana is a dioecious conifer. Dioecious plants maintain male and female reproductive structures on separate individuals. Therefore, proximal spatial location is essential for pollination and successful reproduction. Typically female reproductive structures are more costly and require a greater investment of carbon and nitrogen. For this reason, growth, survival and successful reproduction are more likely to be limited by environmental resources for females than for male individuals. If this is true for Juniperus virginiana, females should be located in more nutrient and water rich areas than males. This also assumes that females can not be reproductively successful in areas of poor environmental quality. Therefore, reproductive males should be more likely to inhabit environments with relatively lower resource availability than females. Whether the environment affects sexual determination or just limits survival of different sexes is still relatively unknown. In order to view distribution trends along the environmental gradient, the position of the tree in the canyon transect was compared to its sex. Any trend in sex should correspond with varying environmental factors in the canyon, ie: sunlight availability, aspect, and ground slope. The individuals’ allocation to growth and reproduction was quantified first by comparing trunk diameter at six inches above ground to sex and location of the tree. The feature of energy allocation was further substantiated by comparing carbon and nitrogen content in tree leaf tissue and soil to location and sex of each individual. Carbon and nitrogen in soil indicate essential nutrient availability to the individual, while C and N in leaf tissue indicate nutrient limitation experienced by the tree. At the conclusion of this experiment, there is modest support that survival and fecundity of females demands environments relatively richer in nutrients, than needed by males to survive and be reproductively active. Side of the canyon appeared to have an influence on diameter of trees, frequency of sex and carbon and nitrogen leaf content. While this information indicated possible trends in the relation of sex to nutrient availability, most of the environmental variables presumed responsible for the sex distribution bias differed minutely and may not have been biologically significant to tree growth.