text:
Meatballs: A Happy Food In Hard Times
At the recent New York Wine and Food Festival, the Meatball Madness competition was sold out. That madness is spreading all over the country. Americans think of meatballs perched on top of spaghetti all covered in cheese, but meatballs are universal. Weekend Edition commentator Bonny Wolf reports on the latest foodie trend shaking things up.
Copyright © 2011 NPR. For personal, noncommercial use only. See Terms of Use. For other uses, prior permission required.
In hard times, comfort food can be reassuring so perhaps that's why one of the latest foodie trends shouldn't be much of a surprise. Gourmet meatballs, anyone? WEEKEND EDITION food commentator Bonny Wolf takes note.
BONNY WOLF, BYLINE: If you live in New York City, you've seen this coming. The meatball shop opened last year in the Lower East Side and has been so popular there are now three of them offering meatballs with your choice of sauce. Uptown is an Italian restaurant called Polpette. Translation, meatball. A few weeks ago, The Meatball Factory opened near Gramercy Park. There's even a bartender, excuse me, mixologist in New York who makes what he calls a meatball cocktail. It involved frying spicy sausages then draining the fat into Irish whiskey.
At the recent New York Wine and Food Festival, the meatball madness competition was sold out. The judge's choice award went to the Little Owl Restaurant's gravy meatball slider, a recipe from the owner's grandmother. They sell more than 1,000 a week. The madness is spreading. Meatballs are served with butter and thyme in Chicago and made of foie gras in Minneapolis. L.A.'s Great Balls on Tire's meatball truck urges patrons to join the re-ball-ution.
Meatballs are now on the menu at Appleby's and neighborhood delis. And in the nation's capitol, James Beard award-winning chef Michel Richard known for sophisticated French cuisine has just opened a restaurant called Meatballs. Do they even have meatballs in France? Americans think of meatballs perched on top of spaghetti all covered in cheese, but meatballs are universal. Spanish albondigas are popular tapas. Greek keftedes are made with lamb and mint and Japanese sec une (sp) use chicken and ginger.
Thai, Chinese, Vietnamese, Moroccan and Indian cuisines all feature spherical meats. And let us not forget the Swedish meatball. Variations on these themes are played out in the new meatballeries. The meatball madness winners included a goat curry ball and a rabbit ball. There are meatballs made with lean meats such as bison and ostrich. There are jambalaya balls and turducken balls. There are even vegetarian meatballs, whatever that means. And if you want to make balls at home, at least six new books have been published in just the last two months focusing on the food orbs.
Why meatballs? They're affordable and familiar. They're a happy food in hard times. To quote from the new meatball shop cookbook, "meatballs are the ultimate cure-all for anything that ails you."
CORNISH: Bonny Wolf is working on a book about the foods of Maryland's Eastern Shore.
CORNISH: This is NPR News.
Copyright © 2011 NPR. All rights reserved. No quotes from the materials contained herein may be used in any media without attribution to NPR. This transcript is provided for personal, noncommercial use only, pursuant to our Terms of Use. Any other use requires NPR's prior permission. Visit our permissions page for further information.
NPR transcripts are created on a rush deadline by a contractor for NPR, and accuracy and availability may vary. This text may not be in its final form and may be updated or revised in the future. Please be aware that the authoritative record of NPR's programming is the audio.
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. 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:
Saturday, March 08, 2014
Follow us:
Western NY
A 12-year-old boy was robbed and assaulted after getting off an RTS bus Thursday afternoon.
According to Rochester Police, it happened around 2:20 p.m. on Frederick Douglass Street. Police say the boy got off the bus and was followed by several suspects.
Two suspects took the boy's cell phone and other electronic devices. Police say a third suspect then began assaulting the boy. He refused medical treatment.
The suspects fled the scene.
Anyone with information is asked to call 911.

subset: commoncrawl


text:
Babe of the Day Mayra Tinajero Considers Herself a Luxury Automobile
Mayra Tinajero is a professional model from San Diego, California.
Mayra Tinajero is a professional model from San Diego, California.
Nikki Blades is professional model and current Maxim Hometown Hottie Finalist.
Celeb Crush Caitlin O'Conner did the reverse commute to stardom -- she was born in Hollywood, California and moved to Uniontown, Pennsylvania as a kid. It's usually the other way around.
Your search for the perfect woman might be over.
Katie DeLuca doesn't only have big you-know-whats, but the sexy model also has a big brain.
Chassidy Luke can be anything you want her to be -- that is, because she's a multi-talented model.
Mayra Tinajero is a model from San Diego. You may remember her as a Maxim Hometown Hotties contestant in 2011. She finished in the Top 10 out of, like, a zillionhot girls. Mayra does promotional, catalog and print modeling and has worked for Falken Tire Cor
Meredith Parkeris a 25-year-old model from Bath, Maine (which sounds like the cleanest place in the world). A 2010 Maxim Hometown Hotties finalist, Parker is an avowed Boston Red Sox fan and lifelong New Englander. She's done glamor, lingerie, swimsuit and promotional modeling.
A h
A 25-year-old model from Chicago, Jelena Kosticis a graduate of DePaul University where she majored in political science. A part-time model for several years, Kostic is only now beginning to put more effort into her career now that her classwork is finished.
Jelena's biggest break came when she entered the Maxim Hometow
We're calling it. It's possibly the closest race we've ever seen, but we're calling it for Aiyana.
MarianaAG is a 29-year-old swimsuit and glamour model from West Palm Beach, Florida.


text:
Fremont, NE Considers Steep Property Tax Hike to Defend its Anti-Immigrant Law
Outlining just how costly it is for states and municipalities to be anti-immigrant, the City Council of Fremont, Nebraska is weighing a hefty 18% property tax hike to bankroll defending its controversial anti-immigrant local ordinance in court. The law was set to go into effect on July 31, but had been put on hold pending a lawsuit in federal court. |


text:
Hi there at our free ringtones website, where you may download hot ringtones for your mobile phone. Today we have a ringtone of "Farmhouse" by phish as well as 674 other ringtones by phish. "Farmhouse" is a real hit from the "Farmhouse" album that was made by phish at their recording studio together with other 12 tracks. You can listen to all 9 phish – "Farmhouse" ringtone variations available here and download it for free in a click. You can also take a glance at other 19 albums produced by phish for all time. "Farmhouse" is referred to Jam, and you may listen to a huge amount of Jam collaborations absolutely for free. And finally, we have collected lyrics for this track and you can view it here as well. So feel free to browse, listen, download ringtones at Audiko.net. Make your phone sound cool!
phish Farmhouse Ringtone
Similar Ringtones
Browse Genres
Alternative Chill Classic Rock Jam Jam Band Jam Bands Jamband Progressive Rock Psychedelic Rock
Albums by phish
Top ringtones by phish
New ringtones
- Spiel mir das lied vom Tod - Lied vom Tod
- - prince royce - Prince Royce - Stand By Me
- 3m8s - Don't You Worry Child - Swedish House Maffia
- Nazar - Sweet 16 feat. Projekt Elias
- Nazar - Pyramiden Hinterm Mond feat. Projekt Elias
- Optiv & CZA - In Too Deep
- Bicycle Horn Sound Effects - Bicycle Horn Sound Effect Ringtone
- Volxsturm - Nur wir 2
- 乧뭬 - 倀漀爀挀攀氀愀椀渀 倀爀椀渀挀攀猀猀ᤠ 倀愀氀愀挀攀
- hey hey - v


text:
Poll: Social Butterfly or Relaxing Recluse?
How has your social life been while pregnant?
9% | Great! I want to squeeze in as much as I can before life gets crazy. | ||||||
51% | So-so. I like to see my friends, but am also happy to be home. | ||||||
40% | Nonexistent. All I want to do is stay home with my feet up. | ||||||
35 Total votes cast. |
Top Polls:
Rewarding Good GradesIs it okay to reward good grades with cash?
Family History
How much do your kids know about their ancestors?
If your child were the victim of a bully, what would you do first?
Thanksgiving Main Course
What's the main course for your family's Thanksgiving feast?
Spanking at School
Would you support a policy of corporal punishment at your child's school?


text:
Wednesday, March 19, 2003
Valpo's home baseball games against Ball State, scheduled for 2 p.m. Wednesday, and against Winona State on Thursday (2 p.m.), have been postponed due to wet field conditions. The game against Ball State could be rescheduled.Copyright ©2014 Valparaiso University Athletics. All Rights Reserved. | www.ValpoAthletics.com |


text:
Assessing Readiness for Change
Is your organization ready for a major change? How can you tell? What can you do if it isn't? To get a handle on change:
Building Commitment to Change
A successful change needs the support of your employees. To win that support, you need to know the:
Aligning Your Organization
All components of your company must be in alignment with a major change. Learn:
Non-Member Registration Fee: $95.00 Member Registration Fee: $85.00 Student Registration Fee: $50.00 Duration: 1 hour 30 minutes


text:
relms Registered: Jan 28, 2005 Total Posts: 2064 Country: United States |
I will have to keep your technique in mind if it ever again gets cool enough in Florida for it to work. Vaseline also does the trick if you can bring yourself to put it on your lens. |
Travis Rhoads Registered: Apr 28, 2009 Total Posts: 3621 Country: United States |
I have seen this technique used before. I think it works here, make it feel very humid...you were adding it, and I worked like mad last week to keep it off my lens! |


