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 2013 (2013), Article ID 867385, 11 pages
An Overlapping Clustering Approach for Routing in Wireless Sensor Networks
School of Software, Dalian University of Technology, China
Received 10 January 2013; Accepted 13 February 2013
Academic Editor: Lei Shu
Copyright © 2013 Zhenquan Qin 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.
The design and analysis of routing algorithm is an important issue in wireless sensor networks (WSNs). Most traditional geographical routing algorithms cannot achieve good performance in duty-cycled networks. In this paper, we propose a k-connected overlapping clustering approach with energy awareness, namely, k-OCHE, for routing in WSNs. The basic idea of this approach is to select a cluster head by energy availability (EA) status. The k-OCHE scheme adopts a sleep scheduling strategy of CKN, where neighbors will remain awake to keep it k connected, so that it can balance energy distributions well. Compared with traditional routing algorithms, the proposed k-OCHE approach obtains a balanced load distribution, consequently a longer network lifetime, and a quicker routing recovery time.
1. Introduction
Studying the behavior of dynamic sensor networks becomes a hot topic. Movements of nodes make the wireless sensor networks (WSNs) [1] a dynamic one. These nodes can communicate with each other in wireless communication radius without any static network interactions. An important issue in dynamic geographical networks is the design and analysis of routing algorithms. Due to the limited communication range of the wireless transceivers, mobile nodes cannot communicate with other nodes unless they are within each other's geographical regions [2, 3]. Thus, it may be necessary for a mobile node to require aids of other nodes after checking their geographical routing information in forwarding data packets to its destination.
It will be much more uncertain when we consider the routing issue in a duty-cycled network, since the duty-cycle scheduling aims to prolong the network lifetime [4, 5] by making some nodes sleep and wake up when packets transmission occurs. Studies on adopting conventional routing protocols in wireless sensor network in a dynamic convention have been generally discussed [3, 6]. Our interest in the routing problem in a duty-cycled network falls into the following two aspects: existing routing algorithm could place a heavy load on a newly joined node due to routing table updates and the wireless network connectivity.
Conventional routing algorithms concentrate on finding the shortest path, without much concern about critical issues such as energy efficiency and network lifetime. The problem we discuss here is how to route efficiently in a duty-cycled sensor network. The basic idea behind the algorithms is to divide the network into a number of overlapping clusters. A node's sleep scheduling leads to a change in the network topology, then the membership of cluster changes as well. We propose a cluster formation scheme called -OCHE, which selects cluster heads considering energy availability firstly, and then the cluster heads recruit cluster members. This cluster creation scheme can well be adopted in different routing circumstances.
The rest of this paper is organized as follows. Section 2, we survey related work. Section 3 defines network model, sleeping scheduling model, energy consumption model, and some notations. In Sections 4 and 5, we further detail the -OCHE scheme and routing algorithm. We present specifics of simulation experiments which validate the correctness of the proposed algorithm in Section 6. Finally, Section 7 concludes the paper.
2. Related Work
Similar to other networks, overload balance, prolonging lifetime, and scalability are the major design concerns of wireless sensor networks. In conventional multihop communications in WSNs, sensors close to the sink are often overloaded, resulting in increased latency and reduced network life span. Such overload might cause latency in communication and reduce life span of network. In addition, the original architecture is not scalable for larger set of sensors covering a wider area of interest. To allow the network to cope with additional load and to be able to afford a large area of interest, clustering routing has been pursued. The main aim of clustering routing is to efficiently maintain the energy consumption of sensor nodes by involving them in multihop communication with a particular cluster and by performing data aggregation and fusion to reduce the number of transmitted messages to sink.
2.1. Routing Protocols
Many routing protocols [7–11] have been studied in the field of wireless sensor networks. Karp and Kung present greedy perimeter stateless routing (GPSR) [7], a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in perrouter state than shortest-path and ad-hoc routing protocols as the number of network destinations increases. Under mobility's frequent topology changes, GPSR can use local topology information to find correct new routes quickly.
Shu et al. propose an efficient two-phase geographic greedy forwarding (TPGF) [8] routing algorithm for WMSNs. TPGF takes into account both the requirements of real-time multimedia transmission and the realistic characteristics of WMSNs. It finds one shortest (near shortest) path per execution and can be executed repeatedly to find more on-demand shortest (near shortest) node-disjoint routing paths. TPGF supports three features: hole bypassing, the shortest path transmission, and multipath transmission, at the same time. TPGF is a pure geographic greedy forwarding routing algorithm, which does not include the face routing, for example, right/left hand rules and does not use planarization algorithms, for example, GG or RNG. This point allows more links to be available for TPGF to explore more routing paths and enables TPGF to be different from many existing geographic routing algorithms.
However, these traditional routing algorithm will overload relay nodes with the increase in sensor density. Besides, convergence characteristics of these algorithm are not good enough to meet the need of dynamic networks, such as duty-cycled networks.
2.2. Cluster-Based Approach for Routing
In the last few years, many algorithms have been proposed for clustering routing in wireless sensor networks [12–24].
In [14], Heinzelman et al. have proposed a distributed algorithm for wireless sensor networks (LEACH) in which sensors randomly select themselves as cluster heads with some probability and broadcast their decisions. The remaining sensors join the cluster of the cluster head that requires minimum communication energy. LEACH is one of the most popular clustering routing algorithms for sensor networks and is completely distributed. However, LEACH uses single-hop routing where each node can transmit directly to the cluster head and the sink. Besides, there are a number of clustering algorithms constructing clusters not more than 1-hop away from a cluster head, such as DCA [15] and DMAC [17]. Similar to these, Baker and Ephremides [13] propose overlapping cluster with . In large networks single-hop clustering, as shown in Figure 2, may generate a large number of cluster heads and eventually lead to the same problems as if there is no clustering.
In addition, the TEEN [16] and APTEEN [18] are hierarchical protocols designed to be responsive to sudden changes in the sensed attributes such as temperature. Younis et al. [19] have proposed a different hierarchical routing algorithm based on a threetier architecture.
To the best of our knowledge, there is only one clustering algorithm that specifically controls overlapping in the formation of clusters, that is, KOCA [20]. Goal of KOCA is to ensure that the entire network is covered with connected overlapping clusters considering a specific average overlapping degree. KOCA is still a static clustering in which the cluster formation is not changed all the time. This condition causes an unbalance load among all nodes. A node that roles as cluster head (CH) will get more load than a non-CH and so that it will die faster. The death of CHs will break the whole network because the link between nodes and center will be broken. Therefore, KOCA cannot be applied in actual situation commendably. Rotating the CH role distributes this higher burden among the nodes, thereby preventing the CH from dying prematurely. To overcome this problem, we propose -OCHE which allows a node to go to sleep while keeping its neighbors connected, thus the role of CH can be rotated and the load of CH can be balanced. The most important is that -OCHE is the first approach to combine the interior cluster routing with exterior cluster routing which achieves balanced load distribution, longer network lifetime, and quicker routing.
3. Assumptions and Notations
3.1. Network Model
We consider a multihop wireless sensor network where all nodes are alike. We assume that each node has a unique id. The locations of sensor nodes can be obtained by GPS. All sensors transmit at the same power level and hence have the same transmission range . Each sensor node is aware of its geographic location and its 1-hop neighbor nodes' geographic locations. We assume that sensor nodes can know the location of base station by receiving the packet, which comes from there. This assumption is the same as that used in [7, 25, 26].
All communications are over a single shared wireless channel. A wireless link can be established between a pair of nodes only if they are within wireless range of each other. The -OCHE algorithm only considers bidirectional links. It is assumed that MAC layer will mask unidirectional links and pass bidirectional links to -OCHE. We refer to any two nodes that have a wireless link as 1-hop or immediate neighbors. Nodes can identify neighbors using beacons.
3.2. Sleeping Scheduling Model
To ensure the network connectivity and prolong its lifetime, we assume that all nodes operate under CKN-based [27] sleep/awake duty cycling. Time is divided into epochs, and each epoch is . On each epoch, nodes run CKN, shown in Algorithm 2, to decide whether to be awake. A node can go to sleep assuming that at least of its neighbors remain awake to keep it connected. And nodes reach a consensus to take turns to sleep, while the whole network is globally connected. Therefore, by changing the value of , the network can manipulate the sleep rate , so that it can proceed with further work with clustering.
3.3. Energy Consumption Model
We use the same radio model defined in [28]. The amount of energy required to transmit an -bit message over a distance is given by (1)
is the energy dissipating to power the transmitter or receiver circuitry. The parameters and are the amount of energy dissipating per bit in the radio frequency amplifier according to the distance , which is given by (2)
The energy consumed by receiving this packet is shown by (3),
3.4. Notations
Network size (): the number of nodes in the network. Sensor nodes are deployed randomly in a square area with side length of .
Energy consumption rate (): for each node, denotes residual energy on the battery, and then EC can be defined as (4), where is the initial energy of each node.
Energy availability ():
Minimum number of awake neighbors in an epoch for each node (): through varying the value of , we can keep the network connected and optimize the geographic routing performance.
Average node degree (): the average degree of a node is the number of its neighbor nodes. The relation between the average node degree () and the radio range () of a node is given by
4. The -OCHE Algorithm
4.1. The Proposed Algorithm
In -OCHE, shown in Algorithm 1, a node can go to sleep assuming that at least of its neighbors remain awake to keep it connected. Given a , we can obtain a new network topology within the range of awake nodes in each cycle. Each node can have three possible states: cluster heads (CHs), boundary nodes (BNs), and normal nodes. A cluster head possesses information about not only its own cluster (such as member nodes' IDs) but also adjacent clusters (such as boundary node and adjacent clusters' members). A boundary node belongs to multiple overlapping clusters connecting different clusters to transfer and forward data, and it improves the network robustness effectively. Normal nodes are internal nodes that belong only to one cluster.
In this section, we present the description of the cluster head's selection process as well as the clusters' generation; we then give an example to illustrate a cluster generated by -OCHE.
4.2. Cluster Head Selection Procedure
In -OCHE approach, the important operation is to select a set of cluster heads (CHs) among the nodes in the network and recruit the normal nodes as these CHs' members. The -OCHE approach adopts to select CHs, and is defined as the battery residual energy after certain consumption during a certain period. At the beginning of each cycle, each node compares its to the threshold (the threshold is an empirical value, which is used to control the number of CHs in the network. The optimal threshold is obtained when the CH nodes take [20] of all the nodes in the network. And we use this value for experiments presented in this paper.), if its is bigger than the , then it becomes a CH and advertises itself as a CH to the sensors within its transmission range to recruit cluster members. This advertisement () is forwarded to all sensors that are no more than hops away from the CH through controlled flooding. The recruitment message's () header includes , , , and , where is cluster head , is the sender node , and is the number of hops leading to the CH node. The field is used to limit the flooding of the message to hops. By receiving the recruit message from CHs, a sensor node joins those clusters no matter whether it has belonged to a cluster.
However, if a CH receives a recruit from another CH , and has the higher , then gives up being a CH and joins 's cluster. Since the forwarding is limited to hops, if a sensor does not receive a CH advertisement within a reasonable time duration, it can infer that it is not within n hops of any cluster head and hence become a CH. In -OCHE, the maximum time that a node should wait for CH advertisement message is set to half cycle of CKN. Note that this is a distributed algorithm and does not demand clock synchronization between the sensors.
4.3. Cluster Generation
Each node maintains a table, , that stores information about the clusters it belongs to. Upon receiving a new message, a node will add an entry in its and check the field in the message. Then the node updates and parent fields in the corresponding entry in the CH table if the recent message came over a shorter path. Often a message traveling the shortest path in terms of the number of hops would arrive first. However, delay may be suffered at the MAC or link layers. For every entry in its , a node sends a join advertisement () message to CH in order to become a member of the corresponding cluster. To limit the flooding, the message is unicasted using the field . The message has the form [, , ] where is the ID of the node that will join the cluster and is the ID of the CH node responsible for this cluster. Upon receiving the message, the parent node will add to its children field. When a CH node receives join advertisement () sent by an ordinary node, it will compare the number of member nodes to threshold to admit new member and update the count of cluster nodes if the size is smaller than threshold or else abandon the request. Supposing that the rejected node has cluster head already, the clustering process ceases. Otherwise, it looks for another appropriate cluster to join in. There is only one single entry in a ordinary node's CH table, because it belongs to one cluster head, while the overlapping cluster node which connects different clusters has multiple entries. Each cluster head maintains a list of all cluster members, a list of adjacent clusters, and a list of boundary nodes.
The -OCHE algorithm avoids the fixed cluster head scheme, with periodic replacement done by sleep scheduling mechanism to balance the node energy consumption. All cluster members send the current state information to cluster head, and -OCHE chooses the node with the highest to be the new head. When the new cluster head gets cluster head's notification, it broadcasts recruitment message and the new cluster forming phase triggers. The process can reduce the energy consumption of broadcast of temporary head.
Note that -OCHE stops in steps. As is a constant value, the clustering process terminates in a constant number of iterations regardless of the network size.
4.4. An Illustrative Example
We demonstrate our algorithm with Figure 1, which is selected from the simulation results optionally, and we add some necessary information to make it more comprehensible.
In Figure 1, there are three clusters with three corresponding cluster heads , , and , and nodes with black frame in the overlapping area are boundary nodes. Note that two cluster heads are not immediate neighbors. Since boundary nodes belong to multiple clusters, their tables contain CHs of those clusters. , , and can communicate with each other through their common boundary nodes in their neighbor cluster head tables.
5. Routing Algorithm
We first discuss the necessary data structures to be maintained at each node for the routing algorithm, as shown in Table 7. We then explain the routing construction and recovery procedures in the network. The routing construction can be divided into two phases: interior cluster routing and exterior cluster routing.
During the interior and exterior routing phase, routes are constructed between all pairs of nodes. The routing recovery phase takes care of maintaining routing table considering sleep schedule and recovering from an individual node failure.
5.1. Interior Cluster Routing
After cluster head selection and cluster generation procedure, each node completes the construction of two tables: and . stores the information of cluster it belongs to and stores the information of its neighbor clusters. In interior cluster routing construction phase, each node constructs interior cluster routing table according to and . At each node ,(i)when is 's child or grandchild, updates by using , (ii)when is in the same cluster with , updates by using , (iii)when is in neighbor cluster, updates by using , (iv)when is one of the others, updates by using .
Let us illustrate it with an example. Tables 1, 2, 3, 4, 5, and 6 are and of , , and . For cluster , we take the CH node , a normal node , and a boundary node into consideration. As the structure of cluster is a spanning tree, the root is , level-1 children are , , , , and , and level-2 children are , , , and .
In the routing table of , when destinations are to , , , and , will check to choose the next hop, as they are all its level-1 or level-2 children. When destinations are and , will check to choose the next hop, as they are in neighbor clusters. For the other destinations, uses exterior cluster routing which will be discussed in the following section.
In the routing table of , when destinations are and , will check to choose the next hop, as they are its children. When destinations are and , will check to choose the next hop, as they are in neighbor clusters. Considering that has two nodes, and , will choose the node of higher to be the next hop. For the other destinations, will check to choose the next hop.
In the routing table of , when destinations are in neighbor cluster, will check to choose the next hop, as they are in neighbor clusters. For the other destinations, will check to choose the next hop. Considering that has two entries, will choose the node of higher to be the next hop. The results of routing table of , , and are shown in Tables 8, 9, and 10.
5.2. Exterior Cluster Routing Construction
We consider each cluster as a node in exterior cluster routing phase. Each CH node takes the responsibility of each cluster. An original routing algorithm (e.g., GPSR and TPGF algorithms) is running exterior clusters. As shown in Figure 3, each hexagon presents a cluster and the black nodes are CH nodes. The normal nodes are ignored except source and sink. When source node sends a packet to sink node , node will run interior cluster routing and then packet will be relayed to CH node . At that time, will run exterior cluster routing to decide which neighbor cluster to be the relay cluster and then run interior cluster routing to the CH node of relay cluster. In general, as shown in Figure 3, the routing path of GPSR is straight while -OCHE's path is sinuous and adaptive to nodes' energy availability which can obtain a balanced load distribution and consequently a longer network lifetime.
5.3. Routing Maintenance
This phase begins when nodes' status change due to duty-cycle scheduling. The route maintenance in our approach basically boils down to cluster maintenance. After a change in topology, all the nodes have the complete cluster information in the form of and . If all CH nodes have a consistent view of the topology, routing loops will not form. However, due to long propagation delay, network partitions, and so forth, some nodes may have inconsistent topology information. This might lead to formation of routing loops. However, these loops are short term, because they disappear within bounded time (required to traverse the diameter of the network).
The new cluster information will be propagated throughout the network. Among exterior neighbor clusters, it should be noted that only the boundary nodes are responsible for broadcasting and rebroadcasting any new information. This helps in quick dissemination of information across the network. Thus, the convergence of the cluster-based protocols is very quick. When a node of a cluster stops working, after a certain time, all its neighbors will detect this event. In interior cluster, only its parent node will update the information of and alarm this event to CH node. If the dead node has children, each child will select one neighbor who has the highest as its new parent.
Let us illustrate it with an example, as shown in Figures 4 and 5. Let node disappear. This event will be detected by nodes , , , , and and CH node. Since nodes , , , , and are not parent nodes, they will just update to indicate the change. The parent node does not need to forward this event to CH as CH is itself; otherwise it needs to relay the event to CH. Node and node , as 's children, have to look for their new parents. As () is 's ('s) only neighbor which has the highest EA, it becomes 's ('s) new parent.
6. Performance Evaluation
6.1. Experiment Setup
To verify the correctness and effectiveness of the proposed -OCHE algorithm, we conduct a detailed simulation using the NetTopo [29]. In our simulation, the studied WSN has the topology: 400 * 400 . The number of deployed sensor nodes ranges from 200 to 1000 (each time increased by 100). The value of changes from 1 to 10 (each time increased by 1). For each number of deployed sensor nodes, we use 100 different seeds to generate 100 different network deployments. A source node is deployed at the location of (50, 50), and a sink node is deployed at the location of (350, 350). We use the GPSR routing protocol implemented in routing layer of the simulator to deliver message. All simulation parameters [30] are listed in Table 11. In Figures 9(a), 9(b), 9(c), 9(d), 9(e), and 9(f), the execution of -OCHE is demonstrated.
In this section, we evaluate traditional GPSR and GPSR in -OCHE approach in terms of energy consumption, network lifetime, and recovery time.
6.2. Energy Consumption
First we compare energy consumption of each sensor in traditional GPSR and -OCHE-based GPSR, which can reflect lifetime of network. Figure 6 reports energy consumption of sensors in two protocols after 600 routing queries have been processed, where -axis and -axis together decide the location of each sensor node and -axis represents the value of energy consumption. Figure 6(a) shows that some sensors in traditional GPSR consume a lot of energy, especially those located along the two edges and diagonal line of the sensor field to which the data sink belongs. So these sensors are energy hungry ones which consume all 5 joules, while sensors located outside this region just consume as little as 0.1 joules after 600 queries. Obviously, the energy consumption in traditional GPSR is very unbalanced. On the contrary, the load in -OCHE-based GPSR balances very well, as shown in Figure 6(b), where no energy intensive nodes exist. In -OCHE-based GPSR the maximum energy consumption is 3 J and the minimum energy consumption is 0.04 J. In other words, in the -OCHE-based GPSR, by consuming 5 J, the sensor network can process routing at least 1000 times.
6.3. Network Lifetime
Finally, we compare network lifetime, which is more attractive to application scientists and system designers. We set the value of (the threshold determines the ratio of active nodes) 90%. The comparison between traditional GPSR and -OCHE protocols is reported in Figure 7, where -axis is the initial energy of each sensor and -axis is the value of network lifetime. From the figure, it can be easily seen that network lifetime in the traditional GPSR is about 1/6 of that in -OCHE. Additionally, if we decrease the value of , the gap between the traditional GPSR and -OCHE-based GPSR will become much wider. Thus we conclude that -OCHE indeed extends network lifetime much more than that of traditional GPSR.
6.4. Recovery Time
Figure 8 shows the impact of the network size (node density) on the time to repair from an individual node failure for GPSR and -OCHE, respectively. The -axis is the network size and the -axis is the value of recovery time. It is obvious that the recovery time of -OCHE is much more better than that of GPSR, especially at high values of network size. For low values of network size, that is network size <30, -OCHE will consume a little bit more recovery time due to the maintenance of clusters. For high values of network size, the recovery time of GPSR increases with network size linearly, while the recovery time of -OCHE increases very slowly.
7. Conclusion
In this paper, we propose a -connected overlapping clustering approach with energy availability for routing and topology information maintenance in WSNs. We compare -OCHE with the classical GPSR, and simulation results show that -OCHE balances the load to extend the lifetime of sensor network. What is more, -OCHE achieves shorter recovery time than GPSR, especially with large network size.
We present the pseudo code of -OCHE and review Connected K-Neighborhood (CKN) algorithm in [27] in this appendix.
This work is supported by the Natural Science Foundation of China under Grants no. 61070181, no. 61272524, and no. 61202442.
- J. Yick, B. Mukherjee, and D. Ghosal, "Wireless sensor network survey," Computer Networks, vol. 52, no. 12, pp. 2292–2330.
- K. Akkaya and M. Younis, "A survey on routing protocols for wireless sensor networks," Ad Hoc Networks, vol. 3, no. 3, pp. 325–349, 2005. View at Publisher · View at Google Scholar · View at Scopus
- D. Johnsort, "Routing in ad hoc networks of mobile hosts," in Proceedings of the 1st Workshop on Mobile Computing Systems and Applications (WMCSA '94), pp. 158–163, IEEE, 1994.
- S. Soro and W. B. Heinzelman, "Prolonging the lifetime of wireless sensor networks via unequal clustering," in Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS '05), p. 8, IEEE, April 2005. View at Publisher · View at Google Scholar · View at Scopus
- J. H. Chang and L. Tassiulas, "Maximum lifetime routing in wireless sensor networks," IEEE/ACM Transactions on Networking, vol. 12, no. 4, pp. 609–619, 2004. View at Publisher · View at Google Scholar · View at Scopus
- C. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers," ACM SIGCOMM Computer Communication Review, vol. 24, no. 4, pp. 234–244, 1994. View at Google Scholar
- B. Karp and H. T. Kung, "GPSR: Greedy Perimeter Stateless Routing for wireless networks," in Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MOBICOM '00), pp. 243–254, ACM, August 2000. View at Scopus
- L. Shu, Y. Zhang, L. T. Yang, Y. Wang, M. Hauswirth, and N. Xiong, "TPGF: geographic routing in wireless multimedia sensor networks," Telecommunication Systems, vol. 44, no. 1-2, pp. 79–95, 2010. View at Publisher · View at Google Scholar · View at Scopus
- V. Rodoplu and T. H. Meng, "Minimum energy mobile wireless networks," IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1333–1344, 1999. View at Publisher · View at Google Scholar · View at Scopus
- Y. Xu, J. Heidemann, and D. Estrin, "Geography-informed energy conservation for ad hoc routing," in Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 70–84, ACM, July 2001. View at Scopus
- Y. Yu, R. Govindan, and D. Estrin, "Geographical and energy aware routing: a recursive data dissemination protocol for wireless sensor networks," Tech. Rep., Citeseer, 2001. View at Google Scholar
- A. A. Abbasi and M. Younis, "A survey on clustering algorithms for wireless sensor networks," Computer Communications, vol. 30, no. 14-15, pp. 2826–2841, 2007. View at Publisher · View at Google Scholar · View at Scopus
- D. J. Baker and A. Ephremides, "The architectural organization of a mobile radio network via a distributed algorithm," IEEE Transactions on Communications, vol. 29, no. 11, pp. 1694–1701, 1981. 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), p. 10, IEEE, January 2000. View at Scopus
- S. Basagni, "Distributed clustering for ad hoc networks," in Proceedings of the 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN '99), pp. 310–315, IEEE, 1999.
- A. Manjeshwar and D. Agrawal, "Teen: a routing protocol for enhanced efficiency in wireless sensor networks," in Proceedings of the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Networks and Mobile Computing, vol. 22, 2001.
- S. Basagni, "Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks," in Proceedings of the IEEE VTS 50th Vehicular Technology Conference (VTC '99), pp. 889–893, IEEE, September 1999. View at Publisher · View at Google Scholar · View at Scopus
- A. Manjeshwar and D. Agrawal, "Apteen: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless sensor networks," in Proceedings of the 16th International Parallel and Distributed Processing Symposium, p. 48, 2002.
- M. Younis, M. Youssef, and K. Arisha, "Energy-aware routing in cluster-based sensor networks," in Proceedings of the 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS '02), pp. 129–136, IEEE, 2002.
- M. Youssef, A. Youssef, and M. Younis, "Overlapping multihop clustering for wireless sensor networks," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 12, pp. 1844–1856, 2009. View at Publisher · View at Google Scholar · View at Scopus
- S. Lindsey and C. Raghavendra, "Pegasis: power-efficient gathering in sensor information systems," in Proceedings of the IEEE Aerospace Conference, vol. 3, pp. 3–1125, IEEE, 2002.
- S. Lindsey, C. Raghavendra, and K. M. Sivalingam, "Data gathering algorithms in sensor networks using energy metrics," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 924–935, 2002. View at Publisher · View at Google Scholar · View at Scopus
- M. Youssef, M. Younis, and K. Arisha, "A constrained shortest-path energy-aware routing algorithm for wireless sensor networks," in Proceedings of the Wireless Communications and Networking Conference (WCNC '02), vol. 2, pp. 794–799, IEEE, 2002.
- L. Subramanian and R. Katz, "An architecture for building selfconfigurable systems," in Proceedings of the 1st Annual Workshop on Mobile and Ad Hoc Networking and Computing (MobiHOC '00), pp. 63–73, IEEE, 2000.
- F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, "Geometric ad-hoc routing: of theory and practice," in Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC '03), pp. 63–72, ACM, July 2003. View at Scopus
- B. Leong, S. Mitra, and B. Liskov, "Path vector face routing: geographic routing with local face information," in Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP '05), pp. 147–158, IEEE, November 2005. View at Publisher · View at Google Scholar · View at Scopus
- S. Nath and P. B. Gibbons, "Communicating via fireflies: geographic routing on duty-cycled sensors," in Proceedings of the 6th International Symposium on Information Processing in Sensor Networks (IPSN '07), pp. 440–449, April 2007. View at Publisher · View at Google Scholar · View at Scopus
- W. Heinzelman, Application-specific protocol architectures for wireless networks [Ph.D. dissertation], Massachusetts Institute of Technology, 2000.
- L. Shu, C. Wu, Y. Zhang, J. Chen, L. Wang, and M. Hauswirth, "Nettopo: beyond simulator and visualizer for wireless sensor networks," in Proceedings of the 2nd International Conference on Future Generation Communication and Networking (FGCN '08), vol. 1, pp. 17–20, IEEE, 2008.
- Y. Chen and Q. Zhao, "On the lifetime of wireless sensor networks," IEEE Communications Letters, vol. 9, no. 11, pp. 976–978, 2005. View at Google Scholar


text:
College Hockey:NCHC playoff tournament to be called NCHC Frozen Faceoff
After two different rounds of voting and over 800 ballots submitted, fans have selected NCHC Frozen Faceoff for the name of the conference's championship weekend. The inaugural event will take place March 21-22, 2014, at the Target Center in Minneapolis, Minn.
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.

subset: commoncrawl


text:
Four Points Best Brews Program
Kick back and relax after a long day on the road with a great craft beer. Our Best Brews® program features unique offerings*, some locally sourced, all straight from the tap at Four Points. Each season the Best Brew program is enhanced with seasonal offerings, like Summer Ales, Oktoberfest & Winter Ales. So, taste your way through your travels and savor a collection of beer experiences to take home with after your time on the road. Cheers!
Daily Best Brews® Special
Enjoy a Western BBQ Bacon Burger in R+R Grill for only $7 with purchase of a Best Brew. Offer available from 5 - 10 PM. Not valid with any other promotions/discounts, one per guest.
*offerings vary by location


text:
Stuck in Crimbo limbo? Here are five wintry reads to curl up with
The Siege by Helen Dunmore (Penguin)
Set during the vicious winter of 1941, as Hitler's armies lay siege to the city of Leningrad, this wonderful novel follows the battle for survival of Anna Levin, her young brother, her dying father, and her lover. It is so cold that people freeze to death in the streets. The Levin family must boil leather to make soup, and burn their books for warmth. And all the while, the Nazis are circling. A great, bleak read.
Little House in the Big Woods by Laura Ingalls Wilder (Egmont)
I loved these tales of 19th-century frontier living when I was a child, especially the resourcefulness of the Ingalls family – Ma, Pa, Mary, Laura and baby Carrie – who lived inside the cosy log cabin built by Pa and kept themselves entertained even as snow reached the rooftop. One day the girls make candy by pouring molten molasses into the snow - an exotic idea in rural Northamptonshire.
Snowdrops by A.D. Miller (Atlantic)
Shortlisted for last year's Man Booker Prize, this accomplished Russia-set thriller follows Nicholas, an expat lawyer enjoying all the thrills Moscow has to give, including a love affair which is not all that it seems. "Snowdrops" is city slang for the bodies that turn up when the snows melt in the spring, either homeless people who simply lay down to die – or murder victims.
The Birthday Boys by Beryl Bainbridge (Abacus)
Beryl Bainbridge's 1991 novel recounts the tragic story of Captain Scott's Terra Nova expedition to the North Pole, told from the points of view of five members of his team. The Antarctic is beautifully rendered, from the silent wastes to the blizzards and frostbite.
The Snow Child by Eowyn Ivey (Headline Review)
This debut isn't published until February, but order it now. Jack and Mabel are a childless couple who moved to the lonesome wildernesses of Alaska for a new start. When the first snows come, they build a girl in their garden – in the morning she has gone, but they glimpse a real child running into the woods. This is a real novel of survival – of shooting and trapping for food, of eking existence from the land, and tramping through waist-high snow. It is also a beguiling tale of love and longing, inspired by Russian folklore.


text:
PODCAST BOARDS > Podcast Show Notes and Comments - with LISTEN NOW link
REVIEW Raider Nation Podcast in iTunes Store
I hadn't checked our reviews in the iTunes store in a while, and I just noticed that we now have 28 reviews.
We have been "rated" by 43 people and we have an overall rating of 4.5 stars.
39 people gave us 5 stars, 1 person gave us 3 stars, and 3 people gave us 1 star (Raider haters obviously).
If anyone else would like to write a review of EITHER of our podcasts (Raider Nation Podcast or Raider Nation Videocast), we would really appreciate it. It helps promote our shows.
Here are samples of some of the reviews (even a favorable one from a non-Raiders fan):
(click graphic below to enlarge)
[attachment deleted by admin]
[0] Message IndexGo to full version


text:
"Where there's God there's a way and he came through today," James Henslee said. "It's the verdict I've been waiting for."
The jury found Beebe guilty of second-degree murder in the death of Amy Henslee, whose body was found in a shallow grave on Jan. 27 in rural Van Buren County. The jury found Beebe guilty of first-degree murder in the death of Tonya Howarth, whose body was found with Henslee's.
Beebe told police that he had been having an affair with Amy Henslee and that Howarth, who was his girlfriend, became enraged when he found them together at this trailer on Jan. 24.
James Henslee said today that the verdict showed that jurors saw Beebe's story as a lie. James Henslee has two sons from his marriage with Amy Henslee.


text:
|Berkeley Parents Network
|Post a Msg
|What's New
Please Note! BPN is now a 501(c)(3) non-profit and has moved to a new website: BerkeleyParentsNetwork.org
Buying a New Car
Please Note! BPN is now a 501(c)(3) non-profit and has moved to a new website: BerkeleyParentsNetwork.org
|Advice about Buying a Car
|Resources & Related Pages
My husband and I have two boys under 5yo. We drive his cars, a 1993 Toyota 4-Runner truck and a 1998 Honda Civic VX. We sold my car which was having too many problems. Ever since I was pregnant with our first boy, I have been trying to convince my husband to buy a newer family car with better gas mileage (the Toyota gets 14mpg) and current safety features like air bags, etc. He has resisted all these years, saying that the Toyota is built like a tank and is just as safe as anything with air bags -- in fact, it's *more* safe than the cars I've been proposing -- like the Mazda5, the Prius V, or the Ford C-Max Energi, for example -- because it's bigger and stronger. He's an engineer and used to work for a company named Failure Analysis, so he pulls out all his engineering and professional terminology as evidence to support his theory that his Toyota is safer because it's bigger. He says that a van like the Honda Odyssey would be more comparable in safety to the Toyota and he's willing to buy one, but we don't need a big van like that and I want to get better gas mileage. I say that there are other safety features in vehicles now, not just the air bags - anti-lock brakes, stability control, for example - but I think that even the air bags in a Prius V, for example, are better than his 'tank' - front, side curtain, knee airbags, overhead air bags. Oh, one more piece here: while driving the truck with our baby 3 years ago, I was rear-ended at a stop light, and the insurance company said the truck was ''totaled.'' The bumper was badly bent down and the frame was bent. Rob took the truck up to his brother's farm in Sonoma, where they lifted the back end up with a crane. They put a huge steel block under the truck, then dropped the truck onto it, nudging the bumper up bit by bit for about 15 drops till it was drive-able again. He says that the bent frame and the slightly-hanging bumper is an aesthetic problem, not a safety problem.
Can anyone match my husband's ''expert'' arguments with evidence supporting my arguments that newer vehicles with current safety features are safer than his 1993 Toyota 4Runner? Or, is he right and I should just relax about these safety issues? Btw, I'm a graduate student and don't have enough income to buy one without his support! I found a 2012 Mazda5 for $15,500 and I want to get it! We can definitely afford it. Safety conscious
After an $800 repair, we're confronted with another $350 repair and realize it is time to buy a new car. However, we haven't bought one for 15 years, so don't know how to go about it nowadays. We really, really do not want to deal with car dealers. Are there better ways to buy a car? We're looking for a compact -- something like a Prius or Civic Hybrid, maybe a non-hybrid with good mileage. We could probably use 5 seats (parents, child, +2 friends) but maybe would manage with 4 seats if it is much cheaper. Also, we are a one-car family, so reliability is crucial. In a couple of years we will probably want to teach our teen how to drive using the car. So the two questions are: what models should we consider? What alternatives are there to going through the dealer? not quite ready to go carfree.
I could use some advice about the process of buying a new car - I'm procrastinating because it's so daunting, especially walking into a showroom and negotiating the price. I'm worried that I won't get a good deal because the dealers will take advantage of the fact that I'm a woman (that happened to a friend of mine). I want to empower myself with knowledge before I go in. My current car is breaking down a little more everyday, I may have to WALK to the dealers!! How have you gotten through this process with your eyes open and dignity in tact?! Can you recommend any good books or buying guides?
Again, I haven't dealt with them directly, but my colleagues who have (2 leases and 1 purchase) are very happy with the results. That said, consider buying used and/or taking transit. Graham
1. Browsing online first, get a feel for what you can afford and what's available. Edmunds.com, or AAA pre- negotiated cars at buyacar.go.aaa.com which shows you cars for sale in a 50 mile radius or less.
2. Go car hunting with the absolute promise to yourself that you WILL NOT buy a car that day. Keep hunting separate from buying, & keep repeating that to the salesperson no matter what they say. EVEN if you LOVE the car and it's PERFECT and they say 2 other people are looking at it and it may not be there when you return, WALK AWAY. (Maybe you'll come back by the end of the day but walk away anyway!)
3. If you do find the perfect car, get all the details you can about it--they should be able to hand you a print out with everything it has in it. Radio, airconditioning, anti lock brakes--even if you don't know what the parts do, get the info on it. Then go back to edmunds.com to enter the details and see what the value range is.
4. Decide what is the most you will pay, period. It's the emotional attachment to a specific car that allows hard-sell techniques to work. If you can't walk away, you make yourself vulnerable regardless of gender (my brother is more vulnerable than I am to hard-sell techniques). --The reason I know this works is when negotiating, I developed a terrible migraine. When the price dropped to within $700 of my researched price, I said, okay that's close enough--I'll come tomorrow when my headache is gone. They followed me across the lot as I was leaving, shouting, okay you win, but you have to take it now. (They thought I was bluffing!) So I said okay, sat through the paperwork and then they had to drive me home because I couldn't see. It was a big lesson in how important it is to walk away and really mean it.
Finally, stop car shopping after you've made your purchase -it'll just make you crazy. Congratulate yourself on the hard work you did and enjoy your car.
It's silly how proud I was for being able to handle this as a single woman, but what the heck. It's life-changing and I'm still proud of it. Now on my third solo purchased car!
We found the annual Consumer Reports issue on cars to be useful. Good luck. DC
You will need to have some idea of the type of car you want: How much will you be driving, how far (commuting?);what size car are you comfortable driving; are you interested in a hybrid, a wagon, an SUV? You can do side by side comparisons on Edmunds.com. I also think the Consumer Reports auto buying guide and magazine issue is very helpful. You can check these out at the library as well. Good Luck and happy driving Likes Cars
They all have a comparison sheet which allows you to select a few models to compare. The spec. sheets are extremely detailed, they tell you all the equipment that's included in the model and submodel.
Once you've figured out which models are of the most interest to you. Go take your test drives but make it clear that's all you are doing.
Call the fleet managers of various dealerships to ask them for the price of the model you are interested in. Now they often will take e-mail inquiries too. Fleet managers sell with a set price for each model. So be very specific about what you want, down to the color of the interior, exterior, floor mats, etc. Compare the prices from the various dealerships.
Select the one price you are happy with, check to see that they have the car on the lot. Go in see the fleet manager, pay and leave. Only buys from fleet managers.
Here's what we did right:
1) We did a ton of research on-line on makes/models/prices and blue book trade-in prices. When we went to the dealer, we already knew what we wanted and our down payment amount.
2) My husband went to the 2 dealers we'd chosen and pre- screened their selection in the models we wanted. So he and the dealers narrowed it down to 2 cars, 1 in each make/model. Could your partner or a friend/family member who is good at this sort of thing do this step for you?
3) We resisted the relentless hard-sell for add-ons that we didn't want. As soon as they found out we had kids, they started pressuring us to get this gross anti-stain upholstry treatment that cost $1000, and the Lo-Jack. I must have had 5 separate dealers tell me the same story about some family whose car got carjacked with the baby inside, and only Lo-Jack saved them! (We live in *Davis* - we're about as likely to get carjacked as we are to get hit by lightning...)
Here's what I'd do different next time:
1) We got the basic model, but we probably should have gone up a step - we paid just as much adding on all the features that don't come with basic, like the locking thing on the keychain.
2) I regret financing the car at all. We had money in our emergency fund to pay 100%, but we wanted to keep cash on hand. They totally got us on this big ''finance fee'' to initialize the loan. We should have read up on what to avoid, re: finance charges, fees, etc. I'm sure there's lots of guides for this online.
Anyway, hope that helps. I'm so interested to see what other people have to say - everyone wants to do better at this! Another car-buying rookie
You can go back-and-forth like this for awhile if you want (the goal being to beat the Cars Direct price) or you can just spit out the Cars Direct price and ask them if they can match it.
I think it is wrong to use the resources of a dealer (make them spend time with you, drive their cars, etc.) and then once you've decided just go with the absolute lowest price. But while I would pay a couple hundred more for them spending time with us, I wouldn't pay thousands more. Anon
Knowledge: If you really know how much a car should cost, you are not going to let someone tell you otherwise. This is easier on a new car, harder on a used one due to the obvious variables. Knowledge and confidence in your knowledge take a bit of research, this can be done online and at the dealer. When you go to the dealer you can say ''I am doing research, I am not buying today, or this week''
Detachment: You need to then determine what you will pay for a car. If the car costs $5 over that, you walk away. If the car is in your favorite color, has a license plate # that speaks to you, but is $5 over your price - you walk away. If you are not committed to your price, you will be susceptible to over-payment. Your commitment to your price is essential, it can be sensed, as can your possible affection for that color of blue. When naming a price, you should start lower than your walk-away price. That way the sales person can get a bit more $of you - but not more than you are willing to give.
Timing: If you are going to buy a new car you can take advantage of the sales commission system. Buy at the end of the quarter, call on the last Thursday of March, all dealers in the area, say ''I want this car, I will buy it Saturday, I have already test driven now I am going to buy, I am calling all x dealers within 100 miles, what is your best price?'' Then call all the dealers, get the best price, call back the one closest to you, say can you meet this price. You can use this tactic any time, sometimes there is additional motivation at the end of the quarter.
Pretend it's for your Mom: Research shows that women are better negotiators than men when they are negotiating for someone else's benefit. They perform less well than men in negotiating for themselves. So, pretend you're buying this for your mom. You wouldn't let that salesperson oversell your mother, would you? negotiator
If you'd rather do it all on your own, Sharon has just finished writing a car- buying guide for women. It's great and it costs less than $30!!!! If you're local, I recommend working with Sharon directly, but you can decide to either use her services or buy the guide. Either way, you'll get a much better deal and not have to get all stressed out about it. Sharon's web site is: www.carbuyingsos.com, and her phone number: (510)593-0289 Good luck! Naama
Here's how I do it: research the car you want on the web. Find out the blue book value, and the invoice value (what the car is worth right out of the factory). Go to vehix.com and a few other sites to compare prices. This is how you find out what people are willing to pay for the car you want. Next,no matter what, visit more than one sales lot in a day. Even if the car you love is sitting right in front of you, walk away. Tell them you need time, you're interested but want to check out other options first. This will make them anxious to serve you when you come back. Go half hour to one hour before closing time. People want to wrap it up and go home. Especially on Fridays. reject the first offer. Flat out. Repeat the price you want to pay, and then you'll probably end up waiting as the salesman goes to see his manager several times. Don't budge on the price.
Keep them guessing: Your behavior should be erratic (it totally throws them off). One minute you REALLY want the car, the next minute, you hear something that you don't like, you stand up abruptly and say: '' I don't like what I'm hearing, this is NOT working for me.'' Be ready to walk away. Be ready to stand firm on what it is you want. You don't have to pay for hidden costs. It helps if you have the money to pay for the car without having to finance it (nothing hurts a car salesman more than to see cash walk out of his door). Take a few days if you need to. If the car you want is gone, then it means the people you were dealing with were difficult. It wasn't meant to be.
Finally, after you are successful at being an actor (because you are one, make no mistake), and an educated customer who KNOWS the value of what they want..... go home and take a hot shower. I always feel gross after these experiences! Good luck Hard Bargainer
Buying a car can be a bit scary - but there are lots of great tools on
the internet now that can help you figure out which suits your needs,
desires and budget. I sell extended warranties thru used car dealers in
the Bay Area, so while I don't directly sell cars I DO know from our
claims history which cars are better than others. But without knowing
more about what you need, it's hard for me to give you any suggestions.
Take a look at websites like edmunds.com and use their research area.
Also, when you figure out which car you like the best, definitely get the
Kelly Blue Book info for the make, model and year. Never pay the retail
price listed for the vehicle. Also, it's always a good idea, unless you
know the history of the car 100%, to get a vehicle history report from
either CarFax or AutoCheck.
Good luck! and Happy shopping.
Buying a New Car - What to Expect?
July 2007
I am helping my mother buy a Prius next month, and my memory of
car-buying involves pushy sales people and never knowing if the
price you're quoted is reasonable. Has anyone gone through the
process lately? Can you get a deal on a Prius, or are they too
hot to bargain for? Are there any dealers who take the Saturn
approach (no haggling, more humane)?
Thanks -
Bad at Barganing (and my mother is worse)
We found a few ''bargains'' in our search -- if you are flexible about color, interior, features, it's worth calling around dealers and seeing what they've got right now. People cancel orders, and less popular colors or perhaps 06 models might be available right away for a small discount. Definitely cast a wide net around the whole Bay Area. And check out what's on Craigslist in the dealer listings, although be prepared to act fast if you see what you want.
Many places did require a ~$500, refundable deposit for us to be placed on a Prius waiting list, and we ended up doing that and buying from with Putnam Toyota in Burlingame. We had a great experience with our seller/agent, Nazir Mojadeddi. Admittedly, we were an easy sell. We gave him our preferences for color, interior and features and then we all just sat back and waited -- about six weeks -- for us to move to the top of the list. But it was nice that he was mellow throughout and didn't try and push us to get a sunroof installed, custom leather, etc, like a couple of other places we approached.
BTW, sales tax is based on where you live, not the dealer's location, so buying in San Mateo Co., where sales tax is lower than Alameda Co. (if that's where you are) won't save you anything!
Service has been pretty good so far at Putnam too.
You could also look on priuschat.com and check out what others thought of particular dealers.
Hope this helps! Prius lover
800-475-7283 http://www.checkbook.org/auto/carbarg.cfm
What they do is approach three dozen dealerships and ask them to bid for your business. They call the fleet managers and make sure that if they bid they put their name on it. They also get all the fees up front so you know exactly what you're paying. Then you get a list of at least five bids. It takes seven to ten business days and you can have the report emailed, mailed, or FedExed to you. You can also call up the service and get help on the phone if you don't understand the report. It costs $190 but it's worth it. When we used the service, we got a list of twelve dealerships, and some actually lowered their price eight hundred dollars below invoice price just to get our business. Prior to getting the report, we had gone to some of the same dealerships and gotten the run around. We thought the Consumer Reports new car price report (not to be confused with the CarBargains service) would be enough, but the salespeople just laughed and gave us quotes that were three thousand dollars higher. Once we got the CarBargains report, they were more than happy to do business on our terms.
By the way, no haggle sales means you pay whatever the price is. In the case of buying a Saturn, you're basically agreeing to be ripped off by a friendly salesperson for thousands of dollars in exchange for a customer appreciation barbecue and a free loaner car when you come in for a service. Not worth it in my opinion.
By the way, if you're selling your mother's old car, make sure you know how much it's worth before trading it in. If you don't do this, you will be ripped off as my mother-in-law was when she traded in her car-by over a thousand dollars. You can get that information from http://www.nada.com and Kelly Blue Book http://www.kbb.com.
Also, make sure you have your financing before you go. We got ours from our bank and you can use it to your advantage to try to get the dealership to give you a lower rate. If you walk in without financing and ask them to do it, they will give you a high rate since the the higher the rate is the more profit they receive. And don't buy the extended warranty package they offer unless you shop around for quotes as they inflate that price on that as well.
It took us a month to get everything in order, but it was well worth it. Took a long time, but didn't get ripped off and got a fair price
Go to the Toyota website and check out the package option you want and it will tell you what the MSRP is. The MSRP is the manufacturer suggested retail price. There should be no reason to pay more than MSRP.
Then call various dealerships and ask if they have the car in the package of your choice in stock, and what the price is. They will quote it to you over the phone and you can compare prices. You are likely to get the best quotes if you ask to speak to the fleet manager. The fleet managers get their commission by the number of cars they sell, not the price of the cars, so they are interested in selling more cars than in charging more. And because they deal with fleet, they will work with you over the phone with no nonsense, since they rather not waste time.
Another option is to call AutoByTel or Autoland. Look them up on the web for contact information. They are a car broker service. They will quote you a price and tell you which dealership has the vehicle you want. I have had good experience with both. For full disclosure, my brother works for Autoland and he was the one who found us our second Prius for $200 below dealer invoice and in the green with gray interior (most green ones come with beige interior). With these services, you don't have to call all the dealerships yourself, you let the broker do the calling and the research. You don't have to pay more, because these brokers have agreements with the dealerships and their cut comes from the dealerships.
Hope this was helpful. cecilita
Another thing that I would definitely recommend is using the Internet to get a price quote. You can do this through Edmunds.com, Autoweb.com, Autobytel.com, car.com, and probably other sites as well. When you do this, your name, contact info, and information about the vehicle you would like to purchase are sent to multiple dealerships. These dealerships usually have dedicated Internet sales personnel who handle these requests. They will get back to you (by email, if you prefer) with a price quote. You can compare quotes, and even see if one dealership will match the quote of another. In our experience, this is a much less high pressure, much more pleasant way to buy a car, and we have gotten excellent price offers.
Last of all, remember that you always have the power to walk out. The dealer can't sell you a car until you agree to buy it. Decide in advance how much you are willing to pay, and don't buy until you get that price.
Good luck. An Internet car buyer
We are buying a car and we would like advice on how to get the best interest rate on a loan from the car dealership. We already were approved for a loan from an online lender but we would like a lower rate.
We have heard of people asking the car dealership to beat the rate they have. The only problem is that the dealership only offers a slightly lower interest rate.
We were wondering if it would be better not to say anything until after the dealership makes us an offer. Then we could mention the interest rate we have.
We plan to negotiate the price of the car before we mention financing. We just don't know the best way to go about doing this.
Any advice or personal experiences would be greatly appreciated. Anon
The best way to get the best deal/loan interest rate is take a loan from a credit union and bring your letter of credit to the dealership.
Other than that, you are at the mercy of the F&I person at the dealership, and (I'm giving proprietary info here, so heed it well), they get kickbacks for getting higher-interest loans approved.
I'm in the industry, so I know this to be true. -- Want you to get a good deal
Among the most useful things my father ever taught me was negotiating with the car salesman at a dealership. He is an utter genius at it, and if I've picked up any of his tips, I'm better off for it. Thanks, Dad!
His strategy was to let out one piece of information at a time. So you'd select the car, go into the office, and sit down to discuss the first offer.
1) Once you have the first offer, tell the salesman that another dealership will give you the same car for $xxxx less. (Note this will only work if you have called another dealership in advance to get their price. Just in case the salesperson you're dealing with face-to-face calls your bluff, you should be able to prove you can get the car cheaper elsewhere. If they ask why you're not at the other dealership, claim convenience.) When the dealership makes a counteroffer, call the other place and ask them if they can beat it. Lather, rinse, repeat.
2) Once you have a price you're satisfied with, you can discuss payment. If you are trading in a car, now is the time to bring it up, NOT before you have an agreed upon price.
3) Bring up financing and let them make an offer. Tell them what you're getting from another bank and let them make a counteroffer. Lather, rinse, repeat again.
It's just like job negotiations in that you want to let them state a price first. Better leverage for you. Good luck! -- a happy car owner
However, I'd like to recommend two surprisingly good web sites for car buyers. One is www.edmunds.com
In addition to price info, technical info, and reviews, this site hosts a number of very active forums of consumers (and occasional dealers) exchanging information about vehicles. As you can imagine, one topic that is heavily discussed is what kind of price people have been paying for various models, including the Honda Odyssey. (It turns out that I am also interested in the Odyssey, and the best you can do with it is roughly MSRP).
The other site, www.carorder.com
lets you buy new vehicles at heavy discount without negotiation. Most other car buying services (including CarPoint) only put you in touch with a dealer and are utterly useless, since you still have to talk to the dealer. I have checked a couple of carorder prices and they seem to be pretty much the bottom.
For instance: the CarPoint dealer quoted 2% over invoice for a Mazda MPV 2000 after three calls and a good workout to my spleen. Carorder.com gave me 0% over invoice in 2 minutes. The MPV discussion group also reports 0% over invoice in the best case.
The only limitation is that Carorder doesn't seem to deal with hard-to-get vehicles, including the Odyssey.
Good luck (and take a good look at the Mazda MPV 2000 before you buy the Odyssey). ---Luigi
We have recently found that you can actually order a car from the internet,
and the web site is carorder.com. (there may be others) It seems like the
ultimate way to buy a car: no pressure, no negotiation games and you get
exactly the color/options you want with a price typically lower or equal to
the invoice price. However it sounds a bit too good to be true. So I would
like to hear from you if you have any experience with such companies. How
was it, is there any hidden catch, etc. thank you!
|Home | Post a Message | Subscribe | Help | Search | Contact Us


