text:
- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 632836, 11 pages
A Multicast Routing Protocol with Pruning and Energy Balancing for Wireless Sensor Networks
1The State Key Laboratory of Software Development Environment, Beihang University, Beijing 100191, China
2Research Institute of Beihang University in Shenzhen, Shenzhen 518057, China
Received 31 March 2012; Accepted 4 June 2012
Academic Editor: Ferry Pramudianto
Copyright © 2012 Juhua Pu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper presents a novel multicast routing protocol for wireless sensor networks, named Multicast tree protocol with Pruning and Energy Balancing (MPEB) to disseminate data through a layered multicast tree with high-efficiency and low-power consumption. With pruning algorithm and energy balancing algorithm, MPEB can save energy and balance load. Pruning algorithm records and maintains backup parents for each child node, and thus it can detach possible nodes from the multicast tree and turn as many nodes as possible to sleep. Energy balancing algorithm protects nodes with low power from running out of energy and dying out, and thus it can balance total energy consumption of the whole network and prolong the network lifetime. The formal validations and simulations evaluate the performance of MPEB, which shows that MPEB has a distinct advantage over others in both reducing and balancing energy consumption.
1. Introduction
A wireless sensor network (WSN) is a wireless network composed of spatially distributed sensor nodes. Sensor nodes are small, battery-powered, resource-constrained devices equipped with embedded CPU, sensors, and transceivers. They are usually scattered in physical environment to collaboratively monitor the surrounding conditions. Recently more and more applications of WSNs have emerged, such as target tracking on battle fields, monitoring volcanic eruptions, habitat monitoring to protect endangered wildlife, vehicular and traffic monitoring for smart living, and so forth [1].
Routing protocol is one of the key research domains in WSNs, and multicast routing protocol has drawn many attentions for its characteristics in wireless networks. It provides efficient message transmission to a group of hosts and helps reducing the bandwidth consumption. This is especially appropriate in wireless environments where bandwidth is scarce and many users share the same wireless channels. In particular, for WSNs, multicast is a fundamental and important communication pattern. A sink node can collect aggregated data from and send control messages to a set of sensor nodes using multicast. Taking environmental monitoring as an example; when the base station wants to acquire data from a given area, it sends control information by multicasting to nodes there. Additionally, sensor nodes can send messages to different sink nodes to implement distributed management. Thus, research on multicast routing is of great significance.
However, as sensor nodes have limited power, traditional multicast routing protocols for ad hoc networks are not suitable for WSNs. Moreover, multicast routing for WSNs with different mobility characteristics has been an active research domain for several years. Although some of relevant work has taken concern for energy protection, tremendous research is still required to decrease and balance power dissipation and prolong the lifetime of the network.
In this paper, we propose MPEB, an innovative multicast routing protocol for WSNs, which supports data dissemination along a layered multicast tree. Our contributions lie in three aspects. Firstly, to support multicast data dissemination, we construct and maintain a valid multicast tree. (A tree is called valid if it has no useless branches.) Secondly, to decrease total energy dissipation, we optimize the multicast tree to turn more nodes into sleeping state, while still maintain network's coverage requirement and connectivity. We achieve this by the proposed pruning algorithm. Thirdly, to protect overload nodes thereby balancing total energy, the energy balancing algorithm is proposed to protect noncritical overload nodes from running out their energy and partitioning the network. Our formal validations and simulations show that MPEB achieves a distinct advantage in reducing and balancing energy consumption, and it also keeps the connectivity of the network.
The remainder of this paper is organized as follows. After surveying the related work in Section 2, we present a detailed description of our proposal in Section 3, followed by formal validations in Section 4 and the simulation results in Section 5. Finally, we conclude this paper in Section 6.
2. Related Work
In this section, we briefly review previous work on multicast routing for wireless ad hoc and sensor networks. Many multicast routing protocols have been proposed in the literature [2–4]. For WSNs, sensor nodes are usually powered by batteries of limited capacity. In many WSNs applications, it is very difficult or even impossible to recharge or replace nodes' batteries after they are deployed. Therefore, the energy efficiency becomes a major objective for designing routing protocols in WSNs.
Nowadays, energy efficient multicast routing protocols for WSNs have been put forward, including tree-based multicast protocols, such as BAM [5], OTREMM [6], and D-ODMRP [7]. BAM obtains load reduction by single hop aggregation (S-BAM) and multiple paths aggregation (M-BAM). S-BAM aggregates radio transmission within one hop and supports one transmission to multiple intended receivers. M-BAM decreases multiple paths via aggregation and limits the range of radio transmission. SM-BAM, combining S-BAM and M-BAM, can reduce communication load. OTREMM is an energy-efficient multicasting algorithm for the case where the transmission powers of the nodes are fixed. It selects an optimal energy-efficient set of nodes for multicasting, taking into account residual energies, the transmission powers used and the set of nodes covered. D-ODMRP embeds a destination-driven feature into an existing on-demand multicast protocol ODMRP. To build a cost-effective multicast forwarding structure, the path to reach a multicast destination is biased towards those paths passing through another multicast destination; if multiple such choices are available, the one leading to the least extra cost is selected. However, OTREMM acquires specific network parameters, and BAM and D-ODMRP have been improved in more recent proposals to be introduced.
Recent proposed methods include EBMR [8] and MTMRP [9]. EBMR is an on-demand routing algorithm, which selects nodes with high energy and short distance to the source to be multicast forwarders. MTMRP, a heuristic distributed minimum transmission multicast routing protocol for WSNs, chooses the forwarding routes which can connect more multicast receivers and introduce a path handover scheme to prune redundant routes for multicast routing.
However, EBMR can further save total energy consumption by implementing sleep/work mechanism, and MTMRP can be improved by considering critical nodes' power protection to balance loads in the network. Moreover, so far, there is seldom research on the multicast routing with mobility, while there are many applications that require the multicast transmission in highly dynamic scenarios, such as traffic monitoring for smart living. Thus, we do research on a robust multicast routing protocol, which can flexibly adapt to static and dynamic network topology.
Overall, efficient power protection routing protocols are desired in dynamic and smart sensor networks. With the motivation from pruning algorithm in unicast communications [10], we propose our protocol with power saving and balancing to improve the efficiency of multicast communication in WSNs.
3.1. Protocol Design
We divide all the nodes in WSNs into three types, namely, source nodes, target nodes, and other nodes. Let us firstly give necessary definitions first.
Definition 1 (source nodes). Source nodes are the nodes which create data and send to destination nodes.
Definition 2 (target nodes). Target nodes are the destination nodes which the source nodes send data to.
The nodes which are neither source nodes nor target nodes are called other nodes.
The WSN we consider in this paper is composed of one source node, multiple target nodes, and one or more other nodes. All the nodes can move, under a mobility model, within a constrained area. In our simulation in Section 5, the mobility model we choose is random waypoint [11]. Regarding energy model, first order radio model [12] works well for its simplicity and excellent performance. To facilitate analysis, without loss of generality, we only concern energy cost by wireless sending and receiving, ignoring energy dissipated by sensing and computing.
There are four states for sensor nodes, waiting, working, sleeping, and dead. The state transition diagram is shown in Figure 1. More details will be depicted later. Working nodes means those in the routing tree, including one root, several branches, and leaves.
Based on the network model above, we propose a new tree-based multicast routing protocol MPEB to improve power efficiency. Each node is identified by a unique ID and has attributes including En (energy remaining), Level (layer in the tree), PID (ID of its parent node), and C List (ID list of its children nodes) for the hierarchical structure. The communication based on multicast tree is implemented by kinds of control messages, including CRQ (children request message), CRQR (reply for CRQ), CMT (children maintenance message), CMTR (reply for CMT), and DNF (detach notification message).
3.2. The Framework of MPEB
The framework of MPEB includes three parts, namely, tree construction, pruning, and energy balance. In this section, we briefly introduce how to construct a multicast tree, and will present pruning and energy balance algorithms in Sections 3.3 and 3.4, respectively.
Since the tree construction is not the main contribution of our paper, we just show the skeleton of the tree construction process here. Readers who are interested in the details can refer to paper [3]. When constructing of multicast tree, the source, as root of the tree, broadcasts a solicit packet CRQ to discover its children, which in turn do the same way to discover their own children, until all the targets join in the tree. As the target nodes' IDs are contained in the CRQ messages, each node knows whether it is a target node or not. To optimize the tree, we utilize a leaf detection mechanism. If leaf node, such as S7 in Figure 2, is not a target, it sends DNF to its parent S6 to voluntarily leave the tree. After a period, all useless branches will be cut off from the tree. Finally, the bold lines in Figure 2 present the valid multicast tree. After that, the relationships between parents and children will be updated periodically via CMT and CMTR messages.
Additionally, the protocol supports coexisting of several multicast groups with adding attribute GID (group ID). Only nodes redundant for all the groups can be pruned from the multicast trees. In the same way, only when there are replacements of the tree node in every group, can it sleep to balance total power. More details are left for further research.
It is common to have several source nodes in a multicast application in WSNs. In [13], Sato proposes an efficient protocol to construct a shared tree for multisource multicast. Here, our algorithms can be easily integrated into this protocol to better multi-source multicast routing. More analysis and experiments will be shown in our future work.
3.3. Pruning Algorithm
Pruning algorithm aims at changing as many nodes as possible into sleeping state so that nodes' energy can be saved. By analyzing control messages, backup parents for each node are found and maintained. If each child of one node has backup parent, this node can be detached from the tree.
Pruning algorithm needs some modification on nodes' attributes and message structure. To maintain nodes' backup parent, GPID (grandparent's ID), and BPID (backup parent's ID) are added in nodes' attributes list. Here the parent of a node's parent is called this node's grandparent. The modifications on message structure are displayed in Table 1. Here CMT messages include the attribute PID. When receiving CMT from its parent, the node records PID in CMT as its GPID. Besides, two kinds of new messages, CDN and CDNR, are needed to detach children from their parents.
Now we discuss how to find the backup parents. In the MPEB tree, if one node receives CRQ from another, the difference between their Levels is less than or equals 1, which will be proved in Section 4. Thus, we can draw all the possible topologies as illustrated in Figure 3.
We record the sender of CRQ as A and the receiver as B. For node B, according to the information in CRQ, the relationship between A and B can be classified into 6 types. (1) A and B have parent-child relationship, as shown in Figures 3(a-1) and (a-2); (2) A and B have the same parent, if the PID in CRQ is equal to B's PID, illustrated in Figure 3(b); (3) A's grandparent is B's parent, as displayed in Figure 3(c); (4) A's parent is B's grandparent, as displayed in Figure 3(d); (5) A and B have the same grandparent, as Figure 3(e); (6) there is no relevance between A's attributes (ID, PID, and GPID) and B's, as presented in Figures 3(f-1), (f-2), and (f-3).
In our proposal, if the relationship between A and B is (a), (b), or (c), B discards this CRQ message. If the relationship is (d), (e), or (f), B records A as its backup parent. Apart from this, if B has more than one available backup parent, the one with minimal Level will be selected. If a node has backup parent, it sets its BP_Flag = 1 when sending out CMTR messages.
When the parent, for example, node 3 in Figure 4(a), receives CMTR, it checks all the children's BP_Flag. If all its children have backup parents and node 3 is not a target node, it can turn to sleep. The process is as follows. First, node 3 sends CDN to all its children. Taking the child node, say node 7, as an example, node 7 sends CRQR to its backup parent node 2, to join node 2's subtree. When CMT from node 2 is received by node 7, which means the parent-child relationship between node 2 and node 7 has been constructed, node 7 sends CDNR to node 3 to relieve the previous relationship. Node 8 does the similar process, and thus node 3 sends DNF to its parent and turns into sleeping state. So the new tree is as Figure 4(b).
As can be seen, the pruning algorithm attempts to detach more nodes from the tree, the total energy dissipated can be greatly decreased. However, there is a side effect about unbalanced loads from pruning algorithm. Take Figure 4 as an example. Although the total power consumed is reduced, nodes 2 and 4 must take more transfer loads, which affects the lifetime of the network due to early deaths of nodes with high load. To solve this problem, we propose energy balancing algorithm as expounded below.
3.4. Energy Balancing Algorithm
To implement this algorithm, we introduce two new attributes, E_Th (energy threshold to take the energy protection scheme) and EPN_ID (ID of the latest EPN message, as shown in Table 2, received by the node), included in node's attributes list. Several kinds of messages are added into this protocol, listed in Table 2. EPB message transmits by broadcasting and others by unicasting.
When node A's energy reduces from original value to E_Th, A sends EPR to its parent and EPN to its children. Any node receiving EPR forwards EPR to its parent until reaching the root, while any node receiving EPN transfers EPN to its children until reaching the leaves. The process of this algorithm is shown below in Algorithm 1. To describe our protocol clearly, we make one definition first.
Definition 3 (target leaf and target branch). For an arbitrary node A, leaves in A's subtree which are also target nodes are defined as A's target leaves, and branch nodes in A's subtree which are also target nodes as A's target branches.
After receiving EPRs, the root computes current overall performance of the network and makes decision on whether to implement energy protection for each EPR. Here, we protect at most 20% nodes of all the alive nodes. If more nodes require protection, those with less remaining power are protected. More dynamic decision making schemes are left for our future work. If A wins the chance to be protected, root records A's ID and En in EPB and broadcasts this message. All nodes, except A, broadcast EPB at the first time they receive it. Sleeping nodes are waken up by EPB to make judgment. If the En of this node is higher than En in EPB, it turns into working state and broadcasts this message, otherwise it keeps sleeping.
When A's target leaf receives EPB for A, if its backup parent is null, it claims the node from which EPB comes as its backup parent. Then, it unicasts EPNR up along the tree to A. Each branch in A's subtree forwards EPNR to its parent only if it has received EPNR from all its children. When A has received EPNR from all its children, the energy protection can be implemented on A. For A's target leaves and target branches having backup parents, they claim their backup parents as new parents. For those without backup parents, they set the backup parents to be one of their children, because in this way, there must exist at least one path to the source node excluding A. Proof in detail will be presented in Section 4. Meanwhile, we adopt different solutions based on whether A is a target node or not. If A is a target node, A destroys the relationships with its children and only keeps communication with its parent. Otherwise, A changes its state into sleeping.
With energy balancing algorithm, we can decrease energy dissipated on nodes with low energy remaining. It is helpful to balance energy in the whole network and prolong the lifetime of the network.
To sum up, as the new protocol MPEB, with pruning algorithm and energy balancing algorithm, changes more nodes into sleeping state and protects nodes with low energy, it can improve the efficiency of power usage.
4. Formal Validation
4.1. Protocol Validation
In this subsection, we prove that MPEB can construct a valid multicast tree to satisfy the routing requirements in WSNs.
Lemma 4. Taking source node as the root, MPEB constructs a stable multicast tree without loops within finite iterations in a connected WSN.
Proof. From the protocol MPEB, it is apparent that source node has no parent and every other node in the tree has just one parent. Considering basic graph theory, it is a tree structure without routing loops. Now we prove that under topology changes, a stable tree can be set up within definite iterations. Here we assume that there are N nodes in the network, so Levels of nodes are integers in the interval [0, N]. (Level 0 means that the node is not in the tree.) We firstly focus on the tree construction stage, and then on tree maintenance stage, to see how to achieve a stable and valid multicast tree.
As can be seen from Section 3.2, the tree construction involves three aspects. Firstly, by flooding CRQ messages, an initial multicast tree will be built, and most parts of the nodes are connected in the multicast tree. Secondly, when constructing the multicast tree, if one node, say node A (which is already connected in the multicast tree with node B as its current parent), gets a new CRQ message from another node, say node C, and node C has a lower Level than node B, node A will set its parent as node C and the Level of node A will decrease. Thirdly, those nodes, which are connected into the multicast tree but cannot transmit messages to the target nodes, will leave from the tree and turn into sleeping state. To sum up, during the tree construction stage, there exist and only exist the above two conditions that may lead to the change of tree topology.
During the tree maintenance stage, the topology change can results from three cases. Two are similar to the two cases occurred in tree construction stage as mentioned above. Another one is the case that nodes' levels increase. For example, when a node moves to a new place and it can only connect to a new parent which has a bigger level. In this case, this node and its subtree (if exists) are affected and need to find new parents.
When one node leaves the tree, it just influences the topology once, thus the number of changes on the multicast tree will not surpass N. In the other cases, as the Level changes in the set (2, N) (excluding the root), the number of changes in the tree will not be larger than (N−1)2.
To sum up, whichever case it is, the number of nodes to change is limited, and each of them can be updated within finite iterations. Therefore, the change of the multicast tree takes place in finite iterations. In other words, the stable multicast tree can be constructed within finite iterations.
Lemma 5. There exists at least one target node in each subtree of the stable MPEB multicast tree.
Proof. Apparently, if no target node is on the subtree, none of the leaves are targets. With our protocol, in a duration , these leaves will be pruned with DNF. After this, there is still no target on the subtree, so new leaves will also be cut off. If the subtree has levels, after , all the nodes will be pruned. In other words, such a subtree cannot exist stably. Therefore, in a stable MPEB tree, every subtree has at least one target node.
Lemma 6. In the stable MPEB tree, all the leaves are target nodes.
Proof. As one leaf node can be deemed as a special subtree with just one node, we know that it must be a target node based on Lemma 5.
Lemma 7. In the stable MPEB multicast tree, if two nodes communicate with each other, the absolute value of the difference between their Levels is not larger than 1.
Proof. We prove this lemma using apagoge. Assume that A and B can communicate with each other and A.Level-B.Level > 1. Obviously they do not have parent-child relationship because the difference between parent's and child's Levels must be 1. If A's parent is C, we get the equation A.Level–C.Level = 1 and B.Level < C.Level. With MPEB, A receives CRQ from B within a period and selects B as its parent because of B's lower Level than C's, which contradicts the assumption before. Thus, for two communicating nodes, the absolute value of the difference between their Levels cannot surpass 1.
4.2. Pruning Algorithm Validation
Here, we prove that pruning algorithm does not influence the connectivity of the multicast routing. Before the validation, we first give the definition of critical node.
Definition 8. For an arbitrary node A, if some target node becomes unachievable after deleting node A from the routing tree, node A is named a critical node.
Lemma 9. In MPEB multicast routing tree, one node is not a critical node, if and only if this node is a branch and not a target node, and all of its children can be connected to the source node via paths excluding this node.
Proof (Adequacy). If A is a branch and not a target node, and that for each child , there exists one path excluding A to the source node. Recording the subtrees rooted at as , we know that paths from the source node to , not including A, can be found. If the subtree rooted at A is M, for an arbitrary target node C in M, we obviously know that C is not A. In other words, C is included in , . Therefore, C can be achieved from the source node with a path without A. As all the target nodes in M can be connected, all the target nodes in the whole network can be connected with the source node through paths without A. According to Definition 2, A is not a critical node.
Necessity. If node A is not a critical node, according to Definition 2, A is not a target, or else the target, itself, is unachievable after deleting it from the tree. With Lemma 6, A is not a leaf, so it must be a branch. For an arbitrary child B of A, there is a subtree M. From Lemma 5, M embraces one target node C. Because A is not a critical node, there exists at least one path between C and the source node which excludes A. For another part, both B and C are in the same subtree M, so they are connected. Therefore, B can also communicate with the source node along some path excluding A. As B is an arbitrary child of A, we conclude that all the children can be connected with the source node via paths excluding A.
From the description of pruning algorithm, we know that all the nodes deleted from the tree conform to the adequate condition of Lemma 9, so they are not critical nodes. Therefore, pruning algorithm will not affect the connectivity of the multicast routing. However, as pruning algorithm makes many nodes sleep, it reduces coverage degree of the network. This problem can be solved by nodes' wakeup mechanism [14], which will be further discussed as our future work.
4.3. Energy Balancing Algorithm Validation
As can be seen from Section 3, the connectivity of the multicast routing is not influenced by energy balancing algorithm, which will be validated in this section by the following lemmas.
Lemma 10. Nodes pruned from the multicast routing tree with energy balancing algorithm are noncritical nodes.
Proof. Assume that we execute energy balancing algorithm on node A. If A is a target node, we detach its children to save energy, but keep its connection with its parent in the tree. Otherwise, A will turn to sleep only if all its target leaves have received EPB, which is flooded along paths without A. In other words, if we assume that A has turned to sleep, there must be some other paths from its target leaves to source node. Moreover, when taking both A's subtree and new paths to target leaves into account, we can obviously find that every branch is also achievable through paths excluding A to the source. In short, all the children of A have new ways to the source. According to Lemma 9, A is a non-critical node. To sum up, just non-critical nodes can be pruned from the multicast tree by energy balancing algorithm.
Lemma 11. EPB message never wakes up nodes with lower energy than the one for whom EPB is broadcasted.
Proof. From the depiction in Section 3, we know that only sleeping nodes with higher energy than the En recorded in EPB will be waken up. Thus, nodes with lower En will keep in sleeping state.
Based on Lemma 11, we conclude that energy balancing algorithm makes sense for energy balancing in the whole network. However, there is more research to be done on nodes' wakeup mechanism to avoid side effects, such as total power waste due to several nodes' wakeup to save one node's power.
5. Performance Evaluation
5.1. Design of Time Parameters
From the detailed description in Section 3, there are four principal time parameters in MPEB, including , , , and .
is the period for nodes to select their parents during the construction of the multicast tree. As parent selection is based on Level, which equals the hops between source node and the sender of CRQ. To guarantee that each node in the tree can find its parent, we set , while in practice, the value is , with referring to the delay of data processing and dissemination. If we use to express the size of CRQ messages and rate to sending and receiving date rates, .
is the dissemination period of CMT, which marks the sensitivity to the topology changes. We assume that the communication radius is and moving speed is , so the parent-child relationship will change within a period . With the following preconditions: (1) within CMT messages have been sent out, (2) the connection is considered cut off if CMT have been retransmitted and no CMTR received, we conclude that the delay is at least to detect the destroyed relationship and the successful transmission rate of messages . As , the conclusion is . In simulations, we set this parameter .
is the transmission period of CRQ, which should be larger than the timeout threshold of CMT that is, . In our simulations, we set .
is the duration for leaves to be pruned. Before a leaf is pruned, it sends at least one CRQ message and waits for its reply from others. Therefore, . In practice, we set .
From the equations listed above, we know that with the successful ratio of transmissions increasing, , , and all diminish, so the total power consumption rises. It embodies the mutual constraints of transmission quality and efficiency. Furthermore, with increasing, , , and also diminish, indicating that with higher speed of mobility, more energy is dissipated to adapt to the topology changes.
5.2. Network Configurations
We simulate MPEB on ns-2 simulation platform. The configurations are listed below in Table 3. In our simulation, we suppose the source node has infinite energy. Although there are different kinds of control messages, these messages always carry relevant basic information. Thus, to simplify the simulation, we assume, without loss of generality, that the size of control messages is 10B. Regarding energy model, we use the first-order radio model [12] as mentioned in Section 3.1, and the parameter configurations are the same as the paper [12]. Interested readers can refer to [12] for details.
To analyze effects of each algorithm, we have made experiments on three MPEB versions as follows. (1) B-MPEB: basic multicast routing protocol without pruning algorithm and energy balancing algorithm. (2) P-MPEB: multicast routing protocol with pruning algorithm, but without energy balancing algorithm. (3) PB-MPEB: multicast routing protocol with both pruning algorithm and energy balancing algorithm. We compare our proposals with improved protocols EBMR and MTMRP.
In the simulations, we analyze two criteria, total energy remaining and survival ratio (as depicted in Section 5.3). To prove the practicality of our proposal, we also concern about the connectivity of the network. Note that all the values in the simulation results are average in 100 experiments. The results are illustrated as in Figures 5 to 8.
Note that although the results in Figures 5 to 8 are gotten under the network whose configuration is in Table 3, we do still simulate other configurations to see in what kind of WSNs our protocol performs well. Firstly, since node density of the network greatly affects the tree structure, we have made experiments with the number of nodes at 30 and 90. The results show that lower node density of the network, less advantage of the pruning algorithm performs, as less backup parents can be found. This indicates that our proposal works better in WSNs with plenty of nodes. Secondly, we have tested different values for energy threshold E_Th from 1J to 6J. The results show that too low or too high values highly affect the survival radio at around 45% and 80%, respectively, which is inline with expectations, as low E_Th undermines the benefits of energy protection and high E_Th brings about many control messages wasting limited resource. Thus, based on the experiments, we suggest that it is better to set the energy threshold as 2J. More details are omitted due to limited space. We also leave more sufficient simulations and analysis as our future work.
5.3. Simulation Results
5.3.1. Total Energy Analysis
Total energy remaining shows the ratio of total energy remaining to initial total energy during the simulation time. Higher energy remaining means higher efficiency of the total energy usage.
When nodes move with low speed as illustrated in Figure 5(a), PB-MPEB and P-MPEB are advantaged to others, because pruning algorithm can change more nodes to sleep so as to save total energy.
In the early, PB-MPEB consumes least, while after a while, PB-MPEB expends more energy than P-MPEB. The reasons are as follows. (1) As more and more nodes acquire energy protection, energy consumed roars up due to control messages, especially EPB flooded in the network. (2) Side effects of this mechanism, like wasting power by many nodes' waking up to save one node's power, exert detrimental impacts on the overall performance.
Among these five protocols, B-MPEB consumes most energy, while MTMRP with a path handover scheme performs better than EBMR. In B-MPEB, since nodes always select those with the lowest Level to be their parents, this will decrease the number of hops, but increase distance within one hop, costing more energy to send messages. Therefore, B-MPEB does not perform well on total energy saving.
While nodes move at high speed, from Figure 5(b), the performance of B-MPEB becomes even worse, as the moving nodes change their parents with higher frequency due to rapid topology changes. Meanwhile, the advantage of pruning algorithm is weakened because of increasing control messages.
Comparing MTMRP with PB-MPEB, we find that both of them perform almost the same under low speed movement model, while the MTMRP performs much worse than PB-MPEB under high speed movement model. Thus, the robustness of our proposal is better than MTMRP.
To investigate the network stations with different protocols, we collected the energy remaining of each node at 300 s in the simulation. The result is shown in Figure 6. As the initial locations of all nodes are generated randomly and they move with random waypoint model, there are many fluctuations in the figure. But, we can still get the overall performance of the network. As seen from the figure, the average energy remaining and the energy balance of our proposal are better than EBMR and MTMRP.
To sum up, we make the following conclusion.
Conclusion 1. For MPEB, the decline in total energy consumption is attributed to pruning algorithm.
5.3.2. Survival Ratio Analysis
Survival ratio means the ratio of the number of alive nodes to the number of all nodes. Higher survival ratio means better balance of the total network.
The simulation results are illustrated in Figure 7. When nodes move with a low speed, our proposals perform better than EBMR and MTMRP. Because energy balancing algorithm can balance total power of the network and avoid early deaths efficiently, PBMPEB performs best in Figure 7(a) as expected. But P-MPEB performs worse than B-MPEB, because the side effect of pruning algorithm, as discussed before, makes some nodes overloaded, hastening their deaths.
As the figure shows, MTMRP and P-MPEB do not perform well due to the overload on critical nodes on the paths. In brief, we propose another conclusion.
Conclusion 2. For MPEB, pruning algorithm may cause load imbalance, but energy balancing algorithm can balance energy consumption.
However, under high-speed movement, P-MPEB is superior to PB-MPEB, shown in Figure 7(b). We can explain this phenomenon with two reasons. (1) High-speed mobility automatically balances communication loads among nodes. While nodes move slowly, the topology seems to be stable and nodes with high load die quickly. However, with high speed, topology changes frequently and different loads cannot exert tremendous impacts such as early deaths, so high mobility is good for load balance. (2) Topology changes consume much more power by control messages in energy balancing algorithm, thus its performance deteriorates. In short, another conclusion is presented below.
Conclusion 3. For MPEB, when the topology changes with high frequency, the advantage of energy balancing algorithm degrades.
5.3.3. Connectivity Analysis
We use the number of achievable target nodes to analyze network connectivity. As can be seen from Figure 8, PB-MPEB performs better than others with low speed, and P-MPEB performs a little better than PB-MPEB under high mobility, in accordance with our analysis above, too.
In Figure 8(a), after nearly 600 seconds with low-speed mobility, as the branch nodes on the tree are powered off, the target nodes become unreachable. The confidence interval for our proposal is (500, 700) with confidence level 0.95, while that for MTMRP is (350, 500). Thus, we can see that our protocol has advantages over others. With high speed mobility, the total performance looks worse than that with low speed mobility, while our protocol still has a little advantage than others.
To sum up, comparing with EBMR, our protocol decreases total energy consumption nearly 11% and increases survival ratio almost 17%, especially under stable scenario with low moving speed. Comparing with MTMRP, our proposal decreases total energy consumption nearly 14% and increases survival ratio almost 13%, especially under dynamic scenario with high mobility models. The overall performance is superior, so that it can prolong the lifetime and optimize the transmissions in the network.
However, these two new algorithms slightly increase the multicast-based delay. Especially when the network topology changes quickly, the amount of control messages increases rapidly. Hence, it may be not sensible to take these algorithms to save energy under strictly restricted latency.
6. Conclusion
In this paper, we propose MPEB, a multicast routing protocol based on multicast tree structure. To decrease energy consumption, pruning algorithm attempts to change as many non-critical nodes as possible to sleep. However, it makes energy dissipation unbalanced in the network, so energy balancing algorithm is proposed to protect nodes with low power to avoid early deaths. In order to prove the correctness and validity of these schemes, we make theoretical proof in Section 4 and sufficient experiments in Section 5. Compared with EBMR and MTMRP, we verify that MPEB with pruning algorithm and energy balancing algorithm is effective on energy protection and balance.
However, there is still much profound research to be done to avoid side effects of pruning algorithm and energy balancing algorithm, such as that pruning algorithm may decrease the coverage of the network due to nodes' sleeping and that energy balancing algorithm may wake up too many nodes to protect one node. Additionally, many more experiments need to be done to deploy this protocol in actual sensor motes to test its performance in realistic wireless sensor networks.
The authors gratefully acknowledge the support from China's Natural Science Foundations (61272350 & 61173009), National High Technology Research and Development Program of China (2011AA010501), International S&T Cooperation Program of China (2010DFB13350), Doctoral Fund of Ministry of Education of China (20091102110017), and Shenzhen Key Laboratory of Data Vitalization (Smart City).
- K. Römer and F. Mattern, "The design space of wireless sensor networks," IEEE Wireless Communications, vol. 11, no. 6, pp. 54–61, 2004. View at Publisher · View at Google Scholar · View at Scopus
- A. Penttinen, "Minimum cost multicast trees in ad hoc networks," in Proceedings of IEEE International Conference on Communications (ICC '06), pp. 3676–3681, July 2006. View at Publisher · View at Google Scholar · View at Scopus
- T. Niwat, T. Yoshito, and S. Kaoru, "An efficient multicast routing protocol for wireless sensor networks," IEIC Technical Report 690, Institute of Electronics, Information and Communication Engineers, Tokyo, Japan, 2005. View at Google Scholar
- A. Sheth, B. Shucker, and R. Han, "VLM2: A very lightweight mobile multicast system for wireless sensor networks," in Proceedings of IEEE Wireless Communications and Networking Conference (WCNC '03), pp. 1936–1941, New Orleans, La, USA, 2003.
- A. Okura, T. Ihara, and A. Miura, "BAM: branch aggregation multicast for wireless sensor networks," in Proceedings of 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS '05), pp. 354–363, November 2005. View at Publisher · View at Google Scholar · View at Scopus
- C. Papageorgiou, P. Kokkinos, and E. Varvarigos, "Energy-efficient multicasting in wireless networks with fixed node transmission power," in Proceedings of ACM International Wireless Communications and Mobile Computing Conference (IWCMC '09), pp. 958–962, June 2009. View at Publisher · View at Google Scholar · View at Scopus
- K. Tian, B. Zhang, H. Mouftah, Z. Zhao, and J. Ma, "Destination-driven on-demand multicast routing protocol for wireless ad hoc networks," in Proceedings of IEEE International Conference on Communications (ICC '09), pp. 1–5, June 2009. View at Publisher · View at Google Scholar · View at Scopus
- F. Wang, J. Tao, and B. Shao, "An energy-balanced multicast routing algorithm in wireless sensor networks," in Proceedings of the 9th International Conference on Grid and Cloud Computing (GCC '10), pp. 361–365, November 2010. View at Publisher · View at Google Scholar · View at Scopus
- L. Cheng, S. K. Das, J. Cao, C. Chen, and J. Ma, "Distributed minimum transmission multicast routing protocol for wireless sensor networks," in Proceedings of the 39th International Conference on Parallel Processing (ICPP '10), pp. 188–197, September 2010. View at Publisher · View at Google Scholar · View at Scopus
- X. Ma, M. T. Sun, G. Zhao, and X. Liu, "An efficient path pruning algorithm for geographical routing in wireless networks," IEEE Transactions on Vehicular Technology, vol. 57, no. 4, pp. 2474–2488, 2008. View at Publisher · View at Google Scholar · View at Scopus
- W. Navidi and T. Camp, "Stationary distributions for the random waypoint mobility model," IEEE Transactions on Mobile Computing, vol. 3, no. 1, pp. 99–108, 2004. View at Publisher · View at Google Scholar · View at Scopus
- W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient communication protocol for wireless microsensor networks," in Proceedings of the 33rd Annual Hawaii International Conference on System Siences (HICSS '00), vol. 2, p. 223, January 2000. View at Scopus
- F. Sato, "An efficient shared-tree-based multi-source multicast routing protocol in mobile ad hoc networks," in Proceedings of the International Conference on Advanced Information Networking and Applications Workshops (WAINA '09), pp. 377–382, May 2009. View at Publisher · View at Google Scholar · View at Scopus
- Y. Zhu and L. M. Ni, "Probabilistic wakeup: adaptive duty cycling for energy-efficient event detection," in Proceedings of the 10th ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, pp. 360–367, Chania, Crete Island, Greece, October 2007. View at Publisher · View at Google Scholar · View at Scopus


text:
25 Green Home Gift Ideas for Dad
From Dean Dowd on June 19, 2009 in Green Remodeling
Every Dad has his day. It's called Father's Day and it comes every year as spring starts its sunny transformation into summertime. Which for dad might mean project-time, garden-time, hiking, camping, or home repair time. Whatever your dad's passions might be, Father's Day comes at a time when our world is as green as it gets—forest canopies are fresh and dense; lawns, landscapes and parks are vibrant and vital.
Now there's no reason why gifts for dad should not be as green as the surrounding flora, and there are green gifts to fit any dad's tastes and tasks. They range from small to large, tangible to symbolic. And you'll be surprised to find out how affordable most of them are. Here are 25 green home gift ideas for dad this year, enough to guarantee that he'll be tickled green at home or wherever his stone may roll.
- Solar LED Flashlight. Solar powered flashlights can fit on your key ring or tabletop and are constantly evolving. Check out SunNight's latest line of solar flashlights—they're heavy duty, helping out the third world, and could make dad's next camping trip that much more eco-friendly.
- Homemade Artwork. Great for the younger Father's Day gifters and the environment. Simply take an old section of cardboard, paint a picture for dad, buy some recycled matte-board, and either build or pick up a thrift-store frame. Put all the pieces together and give dad something heartfelt, unique, inexpensive and most of all, green.
- Performance Chips. These aftermarket performance chips for dad's car or truck work by increasing power, control, and torque in the car, thereby increasing performance and fuel economy. Chips exist for most makes and models, and work especially well for diesel engines (i.e., dad's big, gas-guzzling pick up). Have a look at streetbeatcustoms.com.
- Solar Garden Lights are very common nowadays, but that doesn't mean every dad has one. These plug-free, solar lights simply stick in the ground along garden paths, landscape borders, or at the base of trees to provide wireless, energy-saving, smooth accents to any garden or walkway.
- Reusable Water Bottle. Stainless steel or aluminum, BPA-free reusable water bottles are all the rage right now. They avoid using plastic, disposable water bottles, they are recyclable and reusable, and the water just tastes better. A must-have for anyone, even dad, who is on the go and eco-friendly. Check out Klean Kanteen, CamelBak, and REI for some examples.
- Bamboo Bath Robe. Make dad's lazy Sunday mornings comfortable and eco-friendly with a new bamboo bath robe (among many other available bamboo products).
- Recyclable Wallet. New wallets are something dads always seem to need but rarely buy. Now dad can be on the green revolution front even while carrying his greenbacks. Choose between a recyclable nylon wallet or a recycled rubber wallet.
- Solar Chargers. The amount of solar chargers on the market nowadays is staggering. We have palm-sized, strap-on, flexible, ultra-thin, and more. Now you can go anywhere and never be without your iPod, iPhone, or other portable electronic device.
- Energy & Gas Conservation Kit. This unique home energy saving kit comes with a low-flow showerhead and kitchen and bath aerators, a shrink-fit window kit to save moola during winter, foam weather-strips, draft stoppers, and a helpful Energy Wheel for more eco-friendly tips —all for only $25.
- Homemade Card. A little craft time makes a big difference in the environment. Cardboard, construction paper, poster board, printer paper; these are things most families have lying around the house. Take the time to make dad a card this year and help save energy and trees. Or at least check out recycled greeting cards.
- High Efficiency Grill. A new grill is the mother of all Father's Day gifts, and this year you can help dad take a step up the environmental ladder with a high efficiency gas, propane, electric, or hybrid grill. These are all much cleaner and more efficient than charcoal grills or wood fires, especially when you consider the toxins that go into making most charcoal products (not to mention your steaks!). Electric are by far the most efficient, followed by propane and natural gas. Here is an example of a hybrid grill that can meet the needs of both the energy economist and grilling purist in any dad.
- All Natural Charcoal. If dad's is a hardcore charcoal griller, fear not, you can find natural charcoal, such as these from Cowboy Charcoals, made without coal, chemicals or fillers.
- Eco-Friendly Clothing. In addition to bamboo, there are plenty of other eco-friendly and fair trade clothes out there for any dad. Try sites like BuyGreen or White Apricot, and more sweat-free retailers like Ecolution, Patagonia, or American Apparel.
- Waterless Car Wash. Help dad save water, stop toxic run-off, and still get the roadster clean with waterless car washing. One example: EcoTouch—a full line of affordable, waterless car wash solutions. You can find their products in Whole Foods and many other nationwide outlets.
- Community Supported Agriculture. CSA subscriptions, or weekly delivery of locally grown vegetables, are a great, super-green gift for the dad who loves to cook. Not only are you supporting the local economy but you're taking the waste and pollution out of food purchasing, (i.e., packaging, transportation, and processing). See localharvest.org for a list of CSAs in your area.
- Renewable Energy Credits. Help dad go green in his car by purchasing him carbon credits to offset the emissions from daily driving. BeGreenNow has packages (ranging from $42 to $126) of credits to offset dad's auto emission from now until next Father's Day ... an excellent gift for the energy conscious yet mobile dad.
- Plant a Tree. Add your dad's name to a new tree somewhere, a tree helping to absorb all the extra carbon floating around and to make our lands healthy, wealthy, and green once more. You can also adopt an acre of forest or coral reef in his name through the Nature Conservancy.
- Organic Coffee. Does your dad need a cup or two to get going in the morning? You can make his next cup a little greener by purchasing organic, fair trade coffee beans this Father's Day from retailers like Equal Exchange. Get better coffee and feel better about it at the same time—even better if you can find it from local coffee roasters.
- Solar Backpack. Is dad an outdoorsman? Perhaps he needs some help keeping his GPS locator, fish-finder, iPod, even cell phone charge while he's out and about. With a solar powered backpack he can charge his devices while he's carrying them! For more urban dad's check out a solar messenger bag.
- Upcycled Gifts. Upcycling is actually another recycling term used for creating something(s) out of otherwise landfill-bound materials. Take, for instance, this bowl made from old bike chains, or these wallets made from old cassette tapes. C'mon, how many dads still have their cassette tape collection? Well it turns out you can still invest money in old cassettes.
- Black & Decker Power Monitor. Smart meters may be the wave of the future smart grid, but in the meantime you can help dad monitor how much power appliances are using with the Black & Decker Power Monitor—help him learn where to start paring back energy usage and learn which appliances are the biggest consumers of it.
- Solar LED Workbench Light. Now here's a cool home gadget, especially if your dad spends long Saturday evenings out there in the shop tooling around with his own gadgets, motors, and handiwork. This solar workbench or shed light will make life easier and safer when dad's out working into the night.
- Solar Grill Light. On that same note, help dad get the grilling done after a long day at the workbench with a solar LED grill light. It clips onto the grill and hovers, sort of like a desk lamp, over the work area for easy grilling after dark.
- Tesla Roadster. Um…just in case you have a little over $100,000 lying around to spend on dad this year. Okay, maybe not for most of us, but Tesla Motors is just too cool; a great example of what electric cars can be, as soon as they can make them price competitive. For now…maybe…a picture of it?
- A Local Hike. Save money and enjoy time with dad simply by taking a hike on a local trail or at a local park. A big part of being green is simply to get to know your environment, enjoy it, relish it, love it, and protect it. Sometimes a simple walk in the woods can say more than any amount of money, green or not.

subset: commoncrawl


text:
A Little Slice of Paris in Baltimore
From Margaret Everton on February 25, 2010 in Baltimore
You may not realize how close you are to Paris. You are, in fact, only as a far away as a modest cottage in Homeland. Well, modest isnt really the right word, because from the moment you set foot in the black and white diamond-pattern tile foyer, youll understand that this home is anything but modest.
Dan Proctor and Jeffrey Hess purchased the home, their third purchase together, in pursuit of a design style that they had never tried before. Both designers by trade, they knew what they wanted, and were intent on achieving it. Here is their finished product.
A staircase sets the stage for a house like nothing else can. What better way than this French-inspired, sweeping, curving staircase, with white trim, white balusters, tongue-oiled banister, and oak-shined steps? The staircase is not alone it its Parisian grandeur. It is complemented by a Jacques-Emile Ruhlmann-esque boudoir chair in a tingling red-velvet hue. Chair plus staircase would be enough, but the walls of this ceramic-tiled foyer add the final flair of French glory. They are a stunning blue, Jackie O Blue, according to Proctor, but whatever color, it certainly makes an appropriate entré to the remainder of the house.
Farther inside, a sitting room provides a second gasp of amazement. Part of the astonishment is probably due to the sheer luxury of the place, a stark contrast to the clean, sweeping lines of modern design.
This vintage Paris powder room boasts majestic mahogany paneling, heavy beveled mirrors, and rich black marble plumbing fixtures.
The rich darkness makes another appearance in the dining room. It is decorated the way a billionaire might dress. Imagine a very dark Chanel suit with white cuffs, Proctor says to describe the walls. And the draperies? Like a divine hostess gown, perhaps like something Gloria Vanderbilt might wear at the Biltmore he muses. Whatever they were trying to achieve, they accomplished something noteworthy. The dining room has a story to tellwith themes from La Dame aux Camelias.
Throughout the house is a recurring colorred. I love a little bit of red in any room, Proctor confesses. It occurs in bits of cushions, painting accents, and table art in the great room. We see it again in the foyer chair. It even creeps out onto the back patio in the form of a flower vase. But there is nothing ostentatious about the subtle red thread that runs throughout the house. Theyre welcoming. They make people smile a little bit. They make me happy.
Happy is what this house is all about. And if you happen to drop in for a visit, dont be surprised if you walk out of the house with some high school French vocabulary floating around in your head.


text:
Love, marriage, and everything in-between: Full marriage guide
June 26 is a historical day for marriages. Check out our full list of tips on marriage, love, and family.
June 26 is a historical day for marriages. Check out our full list of tips on marriage, love, and family.
SCOTUS ends bans on gay marriage
Check out photos from Porter Hills Golf Classic: The Grass is Always Greener.
Get an order of HopCat fries free with any purchase at all HopCat locations on Wednesday, July 1.
THE BACHELORETTE's Kaitlyn Bristowe raises eyebrows on The Bachelorette!
More than 6,000 kids and families turned out for free food, fun, and prizes!
Take a look at the photos from Maranda's Park Party at Lamar Park.
Here's a list of Fourth of July events taking place in West Michigan.
Former 'Fast Forward' kid Adam Mellema now works in television in Los Angeles.
Check out Maranda's top picks in this week's Five Star Family Fun Update!
Founders Fest is a street-side celebration of everything from beer, incredible live music, amazing food, street performers and even arts and…
What you need to know about the first Maranda Park Party of the summer in Wyoming.
A special event at Celebration! Cinema Friday will benefit Mackenzie's Animal Sanctuary.
Get your outdoor space ready for summer! Here's 10 great projects to make your yard the perfect place to entertain.
Lori's Voice is helping to provide a bright future for those with mobility issues.
Make one of these recipes for a great side dish for your Fourth of July celebration!
Strawberry shortcake is a simple versatile dessert that's perfect for summertime parties! Here's a gluten-free recipe!
Gail Saukas explains precautions when taking kids on vacation after a divorce.
Tiffany Talsma shows stylish ways to incorporate red, white, and blue into your decor.
Go along with a West Michigan family as they explore camping in an RV.
Professional Fashion Stylist Trish Eigenbrode shares the fashion do's & don'ts of summertime work attire!
Get your outdoor spaces looking great. The Functional Organizer gave us '7 Steps to an Organized Shed'.
We're asking WOTV viewers to submit questions they have for any of our experts from home decor to yoga!
Every year, volunteers from Grand Rapids First Church clean and renovate Wyoming area schools.
Summer is a great time to explore new ways to stay active as a family.


text:
Sean Weatherspoon – Missouri
Scout: David Syvertsen
Height/Weight: 6'1/241
40 Time:
Pro Potential: David Harris – New York Jets
Position Traits
Coverage/Zone Defense Skills: Moves well in coverage and can reach the deep third quickly. Gets by in zone coverage based on reading ability rather than athletic ability. Instinctive mover that gravitates towards the intended target.
Instincts/Recognition: Easily fooled on playaction and counters, likes to move downhill a bit too much. Will lose track of keys. Has a nice feel for the game from the middle, consistently found in the right position on basic runs and passes.
Pass Rush: 12.5 sacks over the past three seasons, a respectable number for a player that did not blitz a lot. He does not offer much as an edge rusher but he is a powerful blitzer that stays low to the ground and accelerates quickly, making him a difficult defender to block for linemen and running backs.
Pursuit/Lateral Movement/Agility: High effort when playing laterally, can reach the sideline in a blink and meet the ball carrier at the lateral-to-vertical point. Does not have wiggle or ability to change direction in space however. At his worst when in the open field one on one against a shifty ball carrier.
Quickness/Explosion: Can explode from his starting point whether he is moving downhill or laterally. Closes on the ball carrier fast and can reach the line of scrimmage before a running back when he diagnoses well.
Strength/Ability to Shed Blocks: Very stout as an inside run defender. Shows no hesitation in taking a block head on. Delivers a jolt to the blocker, hits and sheds with power.
Tackling: Sure tackler in traffic that makes a lot of solo stops. Finished with well over 100 tackles each of the past three seasons. Will struggle to take down a shifty ball carrier out in space as his hips get tight and he does not explode forward.
Versatility: Capable of playing all three linebacker positions within a 4-3 defense or either inside position in a 3-4. Has the athletic ability to play well enough out in space, but also stout enough to play inside and pound with the big boys. His best position will likely be in the middle of a 4-3.
Final Word: Sean Weatherspoon is one of those prospects that will give a team exactly what they think he is going to upon drafting him. He is a reliable inside-out defender that will make plays because of his consistent ability to always end a play near the ball. He is a natural leader that never stops his mouth, keeping his teammates motivated and on track. He has physical limitations, especially out in space, but he is athletic enough to start in the league right away. If a team is looking for a MIKE linebacker that will end each year with 120+ tackles, then Weatherspoon will be high on their board. Probable first rounder that could sneak in to the top 20.


text:
Franchise Index: Previous Season / Next Season
Record: 4-12-0, Finished 4th in AFC West Division
NFL Season Summary
Scored 324 points (20.2/g), 17th of 30 in the NFL.
Allowed 419 points (26.2/g), 28th.
Differential of -95 points (-5.9/g), 26th.
Expected W-L: 5.6-10.4.
Takeaway/Giveaway Differential -2 (-0.1/g), 18th.
Simple Rating System: Total -5.1, Offense: -0.1, Defense: -5.0, SoS: 0.8, versus averages of 0.0.
Coached by
Joe Bugel
Offensive Coordinator: Ray Perkins
Training Camp: Redwood Middle School (Napa, California)
Our primary support comes from users like you. Sponsor this page for $10. Your message will replace this ad.


text:
How can I calculate $\lim\limits_{n \to \infty} \frac{\log_{a} n}{\log_{b} n}$. Where $a$ and $b$ are two integers.
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Sign up
Sign up
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Note that $$\frac{\log_a(n)}{\log_b(n)}=\log_a(b)$$ (see here).
$\lim\limits_{n \to \infty} \frac{\log_{a} n}{\log_{b} n}$, Now,if we change bases to e we get following expressions:
$\lim\limits_{n \to \infty}\frac{\ln n/\ln a}{\ln n/ \ln b} =\lim\limits_{n \to \infty} \frac{\ln b}{\ln a}=\frac{\ln b}{\ln a} $


text:
This page contains links to software, papers, notes, data sets, and other materials used in a graduate seminar in statistical phylogeography at the University of Connecticut held during Spring Semester 2011.
Meetings Tuesday at 4:00pm (except where noted below in magenta type) in the Bamford Room, TLS 171B
You'll find the papers referred to in the Mendeley bibliography
|Jan 18
|Snow day
|Jan 25
|Overview; Introduction to Structure & Structurama
Papers to read: Pritchard et al. (2000), Evanno et al. (2005), Hulsenbeck & Andolfatto (2007)
|Feb 1
|Snow day
|Feb 8
|Structure, Structurama, Clumpp, & distruct
Papers to read: Jakobsson & Rosenberg (2007)
|Feb 15 (2:30pm)
Paper to read: Wilson & Rannala (2003), Faubet et al. (2007)
|Feb 22
Papers to read: Guillot et al. (2005) and Guillot et al. (2008)
|Mar 1
Paper to read: Faubet & Gaggiotti (2008)
|March 8
|Spring break
|March 15 (2:30pm)
|Migrate-N (and LAMARC)
Papers to read: Beerli & Felsenstein (2000), Beerli (2004)
|March 22
Papers to read: Nielsen & Wakeley (2001), and Hey & Nielsen (2004)
|March 29
|∂a∂i -- diffusion approximation for demographic inference
Papers to read: Ellison et al. (2011), Gutenkunst et al. (2009)
|April 5
|Approximate Bayesian Computation: DIYABC, PopABC
Papers to read: Ascunce et al. (2011), Cornuet et al. (2008), Lopes et al. (2009)
|April 12
|ABC -- the debate
Papers to read (listed in the order of appearance): Nielsen & Beaumont (2009), Templeton (2010a), Beaumont et al. (2010)
|April 19 (2:30pm)
|BEAST -- Bayesian skyline plots
Papers to read: Drummond & Rambaut (2007), Kuhner (2009), Ho & Shapiro (2011)
|Batta Lona
|April 26
Paper to read: Lemmon & Lemmon (2008)
|May 3
|Estimating species trees from gene trees: STEM, SpedeSTEM, BEST, and StarBEAST
Papers to read: Kubatko et al. (2009), Carstens & Dewey (2010), Edwards et al. (2007), Liu (2008), Heled & Drummond (2010)
These programs are for allelic data, e.g., microsatellites or AFLPs.
Bibliography on Mendeley.
Note: The bibliography is publicly accessible, but only those whom I invite will be able to add to it. Click the "Ask to join group" button if you're interested.
Free desktop (Windoze, Mac OS X, and Linux) and iPad clients for Mendeley are available. They sync with bibliographies on the web. You may find it useful to get one of these clients, since the web bibliography doesn't sort references by author (or at least I haven't figured out how to get it to sort them by author yet).


text:
Crude Oil Met Its Target -- Now What?
Rod David
The rally is finally getting aggressive, just when crude's longstanding target is met.
Editor's note: Beginning next week, this column can be read daily at
The following are the latest daily summaries of my ongoing intraday coverage, providing context to interpret price action. Any prices listed are for a contract's current "front month." Their direction tends to correlate with any ETFs listed for each.
Today's Highlight:
Wednesday's volatility enabled crude oil to essentially meet its target, for the euro to potentially resume its decline, and for natural gas to discount Thursday's coming EIA report. None of which need extend Thursday. But gold's balancing act is getting old.
Dollar Basket
Jun Contract DX; (NYSEARCA:UUP), (NYSEARCA:UDN)
Last Thursday's 80.31 opening gap was filled Wednesday, and held. The reaction down has room to 80.00 before suggesting the rally won't extend.
Jun Contract EC; (NYSEARCA:FXE)
Wednesday's low retested last week's low, and held. There is no requirement to retest Wednesday's low, except that the decline has likely resumed so long as 1.1.3700 isn't recovered.
Jun Contract GC; (NYSEARCA:GLD)
Gapping down Wednesday just enough to retest 1289.00 without breaking lower wasn't "ineffectual pessimism," since prior sessions' lows weren't probed intraday. And the session remained in negative territory, so 1289.00 seems to have lost its elasticity. Downtrending shouldn't be far behind.
May Contract SI; (NYSEARCA:SLV)
Wednesday's hovering just above 19.25 support wasn't necessarily bullish, but its break isn't any likelier to extend down.
30-Year Treasury
Jun Contract US; (NYSEARCA:TLT)
Tuesday's recovery from fresh lows had been retraced entirely before Wednesday's open, and extended down to probe fresh lows attacking 136-08. That's one of the last two lines of defense against already beginning a bigger decline instead of first waiting to retest last week's high.
Crude Oil
May Contract CL; (NYSEARCA:USO)
The targeted retest of prior highs up to the 104.00 area was fulfilled Wednesday. The day's range expansion suggests that buyers have more energy to at least test 104.50 either Thursday or Friday, and closing above it would signal a much bigger leg underway.
Natural Gas
May Contract NG; (NYSEARCA:UNG), (NYSEARCA:UNL)
Wednesday was the last safe day for a pullback ahead of Thursday's EIA report, but a dip back to the last relative low wasn't rejected in time to signal the pullback was complete. Immediately testing the 4.42 area Wednesday would help to launch a bullish reaction.
Editor's note: Rod's analytical techniques are designed to efficiently identify targets and turning points for any liquid stock or market in any time frame. He applies his techniques live intraday, primarily to S&P futures, at
RodDavid .com
No positions in stocks mentioned.
The information on this website solely reflects the analysis of or opinion about the performance of securities and financial markets by the writers whose articles appear on the site. The views expressed by the writers are not necessarily the views of Minyanville Media, Inc. or members of its management. Nothing contained on the website is intended to constitute a recommendation or advice addressed to an individual investor or category of investors to purchase, sell or hold any security, or to take any action with respect to the prospective movement of the securities markets or to solicit the purchase or sale of any security. Any investment decisions must be made by the reader either individually or in consultation with his or her investment professional. Minyanville writers and staff may trade or hold positions in securities that are discussed in articles appearing on the website. Writers of articles are required to disclose whether they have a position in any stock or fund discussed in an article, but are not permitted to disclose the size or direction of the position. Nothing on this website is intended to solicit business of any kind for a writer's business or fund. Minyanville management and staff as well as contributing writers will not respond to emails or other communications requesting investment advice.
Copyright 2011 Minyanville Media, Inc. All Rights Reserved.


text:
College Hockey:Essery, St. Lawrence force Game 3 with Princeton
PRINCETON, N.J. — Kyle Essery's goal midway through the third period broke a 2-2 tie and helped St. Lawrence force a deciding third game of an ECAC Hockey first-round series with a 3-2 victory over Princeton on Saturday.
Greg Carey scored twice for the Saints (11-20-5), who got 28 saves from Matt Weninger.
Rob Kleebaum and Andrew Calof scored for Princeton (17-12-2).
The following is a self-policing forum for discussing views on this story. Comments that are derogatory, make personal attacks, are abusive, or contain profanity or racism will be removed at our discretion. USCHO.com is not responsible for comments posted by users. Please report any inappropriate or offensive comments by clicking the "Flag" link next to that comment in order to alert the moderator.
Please also keep "woofing," taunting, and otherwise unsportsmanlike behavior to a minimum. Your posts will more than likely be deleted, and worse yet, you reflect badly on yourself, your favorite team and your conference.


text: Apr 8, 2013 15:32 Cruisin' for Sept. 28, 2012 Cruisin' for Sept. 28, 2012 Advocate story Sept. 28, 2012; 10:01 a.m. Comments FRIDAY, SEPTEMBER 28 Car and Bike Show & Shine, Baker Buffalo Festival, at Baker City Hall, 3325 Groom Road in Baker, from 6 p.m. to 8 p.m. The event is open to all antique and unique car, truck and motorcycle owners, and will include a People's Choice Award and dash plaques for the first 50 to arrive. For more information call Ginger at (225) 778-0300. SATURDAY, SEPTEMBER 29 Cruise Breakfast, hosted by the Ramblin' Oldies of Denham Springs, every Saturday from 7-9 a.m. at Berry's Burgers & Seafood at Florida Blvd. and Flannery Road. All gearheads welcome. For more information call (225) 665-3609. Rockin' & Roasting Open Antique Car Show, sponsored by the Pointe Coupee Chamber of Commerce, in downtown New Roads on Morrison Parkway from 10 a.m. to 3 p.m. Entry fee is $20. For more information call (225) 287-4068 or (225) 718-1111. MONDAY, OCTOBER 1 Golden Oldies Motor Club meeting at Annette's Country Cooking & Seafood Cafe, 2804 W. Church St. Ext. in Hammond, at 7:30 p.m. For more information visit the Web site at www.goldenoldiesmotorclub.com . TUESDAY, OCTOBER 2 Cajun Classic Chevy Club meeting at Gerry Lane Cadillac dealership, 10945 Reiger Road, at 7 p.m. Dinner is at 6 p.m. Please bring chairs. For more information call Sal at (225) 937-2766. WEDNESDAY, OCTOBER 3 Baton Rouge Area Mustangers meeting at LaFonda Restaurant, 7838 Airline Hwy. Members begin arriving at 6:30 p.m. with the meeting at 7 p.m. All Mustang owners and enthusiasts are invited to attend. For more information call Jim at (225) 622-2305 or Kerry at (225) 261-1599. Send your car club information to: Cruisin', WHEELS, The Advocate, P.O. Box 588, Baton Rouge, LA 70821, or email to email@example.com or fax to (225) 388-0129. Get The Advocate in your inbox Subscribe


text:
Building is a vast subject, stemming from stick huts to modern skyscrapers. It has been a necessity for humans to develop shelter and dwelling areas. We eventually come to love our dwellings and begin to take pride in them. Portraying through them what makes us, the individual, unique. Home is a place of sanctuary from the everyday hustle of life, a place where we can relax, be with family, find solitude, comfort, and enjoy the company of friends. The ideal dwelling is one that requires no effort to maintain and keep sound, but unfortunately, humans have been unable to produce such a thing. The forces of nature are inevitable. Murphy's Law will eventually be set into action, and all dwellings will begin to require attention.
As builders with fifteen years of experience, we've seen a lot of dwellings and put our hands into a variety of tasks. Getting involved in many different jobs along the way, we've developed a skill set that we've have grown to be proud of. Through the use and manipulation of a variety of materials, we've gained an understanding of application methods, and the labor involved in completing the applications. No two jobs are the same. Environments change between each home and each job requires its own special attention. We have grown to admire that aspect of residential dwellings. Every home has an identity, and it is our pleasure to respect, and help maintain that identity.


text:
The 8 Most Brutal Deaths of Saints
by Ivana Wynn 109k views 8 items tags
St. Patrick's Day is an excuse for Americans to party (read: get drunk), wear green clothes and eat all kinds of green food that any other time of year would look rotten. The Patron Saint of Ireland for which the holiday is named after was actually the son of two Romans living in Britain. He dedicated his life to converting the Irish from polytheism to Christianity, using the shamrock to explain the Trinity. Unlike most saints, St. Patrick was actually celebrated for his piety during his lifetime. He died peacefully of old age and received a proper burial at the time. Not everyone was that lucky.
What Saints died horrible deaths? Here are all the saints who died horrible, horrible deaths.


text:
Feb 4, 2014 8:20 AM
We've rubbed oatmeal on our faces. We've also rubbed cranberry seeds, papaya enzymes, brown sugar, and coffee grounds on our faces in hopes of effectively removing dead skin cells to make way for beautiful complexions. Bobbi Brown Buffing Grains for Face ($42) has its own recipe for exfoliation success: azuki bean powder. Mix it with water or any other cleanser to create your own paste and leave your face bright and refreshed.
If you've got a product or service that you'd like to promote on Outblush, click here to find out about our advertising opportunities.
Outblush is a blog for girls who love to shop. Our staff digs up the best clothes, home stuff, beauty items, and more. New items are posted every day — bookmark us and check out:


text:
Looking for a weekend getaway? Huntsvillians may want to check out Greenville, SC. It's just over 300 miles from the Rocket City — a mere 5 hour drive. And you may want to book your stay at the newly renovated Crowne Plaza.
According to a press release issued Monday by Rialto Capital Advisors, the hotel has undergone a more than $5 million renovation. The newly transformed facility offers an amazing experience for recreational and business guests alike.
The hotel was reportedly designed with a contemporary and sophisticated look that includes a total makeover of all guest rooms, the lobby and lounge, fitness center and bar. The Crowne Plaza also now has a new bar featuring an all-day dining menu with a delicious selection provided by Ruth's Chris Steakhouse. The upscale steakhouse will provide all food and beverage services throughout the hotel.
In addition, the hotel has 6,500 square feet of first class meeting and banquet space, including a 4,200 square foot Grand Ball Room that accommodates up to 500 people. The hotel also features meeting spaces, including two new executive board rooms, demonstrating the company's commitment to business travelers, as well as business leaders in and near the Greenville area.
"We value community investment and are excited to demonstrate our commitment through projects such as this one. This investment will now be able to provide an economic benefit to Greenville and we appreciate their support in making this project possible," said Bradley Kentor, Vice President, Rialto Capital Advisors.
To reserve a guest or meeting room, or to learn more about the Greenville Crowne Plaza, visit the website or call (864) 248-1725.


text:
Over the past few days the Internet has been full of the conflict of interest coverage, be it from jaded lovers or angry blog authors who thought they mattered.. and I suppose it's a sad realization when you realize you don't.
First up, Scoble seems to be surprised that his friends will not go on camera bashing Apple for their crappy products. It's got nothing to do with Apple, it all has to do with self-interest: CEO's of Web 2.0 vaporware have to be nice to everyone on the record because they want to do business or be acquired by those companies. Scoble, who gets a lot of press attention, is a blogger – not press, so he didn't get the iPhone up front or a free PowerMac or whatever he wanted so he is calling Apple for what everyone already knows. Second, a whole slew of people seem pissed at Steven Levy, who gave a glowing review of what is one fugly, closed, DRM-ridden piece of trash product from Amazon that costs more than the competition. Who is complaining? Thats right, the guys that didn't get a free one.
To put it in perspective, this is like me calling out Microsoft for Zune 2 sucking because I didn't get one. And that Lamborgini Murcielago, what a joke!
So here is a lesson for the aspiring bloggers: You either have to be an undying, unquestionable fanboy, or you better hide from any camera / voice recorder / cell phone lest you be caught saying the wrong thing to the wrong people..
How do these folks sleep at night with all that ego and fear on their minds?
Both comments and pings are currently closed.
Comments are closed.
Easy for me. I limit my blog to only 8 subscribers (yes that includes my wife and my mom).
Interesting video
Whats on Vlad's Mind?
Sponsors:This blog is made possible by
Own Web Now Corp and ExchangeDefender.
If you like this blog and are in the need of products we offer I hope you give us some
Get The Newsletter
Vladfire Vlog
Previous Episodes >
SBS Show Podcast


text:
Barry Kent Kaylor, age 48 of McCaysville, Ga. passed away Thursday, November 29, 2007 . Barry was born Tuesday, October 6, 1959 in Polk County Tenn. to Larry Kaylor and Shirley Ann Thomas Kaylor.
Survivors include: son, Barry Kaylor, Jr. of New Bedford, Mass.. father, Larry Kaylor of McCaysville, mother, Shirley Ann Thomas Landrum of Blue Ridge, brother, Brandon Clay Kaylor of McCaysville and sister, Selina Lenora Black of Senoia, Ga.,
The family will receive friends at the funeral home from 2-4, Sunday, December 2.
Arrangements entrusted to the Finch-Cochran Funeral Home of McCaysville.


text:
Shirer Family Genealogy Project
Person Page 1670
Main Page - Master Index - Surname Index - Master Place Index - Historical Sources - Photo Albums - Grave Restoration - Scheurer DNA Project - John Shirer of Somerset Co., PA
Previous Page - Next Page
|Hans Feuerstein1 b. circa 1686, d. circa 1740
|Mother (Feuerstein) Unknown b. circa 1686
|Pop-up Pedigree
|Family 1
|Anna Catharina Nonnenmacher b. 2 August 1711, d. circa 1760
|13 April 1733
|Berg Evangelical Lutheran Church, Berg und Thal, Bas-Rhin, Alsace, France, Principal=Anna Catharina Nonnenmacher1
|Anna Catherina Feuerstein b. 23 Aug 1733, d. 1769
|Johan Nicholas Feuerstein b. 17 Apr 1735, d. 1807
|Johan Joseph Feuerstein b. 7 May 1737, d. c 14 Jan 1793
|Eva Catharina Feuerstein b. 3 Jun 1739, d. a 1763
|Rosina Feuerstein b. 13 Mar 1741 or 13 Mar 1742, d. a 1810
|Johann Mathias Feuerstein b. 5 Apr 1744, d. 1829
|Maria Dorothea Feuerstein b. 17 Feb 1746 or 17 Feb 1747
|Maria Magdalena Feuerstein b. 22 Mar 1749 or 22 Mar 1750
|Michael Feuerstein b. 10 Jun 1750
|Theobald Feuerstein b. 3 Aug 1752, d. b 1760
|Family 2
|Catherine Kuntz Hacken b. circa 1712
|after 1760
|York Co., PA, Principal=Catherine Kuntz Hacken1
|Between 1733 and 1752, the births and baptisms of nine of Nickel (Nicholas) and Catharina's ten children were recorded in the records of Berg Evangelical Church. According to parish records, Nickel was a carpenter, farmer and citizen of Thal.
It is said that when their oldest child became subject to conscription into the French army, Hans Nicholas and Catharina abandoned their 10 acre farm
in Alsace and went to Holland. In Rotterdam, the couple with nine children boarded the ship "Peggy," Captain James Abercombie, Master. He arrived
with his family in Philadephia, PA on Sept 24 1753. The family qualified for entry on the following day.
About 1755 until 1760 he indentured himself and sons as farm laborers in Lancaster Co., PA in order to pay for his passage to America. Some
records are available about this family in Trinity Lutheran Chuch Record in Lancaster, PA.
In 1760, about the same time his wife died, he acquired a 300 acre tract of land that adjoined the Pigeon Hills in Paradise Township, York Co., PA.
The land purchase was made by assignment from Fredrick Eichelberger in papers dated Nov 15 1760. The property was bound by 7 other owners: John Heidler, John Emich, Lawrence McMullen, Adam Blyer, Nicholas Bittenger, Jacob Balsley, and Gotlieb Priechner.
After his wife died he remarried to Catherine Hacken, widow respectively of John Kuntz (1723-1753) of Heidelberg Township, York Co., PA and of
Nicholas Hacken (died 1758) of York Co., PA
Between 1760 and 1764 Nicholas and Catherine, his second wife, were associated with the Christ Evangelical Lutheran Church in York Town. During this time they witnessed the baptism of a Stautzenberger grandchild on April 11, 1763.
On April 3 1763 he was naturalized at the "Supream Court" at Philadelphia. He listed his residence as Paradise Township, York Co., PA.
He was a carpenter and a farmer.
He died shortly before Jan. 11, 1768, the date on which administrative powers for his estate were granted to his second wife, Catherine, and his
eldest son Nicholas Jr. He had lived in America only 15 years. On June 1, 1768 Nicholas Jr. filed a petition reporting that his father had left a widow, nine surviving children, and a 300 acre tract of land in Paradise Township. Nicholas Jr asked for partition of the real estate among the heirs and appointment of a guardian for his brother Michael, age 11 years. John Stiffler (Michael's uncle) was appointed guardian. On May 30, 1770 Nicholas' Sr second wife, Catherine (now remarried Catherine Fritz) and Nicholas, Jr. produced their administration account. Their administration bond and the inventory were filed on June 1, 1770. Nicholas Jr. petitioned the court that he be permitted to take the 300 acre tract, and he was ordered to distribute the estate among the heirs. On Nov 27, 1770 the Court ordered that Nicholas Jr. be summoned to show why he had not paid Conrad Stoutsberger his distributive share. Conrad was by then a widower with minor children of the late Catherine Firestone Stauzberger.
Three of his sons enlisted and served in the Revolutionary War. He and his descendants claimed, as did many Alsacians, German ancestry.
Other researchers include two more children, Susannah Catharina Feuerstein b. 2 Jul 1742 and Johann P. Feuerstein b. 6 Jun 1747. They also mention Caherina Dorothea instead of Maria Dorothea. These two might fit into the family if it can be proved that only nine of the children survived their father's death as mentioned in the estate records.
The following sources by GeneJunky:
1. Title: Firestone Family of Frederick Co. Maryland: Firestone Family of Frederick County, Maryland
Abbrev: Russell (1993)
Author: George Ely Russell
ABBR Western Maryland Genealogy, Vol 9, Nos. 1 & 2, Jan
Page: Therein, "Nicholas Firestone was born Johann/Hanss Nickel Feuerstein/Feyerstein..."
2. Title: Firestone Family of Frederick Co. Maryland, #01 Nicholas Firestone: Firestone Family of Frederick County, Maryland, Subject: #01 Nicholas Firestone, Volume: 9, No. 1, Page: 3-7
Abbrev: Russell (1993): #01 Nicholas Firestone
Author: George Ely Russell
Page: therein, "Nicholas1 Firestone was born Johann/Hanss Nickel Feuerstein/Feyerstein ca. 1713, probably in the village of Thal, a member of the well-established Feuerstein family in Berg Parish..."
3. Title: Firestone Family History (1904): Nicholas: Firestone Family History, Subject: Nicholas Firestone (the elder), Edition: typescript, Version: FHL film 1035628, item 2, File Reference: R. Ulmer, transcription of. dtd 2000
Abbrev: Firestone (1904): Nicholas
Author: Firestone, Jason
Publication: Chicago, 1904
Page: about page 2, "Berg and Thal are two small farming villages situated one mile apart, forty miles north-west of Strasbourg in the Province of Elsas, Germany, and six miles south of the railroad station of ----Union...;" according to Google Earth (10 July 2007) the town of Sarre-Union is located north east of Thal, about 3.3 miles as a crow flys, and 7.4 miles from Berg
4. Title: Firestone Family of Frederick Co. Maryland, #01 Nicholas Firestone: Firestone Family of Frederick County, Maryland, Subject: #01 Nicholas Firestone, Volume: 9, No. 1, Page: 3-7
Abbrev: Russell (1993): #01 Nicholas Firestone
Author: George Ely Russell
5. Title: Firestone Family of Frederick Co. Maryland, #01 Nicholas Firestone: Firestone Family of Frederick County, Maryland, Subject: #01 Nicholas Firestone, Volume: 9, No. 1, Page: 3-7
Abbrev: Russell (1993): #01 Nicholas Firestone
Author: George Ely Russell
Page: therein, "In June or July 1733 he married Anna Catharina Nunnenmacher of Berg, then already about seven months pregnant with their first child," cites "Berg Parish Church Book," baptismal entry dated 27 Aug. 1733 for child Anna Catharina born 23 Aug. 1733
|(From George Ely Russell's 1957 work "Firestone Genealogy")
Nicholas Firestone (Proginator of the American Firestones)
Born 1712: Berg und Thal, Alsace. Farmer having 10 acres. (Another ref. says born 1705). Member of German Lutheran Church. In 1752 he abandoned his propety and secretly left Alsace in order that his oldest son would avoid military service for King Louis XV. The family went to Holland, and sailed from Rotterdam on the ship "Peggy," Capt. James Abercrombie, master. He was an indentured servant, contracting to give his services of himself and his family in exchange for their passage. They arrived at Philadelphia on Sep. 24, 1753, he aged 40, son Nichlas, age 21, sons John, Mathias, and Michael. He qualified on Sep. 25, 1753. They traveled to Lancaster, Lancaster co., Pa., where they lived and workd on a farm as early as 1754. After the terms of their indenture were fulfilled, they moved to Conococheague Creek, in what was then Cumberland co., Pa., living in Peters twp. (now Franklin County), where he remained until his death in 1763. The name of his wife is not known; she may have died in Alsace. Children: Nicholas, b. c1732; George Philip, b. c1736' John, b. c1734; Mathias, b. c1740; and Michael (no further record).
Compendium of American Genealogy, Virkus, volume 6., page 450
Harvey Firestone, A. Lief, 1951 (biography)
Penssylvania-German Pioneers, Strassburger & Hinks, 1934, v.1, page 46
Lancaster Co. (Pa) Historical Society Papers, page 2761
|25 March 1712
|Berg Evangelical Lutheran Church, Berg und Thal, Bas-Rhin, Alsace, France1
|13 April 1733
|Berg Evangelical Lutheran Church, Berg und Thal, Bas-Rhin, Alsace, France, Principal=Anna Catharina Nonnenmacher1
|24 September 1753
|Ship Peggy, Philadelphia, Philadelphia Co., PA, THE PEGGY
[List 204 A] A List of mens Names and ages, Imported in the Ship Peggy, Capt. James Abercrombie, from Rotterdam, 24 September, 1753.
Nicholus Fyrestein, 40
Nicholus Do., Jun., 21
List of Foreigners imported in the ship Peggy, Capt. James
Abercrombie, Qualified 24th Sept. 1753.
119 Stedman.
[List 204 B] Foreigners imported in the Ship Peggy, Capt. James Abercrombie, From Rotterdam. Qualified 25th Sept. 1753.
Nickell Füerstein
Nickel Feuer[stein]
[Endorsed:] List of Foreigners imported in the Ship Peggy, Capt.
James Abercrombie
Qualified 24th Sept. 1753.
119 [men]
+21 [women & children]
140 [Total]2
|after 1760
|York Co., PA, Principal=Catherine Kuntz Hacken1
|before 11 January 1768
|Paradise Twp, York Co., PA1
Previous Page - Next Page
Main Page - Master Index - Surname Index - Master Place Index - Historical Sources - Photo Albums - Grave Restoration - Scheurer DNA Project - John Shirer of Somerset Co., PA
Compiled by: Denny Shirer, Canton, Ohio
This page was created by John Cardinal's Second Site v1.8.7.
Site updated on 17 October 2014; 40,089 people
Census Records | Vital Records | Family Trees & Communities | Immigration Records | Military Records Directories & Member Lists | Family & Local Histories | Newspapers & Periodicals | Court, Land & Probate | Finding Aids


text:
SAFETY ALERT: If you are in danger, please use a safer computer, or call 911, your local hotline, or the U.S. National Domestic Violence Hotline at 1-800-799-7233 and TTY 1-800-787-3224. See more technology safety tips here. There is always a computer trail, but you can leave this site quickly.
|< Previous
|Next >
|Resource Name
|New York State Department of Labor Division of Safety and Health
|Protecting workers, assisting the unemployed and connecting job seekers to jobs.
|Bldg. 12, State Campus, Rm. 159, Albany, NY 12240
Alianza is not responsible for the information provided in any of the websites, books, videos or other resources published by any of the organizations or other entities listed.
Copyright © 2009 National Latino Alliance for the Elimination of Domestic Violence (Alianza), All Rights Reserved.
Web Implementation by Karmic Visions


text:
INFJs, especially ladies...this is embarassing to say, because i don't want to be perceived to be a "crazy lady" but i have a good clairvoyant friend, tony, and he told me very clearly...STOP dating guys, or looking for men, assuming they will be "THE ONE" - and stop looking for "THE ONE" because it reeks of desperation, and guys hate the "ball and chain" feeling, and they can sense it when they are with a girl and usually try to run!
actually i was told that the person i will meet will not seem like "THE ONE" he will be a friend first, it will be a sexual relationship first, before me even knowing that he is "THE ONE" what a sick cosmic joke that is, isnt it! it might happen to you all too!...so this stuff about finding "THE ONE"...maybe it would be a good idea to put that on the back-burner for a little while, and just learn to be "chill" and to have fun...and enjoy the moment, and anothers company?
not saying you all have to do this, but as an INFJ girl, for me this lesson is a thorn in my side, and i have to learn it. you see finding "THE ONE" can be lots of trouble, sometimes you'll land a guy that will pretend to be "THE ONE" to get you into bed...most of the time, guys you meet will literally run, if you start acting like the type of girl that is looking for their soul-mate within a few moments of conversation (unless you are really pretty, men will always find an excuse to like a girl if she's pretty, even if she is a doorknob or an absolute psycho type)...and you can miss out on a lot of guys by seeming on this mission to find "THE ONE".
does this make any sense? and please guys help me to understand "chilling" i hate it, and well you guys [INFJs] don't seem to be the "chilling" type, so i did post a thread regarding the "chilling" issue, and asked some help from ENFJs too...guys generally like to chill, younger ones i guess? anyhow...hope you all get my point about "THE ONE"
there is some major double standard too- don't think i've missed it! a man looking for "THE ONE" seems to be principled, and romantic, whereas girls actively looking for "THE ONE" are treated like they are crazy, or clingy types, or looking to trap a man! believe me, i am not clingy at all...and men learn that really fast, once they do anything stupid i walk....but that is another issue! but yes, what is wrong with a girl looking for love? i guess it has to do with the interaction between men and women, and who decides whom is "THE ONE". i think that men mostly make that decision, this is why women perceive a competition, and often fight amongst themselves for a good guy...but i am sure, there will be argument about this topic...i just wanted to illustrate some of the things i've felt when i was looking for love.