text:
Sunday, March 9, 2014 | 3:40 p.m.
Hi, (not you?) | Member Center | Sign Out
Updated: 9:03 p.m. Wednesday, Oct. 31, 2012 | Posted: 8:55 p.m. Wednesday, Oct. 31, 2012
By Doug Harris and Staff Writer
The interception he made on a deflected pass in the end zone against Purdue is almost a distant memory for C.J. Barnett. He figures he just was in the right place at the right time. Those are plays he expects to make.
But the Ohio State junior safety still dwells on the many chances he's had to commit larceny, only to allow opponents' passes to sail through his fingers. Those are plays that are tough to shake.
"I think I've had six dropped picks so far, which is ridiculous," he said.
"I'm trying to let it slide, but it just kept happening. In the Indiana game, I think I dropped like three of them. … If I make those plays, it's a different game. You've got to make those plays when they come to you. If not, they'll get someone else in there."
Barnett's spot in the starting lineup, though, certainly is secure. The Northmont High School grad cracked the first string as a redshirt freshman in 2010, but played only two games before suffering a season-ending knee injury.
He started all of last season and has been a steadying influence in the secondary this year. He missed three games with an ankle sprain, and it's probably no coincidence OSU has had its best defensive showings in the two full games he's played since his injury.
"I think my role back there is just to be someone who's calm and collected," he said. "I never get too up, never get too down. I show emotion sometimes, but usually I'm the guy that calms everyone down. … I would describe my role, I guess, as the granddaddy back there."
The Buckeyes likely will need the veteran perspective Barnett can provide on Saturday when they host woeful Illinois, which is on a five-game losing streak.
They've done their best work against the top teams, especially in night games. But lesser opponents have given them fits.
"Sometimes I've been around teams like that," coach Urban Meyer said. "The Nebraska atmosphere, the Penn State atmosphere, we played our best games. I've addressed that. … I'm kind of counting on our guys going out there, growing up, performing and not worry whether it's prime time or not."
Schedule update: The Buckeyes have agreed to a two-game series with Boston College in 2020 and '21, the same seasons they'll face Oregon.
In the next 11 years, they'll also play two games apiece against Virginia Tech, Oklahoma, Cincinnati, North Carolina, TCU and Texas.
Kudos from coach: Quarterback Braxton Miller was asked what he thought of Meyer finally backing him as a Heisman Trophy candidate.
"It's an honor to put my name in the Heisman thing," he said. "You just work each and every day, and you never know what's going to happen at the end. … You (can) win awards with our offense. It's supposed to make big plays."
Next game
Who: Ohio State (9-0, 5-0 Big Ten) vs. Illinois (2-6, 0-4)
When: 3:30 Saturday
Where: Ohio Stadium
Radio: WING-AM (1410)
Advertisers & Sponsors |
© 2014 Cox Media Group. By using this website,
you accept the terms of our Visitor Agreement and Privacy Policy, and understand your options regarding Ad Choices.
Already have an account? Sign In
{* #registrationForm *} {* traditionalRegistration_displayName *} {* traditionalRegistration_emailAddress *} {* traditionalRegistration_password *} {* traditionalRegistration_passwordConfirm *}Already have an account? Sign In
{* #registrationFormBlank *} {* registration_firstName *} {* registration_lastName *} {* traditionalRegistration_displayName *} {* traditionalRegistration_emailAddressBlank *} {* registration_birthday *} {* registration_gender *} {* registration_postalZip *} {* traditionalRegistration_passwordBlank *} {* traditionalRegistration_passwordConfirmBlank *} {* agreeToTerms *}We have sent you a confirmation email. Please check your email and click on the link to activate your account.
We look forward to seeing you frequently. Visit us and sign in to update your profile, receive the latest news and keep up to date with mobile alerts.
Don't worry, it happens. We'll send you a link to create a new password.
{* #forgotPasswordForm *} {* forgotPassword_emailAddress *}We have sent you an email with a link to change your password.
We've sent an email with instructions to create a new password. Your existing password has not been changed.
To sign in you must verify your email address. Fill out the form below and we'll send you an email to verify.
{* #resendVerificationForm *} {* resendVerification_emailAddress *}Check your email for a link to verify your email address.


text:
'Vanya and Sonia and Masha and Spike' wins Tony
Sunday - 6/9/2013, 10:04pm  ET
AP Drama Writer
NEW YORK (AP) -- Christopher Durang's comical "Vanya and Sonia and Masha and Spike" has won the best play Tony Award.
The play, which takes characters and themes from Anton Chekhov and sets them in present-day Pennsylvania, stars Sigourney Weaver, Kristine Nielsen and David Hyde Pierce. It centers on three middle-aged siblings uneasily negotiating with age and hysterically mixes in references to Lindsay Lohan, Maggie Smith and ancient Greek drama.
Durang, whose other works include the play "Beyond Therapy," was a Tony nominee for "A History of the American Film" and his "Miss Witherspoon" was a Pulitzer Prize nominee in 2006.
"Vanya and Sonia" beat out Tony contenders "The Assembled Parties," ''Lucky Guy" and "The Testament of Mary."
Copyright 2013 The Associated Press. All rights reserved. This material may not be published, broadcast, rewritten or redistributed.


text:
Category: Violence Against Women
Jean Friedman-Rudovsky writes for Vice (TRIGGER WARNING): "For a while, the residents of Manitoba Colony thought demons were raping the town's women. There was no other explanation. No way of explaining how a woman could wake up with blood and semen stains smeared across her sheets and no memory of the previous night. No way of explaining how another went to sleep clothed, only to wake up naked and covered by dirty fingerprints all over her body. No way to understand how another could dream of a man forcing himself onto her in a field—and then wake up the next morning with grass in her hair."
Read More...Katie J.M. Baker writes for Jezebel: "The word 'rape' does not factor into Yale's new report on how the university is handling sexual misconduct; instead, the act is described as 'nonconsensual sex,' and it's usually punishable by 'written reprimand.' (Sometimes rapists have to spend some time thinking about respect!) According to the report, five of the six people Yale identified as nonconsensual sex-havers over the past six months either graduated without much stress or will be returning to campus in the fall."
Read More...Sania Salman writes for Policy Mic: "International agencies annually report statistics highlighting the continued struggle of women around the world. For example, the International Center for Research on Women reports 51 million girls under the age of 18 are married, while an additional 10 million are married underage — making that one girl every three seconds. Another ICWR publication surveyed six countries: Brazil, Chile, Croatia, India, Mexico, Rwanda. The results indicate that between 20-40% of men admitted to having perpetrated violence against a female partner. In these same countries, approximately 30-40% of women reported that they have been physically abused by an intimate male partner."
Sania Salman is the summer 2013 NOW/PAC intern.
Read More...Keith Moore writes for BBC News: "A petition calling on Twitter to add a 'report abuse' button has received thousands of signatures. It follows a deluge of abuse and rape threats received by Caroline Criado-Perez, who successfully campaigned for women to be included on UK banknotes."
Read More...Tara Culp-Ressler writes for Think Progress: "The University of Colorado Boulder is facing a federal investigation to determine whether it has violated Title IX, a gender equity law requiring colleges to provide equal access to education that is free from sexual assault or gender-based harassment. The investigation comes in response to one student's complaint that CU Boulder was too slow to punish her rapist — waiting months to remove him from campus, fining him $75, and requiring him to do a five-page paper 'reflecting on his experiences.'"
Read More...Max Rivlin-Nadler writes for Gawker: "Making the rounds in the days leading up to the Zimmerman verdict was the story of Marissa Alexander, a Florida woman now serving up to 20 years in prison for firing a warning shot in the area of her abusive husband, who was in her home against her wishes."
Read More...From BBC News Health: "More than one in three women worldwide have experienced physical or sexual violence, a report by the World Health Organization and other groups says. It says 38% of all women murdered were killed by their partners, and such violence is a major contributor to depression and other health problems."
Read More...Katie McDonough writes for Salon: "A measure to bring in independent prosecutors to decide which sexual assault cases in the military go to trial was blocked late Tuesday night after Armed Services Committee Chairman Sen. Carl Levin (D-Mich.) sided with military officials seeking to keep prosecution of sexual assault within the chain of command."
Read More...Wagatwe Wanjuki writes for RH Reality Check: "When it was announced earlier this month that the Supreme Court had ruled, in Maryland v. King, that police officers can collect DNA samples from people who have been arrested for (but not convicted of) a serious crime, many rape survivors rejoiced. I was not one of them."
Read More...Hannah Slater writes for ThinkProgress: "On Tuesday, the Senate Armed Services Committee convened a hearing on sexual assault in the military. The Joint Chiefs of Staff and Judge Advocate Generals of the Armed Forces testified, discussing proposals to address this problem. This year's Defense Department annual report on sexual assault revealed the disturbing trend that rates of sexual assault in the military rose by 34 percent between 2010 and 2012 and that only 3 percent of assaults were prosecuted last year. The personal stories of survivors further illuminate a shameful failure to effectively address this problem so far, and highlight the need for reform."
Read More...Cheryl Thomas, director of the Women's Human Rights Project, writes at MinnPost: "As the news from Cleveland, Ohio, and the sexual assaults in the military continue to horrify us, I have the nagging sense that we are profoundly and dangerously naïve to be shocked at the brutality that went on in the Seymour Avenue home in Cleveland and on our nation's military bases."
Read More...The Editorial Board of The Washington Post writes: "The battles over child custody that unfold in courtrooms across the United States don't get much attention. If a celebrity is involved, there might be headlines, but publicity is generally shunned out of the not-unreasonable urge to protect the privacy of children. Unfortunately, though, that has tended to shroud problems in how these critical decisions are made. That's why a conference focusing attention this week on systemic issues in family court is so important."
Read More...Anastasia Moloney writes for the Thomas Reuters Foundation: "In a courtroom in Guatemala's capital, Guatemala City, a landmark genocide trial that has raised victims' hopes that justice will prevail is nearing an end.
Former Guatemalan dictator Jose Efrain Rios Montt - the first ex-head of state to stand trial for crimes against humanity in his own country - and his former intelligence chief Jose Mauricio Rodriguez are facing charges of genocide and crimes against humanity under Rios Montt's 1982-1983 rule."
Read More...Tom Vanden Brook writes for USA Today: "Facebook has removed a page that denigrated women in the Marine Corps after a House member complained to the Pentagon and called the page another example of the military's lax attitude toward sexual harassment."
Read More...Max Fisher writes for The Washington Post: "A new study in the American Sociological Review, by Rachael S. Pierotti of the University of Michigan, looks at the attitudes of women in 26 different countries toward intimate partner violence. The findings, which could be potentially quite important for curbing domestic violence, suggest that global cultural attitudes increasingly reject it, and that women who are exposed to these ideas are more likely to adopt them."
Read More...


text:
It's time now to crown another Classroom Champion and this week we congratulate Claudia O'Connell of St. Joseph Catholic School.
News 3 Sports would like to congratulate our latest Classroom Champion Claudia O'Connell. The St. Joseph Catholic School senior has a 3.4 Grade Point Average and she's ranked in the top fifty percent of her class.
Claudia is the captain of the St. Joseph Cheerleading Squad. She's also a member of the basketball, track, soccer, volleyball, and cross-country teams. Claudia is also an All-American Cheerleader and placed fifth in the state track meet in the 300m hurdles, and she was a Regional Qualifier in the Discus. Academically, she's the vice president of her class, a member of the Choir, Student Council, Eagles for Life, and a Class Officer.
"Claudia wants to succeed, and she is driven to succeed. I think that's just fascinating, when people are driven to succeed the way she and a lot of the students at St. Joseph are. I would assume a lot of it came from her parents; that she was raised well. And, I think a lot of it has to do with environment that she's in here at the school. Where there's a lot of emphasis on personal success and personal achievement."
"She stepped up from the barrel last year to a vital role on our team, as a middle blocker. She's excelled in that role. Claudia's a very competitive, very intense player. She's a leader during practices and games, and a very important part of our varsity team. She really wants to excel in everything and improve everything she's doing. And I think she really wants our team to move on this year to the playoffs. And she's dedicated to do her personal part to impact the team and make them succeed this year."
"Leading by example is really important to me, because as a senior you have younger students who look up to you. I want to be a good role model for all of my classmates. Being a scholar athlete doesn't come easy to me. Because when you get home late at night from a game or a practice; it's hard to do your homework. But you always have to get it done and have it ready to go for the next days class."
Claudia plans on attending Benedictine College and majoring in nursing and running track.
Congratulations to Claudia O'Connell of St. Joseph Catholic School. This week's News 3 Sports Classroom Champion!
To comment, the following rules must be followed:
Comments may be monitored for inappropriate content, but the station is under no legal obligation to do so.
If you believe a comment violates the above rules, please use the Flagging Tool to alert a Moderator.
Flagging does not guarantee removal.
Multiple violations may result in account suspension.
Decisions to suspend or unsuspend accounts are made by Station Moderators.
Questions may be sent to firstname.lastname@example.com.
Please provide detailed information.


text:
Actress Emma Watson visits "Late Show with David Letterman" at the Ed Sullivan Theater on July 8, 2009 in New York City. Emma Watson And Queen Latifah Visit "Late Show With David Letterman" - July 8, 2009 Ed Sullivan Theater New York, NY United States July 8, 2009 Photo by Jeffrey Ufberg/WireImage.com To license this image (57865035), contact WireImage.com
UPLOADED ON 2009-07-08 19:25:02 PHOTO BY Jeffrey Ufberg/WireImage.com
Netflix - Try for Free
Instantly watch TV episodes and movies via the Internet on your computer or TV. 1 month FREE!


text:
Rayman Raving Rabbids 2 (DS)
Manufacturer: Ubisoft Entertainment Part number: 16383
$16.51 at 1 online store
- CNET Editor rating: 3.0 stars Good
- Average user rating: 0 stars No reviews, write one!
- More product information:
- Editors' review
- User reviews
- Specifications
- Manufacturer info
- Description:
- The Rabbids strike again! The mischievous bunnies are back in a hilarious sequel that is guaranteed to be even crazier and funnier than the first - and with even more wacky games! They've invaded the world of Rayman, and now the insane Rabbids have a new objective: invade planet Earth! They have established their base at a shopping mall ... Read more
Where to buy
store | customer rating | inventory | tax & shipping | price |
| In stock Get free shipping on orders over $35.00 | Enter zip code to get total price: Price +Tax +Shipping =Total price | as of 03/11/2014 |
*Total price for the Rayman Raving Rabbids 2 (DS) are estimated and may vary slightly based on exact tax, shipping, manufacturer rebate or any sale/promotion on the merchant site.


text:
A Scenario- Based Performance Evaluation of Multicast Routing Protocols for Ad Hoc Networks Manoj Pandey and Daniel Zappala Computer Science Department Brigham Young University Provo, UT 84602- 6576 { manoj, zappala}@ cs. byu. edu Abstract Current ad hoc multicast routing protocols have been de-signed to build and maintain a tree or mesh in the face of a mobile environment, with fast reaction to network changes in order to minimize packet loss. However, the performance of these protocols has not been adequately examined under realistic scenarios. Existing performance studies generally use a single, simple mobility model, with low density and of-ten very low traffic rates. In this paper we explore the perfor-mance of ad hoc multicast routing protocols under scenarios that include realistic mobility patterns, high density and high traffic load. We use these scenarios to identify cases where existing protocols can improve their performance. Based on our observations, we make a series of recommendations for designers of multicast protocols. 1 Introduction Mobile ad hoc networks have numerous practical appli-cations, such as emergency and relief operations, military exercises and combat situations, and conference or class-room meetings. Each of these applications can potentially involve different scenarios, with movement pattern, density and traffic rate dependent on the environment and the na-ture of the interactions among the participants. For exam-ple, in a search- and- rescue operation, individuals may fan out to search a wide area, resulting in a fairly regular pattern of movement, low density, and low traffic rate. In a battle-field scenario, the movement of soldiers may be heavily in-fluenced by the movements of their commander, with higher density and a higher traffic rate. In other cases, the environ-ment itself may give rise to movement patterns and density, such as patrons visiting an exhibit hall and moving among a selected group of displays. In addition, depending upon the communication need, applications can be very demanding, requiring the system to support very high traffic rates. To enable group communication in these scenarios, a number of ad hoc multicast routing protocols have been pro-posed [ 15, 10, 22, 12, 14, 5, 18, 24, 3]. In making the tran-sition from wired to wireless networking, protocol designers have focused on the obvious challenge of designing a mul-ticast routing protocol that can cope with a mobile environ-ment. As a result, the main goal of most ad hoc multicast protocols is to build and maintain a multicast tree or mesh in the face of a mobile environment, with a fast reaction to network changes so that packet loss is minimized. While most ad hoc multicast protocols have met this ba-sic design goal, their performance has not been adequately examined under realistic scenarios. Existing performance studies in this area suffer from three common flaws: • Simplistic mobility models. Existing studies use either a Uniform mobility model [ 16] or the Random Way-point model [ 10, 22, 12]. It is well known that because these models utilize random, independent movements they do not reflect realistic usage patterns. A number of researchers have evaluated unicast routing performance under a variety of mobility patterns [ 13, 9, 1], using more elaborate models and metrics to capture their ef-fect on routing performance. Our study is the first to apply this methodology to examine multicast routing performance. • Low density. Many evaluations use only 50 mobile nodes in a 1000m2 square field and a 250mradio range, which often leads to a density of less than 10 nodes within radio range [ 16, 12, 14, 5]. However, there are many common scenarios in which a network may have many more users in a small area – any situation in which there is a planned gathering or a crowd. This density will likely result in congestion and packet loss; because some protocols use packet loss as an indicator for mobility they may react in precisely the wrong way. Moreover, multicast protocols are often built on top of broadcast, such as for source discovery or tree repair, Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE and these mechanisms will cause excessive overhead in high density scenarios. • Low traffic load. Current evaluations generally employ a very low data rate of 2 to 20 kbps [ 10, 14, 18, 24, 3], with only a few using rates as high as 80 to 200 kbps [ 12, 19, 15]. Clearly, a protocol that performs very well at lower traffic rates may not be able to handle higher traffic rates efficiently. In addition, while some theo-retical work has examined the capacity of ad hoc net-works [ 8, 17], no one has examined the fundamental question of whether multicast routing protocols can ac-tually reach these limits. In our study, we try to rectify these shortcomings by ex-amining the performance of two common multicast rout-ing protocols – ODMRP [ 15] and ADMR [ 10] – under sce-narios that include realistic mobility patterns, high density, and high traffic load. We use a simulation- based perfor-mance evaluation so that we can thoroughly examine pro-tocol behavior in a controlled environment. Our goal in this work is to impact how future multicast routing proto-cols are designed by identifying general cases where existing protocols can improve their performance. Accordingly, we identify specific mechanisms that cause performance bottle-necks, then generalize our experiences into a set of recom-mendations for multicast protocol designers. We first explore multicast routing performance using re-alistic mobility models, similar to those described in the IM-PORTANT framework [ 1] and other unicast evaluations. To the best of our knowledge, this is the first time that multicast routing protocols have been examined over a wide range of mobility patterns. Our goal is to sort through the overwhelm-ing number of models and metrics and identify the key areas where protocol designers should focus their attention. In studying this scenario, we show that multicast perfor-mance is largely predicted by two key mobility metrics – the frequency of link breaks and the density of the mobility pat-tern. This enables protocol designers to focus on optimizing performance with respect to these metrics, regardless of the particular usage scenario. We find that ODMRP does not re-act quickly to link breaks because it must rely on a periodic broadcast from the source in order to find members that have moved. ADMR reacts more quickly, but at the cost of much higher transmission and control overhead. There is certainly room for a protocol that achieves better tradeoffs. Our second scenario examines multicast performance un-der high density, which we believe will be a common case for ad hoc networks. While ODMRP handles this scenario very well, ADMR throughput is severely impacted by den-sity. In this scenario, ADMR experiences congestion col-lapse at about 25 kbps, performing even worse than flooding, while ODMRP can achieve rates in excess of 200 kbps. We analyze ADMR's poor performance and show that it is due to its use of explicit acknowledgments and its assumption that all packet loss is a sign of mobility. We design several mod-ifications of ADMR that correct this problem and dramati-cally increase throughput in this scenario without affecting its performance in other situations. Our last scenario examines multicast performance under high traffic load. We find that ODMRP performs signifi-cantly better than ADMR, but both experience high packet loss as the traffic rate increases. Packet size plays an im-portant role in reaching high capacity – sending fewer large packets is generally better than sending many small packets. We then extend recent theoretical results for the capacity of ad hoc networks to the case where multicast traffic is trans-mitted, and find that the number of hops in the multicast tree is a critical factor. We argue that for this scenario it is better to use a multicast tree rather than a mesh. 2 Background We have chosen to study the performance of ODMRP and ADMR in these scenarios because they operate on-demand rather than proactively maintaining routes. Several performance studies indicate that these protocols perform well [ 16, 10]. In addition, ODMRP is mesh- based whereas ADMR is tree- based, providing us a perspective on both types of protocols. 2.1 ODMRP ODMRP is a mesh- based demand- driven multicast proto-col, similar to DVMRP [ 23] for wired networks. A source periodically builds a multicast tree for a group by flooding a control packet throughout the network. Nodes that are members of the group respond to the flood and join the tree. Nodes that are on the tree use soft state, meaning their status as forwarders for a given group times out if not refreshed. Because the forwarding state is shared among all sources for a given group, the set of forwarders for a group forms a mesh, providing robustness for the mobile receivers. In particular, an active ODMRP source periodically floods a JOIN QUERY message throughout the entire net-work. Each node receiving this message stores the previ-ous hop from which it received the message. When a group member receives the JOIN QUERY, it responds by sending a JOIN REPLY to the source, following the previous hop stored at each node. Nodes that forward a JOIN REPLY create soft forwarding state for the group, which must be renewed by subsequent JOIN REPLY messages. If the node is already an established forwarding member for that group, then it sup-presses any further JOIN REPLY forwarding in order to re-duce channel overhead. The basic trade- off in ODMRP is between throughput and overhead. A source can increase throughput by send-ing more frequent JOIN QUERY messages. Each message Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE rebuilds the multicast mesh, repairing any breaks that have occurred since the last query, thus increasing the chance for subsequent packets to be delivered correctly. However, be-cause each query is flooded, increasing the query rate also increases the overhead of the protocol. ODMRP can also control redundancy via the soft- state timer for node forward-ing state. A longer timer will increase the size of the mesh and hence provide more redundant paths for packets to be delivered. Of course, increasing the soft- state timer also in-creases overhead since many of the links in the mesh will result in duplicate packets being delivered. 2.2 ADMR ADMR creates source- specific multicast trees, using an on- demand mechanism that only creates a tree if there is at least one source and one receiver active for the group. Unlike ODMRP, receivers must explicitly join a multicast group. Sources periodically send a network- wide flood, but only at a very low rate in order to recover from network par-titions. In addition, forwarding nodes in the multicast tree may monitor the packet forwarding rate to determine when the tree has broken or the source has become silent. If a link has broken, a node can initiate a repair on its own, and if the source has stopped sending then any forwarding state is silently removed. Receivers likewise monitor the packet re-ception rate and can re- join the multicast tree if intermediate nodes have been unable to reconnect the tree. To join a multicast group, an ADMR receiver floods a MULTICAST SOLICITATION message throughout the net-work. When a source receives this message, it responds by sending a unicast KEEP- ALIVE message to that receiver, confirming that the receiver can join that source. The re-ceiver responds to the KEEP- ALIVE by sending a RECEIVER JOIN along the reverse path. In addition to the receiver's join mechanism, a source pe-riodically sends a network- wide flood of a RECEIVER DIS-COVERY message. Receivers that get this message respond to it with a RECEIVER JOIN if they are not already connected to the multicast tree. Each node begins a repair process if it misses a defined threshold of consecutive packets ( 2 for our simulations). Re-ceivers do a repair by broadcasting a new MULTICAST SO-LICITATION message. Nodes on the multicast tree send a REPAIR NOTIFICATION message down its subtree to can-cel the repair of downstream nodes. The most upstream node transmits a hop- limited flood of a RECONNECT mes-sage. Any forwarder receiving this message forwards the RECONNECT up the multicast tree to the source. The source in return responds to the RECONNECT by sending a RECON-NECT REPLY as a unicast message that follows the path of the RECONNECT back to the repairing node. Nodes on the multicast tree also maintain their forward-ing state. They expect to receive either passive acknowledg-ments ( if a downstream node forwards the packet) or an EX-PLICIT ACKNOWLEDGMENT if it is a last hop router in the tree. If a defined threshold of consecutive acks are missed ( 15 for our simulations), then the forwarding node expires its state. Finally, a receiver keeps track of how many times it has had to initiate a repair due to a disconnection timeout. If this number reaches a certain threshold then the receiver asks the source to switch to flooding in its next RECEIVER JOIN message. If enough receivers ask, then the source switches to flooding for a limited time. During flooding, all the data packets are sent as network- wide flood and all repair mes-sages are suppressed. 3 Simulation Methodology For our simulations we use GloMoSim- 2.03 [ 26]. We fixed the ODMRP implementation provided in the Glo- MoSim distribution because it contained several major bugs that prevented packets from being delivered. Since Glo- MoSim did not include ADMR, we wrote our own imple-mentation based on the original ADMR publication [ 10] and a specification published as an Internet draft [ 11]. We did not implement source pruning ( where the source stops send-ing data if there are no receivers) so that we could study the effects of partitioning on packet loss. We also wrote a simple flooding protocol for GloMoSim. One important implementation detail for multicast rout-ing protocols is the use of randomization ( or jitter) to avoid collisions due to protocol synchronization. Each node that forwards a multicast message adds a random delay between 0 and 10 ms before forwarding the packet. Likewise, at the application layer, we avoid starting sources at the same time, since they use CBR and would thus remain synchronized for the duration of the simulation. Finally, for ADMR we ex-clude any startup delay caused by buffering packets before sufficient receivers have joined the group. To verify our protocol implementations, we ran simula-tions identical to those reported in [ 10] that compare ADMR and ODMRP. Our results are very close, with slightly higher delay due to the jitter we have added at each node. The re-sults reported in this paper differ more substantially from [ 10] because we are using a different field size. In our simulations we collect the following metrics: • Throughput (%): The ratio of the number of packets received to the number of packets sent. • Throughput ( rate): The rate at which group members receive data, in kilobits per second. • Transmission Overhead: The ratio of the number of data messages transmitted ( originated or forwarded) and the number of data messages received. This met-ric is a measure of the efficiency of a routing protocol Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE – a lower value for transmission overhead indicates that fewer forwarders were needed. • Control Overhead: The ratio of the number of con-trol messages originated or forwarded over the com-bined total of data and control messages originated or forwarded. This metric indicates the percentage of all messages that are control messages. • Delay: The difference between the time when the packet is sent by the source and when it is received. Note that previous studies have combined transmission overhead and control overhead into a single metric called normalized overhead, but this can obscure the differences between the two. For ODMRP, control packets consist of JOIN QUERY, JOIN REPLY, and ACKNOWLEDGMENTS. For ADMR, con-trol packets consist of RECEIVER DISCOVERY, MULTICAST SOLICITATION, KEEP- ALIVE, RECEIVER JOIN, REPAIR NOTIFICATION, RECONNECT, RECONNECT REPLY, and also ACKNOWLEDGMENTS sent by the end receivers in or-der to maintain the tree. Since ODMRP JOIN QUERIES and ADMR RECEIVER DISCOVERY messages have data piggy-backed with them, we count these packets as both data and control messages. Except where noted, our simulations use 50 nodes, ran-domly placed over a square field whose size is 1000m2. Nodes communicate using IEEE 802.11 for the MAC proto-col, with a 250m radio range, free- space radio signal propa-gation, and a maximum data rate of 2 Mbps. 4 Mobility Scenarios Our first scenario explores the effects of realistic mobility patterns on multicast routing performance. We use mobility models similar to the IMPORTANT framework [ 1], but ap-ply this methodology for the first time to multicast. We con-sider a wide range of mobility models and explain how they impact multicast routing performance. As a result, we are able to identify two key mobility metrics that predict multi-cast performance. This enables protocol designers to focus on optimizing performance with respect to these metrics, re-gardless of the particular usage scenario. 4.1 Mobility models and connectivity metrics A number of researchers have developed mobility mod-els to capture the movement patterns of wireless network users. We have chosen a set of models from three different classes of motion – random, path- based, and group- based movements: • Uniform: Each node starts at a random position and moves in a random direction with a constant velocity Model Parameters Random speed: between max and max − 5m/ s Waypoint pause time: 30 seconds Manhattan grid size: 150 meters Exhibition centers: 10 minimum distance to center: 20 meters pause time: 30 seconds Battlefield leaders: 16 minimum distance to leader: 20 meters pause time for leader: 30 seconds Table 1. Parameters used in Mobility Models [ 16]. This models independent movement with high temporal dependency. • Random Waypoint: Each node chooses a random desti-nation within the simulated field, moves to the destina-tion at a randomly chosen speed, pauses for a fixed pe-riod of time, and then chooses a new destination. This model has been widely used in the literature, allowing us to validate our results with other research. • Manhattan: Each node moves along a set of pre- defined streets, which are arranged in a grid pattern. All nodes use the same speed, and each node may choose any direction when reaching an intersection. This models path- based motion with low spatial dependence [ 1, 6]. • Exhibition: Each node chooses a destination from among a fixed set of exhibition centers and then moves toward that center with a fixed speed. Once a node is within a certain distance of the center it pauses for a given time and then chooses a new center. This model is similar to the event scenario described by Johansson et al. [ 13] and represents independent movement but with high node density. • Battlefield: Each node follows a group leader by choos-ing a destination close to where the leader is currently located and then moving there. The group leader uses the Random Waypoint model. This is similar to the RPGM model [ 9] and represents group- based mobility with high spatial dependence. Table 1 lists the default parameters we use for each of these models. For each of these models we vary the speed at which nodes move. For all models we avoid sharp turns and sudden changes in velocity by using acceleration and deceleration vectors [ 2]. As part of this work we extended GloMoSim to include the Uniform, Manhattan, Exhibition, and Battlefield mobility models. To differentiate among these models, we use a set of mo-bility and connectivity metrics. Of the mobility metrics de-fined in the IMPORTANT framework [ 1], we found that spa-tial dependency and the average number of link changes are Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE able to differentiate between our mobility models and help to explain multicast routing performance. These are defined informally as: • Spatial dependency: The degree to which two nodes are moving in a similar direction with similar speed. • Number of Link Changes: The number of link changes seen during the course of a simulation. A link change is counted when two nodes come within radio range when previously they had not been able to communicate di-rectly, and vice versa. In addition, because we are studying multicast routing, we introduce two new metrics: • Neighbor Density: The number of nodes which are within radio range of a given node. We do not distin-guish between active and inactive nodes, because with multicast a node that is not transmitting its own data can still act as a forwarder. • Reachability: The number of nodes that are reachable via forwarding through the ad hoc network. We mea-sure this using a recursive coloring algorithm, so that nodes in the same partition have the same color. We used a set of simulations to confirm that each of these metrics is able to distinguish between the mobility models. Of the most importance to us, the number of link changes clearly differentiates among the models ( Figure 1). This be-havior was not seen with the IMPORTANT framework [ 1], but it is significant because the number of link changes can have a significant impact on a multicast routing protocol – each link change may potentially break the multicast tree or mesh and cause a receiver or intermediate node to attempt a repair. Both spatial dependency and density are higher for the group- based mobility models ( Exhibition and Man-hattan), as is expected, though the difference is clearer with density ( Figure 2). Note that density is initially low for Bat-tlefield and Exhibition because at low speeds the nodes do not have time to form groups. Another significant differ-ence among the protocols is that all of them maintain high reachability except for Battlefield [ 20]. This means that the Battlefield model is a good test for determining how well a protocol reacts to a partition in the network. 4.2 Mobility metrics explain routing performance For the mobility scenarios, we try to isolate the pattern of node movement from other factors, such as the traffic rate. Hence we use only three multicast groups, each consisting of 1 source and 7 receivers. The multicast groups are not overlapping, which means that with the 3 senders and 21 receivers combined about half of the nodes are participating 0 10000 20000 30000 40000 50000 60000 70000 80000 0 5 10 15 20 25 30 35 40 45 50 Number of Link Changes Speed ( m/ s) For Battlefield For Exhibition For Manhattan For Uniform For Waypoint Figure 1. Mobility model link changes 0 2 4 6 8 10 12 14 16 0 5 10 15 20 25 30 35 40 45 50 Node Density [ Number of Neighbors] Speed ( m/ s) Battlefield Exhibition Manhattan Uniform Waypoint Figure 2. Mobility model density in a multicast session. Each multicast source uses a Constant Bit Rate ( CBR) flow, transmitting a 64 byte packet every 250 milliseconds ( 6 kbps). We run each simulation for 600 seconds and we average the results of 25 simulations. For both ODMRP and ADMR, throughput depends on the model ( Figures 3 and 4) and the ordering from worst to best can be explained by both the number of link changes and the density. Throughput is worst for Battlefield because it creates the most link changes, to the point that the network frequently becomes partitioned. At moderate to high speeds, approximately 10 nodes are separated from the rest of the network with the Battlefield model. The Manhattan model has a similar large number of link changes and also low den-sity, so it is the next worst. Uniform and Random Waypoint result in similar performance; although Uniform has fewer link changes this is balanced by Random Waypoint having higher density. Finally, the Exhibition model results in the best performance because the number of link changes is rel-atively low and it creates high density. Note that for ODMRP our results show lower through-put than with previous ODMRP simulations [ 16] because these previous simulations are at low speed ( 20m/ s), use a lower data rate, and try only the Uniform mobility model. Likewise, we show lower throughput for ADMR than with previous ADMR simulations [ 10] because the previous sim-ulations use a elongated field ( 1500m x 300m) that results Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE 0 10 20 30 40 50 60 70 80 90 100 0 5 10 15 20 25 30 35 40 45 50 Throughput (%) Speed ( m/ s) For Battlefield For Exhibition For Manhattan For Uniform For Waypoint Figure 3. ODMRP throughput 0 10 20 30 40 50 60 70 80 90 100 0 5 10 15 20 25 30 35 40 45 50 Throughput (%) Speed ( m/ s) For Battlefield For Exhibition For Manhattan For Uniform For Waypoint Figure 4. ADMR throughput in higher density and are limited to the Random Waypoint model. Regardless of the mobility model, ODMRP performance degrades as speed increases, whereas ADMR is able to main-tain throughput greater than 80%. Based on our results, we calculated Pearson's correlation coefficient and confirmed that there is a strong negative linear relationship between the number of link changes and throughput for ODMRP. Note that ODMRP could obtain better performance by sending JOIN QUERY messages more frequently, and hence reacting to broken links more quickly, but this would in turn incur more overhead. Recent revisions of ODMRP use GPS to track location and adaptively increase the refresh interval as mobility increases. ADMR is able to maintain high through-put because ( a) forwarding nodes are able to initiate local re-pair of the multicast tree and ( b) receivers experiencing high packet loss can ask ADMR to switch to flooding. However, the cost of these actions are higher control and transmission overhead. One of our important findings is that the density created by each of the mobility models explains the performance of the rest of our performance metrics. For both ODMRP and ADMR, the transmission overhead, control overhead, and delay varies according to the mobility model, with the or-dering among the models correlates exactly with the order-ing for density. We show representative graphs for ADMR 0 1 2 3 4 5 6 7 8 9 10 0 5 10 15 20 25 30 35 40 45 50 Transmission Overhead Speed ( m/ s) For Battlefield For Exhibition For Manhattan For Uniform For Waypoint Figure 5. ADMR transmission overhead 0 10 20 30 40 50 60 70 80 90 100 0 5 10 15 20 25 30 35 40 45 50 Control Overhead Speed ( m/ s) For Battlefield For Exhibition For Manhattan For Uniform For Waypoint Figure 6. ADMR control overhead in Figures 5 and 6. Group- based mobility models, which lead to higher density, result in a greater chance that mul-ticast group members will be located near the source. This leads to a savings in transmission overhead and delay. High density also decreases control overhead for ODMRP, since JOIN REPLY messages travel fewer hops. For ADMR, how-ever, control overhead increases with density ( Figure 6). This happens because ADMR switches to flooding more fre-quently when density is low [ 20]; during these times ADMR has no control overhead. These results confirm that characterizing link variations and density fluctuations for any user movement is crucial to-wards understanding routing performance. We also include reachability as a key metric since partitioning is a special case of a link breaking. Additional metrics defined in the IM-PORTANT framework, such as temporal dependence, spatial dependence, and relative velocity, are important only in that they induce link changes and density. It is possible, for ex-ample, to construct a model that creates spatial dependence and yet few link changes. Each node in this strawman model simply vibrates in place, with the amplitude of vibration sig-nificantly smaller than the radio range. Given sparse place-ment, density variations are negligible and since movements are small no link breaks occur. However, depending upon the alignment of the vibrations and relative velocities, spa-tial dependence between two nodes can be varied arbitrarily. Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE 0 20 40 60 80 100 0 10 20 30 40 50 60 70 80 Throughput (%) Density [ Number of Neighbors] Flooding ODMRP ADMR Figure 7. Variation of throughput with density Hence, we can conclude that protocol designers should con-centrate on optimizing multicast protocols for both frequent mobility and density. 5 High Density Scenario Our second scenario explores the effects of high density on multicast routing performance. For this scenario, we study density without any mobility. Accordingly, we stati-cally place a set of 75 nodes on a field and vary the density by varying the size of the field. We use three multicast groups, each having 1 source and 22 receivers. To see the effects of density, we increase the traffic rate of each source slightly; each source sends a 100 byte packet every 100 milliseconds ( 24 kbps). We run each simulation for 100 seconds and we average the results of 25 simulations. Surprisingly, ADMR performs very poorly in this sce-nario ( Figure 7). Both ODMRP and ADMR initially receive low throughput as the density of the network is so small that it is partitioned. As the density increases, ODMRP achieves very high throughput once the network is connected, while ADMR never delivers more than 60% of the packets. In fact, ADMR does much worse than a simple flooding protocol. 1 This indicates that ADMR's ability to switch to flooding is not causing this problem. To explore this problem further, we fix the density at a high value and then vary the traffic rate to determine when ADMR encounters a problem. To accomplish this, we ran-domly place 50 nodes within 20 meters of a central point, again with no mobility. We use only a single multicast group, with 1 sender and 30 receivers. We vary the traffic rate for this source by keeping the packet size fixed at 100 bytes and adjusting the number of packets sent per second. We run each simulation for 60 seconds and we average the results of 25 simulations. In this scenario, ADMR's throughput begins to collapse when the sending sending rate is only about 25 kbps ( Fig- 1For our implementation of flooding, we use a simple protocol in which each node receiving a packet for a group first checks whether it is a duplicate and, if not, forwards the packet by retransmitting it. 0 20 40 60 80 100 0 50 100 150 200 Throughput (%) Sending Rate ( kbps) flooding odmrp admr Figure 8. High density throughput ure 8). This is even worse than flooding, which must forward each packet 50 times! Because of its simplicity, ODMRP operates extremely well, even at extremely high rates. ODMRP's only control traffic is a periodic JOIN QUERY; while this message is flooded, it is transmitted once every 3 seconds, regardless of the sending rate. The subse-quent JOIN REPLY messages, one per receiver, form a tree shaped like a star. This means that each data packet is simply broadcasted by the source and then immediately received by all group members. To pinpoint ADMR's problems with high density, we plot a trace of the major network activity when the traffic rate is 200 kbps ( Figure 9). The graph is divided into three sec-tions, with each section being a different version of ADMR. The bottom section of this plot shows the standard version of ADMR, before we have fixed any of ADMR's problems under high density. Each symbol on the graph represents a packet being transmitted, with the y- axis indicating which node sent the packet. Node 0 is the sender for the group. To make the trace readable, we show only the first 7 seconds of network activity; the rest of the 60 second trace continues with exactly identical patterns to those shown here. The first problem evident from this trace is that ADMR suffers from RECEIVER JOIN implosion. When the source starts at approximately 1300 ms, it transmits a RECEIVER DISCOVERY message. All existing group members immedi-ately respond with a RECEIVER JOIN message, which over-whelms the source. The source responds with a separate UNICAST KEEP- ALIVE message for each receiver, but these messages are delayed due to congestion. However, the primary problem in this case is that ADMR sets a timer for each RECEIVER JOIN message that is based on the inter- packet gap advertised by the source. Because the inter- packet gap is so small in this simulation ( 4 ms), the timer fires faster than the source can respond and ADMR as-sumes the join attempt has failed. Hence, when the source sends its RECEIVER DISCOVERY message, each receiver sends three RECEIVER JOIN messages, then gives up and sends a MULTICAST SOLICITATION message. Eventually, the source delivers a UNICAST KEEP- ALIVE message to a Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE 0 1000 2000 3000 4000 5000 6000 7000 Multicast Group Member Address Time ( millisec) - 0 ADMR: Regular - 1 - 2 - 3 - 4 - 8 - 9 - 10 - 11 - 14 - 16 - 18 - 19 - 0 ADMR: Only Timers Fixed - 1 - 2 - 3 - 4 - 8 - 9 - 10 - 11 - 14 - 16 - 18 - 19 - 0 ADMR: Both Timers/ Ack Fixed - 1 - 2 - 3 - 4 - 8 - 9 - 10 - 11 - 14 - 16 - 18 - 19 Data Sent Data Forwarded Data Received Explicit Ack Multicast Solicitation Receiver Discovery Receiver Join Keep- Alive Repair Notification Reconnect Reconnect Reply Figure 9. High density ADMR packet trace receiver, and this causes another round of triple RECEIVER JOIN messages followed by solicitations. Because the so-licitations are flooded and sent using broadcast at the MAC layer, they cause severe congestion; 10 solicitations in a second result in 500 control packets transmitted during that time. This congestion forces the source to continually back-off. Hence, even though the source queues packets in the MAC layer at about 2800 milliseconds, many of them are never sent. Even when packets are sent, few of the group members successfully join for any length of time – the throughput is 0.07%. Later in the trace ( not shown), Repair timers have the same problem as the Join timers, resulting in additional MULTICAST SOLICITATION messages. Fixing this problem requires only a small adjustment to the ADMR Join and Repair timers. We establish a Repair- WaitTime, so that the calculated timer can never be less than this value. At large inter- packet gaps ( low sending rates), the original timer value is used, but at higher sending rates the timers are set to their minimum values. By setting the RepairWaitTime to a reasonably short time ( e. g. 500 ms), we can ensure that the timer never fires too soon ( this is the equivalent of 125 missed packets for our packet trace), but is fast enough to adapt to mobility- induced losses. The middle section of the packet trace in Figure 9 shows network activity for ADMR with the Join and Repair timers fixed, using a value of 500ms for the RepairWaitTime. This dramatically reduces the number of RECEIVER JOIN mes-sages that are sent, which allows data to be transmitted. Note that most group members can now receive data, though some members that join later have difficulty joining because of the congestion in the network. This reveals a second serious problem with ADMR in the high density scenario: each receiver transmits explicit ac-knowledgments to the source, resulting in ack implosion. Like any ADMR forwarder, the source must receive either a passive or active acknowledgment to maintain its forward-ing state. Since the forwarding tree is actually a star at high density, all receivers are the last hop in the tree and all must send an EXPLICIT ACK for each packet. Hence, the through-put for this case improves to only 12.92% as many packets are either delayed or lost due to the congestion from explicit acks. Moreover, some nodes actually become forwarders for a short time, as seen for nodes 8 and 16 in the middle section of the trace. This occurs when an intermediate node receives a MULTICAST SOLICITATION before the source. Our solution for the ack implosion problem is based on the observation that this problem is very similar to the ack implosion problem in reliable multicast [ 7]. In the wireless case, a source ( or any other forwarder in a dense region) only needs to receive one acknowledgment for a packet in order to maintain its forwarding state. Even better, if the source ( or forwarder) can receive one ack for every k packets, then it can maintain its forwarding state with a minimum of over-head. Damping the explicit acks in ADMR is simple, since each ack is broadcasted. Each group member sets an ack timer to a random value between zero and MaxAckTime. If the timer expires and the member has received data during this inter-val then it sends an EXPLICIT ACK. However, if the group member hears an EXPLICIT ACK during this interval, it can-cels its timer and then waits the remainder of MaxAckTime before it sets a new ack timer. The source ( or forwarder) sets its forwarding state timer to AckWaitTime, which is equal to m ∗ MaxAckTime. This ensures that the source does not time out its forwarding state unless it missesmacks in a row. The top section of the packet trace in Figure 9 shows net-work activity for ADMR with both explicit acks and the Join and Repair timers fixed. We use a value of 66 ms for Max- AckTime, 2 seconds for AckWaitTime, and 500ms for the RepairWaitTime. As can be seen from this trace, explicit Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE 0 20 40 60 80 100 0 20 40 60 80 100 120 140 160 180 200 Throughput (%) Sending Rate Per Source [ By Varying Number of Packets sent per second] ADMR: Regular Version ADMR: Repair switched off ADMR: Explicit ACKs switched off ADMR: Both Repair and Explicit ACKs switched off Fixed ADMR Figure 10. ADMR fixed for high density acks are sent regularly, but at a much reduced rate. This re-lieves the congestion in the medium, allowing a throughput of 95.86%! To verify that our two solutions work, we repeated the simulation of Figure 8 using five versions of ADMR: the regular version, ADMR with the Join and Repair timers disabled, ADMR with explicit acks disabled, ADMR with timers and explicit acks disabled, and finally ADMR with our two solutions. As shown in Figure 10, our solutions en-able ADMR to scale with offered load during the high den-sity scenario. In fact, they work just as well as completely disabling the problematic mechanisms, though this is not a viable alternative. We do not claim that our solutions enable ADMR to ob-tain high throughput for all scenarios. We did, however, test our solutions with the mobility scenario in the previous sec-tion and found that we were able to obtain nearly identical results in these cases. We do note that ADMR's perfor-mance is sensitive to the timer settings we have adjusted. Using larger values for the RepairWaitTime cause ADMR to react too slowly to high mobility conditions, and using larger values for AckWaitTime cause excessive pruning and low throughput for high mobility conditions. Our primary purpose in this exercise is to demonstrate the pitfall of testing multicast routing performance in only low density situations. Our experiments with high density have identified several flaws in ADMR that can be general-ized to any multicast routing protocol. Explicit acknowledg-ments should be avoided if possible, and control messages that are flooded should be rate limited to avoid broadcast storms. While we have implemented changes to ADMR that solve these problems for a single group, dampening these messages across multiple groups is a more difficult problem. Our results also question the practice of building a routing protocol that reacts to packet loss. If the protocol interprets all packet loss as a sign of mobility, then it will misinter-pret congestion as a sign of mobility and potentially cause a congestion collapse. 0.1 1 10 100 1000 0 20 40 60 80 100 120 140 Rate ( kbps) Sending Rate Per Source ( kbps) ODMRP -- byte received per receiver ODMRP -- byte sent per node ODMRP -- byte Received per node ADMR -- byte received per receiver ADMR -- byte sent per node ADMR -- byte Received per node Figure 11. High traffic: packet size 0.1 1 10 100 1000 0 20 40 60 80 100 120 140 Rate ( kbps) Sending Rate Per Source ( kbps) ODMRP -- byte received per receiver ODMRP -- byte sent per node ODMRP -- byte Received per node ADMR -- byte received per receiver ADMR -- byte sent per node ADMR -- byte Received per node Figure 12. High traffic: inter- packet gap 6 High Traffic Scenario Our third scenario explores the effects of high traffic rates on multicast routing performance. To isolate the effects of load from other factors we keep density and mobility low. In these simulations we use the same parameters as the mobility scenario, except we keep the speed constant at 1 m/ s. We then vary the traffic rate in two ways: using a fixed packet size of 64 bytes and varying the inter- packet gap, and using a fixed inter- packet gap of 250 ms and varying the packet size. For this scenario use the Exhibition model with 10 centers; results for other mobility models are similar. Our results indicate that ODMRP is able to achieve a maximum throughput of about 55 kbps, while ADMR can receive at most 40 kbps when varying the packet size ( Fig-ure 11). Both protocols obtain significantly lower through-put when varying the inter- packet gap ( Figure 12). In both figures we show the average rate at which data is received by the group members, as well as the average transmission rate ( at the MAC layer) for each node in the network and the av-erage rate at which packets are received by each node ( also at the MAC layer). The data reception rate indicates how successful the routing protocol is; for example, when the packet size is varied, ODMRP receives about 30 kbps when the sources send at 50 kbps, or about 60% of the through-put. The rate transmitted per node and the rate received per Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE node indicate the load imposed on the network by the rout-ing protocol. The rate received is always higher than the rate transmitted because each node has more than one neighbor. Our second purpose in exploring this scenario is to exam-ine a fundamental question: how effectively can a multicast routing protocol use the available capacity of an ad hoc net-work? It clear from our results that multicast can use more of the available capacity by transmitting large packets rather than small packets. For example, when varying the packet size ODMRP can receive about 55 kbps, but can only re-ceive about 20 kbps when varying the inter- packet gap. But how much of the available capacity can a multicast routing protocol actually use? From work on the capacity of ad hoc networks [ 8, 17], we know that the unicast sending rate, λu available to a node is bounded by: λu < C/ n Lu/ r , ( 1) where C is the capacity of the network, n is the number of nodes that are transmitting, Lu is the expected path length in meters, and r is the radio range in meters. Because Lu/ r is the expected unicast path length in hops, we can trans-late this equation into an available sending multicast rate by substituting the expected number of hops in a multicast tree. Hence, for multicast: λm < C/ n Lm , ( 2) where Lm is the expected number of hops in the multicast tree. This bound indicates that one of the critical factors for a multicast tree is its efficiency, with a lower Lm enabling a higher transmission rate. This is exactly what the bandwidth efficient multicast protocol [ 19] tries to accomplish, by hav-ing receivers join along the shortest path to the existing tree, rather than using the shortest path to the source. This indi-cates that in a high traffic scenario it is better for a multicast protocol to use a tree instead of a mesh. To determine Lm for our scenarios, we ran an experiment that measured this value for both ODMRP and ADMR as we vary the number of group members for a single group with one source ( Figure 13). In both cases, this measurement ex-cludes any forwarding done by flooding of control or data packets. The average Lm increases slowly for both proto-cols when the group includes only a single source. This mea-surement appears to follow the Chuang- Sirbu law, in which Lm/ Lu = mk, where m is the number of receivers [ 4, 21]. This law fits our data when Lu is 3 ( the measured value for our simulations) and k is 0.58. When we allow all members to be sources for the multicast group, ADMR is unaffected ( since it builds a tree per source), but Lm grows significantly for ODMRP since it uses a mesh. The number of links in the mesh falls at very large group sizes for ODMRP, but this is 0 5 10 15 20 25 30 35 0 5 10 15 20 25 30 35 40 Multicast Hops ( Lm) Number of Receivers ODMRP ADMR ODMRP with All Members as sources Figure 13. Lm as a function of group size only because the number of nodes and the area of the net-work is limited. Hence, we would expect ODMRP to not be bandwidth efficient as the number of sources grows. Returning to Equation 2, we can now calculate the send-ing rate available to a node. We use a measured Lm of 12 for a group size of 7 ( Figure 13), 2000 kbps for C [ 17], and we have 3 active sources. This yields λm = 55kbps for ODMRP, which is what it does obtain when using large packets. Since ADMR has a lower Lm, it should be able to achieve a higher sending rate. However, ADMR switches to flooding once packet loss begins to occur, which is ex-actly the wrong thing to do during a period of congestion. ADMR misinterprets packet loss as a sign of mobility and thus makes the situation even worse. This problem is par-ticularly acute when varying the inter- packet gap, because increasing the sending rate in this case increases the number of packets that are flooded. It is an open question as to whether other multicast rout-ing protocols better utilize network capacity. We believe a tree- based protocol ( with lower overhead than ADMR) could do better than ODMRP, particularly for multiple sources, be-cause its Lm will be lower. On the other hand, it is possible that the theoretical limits are too high, and that ad hoc net-works using IEEE 802.11a are simply unable to support high levels of multicast traffic. We are currently designing a new multicast routing protocol that uses a tree and reliable broad-cast at the MAC layer in an attempt to achieve high utiliza-tion. 7 Conclusions Our goal in this work has been to identify cases where ad hoc multicast routing protocols can improve their perfor-mance, resulting in a set of recommendations to multicast protocol designers. Our first recommendation is that designers focus on opti-mizing for both mobility and density. Protocols should react to link breaks, but with lower overhead than ADMR does. Designers should also be aware of the pitfalls associated with high density situations, avoiding problems such as ack im- Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE plosion and broadcast storms. While these problems have been seen in wired networks, it is apparent that these lessons have not always carried over into wireless networking. Pro-tocols should instead take advantage of the density created by group- based mobility patterns. Recent work by Yi et al. does this by treating groups of users as a team and then mul-ticast a single packet to each team [ 25]. We strongly recommend that routing protocols should not attempt to monitor packet loss and repair routes when loss is high. As we have seen with ADMR, such loss may in fact be due to congestion and the increased repair traffic can lead to congestion collapse. Rather, loss monitoring should be done by the transport layer, which can then use input from the MAC layer to determine if the loss is due to congestion or mobility. The transport layer can then request that the routing protocol take appropriate action when the loss is due to mobility ( and suspend sending any more data until a new route is found). To achieve high capacity, protocols should use a bandwidth- efficient tree rather than a mesh and should have very low control overhead. Mesh- based multicast protocols increase the number of hops in the multicast tree and hence cannot support high traffic rates. This argues for a simple, end- to- end protocol design, with receivers in charge of join-ing groups and reacting to route changes. Asking multicast forwarders to maintain the tree results in too much control traffic, particularly when broadcast is used to repair the tree. Finally, we suggest that future multicast protocol evalua-tions – both in simulations and in testbeds – need to be more comprehensive. Evaluations should consider a range of real-istic mobility models and should include special cases, such as high density and high traffic rates. References [ 1] F. Bai, N. Sadagopan, and A. Helmy. IMPORTANT: A framework to systematically analyze the Impact of Mobility on Performance of RouTing protocols for Adhoc Networks. In IEEE INFOCOM, 2003. [ 2] C. Bettstetter. Smooth is Better than Sharp: A Random Mo-bility Model for Simulation of Wireless Networks. In ACM MSWiM, July 2001. [ 3] T. Camp, J. Boleng, and V. Davies. A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communi-cations & Mobile Computing ( WCMC), 2002. [ 4] J. Chuang and M. Sirbu. Pricing Multicast Communica-tions: A Cost- Based Approach. Telecommunication Systems, 17( 3): 281– 297, July 2001. [ 5] S. K. Das, B. S. Manoj, and C. S. R. Murthy. A Dynamic Core Based Multicast Routing Protocol for Ad Hoc Wireless Networks. In ACM MobiHoc, June 2002. [ 6] V. Davies. Evaluating Mobility Models Within an Ad Hoc Network. Master's thesis, Colorado School of Mines, Math-ematical and Computer Sciences, 2000. [ 7] A. Erramilli and R. Singh. A Reliable and Efficient Multi-cast Protocol for Broadband Broadcast Networks. In ACM SIGCOMM, August 1987. [ 8] P. Gupta and P. Kumar. The Capacity of Wireless Networks. IEEE Transactions on Information Theory, IT- 46( 2): 388– 404, March 2000. [ 9] X. Hong, M. Gerla, G. Pei, and C. Chiang. A Group Mobil-ity Model for Ad Hoc Wireless Networks. In ACM MSWiM, August 1999. [ 10] J. Jetcheva and D. Johnson. Adaptive Demand- Driven Mul-ticast Routing in Multi- Hop Wireless Ad Hoc Networks. In ACM MobiHoc, October 2001. [ 11] J. Jetcheva and D. B. Johnson. Adaptive Demand- Driven Multicast Routing in Multi- Hop Wireless Ad Hoc Networks, July 2001. [ 12] L. Ji and M. S. Corson. Differential Destination Multicast - A MANET Multicast Routing Protocol for Small Groups. In IEEE INFOCOM, 2001. [ 13] P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark. Scenario Based Peformance Analysis of Routing Protcols for Mobile Ad Hoc Networks. In IEEE Mo-biCom, August 1999. [ 14] S. Lee and C. Kim. Neighbor Supporting Ad Hoc Multicast Routing Protocol. In ACM MobiHoc, Aug 2000. [ 15] S. Lee, W. Su, and M. Gerla. On- Demand Multicast Rout-ing Protocol in Multihop Wireless Mobile Networks. In ACM/ Baltzer Mobile Networks and Applications, 2000. [ 16] S. Lee, W. Su, J. Hsu, M. Gerla, and R. Bagrodia. A Per-formance Comparison Study of Ad Hoc Wireless Multicast Protocols. In IEEE INFOCOM, 2000. [ 17] J. Li, C. Blake, D. S. J. D. Couto, H. I. Lee, and R. Morris. Capacity of ad hoc wireless networks. In Mobile Computing and Networking, pages 61– 69, 2001. [ 18] J. Luo, P. Eugster, and J.- P. Hubaux. Route Driven Gossip: Probabilistic Reliable Multicast in Ad Hoc Networks. In IN-FOCOM, 2003. [ 19] T. Ozaki, J. B. Kim, and T. Suda. Bandwidth- Efficient Mul-ticast Routing for Multihop, Ad- Hoc Wireless Networks. In IEEE INFOCOM, 2001. [ 20] M. Pandey and D. Zappala. The Effects of Mobility on Mul-ticast Routing in Ad Hoc Networks. In Technical Report, UO- CIS- TR- 2004- 2, March 2004. [ 21] G. Phillips, H. Tangmunarunkit, and S. Shenker. Scaling of Multicast Trees: Comments on the Chuang- Sirbu Scaling Law. In ACM SIGCOMM, 1999. [ 22] E. Royer and C. Perkins. Multicast Operation of the Ad- Hoc On- Demand Distance Vector Routing Protocol. In Mobile Computing and Networking, 1999. [ 23] D. Waitzman, C. Partridge, and S. Deering. Distance Vector Multicast Routing Protocol. RFC 1075, November 1988. [ 24] C. Wu, Y. Tay, and C. Toh. Ad hoc Multicast Routing Pro-tocol Utilizing Increasing id- numberS ( AMRIS) Functional Specification. In Internet- Draft ( work in progress), Nov 1998. [ 25] Y. Yi, M. Gerla, and K. Obraczka. Scalable Team Multicast in Wireless Networks Exploiting Coordinated Motion. Ad Hoc Networks Journal, August 2003. [ 26] X. Zeng, R. Bagrodia, and M. Gerla. GloMoSim: A Library for Parallel Simulation of Large- ScaleWireless Networks. In Workshop on Parallel and Distributed Simulation, May 1998. Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks ( WoWMoM' 05) 0- 7695- 2342- 0/ 05 $ 20.00 © 2005 IEEE
Click tabs to swap between content that is broken into logical sections.


text:
Morning Huddle - Bountygate the zombie
Bountygate just won't die!
Bountygate should be over. It should be in the rearview mirror, but it isn't. DeMaurice Smith has submitted a letter to Roger Goodell, suggesting that Goodell re-open the NFL's probe into the Saints' bounty program. In all reality, the move is essentially a last ditch effort by the NFLPA to get some of the suspensions associated with the scandal either overturned or reduced. It won't work. Roger Goodell is still Roger Goodell.
Adam Archuleta wasn't happy during his football playing days according to the Washington Post, but that wasn't due to concussions. In the candid interview, Archuleta attributed his unhappiness as a player to the expectations he put on himself, even as his play deteriorated. The expectations took its toll, and Archuleta said the ordeal made him "miserable."
Paul Kuharsky came up with the "AFC South offseason hype awards," and the idea is pure genius. You can take a look at the awards by clicking the link, but the idea is great. There's the possibility that a similar type of league wide awards article could make its way to This Given Sunday. Stay tuned on that front. For now, enjoy Kuharsky's take on the AFC South.
Like TGS on Facebook | Follow TGS on Twitter |


text:
Hihi, Jellicent! Did you get my pm? I don't want to pester about it, and if you busy with irl / smogon things, it's fine, but I'm getting unnecessarily nervous / anxious! :x Sorry for interrupting you in whatever you may be currently doing, btw.
Hello Jellicent, I believe there should be profiles and information for people on the wifi battle finder, i.e. skill level, if they dc due to losing, and a rating system to see if a player is friendly in the chat or not. Maybe these ideas are being imported now, or they are impossible to add, but thank you for taking your time to read my suggestion- ihavetm87
im taking a LoA from smogon for a bit, please keep the movie article up to date - all the main panelists are done, we just wait on solace to see if she does hers - get in contact w/ her and see if she'll participate, if not, please get gp+html to do it ASAP thank you :)
Someone is also trying to post very little and deleting very old posts when necessary because his planned 3k post isn't done... (9.9)
i know! i love cassie especially but cook is great too. i'm excited for effy as well hahah. i don't think any of the 3rd series cast is returning but i don't even care tbh. do u know how many eps they plan on making?
yo those sections of the forums that you talked about in your post already have mini-sites on the front page so it seems like hubs would be somewhat redundant, no? just wondering haha
defensive cryogonal usually doesn't run enough speed to get minimum Speed smeargle, offensive can though
07:32 Jellicent why is explosion even a slash? 07:33 Jellicent it's not like smeargle exploding is ever a threat .__. uhhhh from what i remember Explosion was slashed because it could OHKO defensive Cryogonal if it tries to spin your hazards away instead of simply stopping it from spinning for one turn, dunno if that applies to the new ev spread tho.


text:
User talk:Jszellmer
From ErfWiki
Fanon material
Hi there! You started an article about Rosie: Dollamancer and put your information under "Proposed Canon". Would you remind me where in the comic or text updates you can find any mention of Rosie? Because otherwise it is a Fanon. --Muzzafar 02:20, 19 December 2011 (EST)
My apologies. That is Fanon level material. Is there a specific template I have to follow for that, or do I just have to list it as Fanon?


text:
TOOLS: Should you buy or rent?
Do-it-yourselfers are often faced with several hurdles to getting their projects done. First, not every home has the extra space to store things like power tools and lawn equipment. Even if you do have ample space, you may not have the need or the desire to own these items for jobs that are not on your regular to-do list. Then there's a matter of budget.
More and more homeowners are tackling projects on their own rather than paying high fees for professional contractors, said Dave Eastlake, of the family-owned Eastlake Rent-All Inc., Elmwood Park (eastlakerentall.com). "It's often less expensive to rent an item for a single use than to buy it and have it hanging around," he said.
Ambitious homeowners can rent tools for pretty much any indoor remodeling project, said Jim McManus, owner of McManus Rentals, Hackensack (mcmanusrentals.com).
"We also have for sale products you need to use with specific tools," he added. Among the most popular DIY projects are floors, walls and woodwork in bathrooms, kitchens, basements and recreation rooms.
Many homeowners are no doubt dreaming of spring and of getting back into the great outdoors. If you're one of them, start making your to-do list early.
"We'll get real busy when the weather starts to warm up," said Eastlake. Landscaping, home exterior and masonry are among the bigger outdoor projects for eager do-it-yourselfers.
* Pressure washer - (from 1,000 to 4,000 psi, or pound-force per square inch) $55-80 full day
* Mortar mixer - (not including price of materials) $75 full day, $300 week
* Tiller - (can be rented for two, four or eight hours) $15-75


text:
Join ConceptArt.Org.
Its' free and it takes less than 1 minute!
AI - Happiness ハピネス
all the FIGHT CLUB music - so much... so awesome.
Gil Scott Heron has a new album. I didn't realize he died about six months ago. May he rest in peace. If you didn't know, he may have created hip hop about 40 years ago.
PhuturePrimitive, and iTunes radio/ambient/DI-Chillout ~M
Mark Wagner
I enjoy the little fun that this is a song about robbing a bank.
Oh.... .. and dat trumpet.
i am listening to bad romance. I love games i love Des Moines. play online games, and MMORPG social games such as Bloody Bite, Pirates: Tides of Fortune and RiotZone, Mini Flash Games, Shockwave 3d games, Android mmo games and more. Play a free online game now! Follow me find all best free rpg games.
Last edited by mathilda; January 14th, 2012 at 09:41 PM.
o 3 o
sb most art copied to page 1
Weapons of Mass Creation 2011 ::: Add your favourites!
skype: velocitykendall
facebook: Alface Killah
I'm still discovering music that came out while I was in junior high.
As hipster as it is to say, I usually stay away from mainstream music. Because well... frankly to my ears it's crap 99% of the time. Found this song amongst the mainstream charts and my foots been tapping ever since.
i admit that fatboy slim made a lot of fucking retarded bullshit, but that tune that plays at the end of that Larry Clark movie where they kill John Conner from Terminator3 fucking rules.
same goes for these squelching acid masterpieces. for everyone who knows cutoff knobs mean more than just what happened to John Wayne Bobbit, i salute you
sb most art copied to page 1
Weapons of Mass Creation 2011 ::: Add your favourites!
skype: velocitykendall
facebook: Alface Killah
Mala Rodriguez. [URL="http://www.youtube.com/watch?v=c1g2PlWEQSI"]
Last edited by Deepinonespersona; January 4th, 2012 at 05:08 PM.
That was awesome.
I've been listening to the Tron Legacy soundtrack a lot recently by Daft Punk. Found this on Youtube a little while ago and find it addictive.
And this one,but not for the whole 15mins.
Also I've been listening to a lot of Dream Theater because I am scared of looking for new music....
I've had this one stuck in my head all day!
ill get changed ill get changed ill get changed ill get changed hehe
ive found if i can skate to my smoking buddy Steves house in the time it takes to play Us Vs Them im making good time
if you like that youll love this.
sb most art copied to page 1
Weapons of Mass Creation 2011 ::: Add your favourites!
skype: velocitykendall
facebook: Alface Killah
The Knife - This is Now
Real Estate-- Easy
Perfect relaxation music for drawing
I bought some some pretty bassy headphones for Christmas and figured some electronic stuff would be a good way to break them in.
Last edited by Bill; January 8th, 2012 at 03:37 AM.
Honorary mentions:
Abbesses by Birdy Nam Nam
Bookends by Simon and Garfunkel
Skip Divided (Modeselektor Remix)
Along the Red Danube by Yom
Rabbit In Your Headlights by U.N.K.L.E
Turn It Off by Phantogram
^^^i love florence the machine (or whatever her name is!!!)
i like oldies like john lennon's imagine
and stuff like lateeya- lullaby and cheap date (they are my uke songs)
and frank ocean- thinking about you
and drake-hyfr
and midnight city by q83r or something rather
diverse types of things!
this is my art history blog: "teenager traversing art history"
ps i know it has a horrible name...any suggestions are welcome!!!
Came across this guy...smooth as silk!
Last edited by Angel Intheuk; January 20th, 2012 at 01:05 PM.
I love infected mushroom. This is one of my favs by them.
By the way, i found this on my Pandora station which is mostly more non-vocal electronic music on this clicky link
"I must not fear. Fear is the mind-killer. Fear is the little-death that brings total obliteration. I will face my fear. I will permit it to pass over me and through me. And when it has gone past I will turn the inner eye to see its path. Where the fear has gone there will be nothing. Only I will remain."
--- Frank Herbert, Dune - Bene Gesserit Litany Against Fear
Check out my Sketchbook! Critique and Criticism welcomed.
or my Deviantart!
· or check out my: Blog
Minimalist electronica with a strong, but calm beat. Listen using good headphones.
Edit: apparently there are many remixes.
I've really gotten nerdy these last few months.
Honestly from what I can see they only have one other good song, but I'll try to investigate them a little more. Apparently this single for a Luna Sea tribute album had them branch out of their element and into a different genre than what they usually do. Probably applies to the other bands featured on the album as well.
Last edited by Psychotime; January 10th, 2012 at 12:41 PM.


text:
Jason A. McKie (twitter: @Jmack37)
Position: FB
Height: 5-11 Weight: 240 lbs.
Born: May 22, 1980 in Gulf Breeze, FL
College: Temple (school history) (McKie college stats)
Weighted Career AV (100-95-...): 3 (10215th overall since 1950)
Other SR Links: College Football at Sports-Reference.com
Promote your website or business by sponsoring this page for $5 on Pro-Football-Reference.com. Your message will replace this ad.
0 Accepted Penalty | 0 |


text:
1. Eleven-time Olympic medalist Ryan Lochte capped off his birthday celebration weekend in Vegas with a pool party to remember at Azure at The Palazzo.
3. Ryan flaunts a patriotic swimsuit on the signature Azure blue carpet with one of the gold medals recently won at the London Olympics.
Save 50% off newsstand price
Download this week's issue of OK! Magazine for only $1.99
Download this week's issue of Star Magazine for only $1.99


text:
Glam Media acquires fashion site StyleMob
Women's-focused media and advertising company Glam Media has acquired StyleMob, a small social-media site consisting of a blog and some community features pertaining to fashion. Financial terms were not disclosed.
The rumor was first reported in Valleywag earlier on Thursday, where blogger Nicholas Carlson added that StyleMob's founders "weren't happy" about the acquisition. Glam Media recently raised significant venture funding and hinted that it would go in part toward purchasing smaller companies.
StyleMob, centered on "street fashion" rather than the runways of Paris and Milan, had already been a part of Glam's … Read more


text:
PodShow.com Gets Some Updates!
Thursday, June 16th, 2005After some long waiting and lots of complaining, the PodShow.com Website has finally got an update. You can now find out a little bit more about PodShow, the podsquad, listen to demos, get links to the PodShow Sirius Promos and much more. Check it out now at PodShow.com.


text:
16 hrs ago | ESPN
Unfair to put 'bad boys' label on Ravens?
Another arrest, another black mark on the Baltimore Ravens ' image. The arrest of backup offensive lineman Jah Reid on two misdemeanor battery charges was the third involving a Ravens player in 22 days.
Trending on the Topix Network
2014 NFL free agency primer: LBs
Inside and outside, the face of the modern linebacker has changed. Inside guys were once able to get by on a primary skill - either an ability to move up against the run, or cover tight ends and slot receivers in a rudimentary fashion.
ESPN's Todd McShay went outside the box in his latest mock draft, picking Alabama inside linebacker C.J. Mosley to go to the Baltimore Ravens .
Newsome needs to work magic on offense
Baltimore Ravens general manager Ozzie Newsome has built two Super Bowl champion teams.
Predicting the Baltimore Ravens' 5 Biggest Free Agency Moves
The Baltimore Ravens are a week away from entering the 2014 NFL Free Agency looking to make a big splash to bolster their team.
President Clinton may 'Dance With the Stars'
Professional dancer Karina Smirnoff has made it known that she is very interested in teaming with former President Bill Clinton on the upcoming season of " Dancing With the Stars ."
Russell Street Report's Brian Bower wonders whether the Ravens let go of Leach too soon without weighing all the necessary options.
Free Agency GM: Inside Linebacker Edition
The countdown to free agency continues along with our look at positions and players to target.
Chad Johnson tells of the times he tried to fight Ray Lewis
A fight between Chad Johnson and Ray Lewis would not go well for Johnson. But Johnson doesn't seem to realize that.
Ravens made the right call releasing Leach and McClain, but it wasn't an easy one
The tweets started rolling in, not long after the news came out that fullback Vonta Leach and weak-side linebacker Jameel McClain had been let go by the Ravens.
Ravens Must Stop the Bleeding, Find a Way to Retain Marquee Free Agents
That plan ended with the Ravens finishing the 2013 season 8-8 and missing the playoffs altogether, and with the Ravens in a similar personnel bind, the last thing the team can afford if it wants to get back to the postseason is another veteran exodus.
Ravens' free agent outlook: Tackle, tight end loom as problems
The sad fact of the matter is, most of us won't make it to New Orleans to celebrate Mardi Gras.
New Orleans Saints' defensive coordinator Rob Ryan, All-Pro...
New Orleans Saints defensive coordinator Rob Ryan helped the Saints finish fourth in the NFL total defense and scoring defense.
'Dancing With the Stars' cast rumors
It all started with Bruce Jenner buzz. Reports that he would follow in Kim and Rob Kardashian's footsteps for a ballroom spin surfaced last month.
'DWTS' 2014 cast spoiler round-up includes Tim Tebow, Sharon Osbourne
With just a week and change to go before the celebrity lineup of " Dancing with the Stars " 2014 is revealed during the March 4 episode of "Good Morning America," a Feb. 24 Hollywood Life article named nine notables who were allegedly asked to participate in the hit reality dance competition's spring season.
Ravens GM: Rice casino arrest is 'concerning'
Baltimore Ravens general manager Ozzie Newsome called the events surrounding Ray Rice 's arrest at an Atlantic City, N.J., casino "concerning," but said the team will let the legal process play out even as the running back faces potential discipline under the NFL's personal conduct policy.
The allegations against Ray Rice seem to be pretty serious. But the bigger problem is that his alleged actions have been caught on tape according to numerous reports.
Earl Thomas, pissed off for greatness
Former Ravens' scout Daniel Jeremiah was on with Softy yesterday to go along with this excellent Earl Thomas interview , and one of the things that stood out was the story DJ told about the absolutely crazy intensity that Ray Lewis brought to OTAs, training camp, practice and games each and every day.
Cops: Ravens' Rice knocked out fiancee
In this March 11, 2013 file photo, Baltimore Ravens running back Ray Rice, left, poses with his daughter, Rayven, and Janay Palmer as they arrive for a screening of a new film released on DVD that chronicles the team's championship NFL football season in Baltimore.
Michigan hopes defensive shifts spark D
Defensive coordinator Greg Mattison will move his focus from the defensive line to the linebackers, secondary coach Curt Mallory will only coach the safeties while former outside linebacker coach Roy Manning will move back to the secondary and takeover coaching the cornerbacks.