text:
Dec 19, 2008 11:16 AM
Fellow fine haired friends, listen up: You have not experienced life until you experience it with the addition of Unite Eurotherapy Boosta Spray ($27). This indispensable spray-on product contains dimethicone to seriously increase volume (without adding weight), while the addition of sea kelp produces shine and strength. For our NYC readers, pick this stuff up at the fabulous XacAnthony Salon. Your hair won't know what hit it.
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:
Winter Carnival Wrap-Up and Adventure Spring Break
February 12, 2014 in Uncategorized
Hello Parents,
I hope your students enjoyed Winter Carnival. With the festivities concluded, campus is once again calm.
Like every year, this year's Winter Carnival was fantastic and invigorating. The overall winner was Air Force ROTC, taking first place in special events, second place in Stage Revue, and second place in the snow statue competition in the student organization division. The 2014 Winter Carnival Queen was Janna Clement, who was sponsored by Delta Zeta sorority and Swift's True Value Hardware.
My favorite part part of Winter Carnival is the snow statue competition, and they were quite impressive this year. Phi Kappa Tau won the fraternities division, Alpha Sigma Tau won the women's groups division, Summit/Women In Engineering took the residence halls division, and Army ROTC won the student organizations division. Although Winter Carnival is now over, it's nice to see the statues still standing on campus. It gives us all a sense of promise as we continue to work our way through the semester.
As we approach the bulk of the semester, it's time for your student to start considering his or her plans for Spring Break. This year, Spring Break will take place March 10 through 14. Through the Outdoor Adventure Program (OAP), Michigan Tech offers a variety of Adventure Spring Break (ASB) adventures for students to participate in. ASB provides opportunities to explore new places through excursions outside of the Keweenaw. This year, a number of different adventures are being offered, including a trip to Puerto Rico, the Great Smoky Mountains National Park, and Buffalo River, Arkansas. All ASB trips are lead by student trip leaders who are certified in Wilderness First Responding and have had prior experience with ASB trips. ASB is not only a wonderful opportunity for your student to broaden their horizons and break out of their comfort zones, but their participation can also earn them Physical Education credit for Track A of the Spring 2014 semester! Below, you can find more more information about the trips offered through ASB.
Puerto Rico
Cost: $1,300
Includes transportation (rental cars and airfare), breakfast, lodging, surfing lesson, waterfall hikes, and snorkeling. For more information, contact: Carly at email@example.com or 248-881-5494, or Ryan at email@example.com.
Great Smoky Mountains National Park
Cost: $450-500
Includes transportation, food, backpacking, whitewater rafting, historic mill tours, waterfalls, and exploring. For more information contact: Karl at firstname.lastname@example.com.
Buffalo River, Arkansas
Cost: $450
Includes transportation, food, canoeing, and hiking. For more information contact: OAP at firstname.lastname@example.com.
These are truly great opportunities for your student to embark on new experiences and learn something new. If your student is interested in participating in any of these trips, I would recommend that they attend the informational meeting on February 13 at 7:00 p.m. at the OAP House. If you or your student have any questions about ASB, email email@example.com.
That's it for this week! I hope you all have a great rest of the week and enjoy the lovely winter weather. If you have any questions about Adventure Spring Breaks or would like to see more information about a specific topic, please feel free to email me at firstname.lastname@example.com. Until next time!


