Mutation Research/environmental Mutagenesis and Related Subjects, Jan 1, 1983
The methods for detecting carcinogens and mutagens with the Salmonella mutagenicity test were des... more The methods for detecting carcinogens and mutagens with the Salmonella mutagenicity test were described previously (Ames et al., 1975b). The present paper is a revision of the methods. Two new tester strains, a frameshift strain (TA97) and a strain carrying an ochre mutation on a multicopy plasmid (TA102), are added to the standard tester set. TA97 replaces TA1537. TA1535 and TA1538 are removed from the recommended set but can be retained at the option of the investigator. TA98 and TA100 are retained. We discuss other special purpose strains and present some minor changes in procedure, principally in the growth, storage, and preservation of the tester strains. Two substitutions are made in diagnostic mutagens to eliminate MNNG and 9-aminoacridine. Some test modifications are discussed.
Detrended correspondence analysis (DCA) is an improvement upon the reciprocal averaging (RA) ordi... more Detrended correspondence analysis (DCA) is an improvement upon the reciprocal averaging (RA) ordination technique. RA has two main faults: the second axis is often an ‘arch’ or ‘horseshoe’ distortion of the first axis, and distances in the ordination space do not have a consistent meaning in terms of compositional change (in particular, distances at the ends of the first RA axis are compressed relative to the middle). DCA corrects these two faults. Tests with simulated and field data show DCA superior to RA and to nonmetric multidimensional sealing in giving clear, interpretable results. DCA has several advantages. (a) Its performance is the best of the ordination techniques tested, and both species and sample ordinations are produced simultaneously. (b) The axes are scaled in standard deviation units with a definite meaning, (c) As implemented in a FORTRAN program called DECORANA, computing time rises only linearly with the amount of data analyzed, and only positive entries in the data matrix are stored in memory, so very large data sets present no difficulty. However, DCA has limitations, making it best to remove extreme outliers and discontinuities prior to analysis. DCA consistently gives the most interpretable ordination results, but as always the interpretation of results remains a matter of ecological insight and is improved by field experience and by integration of supplementary environmental data for the vegetation sample sites.
Instrumenting the physical world through large networks of wireless sensor nodes, particularly fo... more Instrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, lightweight, untethered, and unobtrusive. The problem of localization, that is, determining where a given node is physically located in a network, is a challenging one, and yet extremely crucial for many of these applications. Practical considerations such as the small size, form factor, cost and power constraints of nodes preclude the reliance on GPS of all nodes in these networks. We review localization techniques and evaluate the effectiveness of a very simple connectivity metric method for localization in outdoor environments that makes use of the inherent RF communications capabilities of these devices. A fixed number of reference points in the network with overlapping regions of coverage transmit periodic beacon signals. Nodes use a simple connectivity metric, which is more robust to environmental vagaries, to infer proximity to a given subset of these reference points. Nodes localize themselves to the centroid of their proximate reference points. The accuracy of localization is then dependent on the separation distance between two-adjacent reference points and the transmission range of these reference points. Initial experimental results show that the accuracy for 90 percent of our data points is within one-third of the separation distance. However, future work is needed to extend the technique to more cluttered environments
This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor ne... more This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with individual nodes remaining largely inactive for long periods of time, but then becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in almost every way: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses three novel techniques to reduce energy consumption and support self-configuration. To reduce energy consumption in listening to an idle channel, nodes periodically sleep. Neighboring nodes form virtual clusters to auto-synchronize on sleep schedules. Inspired by PAMAS, S-MAC also sets the radio to sleep during transmissions of other nodes. Unlike PAMAS, it only uses in-channel signaling. Finally, S-MAC applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network. We evaluate our implementation of S-MAC over a sample sensor node, the Mote, developed at University of California, Berkeley. The experiment results show that, on a source node, an 802.11-like MAC consumes 2-6 times more energy than S-MAC for traffic load with messages sent every 1-10 s.
IEEE Transactions on Mobile Computing, Jan 1, 1999
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without th... more An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
Mutation Research/environmental Mutagenesis and Related Subjects, Jan 1, 1983
The methods for detecting carcinogens and mutagens with the Salmonella mutagenicity test were des... more The methods for detecting carcinogens and mutagens with the Salmonella mutagenicity test were described previously (Ames et al., 1975b). The present paper is a revision of the methods. Two new tester strains, a frameshift strain (TA97) and a strain carrying an ochre mutation on a multicopy plasmid (TA102), are added to the standard tester set. TA97 replaces TA1537. TA1535 and TA1538 are removed from the recommended set but can be retained at the option of the investigator. TA98 and TA100 are retained. We discuss other special purpose strains and present some minor changes in procedure, principally in the growth, storage, and preservation of the tester strains. Two substitutions are made in diagnostic mutagens to eliminate MNNG and 9-aminoacridine. Some test modifications are discussed.
Detrended correspondence analysis (DCA) is an improvement upon the reciprocal averaging (RA) ordi... more Detrended correspondence analysis (DCA) is an improvement upon the reciprocal averaging (RA) ordination technique. RA has two main faults: the second axis is often an ‘arch’ or ‘horseshoe’ distortion of the first axis, and distances in the ordination space do not have a consistent meaning in terms of compositional change (in particular, distances at the ends of the first RA axis are compressed relative to the middle). DCA corrects these two faults. Tests with simulated and field data show DCA superior to RA and to nonmetric multidimensional sealing in giving clear, interpretable results. DCA has several advantages. (a) Its performance is the best of the ordination techniques tested, and both species and sample ordinations are produced simultaneously. (b) The axes are scaled in standard deviation units with a definite meaning, (c) As implemented in a FORTRAN program called DECORANA, computing time rises only linearly with the amount of data analyzed, and only positive entries in the data matrix are stored in memory, so very large data sets present no difficulty. However, DCA has limitations, making it best to remove extreme outliers and discontinuities prior to analysis. DCA consistently gives the most interpretable ordination results, but as always the interpretation of results remains a matter of ecological insight and is improved by field experience and by integration of supplementary environmental data for the vegetation sample sites.
Instrumenting the physical world through large networks of wireless sensor nodes, particularly fo... more Instrumenting the physical world through large networks of wireless sensor nodes, particularly for applications like environmental monitoring of water and soil, requires that these nodes be very small, lightweight, untethered, and unobtrusive. The problem of localization, that is, determining where a given node is physically located in a network, is a challenging one, and yet extremely crucial for many of these applications. Practical considerations such as the small size, form factor, cost and power constraints of nodes preclude the reliance on GPS of all nodes in these networks. We review localization techniques and evaluate the effectiveness of a very simple connectivity metric method for localization in outdoor environments that makes use of the inherent RF communications capabilities of these devices. A fixed number of reference points in the network with overlapping regions of coverage transmit periodic beacon signals. Nodes use a simple connectivity metric, which is more robust to environmental vagaries, to infer proximity to a given subset of these reference points. Nodes localize themselves to the centroid of their proximate reference points. The accuracy of localization is then dependent on the separation distance between two-adjacent reference points and the transmission range of these reference points. Initial experimental results show that the accuracy for 90 percent of our data points is within one-third of the separation distance. However, future work is needed to extend the technique to more cluttered environments
This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor ne... more This paper proposes S-MAC, a medium-access control (MAC) protocol designed for wireless sensor networks. Wireless sensor networks use battery-operated computing and sensing devices. A network of these devices will collaborate for a common application such as environmental monitoring. We expect sensor networks to be deployed in an ad hoc fashion, with individual nodes remaining largely inactive for long periods of time, but then becoming suddenly active when something is detected. These characteristics of sensor networks and applications motivate a MAC that is different from traditional wireless MACs such as IEEE 802.11 in almost every way: energy conservation and self-configuration are primary goals, while per-node fairness and latency are less important. S-MAC uses three novel techniques to reduce energy consumption and support self-configuration. To reduce energy consumption in listening to an idle channel, nodes periodically sleep. Neighboring nodes form virtual clusters to auto-synchronize on sleep schedules. Inspired by PAMAS, S-MAC also sets the radio to sleep during transmissions of other nodes. Unlike PAMAS, it only uses in-channel signaling. Finally, S-MAC applies message passing to reduce contention latency for sensor-network applications that require store-and-forward processing as data move through the network. We evaluate our implementation of S-MAC over a sample sensor node, the Mote, developed at University of California, Berkeley. The experiment results show that, on a source node, an 802.11-like MAC consumes 2-6 times more energy than S-MAC for traffic load with messages sent every 1-10 s.
IEEE Transactions on Mobile Computing, Jan 1, 1999
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without th... more An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.
Uploads
Papers by makhaliro shaba