3 resultados para low food secure
em DigitalCommons@University of Nebraska - Lincoln
Resumo:
In January 1973, large numbers of Mugil cephalus (striped mullet), weighing approximately 250 gm each, died in two freshwater localities in tidewater bayous of Jackson County, Mississippi. Fish identified as Mugil curema, M. cephalus, Megalops atlantica, Dormitator maculatus, and Fundulus grandis were found dead in other low saline estuarine areas. Fish-kills during cold periods are less commonly encountered in Mississippi than in Texas or Florida. This particular incident is attributed to conditions of stress for fishes incompletely acclimated to the encountered low temperatures. The most deleterious stress was the low saline water which probably allowed a breakdown in the fishes' ion-osmoregulatory mechanisms. Striped mullet and other euryhaline fishes in salinities greater than 6 ppt survived, as did freshwater centrarchids and ictalurids in areas with dying mullet. Other stresses thought to contribute to the weakening of striped mullet in Paige Bayou during the period of rapidly decreasing temperatures include starvation and high levels of pesticide residues. In examined fish, the alimentary tracts were devoid of food, the gall bladders were distended and leaking bile, the livers contained excess lipid material and were often stained throughout with bile pigments, and the levels of DDT metabolites and endrin residues in the liver were higher than in control fish. Stress caused by low levels of dissolved oxygen, toxic substances in the water, or disease was discounted as a cause of death.
Resumo:
Wireless sensor networks are promising solutions for many applications. However, wireless sensor nodes suffer from many constraints such as low computation capability, small memory, limited energy resources, and so on. Grouping is an important technique to localize computation and reduce communication overhead in wireless sensor networks. In this paper, we use grouping to refer to the process of combining a set of sensor nodes with similar properties. We propose two centralized group rekeying (CGK) schemes for secure group communication in sensor networks. The lifetime of a group is divided into three phases, i.e., group formation, group maintenance, and group dissolution. We demonstrate how to set up the group and establish the group key in each phase. Our analysis shows that the proposed two schemes are computationally efficient and secure.
Resumo:
The security of the two party Diffie-Hellman key exchange protocol is currently based on the discrete logarithm problem (DLP). However, it can also be built upon the elliptic curve discrete logarithm problem (ECDLP). Most proposed secure group communication schemes employ the DLP-based Diffie-Hellman protocol. This paper proposes the ECDLP-based Diffie-Hellman protocols for secure group communication and evaluates their performance on wireless ad hoc networks. The proposed schemes are compared at the same security level with DLP-based group protocols under different channel conditions. Our experiments and analysis show that the Tree-based Group Elliptic Curve Diffie-Hellman (TGECDH) protocol is the best in overall performance for secure group communication among the four schemes discussed in the paper. Low communication overhead, relatively low computation load and short packets are the main reasons for the good performance of the TGECDH protocol.