text:
Project to determine if COPD patients can do pulmonary rehab at home was focus of 15th Annual Cohen Lecture
Wednesday, April 21, 2010
A pilot project to teach people with chronic obstructive pulmonary disease (COPD) how to do pulmonary rehabilitation at home was highlighted at the 15th Annual Allen B. Cohen Memorial Research Lecture on Tuesday, April 20, at the Biomedical Research Center at UTHSCT.
Shown at this year's event are Geri Cohen, at left, widow of Allen B. Cohen, MD, Ph.D., and UTHSCT Vice President for Research Steven Idell, MD, Ph.D. Dr. Idell was recruited to UTHSCT by Dr. Cohen.
The lecture, "Getting COPD SMART (Self Management Activation Research Trial)," was delivered by David Coultas, MD. He spoke about his COPD research project, which is funded by a five-year, $3.25 million grant from the National Institutes of Health.
This study is designed to determine if teaching people with COPD how to participate in pulmonary rehabilitation in their own home will improve their health and quality of life.
Pulmonary rehabilitation often means coming to a center several days a week for eight to 12 weeks.
Not all medical centers offer these programs, and many COPD patients are 70 years of age or older or live in rural areas a distance from the rehab centers, making it difficult to participate.
Teaching people how to do pulmonary rehabilitation at home removes these barriers, said Dr. Coultas, UTHSCT's physician-in-chief and vice president for clinical affairs.
About 65 members of the UTHSCT Research Council and their guests attended this year's lecture, which is held annually to honor the memory of Dr. Cohen.
Dr. Cohen was an internationally respected pulmonary physician and researcher. The former UTHSCT executive associate director and professor of medicine and biochemistry died in February 1995.
He was the catalyst that helped make UT Health Science Center at Tyler a world-class biomedical research facility.
For 60 years, The University of Texas Health Science Center has provided excellent patient care and cutting-edge treatment, specializing in pulmonary disease, cancer, heart disease, primary care, and the disciplines that support them. UTHSCT's annual operating budget of $125 million represents a major economic impact of over $287 million to the Northeast Texas region. In FY 2009, scientists in the Center for Biomedical Research were awarded 80 competitive grants and contracts totaling $14.6 million. As the academic medical center for Northeast Texas, its graduate medical education program – with residencies in family medicine and occupational medicine – provide doctors for many communities throughout the region and beyond.


text:
Here's a hot little silver daddy fantasy story about this well endowed senior:
I met this nice older gentlemen one day when I was pulled over changing a flat tire. He saw me struggling with it in the rain and said I should come over to his house across the street as he had a compressor in the garage. I thought he was nice friendly old guy and didn't even consider anything remotely sexual even though I thought he was cute and charming.
We were drenched by the time we got inside his big double garage. He offered me a dry shirt and I accepted it. As I took my wet t-shirt off I noticed his eyes where all over me. I said he should get out of his wet clothes too and he was getting my drift. I watched him unbuckle his trousers and drop them to the ground. Next he dropped his old fashioned white y-fronts and my jaw nearly hit the floor along with his underwear. He had a huge cock! It was long and still wet and my heart began thumping with excitement. I wanted that huge juicy prick in my mouth!
I didn't bother with any coyness and moved straight over to him. I took his slick wet horse dick in my hand and stroked it telling him how beautiful it was. He said we go into his bedroom and I gladly followed. I told this sexy grandpa to lie back on the bed as I wanted to make to love to his long beautiful cock.
He was only slightly hard and I licked his member up and down. He told me it took him ages to get hard and that was more than okay by me. I loved the sensation of this huge soft dong in my mouth and I alternated sucking it and then his low hanging balls. I wondered how long I was gonna have to work on his delicious old dick before he rewarded my lips with a full load of mature man chowder.
Once I got him harder he wanted to stick it in my ass. I was a bit nervous as I had never had one that big but I did want him to fuck me. I got on my hand and knees and licked my asshole. His mustache tickled as he really got into eating my ass out. Then I felt the fat tip of his mighty cock enter me. I felt so good inside me and I watched in the mirror as this handsome grandfather fucked me doggy style.
I told him not to cum inside me as I wanted that load in my mouth. He agreed and after fucking me for what seemed like an eternity he said he was gonna blow. I was so much in cum lust for this poppy's cock I took his tool back into my mouth straight from my ass. I could taste it but didn't care as all I wanted was for this big dick to blow a hot cum load down my throat. As his fat cock head pushed against my throat I could taste precum. Then he moaned loudly and a thick salty flow of cum drenched my mouth.
We took a shower together and then went to finish fixing my tire. I was stunned when his wife drove up the drive way as we were working! I had assumed he was living there alone! It kind of added to just what a sexy gay encounter it was.
8 Responses to 'Horse Hung Grandfather'
ragu -
May 25th, 2011 at 6:46 pm
i like big cock
ragu -
May 25th, 2011 at 6:47 pm
i like old big cock
mariana -
January 26th, 2012 at 8:48 am
hot as hell horsehung grandpas are the best
July 7th, 2014 at 6:25 am
if you are ever in phoenix, let me know and we can meet up and go out for dinner and drinks….
tahar -
August 10th, 2014 at 11:08 am
let me your adress for you meet you
yorba -
November 9th, 2014 at 5:46 pm
Please sir i want to be your little girl I will do everything you say if you will just let me be your cock drainer. youe cock is so nice i will suck it in public when ever you say .please email me back I am i. So Ca Rialto 92376. And i will swallow every drop of cum i promise
badboy -
December 20th, 2014 at 6:06 am
Whoa! Very nice dick you have on you! I'd love to see it erect and shooting cum all in my mouth and face!
memo -
September 25th, 2015 at 7:02 am
my big dream fucking beautiful old man like you all night and day


text:
Tag Archives: hostingcon
Pogo partners with SanDisk at HostingCon – Pogo SSD Week
Pogo SSD Week continues as HostingCon kicked off yesterday. If you can be in Miami Beach today, you have a great opportunity to see just how transformational SSD technology really is. Pogo is demonstrating our new Iris XF line of SSD-based storage servers at … Continue reading


text:
Still life painting of flowers F McJannet oil on board
browse these categories for related items...
Directory: Fine Art: Paintings: Oil: Europe: British: Pre 1970: item # 745757
Please refer to our stock # 6261 when inquiring.
One of a Kind Antiques and Art
PO Box 1080
Deep River CT 06417
Guest Book
|Still life painting of flowers by English artist F McJannet. This lovely still life oil on artist board was painted by a very accomplished artist. So far we have only been able to find one auction record for the artist, James Thompson Aucioneers and Valuers Kirkby Lonsdale, Lancashire, England lot 178 on 1.21.04, will add to the artists bio as we come across more information. The label on the back reads F. McJannet 5 Cragsland Park Great Urswick Ulverston Studio Tarn Close. The painting measures 16 by 20 inches and the frame measures 20 by 24 and one half inches. "The villages of Great Urswick and Little Urswick, together called Urswick, are located in the Furness peninsula, part of the county of Cumbria in the United Kingdom. They are situated to the south-west of the town of Ulverston. Great Urswick is situated along the north and west sides of Urswick Tarn, a modest body of water (c. 1100 feet by 600), although the largest such natural body in Low Furness. The tarn is fed from the surrounding hills and feeds Gleaston Beck to the south, the water is said to have a red hue due to the iron content of the surrounding land. Little Urswick, the smaller of the two settlements, stands further south on the lower slopes of a limestone outcrop known as Bolton Heads." Taken from Wikepedia Shipping extra. Connecticut residents and buyers picking up in Connecticut add 6.35% state sales tax. Buyers outside the USA are responsible for any taxes,tariffs or customs that might apply.This piece is on display in our gallery at Clock TowerAntiques Center and can be seen in-person by visiting 824 E Main Street Branford,CT06405. For hours of operation visit: http://www.ClockTowerAntiquesCenter.com *** If you wish to see examples of similar items we have sold and/or appraised please go to our affiliate site www.OneofaKindAntiques.com and click the Archives / Homepage logo ***


text:
Dec 22, 2009 8:57 AM
Ostensibly, Planetary String Lights ($98) are Christmassy. But we happen to think they'd be a beautiful way to add light and ambiance year-round. Tiny sunbursts of white glass surround small golden lights, reflecting a sweetly dappled, floral pattern. We've got a few of these pomanders strung up in our bedroom in lieu of a ceiling light, and let us assure you, they provide some seriously romantic mood lighting. It just makes everything look more... magical. *wink*
See more string lights.
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:
Kevin S. Jones
Position: RB
Height: 6-0 Weight: 228 lbs.
Born: August 21, 1982 in Chester, PA
High School: Cardinal O'Hara
College: Virginia Tech (school history) (Jones college stats)
Drafted by the Detroit Lions in the 1st round (30th overall) of the 2004 NFL Draft.
Weighted Career AV (100-95-...): 27 (3730th overall since 1950)
Other SR Links: College Football at Sports-Reference.com
Output includes all passing, rushing, and receiving plays.See all Kevin Jones Super Bowl plays using the Super Bowl Play Finder


text:
Mather, Cubs end 4-game skid, stop Rockies' string
Colorado Rockies relief pitcher Matt Reynolds throws to first base after fielding a hit by the Chicago Cubs' Anthony Rizzo in the eighth inning of a baseball game in Chicago, Friday, Aug. 24, 2012. Reynolds was charged with an error on the throw to first. The Rockies lost 5-3. (AP Photo/Paul Beaty)


text:
Who doesn't love a great deal? Who doesn't love free deals? No stay at home mom says no to freebies and deals. Sometimes those are the things that make living on one income possible. If you are interested in learning about some new and local deals, you've clicked on the right article.
The Howard Hughes Center has a page on their website dedicated to coupons specific to the businesses located there. A free class at Gymboree would be a great way to let a little one unwind while letting them venture out beyond your reach. It's a shame to pay for classes only to find out they aren't ready to detach and don't want to participate at all. A free class will help eliminate some of the apprehension you might have. You can save 20 percent off your total at Johnny Rockets. Have the kids work up an appetite while playing and then refuel with a burger and fries at this fun diner. After lunch, enjoy a sweet treat before you head home. Mrs. Fields is offering a free cookies if you buy two. Yum!
Coupons can be found here for printing
Each individual business may offer their own coupons at times.
- You can get half price games at Dave and Buster's on Wednesdays.
- Find deals at Buffalo Wild Wings such as "Wing Tuesdays" and "Boneless Thursdays"
- Movie tickets will only cost you $7 on Tuesdays
- And don't forget, they offer free WiFi on the lower lever courtyard.
Always make sure to sign up for any discount cards or email lists for more deals. You can get free ice cream from Ben and Jerry's on your birthday and earn free food at Kabuki with their discount card. You can never have too many discount cards.


text:
EUGENE, Ore. - The Oregon women's basketball team will look to sweep a weekend with the Washington schools for the first time since the 2010-11 season when the Ducks play host to the Huskies on Sunday afternoon at Matthew Knight Arena.
The Ducks (10-8, 1-6 Pac-12) and the Huskies (10-8, 3-4) tip at noon for Pac-12 Networks televised game. The game features four of the top-5 scorers in the Pac-12.
UW Series Record: Oregon trails, 43-46 overall (26-14 at home)
Last Meeting: L, 69-62 (March 7, 2013 at Pac-12 Tourney)
Notable: Oregon won its first Pac-12 game on Friday night, 82-66, versus Washington State. The Cougars entered the game tied for third in the league standings with a 5-1 record. The Ducks lead the nation in scoring at 95.7 points per game while Jillian Alleyne leads the nation in rebounding at 14.9 per game. Alleyne has posted 14 straight double-doubles.
Last Game: Jan. 24, 2014 at Oregon State (L, 75-68)
Head Coach: Mike Neighbors (First Season)
Notable: Washington's Mike Neighbors is in his first season as head coach after being promoted when former coach Kevin McGuff left for Ohio State in April. The Huskies are led by the guard duo of Kelsey Plum (19.8 ppg) and Jazmine Davis (19.1 ppg). Plum went 6-for-6 on three-pointers and scored 27 points in a loss at Oregon State on Friday.
The Ducks' game on Sunday afternoon versus Washington will be broadcasted on the Pac-12 Networks, with Ann Schatz and former Pepperdine head coach Julie Rousseau on the call. Fans can also listen to Terry Jonz's call on the radio via KUGN 590 AM (Eugene), KUIK 1360 AM (Portland) and TuneIn Radio (online and mobile devices). Live stats are available at goducks.com.
On Friday night, in addition to Oregon defeating Washington State, Oregon State beat Washington, 75-68, USC won at No. 19 California, 77-70, No. 14 Arizona State narrowly won at Utah, 65-62, No. 4 Stanford beat UCLA, 72-55, at home and Colorado trumped Arizona, 68-47.
With a double-double on Friday night against Washington State, sophomore forward Jillian Alleyne (left) is now tied with Catherine Kraayveld and Arianne Boyer for sixth all-time in school history with 28 career double-doubles.
Four of the Pac-12's top five scorers will be in action on Sunday at Matthew Knight Arena. Oregon's Chrishae Rowe (2nd - 21.6 ppg) and Jillian Alleyne (3rd - 20.7 ppg) will do battle against Washington's Kelsey Plum (4th - 19.8 ppg) and Jazmine Davis (5th - 19.1).
Oregon and Washington rank No. 1 and No. 2, respectively, in the Pac-12 in team free throw percentage. The Ducks lead the conference at 72.7 percent while Washington is second at 69.7 percent. Individually, both UW's Kelsey Plum (3rd - 85.3 percent) and UO's Ariel Thomas (5th - 79.7 percent) rank in the top five in the conference. Washington State guards Lia Galdeira and Tia Presley entered Friday's game ranked No. 6 and No. 7 in the Pac-12 in scoring, respectively, averaging 37.9 points per game combined. The duo combined for 30 points on 7-of-30 shooting (14-of-18 at the free throw line) Friday night.
- Washington knocked off Oregon three times last year, including a 69-62 loss in the Pac-12 Tournament.
- Washington and Oregon have met six times over the last two seasons. The Ducks won the first regular season meeting in 2011-12 (88-86 in Eugene on Dec. 31, 2011) but Washington has won five straight, including two Pac-12 Tournament victories.
- The Ducks are 3-7 against the Huskies under head coach Paul Westhead. Westhead was victorious in his first meeting against UW, 82-71, on Jan. 1, 2010 in Eugene and the Ducks beat the Huskies in three of the first five meetings under Westhead, but have lost five straight.
- Washington won the first nine meetings in series, spanning from March 1, 1974 through March 11, 1978. That nine game winning streak is Washington's longest in the series.
- Oregon's longest winning streak in the series is 12 games, running from Feb. 8, 1996 through Dec. 28, 2001.
- The first meeting in the series was played in Eugene. Washington won, 50-39, on March 1, 1974.
- The last time Oregon swept both Washington and Washington State at home was on Jan. 6 and Jan. 8, 2011. They were the final women's basketball games played at 84-year-old McArthur Court.
2012-13: In the first round of the Pac-12 Tournament, Jillian Alleyne had a double-double, her 12th of the season, with 11 points and 15 boards against the Huskies. The Ducks led by as much as 22 points in the first half but were outscored 41-23 in the second half and lost, 69-62, on March 7, 2013.
2012-13: Washington's Kristi Kingma set the Pac-12 single-game record with 11 made three-pointers against the Ducks on Feb. 15, 2013 in Eugene. Kingma scored 35 points while Jillian Alleyne had 20 points for the Ducks.
2011-12: In Oregon's last victory over Washington, Ariel Thomas scored a team-high 21 points while Nia Jackson, a Seattle native, added 19 in an 88-86 win on Dec. 31, 2011 at Matthew Knight Arena. Danielle Love blocked Washington's potential game-winning shot with seconds left on the clock.
2010-11: In the final game played at McArthur Court, the Ducks defeated the Huskies and swept the Washington schools with a 68-64 win on Jan. 8, 2011 in front of 2,854 fans. Nia Jackson, a Seattle native, scored a game-high 22 points, and Nicole Canepa came off the bench to score 15 points. Oregon went 20-of-36 at the free throw line while Washington had just 17 attempts.
2009-10: Taylor Lilley joined the 1,000 point club at Oregon when she scored 33 while also breaking the school's career three-point record with eight triples in an 82-71 win against the Huskies on Jan. 1, 2010 in Eugene.
1980-81: Bev Smith set the single-game school record (which still stands) with 11 steals at Washington on Jan. 22, 1981. Smith also set the UO field goal attempts record against the Huskies that season with 30 shots versus UW on March 14, 1981. Chrishae Rowe broke that mark this season with 32 field goal attempts at Cal on Jan. 5.
Jazmine Davis scored 28 points to lead a furious second-half rally, and Washington beat Oregon 69-62 on March 7, 2013 in the opening round of the Pac-12 Conference tournament in Seattle, Wash. Talia Walton added 19 points and nine rebounds, while Aminah Williams had 11 points and 17 boards, for the fifth-seeded Huskies (20-10), who trailed by as many as 22 in the first half. Washington won despite shooting 32 percent from the floor, including 6 of 31 from 3-point range. Ariel Thomas led the No. 12 seed Ducks (4-27) with 13 points. Jillian Alleyne scored 11, and she and Liz Brenner grabbed 15 rebounds apiece. The Huskies went ahead for good, 61-60, on Walton's jumper with 4:17 to play, and Walton's 3-pointer with 1:13 left gave Washington a six-point lead and effectively clinched the win.
Oregon continues to lead the NCAA in scoring at 95.7 points per game. Oregon has reached 100+ points seven times this season and hit the century mark five straight games before scoring 96 points against Cal State Northridge on Dec. 29. The Ducks' 131 points against Bakersfield in the season-opener on Nov. 9 is the second most in any NCAA game this season (behind Kentucky's 133-130 4OT output against Baylor) and set new Pac-12 and school records. The Ducks' 130 points against Southern would have set both school and conference marks as well, if not for the 131 points scored against Bakersfield.
Oregon is third in the nation in made three-pointers, averaging 9.67 per game. Sacramento State, which defeated the Ducks at Matthew Knight Arena on Nov. 17, leads the nation at 13.3 made threes per game. The Ducks and Hornets combined to attempt an NCAA record 86 threes in thier game. Oregon would have tied the NCAA record with 52 three-point attempts against Southern on Dec. 18, but Sacramento State took 55 four days prior on Dec. 14 against UC Irvine.
This season Oregon is 8-0 when shooting better than 40 percent from the field but is 2-8 when shooting less than 40 percent. The Ducks defeated Pepperdine and Southern when shooting less than 40 percent while the Ducks have shot under 40 percent from the field in each of their eight losses. Most recently, Oregon knocked off Washington State, 82-66, when shooting 43.5 percent from the field. It was Oregon's first conference win and the first time the Ducks shot better than 40 percent against a league foe.
Oregon is 44-15 under head coach Paul Westhead when scoring 80-or-more points. The Ducks went 17-5 when reaching 80 points in 2009-10, Westhead's first and most successful season. Since then, Oregon has gone 9-3 in 2010-11 when scoring 80+, a perfect 8-0 in 2011-12 and 0-2 last season. This year, Oregon is 10-5 when reaching the 80-point mark.
Despite the Ducks' 1-6 start to conference play, sophomore Jillian Alleyne has consistently shined. The 6-foot-3 forward is averaging a team-high 21.0 points per game in five Pac-12 contests to go with an amazing 16 rebounds per game. Alleyne has posted a double-double against all seven Pac-12 foes the Ducks have met this season, including 26 points and 13 rebounds at No. 4 Stanford to open league play on Jan. 3. She had 15 points and season-high 20 rebounds on Jan. 17 at UCLA and 21 points to go with 19 rebounds in the Ducks' win over Washington State on Jan. 24.
Jillian Alleyne leads the nation in rebounding at 14.9 per game. She upped her average after grabbing 19 rebounds on Friday night against Washington State. She has grabbed 10+ rebounds in 16 of 18 games this season, only coming up short when she went out with a rolled ankle against Sacramento State and when she grabbed nine boards at No. 1 ranked UConn on Nov. 20. If the season ended today, her 14.9 rebounds per game would smash the single-season school record of 13.6, held by Bev Smith during the 1979-80 season. Bev Smith also holds the total rebounds record with 376 during the 1980-81 season. Alleyne came up just seven rebounds short of break that mark last season as she pulled down 370 boards in her freshman campaign. She has 269 rebounds this year, putting her on pace for 447 boards if she keeps her current average.
Jillian Alleyne posted her 28th career double-double (in 49 career games played) and her NCAA-leading 16th of the season on Sunday afternoon at USC. She has a double-double in 14 straight games. Alleyne was tied for third in the Pac-12 last year as a freshman with 12 double-doubles, when she was selected Pac-12 Freshman of the Year in the media vote. Right now Alleyne ranks sixth all-time at Oregon in career double-doubles. She is tied with Catherine Kraayveld (2000-05) and Arianne Boyer (1993-97). Amanda Johnson's 30 career double-doubles ranks fifth all-time. The school record is 88, set by Bev Smith from 1978-82. Smith also holds the single-season record, with 24 double-doubles during the 1981-82 season.
Chrishae Rowe leads all freshman, scoring 21.6 points per game. She ranks 22nd in the NCAA overall. She and Washington's Kelsey Plum (46th, 19.8 ppg) are the only freshman ranked in the top-50 in the nation in scoring. Rowe is also the top scoring underclassman in the nation, as every player above her in the rankings are juniors or seniors.
Last year Jillian Alleyne shot 53.8 percent from the free throw line in her otherwise stellar freshman campaign. This year, the sophomore now ranks ninth in the Pac-12 at 77.4 percent, an improvement of 23.6 percent. Of the top 15 in the Pac-12 in free throw percentage, Alleyne has the most makes and attempts (106-of-137).
Oregon not only leads the Pac-12 in scoring at 95.7 points per game, the Ducks lead the Pac-12 in free throw percentage (72.7 percent), rebounds (52.6 per game), steals (11.61 per game) and turnover margin (+4.28 per game). Oregon also leads the Pac-12 in made three-pointers (9.67 per game) plus offensive rebounds (22.11)
Oregon improved 11 spots in the Sagarin RPI from 77 to 66, after defeating Washington State on Friday night. Oregon checks in at 86 in the RealTime RPI and is still 92 in the NCAA RPI (updated after the weekend).
In the NCAA, a team has taken 100 or more field goal attempts in a game this year just four times. Oregon accounts for three of those instances. Baylor attempted a NCAA-high 105 shots against Duke in a four-overtime game, while the Ducks attempted 102 shots on Dec. 18 against Southern plus 101 shots against both No. 23 ranked California on Jan. 5 (OT) and Bakersfield on Nov. 9.
Oregon has reached 100+ points seven times this season. The Ducks scored a Pac-12 record 131 points in their season-opening win over Bakersfield and 113 points in a victory versus Portland. The Ducks scored 100+ points in five straight games, including 130 on Dec. 18 in a 40-point win over Southern and 124 points on Dec. 20 against Cal Poly. The Ducks failed to reach 100 in their last four games. The Ducks are averaging 81.3 points per game through three league contests. Under head coach Paul Westhead, Oregon has reached the century mark 14 times, winning all but one of those games (13-1).
With the new 10-second backcourt violation rule in place this season, Oregon's press-and-run style should benefit. Thus far, Oregon has forced four 10-second backcourt violations, with one against Portland on Nov. 12, one versus Sacramento State on Nov. 17, one against Portland State on Dec. 14 and one at No. 23 ranked California on Jan. 5.
Oregon is 45-35 at home under head coach Paul Westhead. The Ducks averaged 11 home wins per season under Westhead before last year, when Oregon won three games at Matthew Knight Arena. His best record was in his first season, 2009-10, when the Ducks boasted a 14-6 home mark, which included six Pac-12 victories. Oregon is 9-2 at Matthew Knight Arena this season overall and 1-1 in Pac-12 play. The Ducks are 1-6 on the road overall and 0-5 in Pac-12 play.


text:
(0) items
Edition: 3rd
Author(s): Campbell, Neil A.; Reece, Jane B.; Heitz, Jean
ISBN: 9780321522931 / Paperback / 12/14/2007
Marketplace Disclaimer:
Edition, Cover Design, etc may vary from the eCampus.com description. Please refer to the seller's comments before ordering. Marketplace sellers are required to ship by the end of the 5th business day. Items are not returnable to eCampus.com. Orders cannot be cancelled by eCampus.com.


text:
On Feb. 27, The Pokémon Company International announced that starting in March, Netflix would begin streaming the "Pokémon" animated series, based on the popular video game franchise.
Netflix will begin streaming both the first season, "Pokémon: Indigo League," and the most recent season, "Pokémon: Black and White." Both seasons give fans the chance to catch up on the adventures of Ash Ketchum and Pikachu, and to see how the storied adventure began for the young trainer from Pallet Town.
While "Pokémon: Indigo League" will only be available to Netflix members in the United States, Canada, the United Kingdom, and Ireland, the most recent season, "Pokémon: Black and White," will be available to all Netflix members. In addition, both "Pokémon: Black and White" movies, "Pokémon the Movie: Black—Victini and Reshiram" and "Pokémon the Movie: White—Victini and Zekrom," will also be available to all Netflix members.
You can begin your "Pokémon" marathon when Netflix begins streaming the animé on March 1.


text:
Commentary: Gentrifying NASCAR
Commentator Scott Huler tries to make peace with changes in the sport of NASCAR now that it has become more popular with upscale fans and sponsors.
You must be signed in to leave a comment. Sign In / Register
Please keep your community civil. All comments must follow the NPR.org Community rules and terms of use, and will be moderated prior to posting. NPR reserves the right to use the comments we receive, in whole or in part, and to use the commenter's name and location, in any medium. See also the Terms of Use, Privacy Policy and Community FAQ.


text:
|Gananda loses to Avon in home tournament
Avon defeated tournament host Gananda 62-48 on Thursday. The loss was the second straight for Gananda who falls to 5-2 on the season.
Tyler Hite led all scorers with 19 points while Riley Palmer led the way for the Blue Panthers with 11.
blog comments powered by Disqus <<< Back to the FingerLakes1.com Homepage | News Desk | Sports Page | Living Section | Business | Technology
FingerLakes1.com Network SITE MAP