Ian Foster has survived as All Blacks head coach, with the NZ Rugby board hailing the team's "magnificent" weekend win in South Africa. Video / NZ Herald
Ian Foster has survived as All Blacks head coach, with the NZ Rugby board hailing the team’s “magnificent” weekend win in South Africa.
Former Ireland coach Joe Schmidt has been elevated in the coaching set-up and will now lead the All Blacks’ attack, NZ Rugby told reporters today after a board meeting.
The “unanimous” board decision means Foster will lead the team into next year’s Rugby World Cup in France.
“It’s a privilege to be in this job, it’s never something you take for granted,” Foster told a press conference in Auckland.
Asked about his emotions after being confirmed as coach, he said: “No doubt it’s been a hard time … but you’ve got to be in the here and now … I’m a key catalyst for that and I’m delighted to be here.”
On the past few weeks and speculation about his future, Foster denied a suggestion he was “hung out to dry”.
“In some ways that is part of the job and it’s part of Robo [NZR chief exec Mark Robinson] and Stew’s [NZR chairman Stewart Mitchell] job as well to critique me … I’d rather it wasn’t there but we live in the real world and we’re under pressure to perform. I don’t mind that.”
Foster confirmed he only found out he would be staying as head coach this morning.
On Schmidt joining the coaching team, Foster said he was excited for what he’ll bring to the group.
“He loved his time with Leon and the Blues and he got a taste for it … I’m delighted. He’s there for the right reasons. He compliments the group a lot.”
Foster also thanked the players for the support they’ve showed him and said he is “immensely proud”.
“There’s no doubt there was a void there for the team … but sometimes you go through a void. There was a bit of uncertainty, but our job is to play through that.”
Recap of the press conference:
Watch live: NZ Rugby set to announce Ian Foster's future – New Zealand Herald
Volusia Art Notes, Aug. 19, 2022 | Arts & Entertainment | hometownnewsvolusia.com – Hometown News
Art League of Daytona Beach
The next exhibit at the league will be a special invitational, “Men Painting Women.”
Five award-winning male artists will display works in the gallery from July 30 to Sept. 4 with a reception with the artists from 4 to 7 p.m. Saturday, Aug. 20, at 433 S. Palmetto Ave. in Daytona Beach.
For more information, visit artleague.org or call (386) 947-7103.
Singers workshop
The Daytona Beach Choral Society will host a free vocal workshop for singers from 6:30 to 8:30 p.m. Tuesday, Aug. 30, at Ormond Beach Presbyterian Church, 105 Amsden Road.
The workshop will be led by Director, Composer and Educator Tawn Thomas. Participants will focus on sight reading, ear training, technique and tools for at-home practice.
The event is open to all independent singers, choirs, and DBCS members.
For a reservation, email [email protected].
Museum of Arts & Sciences
The Museum of Arts & Sciences offers events and exhibits at 352 S. Nova Road, Dayton Beach.
Lunch and Learn: “Tech Savvy: Home Technology from 1890-1990” will meet from noon to 1:30 p.m. Friday, Aug. 19. Mr. Zachariah will lead a tour of the exhibit and lunch will be in museum cafe. Tour is free for members and $5 for members, both required to buy lunch. Advanced reservation required.
Movie Night in the Lohman Planetarium will be from 7 to 10 p.m. Friday, Aug. 19. Superhero Summer continues with “The Batman”. Movie goers should arrive at least 15 minutes before the event. Tickets are $10 for members and $12 for non-members.
Artist Landscape Demonstration with Arnold Desmarias will be from 1 to 4 p.m. Saturday, Aug. 20, Wednesday, Aug. 24, and Saturday, Aug. 27. Mr. Desmarais, a master landscape artist, will recreate “Mount Mansfield, New Hampshire,” 1866 by Edward Darch Lewis. The unique three-day event will provide an opportunity to see the creative process from raw canvas to finished work as well as to ask questions while he works. Free for members or with paid museum admission.
MOAS After Hours: In Partnership with The Locals Mix will be from 5 to 7 p.m. Monday, Aug. 29. Includes exclusive after-hours access to all galleries, happy hour drink specials with Fun Coast Bartending, food from the Ice Queen Truck, and live music by Alexis O and DJ Jukebox Bully in partnership with The Locals Mix. Peggy Banks, the curator of this year’s Beaux Arts of Central Florida exhibit, will discuss the exhibit. Admission is free for members and $5 for non-members.
Child’s Play: Historical Toys and Games from the Collection will be on display to Sunday, Aug. 28.
This year Beaux Arts of Central Florida celebrates its 60th anniversary. The opening reception will be from 5 to 7 p.m. Monday, Aug. 29, in the Gary Libby Gallery and The Root Gallery. There will be 42 artists this year exhibiting their art in the juried show “Epiphany: Visions of Art.” The show will run until Nov. 27.
The Passport Gala, The Jazz Age: Black and Tans, annual fundraiser for the Museum of Arts & Sciences will be from 6 to 10 p.m. Friday, Sept. 23. Enjoy an evening with prohibition-era cocktails, a progressive dinner and live auction. The Smithsonian Jazz Masterworks Orchestra will perform “The Jazz Age: Black and Tans,” inspired by the speakeasy era. Tickets are $100 per person. Table sponsorships are available.
“Art as Alchemy,” an exhibit from Miami’s New World School of the Arts, will be on display until Oct. 16.
Tech Savvy: Home Technology from 1890s to the 1990s will be on display until Dec. 4.
“Key West: Southernmost USA” exhibit is on display. Explore the southernmost point of the continental United States.
The museum is open from 10 a.m. to 5 p.m. Monday to Saturday and 11 a.m. to 5 p.m. Sunday.
For more information or to register for classes or events, call (386) 255-0285 or visit moas.org.
Art exhibit
Galerie Elan is hosting its August exhibit, “Equus, Spirit of the Horse,” at 230 S. Beach St., Daytona Beach.
Gallery hours are 11 a.m. to 6 p.m. Monday to Thursday and Saturday; 11 a.m. to 9 p.m. Friday; and closed Sunday.
For more information, call (386) 871-9906 or email [email protected].
Ocean Art Gallery
Ocean Art Gallery will host “Volusia County Takes Care of Sea Turtles” at 5:30 p.m. Thursday, Aug. 25, at 197 E. Granada Blvd., Ormond Beach.
The speaker will be Allie Bernstein of the Marine Science Center. Participants will learn how to protect turtles, how Volusia helps and how they can help.
For more information or a reservation, call (386) 317-9400.
Atlantic Center for the Arts
Atlantic Center for the Arts in New Smyrna Beach has several activities coming up.
ACA Spotlight featuring Diana Cooper will be from 1 to 3 p.m. Saturday, Aug. 20, at ACA Harris House, 214 S. Riverside Drive. ACA Community Artist Bethany Bennett will lead the workshop. Participants should bring canvas or bristol board, brushes and paint colors of your choice, or ACA will provide them for a donation. No registration required. Walk-ins welcome.
Nature Sketch Club will meet at 11 a.m. Saturday, Aug. 27, at ACA Main Campus, 1414 Art Center Ave. Free and open to everyone. Artist Bethany Bennett will lead sketch techniques and wellness exercises that will bring you closer to nature.
University of Central Florida Flying Horse Editions: The Art of Research will be on display until Oct. 29 at the ACA Main Campus Pabst Visitor Center & Gallery. Free and open to everyone. Flying Horse Editions is a collaborative research studio for visual artists at the University of Central Florida.
ACA main campus gallery hours are 10 a.m. to 4 p.m. Tuesday to Friday and 10 a.m. to 2 p.m. Saturday. For more information, call (386) 427-6975.
ACA Downtown: Arts on Douglas Alt_Space Gallery and Yurick Studios Gallery hours are 10 a.m. to 5 p.m. Tuesday to Friday and 10 a.m. to 4 p.m. Saturday and by appointment. For more information, call (386) 428-1133.
Artists Workshop
Artists Workshop Inc. of New Smyrna Beach offers adult classes and workshops in the studio at Marine Discovery Center, 540 Barracuda Blvd.
Studio hours are 9:30 a.m. to 4 p.m. Monday to Friday.
The exhibit “Go Figure – Figures and Portraits” will be on display to Aug. 30 at the gallery at 115 Canal St. Hours are 11 a.m. to 3 p.m. Monday to Saturday.
Upcoming fall workshops are Abstract Made Easy with Keri Ippolito Sept. 17-18 and Painting Trees with Confidence with Robin Popp Sept. 24-25.
For more information, email [email protected], call (386) 424-9254 or visit artistsworkshopinc.com.
Hub on Canal
The Hub on Canal has workshops and classes at 132 Canal St., New Smyrna Beach.
The August exhibit opening in The Founders Gallery is “The Embodied Experience,” abstract expressionism by Liz Carey. The exhibit will be on display through Aug. 28.
Art in the Form of Film with Paul Marino will meet from 5:45 to 9 p.m. Friday, Aug. 19. “Adaptation” (2002) will be the film. Mr. Marino will introduce the film, raise questions to ponder and host a post-viewing discussion. The fee is $7, which includes a glass of wine or bottle of water.
Get Messy and Wild with Liz Carey will meet from 10 a.m. to 2 p.m. Saturday, Aug. 27. In the intuitive abstract workshop, participants get to listen to their own intuition and heart and get messy. The fee is $60 for members; $70 for non-members (plus $10 supplies fee paid to instructor). Participants should bring a canvas, 18 by 24 inches or larger, and watercolor paper. Alcohol inks and acrylic inks provided by instructor, but participants may bring their own colors. Limited enrollment.
Relax and Renew Workshop with Liz Carey will meet from 3 to 4 p.m. Saturday, Aug. 27. This workshop is a relaxation and rest experience for busy people and minds. Instructor Liz Carey will guide you to fully relax. The fee is $20 for members; $25 for non-members. Participants should bring two blankets and two and three firm bed pillows. Limited enrollment.
Other events and classes are:
•Painting Foundations with Mary Gerlach meets 9:30 a.m. to 12:30 p.m. Tuesdays. The fee is $20 per class (bring your own supplies). For information or to register, call (386) 846-3104.
•Jewelry Making and Design with Debbie Moser will meet from 4 to 5:45 p.m. Fridays. The cost is $20 per class (materials and basic tools provided). To register or for information, email [email protected].
•Group Ukulele with Sally Mackay meets multiple times during the week. The cost is $20 per class. For more information or to register, call (386) 235-4140.
•Elevate your Drawing Skills with Bob Stinziano will be from 1:30 to 4:30 p.m. each Monday. All skill levels welcome. The fee is $20 per class. Space is limited. For more information or to register, contact Mr. Stinziano at (386) 944-9249 or [email protected].
•French language classes with Yveline Del Villar are offered multiple times during the week. The fee is $20 per class. To register or for information, email [email protected] or call (407) 760-7355.
•Benvenuto in Italia! with Joanne Kehrli will meet Tuesdays with beginners 3:30 to 4:30 p.m. and intermediate 4:30 to 5:30 p.m. The fee is $96 for eight-week. For more information or to register contact Ms. Kehrli at (703) 727-7897 or [email protected].
•Harmonica with Farley Palmer will meet from 6 to 8 p.m. second Thursday of each month. Open to students of all levels. The fee is $10 per class.
Volunteers are needed for the reception desk, special events, outreach programs, promotional events, building maintenance and most all areas of operations.
For more information, visit thehuboncanal.org or call (386) 957-3924.
Antiques & Art
Antiques & Art will host a Highwaymen Art Show Sale from noon to 5 p.m. Sunday, Aug. 21, at 520 Andrews St., New Smyrna Beach.
Meet invited Highwaymen artist Al Black, one of the few remaining members and an inductee into the Florida Hall of Fame. Along with Highwaymen painting, Florida artist Jerry Chaput will showcase his work. There will be a Cuban paintings and Cuban Cookbook signing by host Rapheal Periut.
For more information, call (386) 427-9910, (386) 427-4949 or visit highwaymangallery.com.
ArtHaus classes
ArtHaus offers several classes at 3840 Ridgewood Ave., Port Orange.
Acrylic Painting Class for ages 18 and older will meet from 1 to 3 p.m. Saturdays. The classes are taught by professional artists Aaron Shelton and Savannah Zanosky. These are two-class sessions and supplies are included. Each class is $60 and includes a professionally hand-stretched canvas.
For more information or to register, call (386) 767-0076 or visit arthaus.org.
Museum of Art DeLand
The Museum of Art-DeLand is hosting the exhibit “Clyde Butcher, Cuba: The Natural Beauty,” until Sept. 18 at 100 N. Woodland Blvd.
Commissioned by the United Nations to create a portfolio of the mountainous lands of Cuba, Mr. Butcher set out on three, week-long expeditions into unfamiliar lands. Admission is free for members and $5 for non-members.
For more information, visit moartdeland.org.
Gateway Center for the Arts
Gateway Center for the Arts hosts pottery classes for adults from noon to 2 p.m. each Wednesday at 880 N. U.S. 17/92, DeBary.
Classes are for beginner and intermediate students. Each session is $50. Masks are required and class sizes are limited.
Open Studio is at 10 a.m. each Tuesday.
“You Satisfy: A Summer Celebration of Song” will be at 6:30 p.m. Saturday, Aug. 27. The concert will dive deep into the history of gospel music, and reflect on how far the genre has come. Tickets are $15.
Intro to Improve is back in September. Classes will be from 7 to 9 p.m. each Tuesday from Sept. 6 to Oct. 25. Class is $200 for eight weeks. Classes are lead by Jilliam McManus and Dyland Miller from Subject to Change.
Volunteers are needed. Volunteers will be able to participate in events and shows for free, while also gaining credit for future classes and shows.
For more information or a reservation, call (386) 668-5553 or visit gatewaycenterforthearts.org.
Choir auditions
The Singsations Youth Choir for ages 7-13 will have auditions and registration from 9 to 11 a.m. Saturday, Aug. 27, and 4 to 6 p.m. Wednesday, Aug. 31, at
Dickinson Memorial Library and Hall, 148 Albertus Way. Orange City.
Rehearsals will be from 4:30 to 6 p.m. Wednesdays from September to December.
For more information, call (386) 216-9917.
The Singphony Youth Chorus for girls and boys from fourth to eighth grade will meet from 3:45 to 5 p.m. each Wednesday starting Aug. 31 at 880 N. U.S. 17/92, DeBary.
Tuition is $175 per semester and $25 chorus fee from August to December. The holiday concert will be at 7 p.m. Friday, Dec. 9.
For more information, call (386) 668-1060.
Your comment has been submitted.
Reported
There was a problem reporting this.
Log In
Keep it Clean. Please avoid obscene, vulgar, lewd, racist or sexually-oriented language.
PLEASE TURN OFF YOUR CAPS LOCK.
Don't Threaten. Threats of harming another person will not be tolerated.
Be Truthful. Don't knowingly lie about anyone or anything.
Be Nice. No racism, sexism or any sort of -ism that is degrading to another person.
Be Proactive. Use the 'Report' link on each comment to let us know of abusive posts.
Share with Us. We'd love to hear eyewitness accounts, the history behind an article.
Success! An email has been sent to with a link to confirm list signup.
Error! There was an error processing your request.
Would you like to receive our daily news? Signup today!
Want to receive our paper at home? Subscribe to our Print Edition!
To advertise your business, call (386) 322-5900.
Agencies | National | Regional: Call Amanda Tucker at (772) 467-4352.
Sign up for our free e-newsletter:
Email [email protected] to get started.
We’re always interested in hearing about news in our community. Let us know what’s going on!
Sorry, there are no recent results for popular videos.
Sorry, there are no recent results for popular commented articles.
Designing with EQ Featuring Aaron Brody, Director, Analytics, Carat US | LBBOnline – Little Black Book – LBBonline
Welcome to Designing with EQ by Carat. In this series we take a closer look at the unique backgrounds, passions, and talents that make up the agency team, and how they come together to design for people and brands.
For August’s edition, we sat down with director of analytics, Aaron Brody. Have a read to learn more about his unique background as a creative writing major and how he uses this skillset to tell a story with data.
Q> What was your first job? What was the most important skill/lesson you learned?
Aaron> When I graduated college, I became a communications planner for a small advertising agency in New York. Unlike Carat, we did not have different teams for the many agency roles. As part of that job, I learned all the functions of running a campaign such as market research, ad ops, and digital/social planning. It taught me to be flexible and shift my day-to-day based on the different role I needed to play.
Q> How has your career evolved since you first joined Carat?
Aaron> I joined as an associate director of analytics and now I am a director of analytics. When I joined as an AD my goal was to make sure that all reports got done on time. As I moved into a director role, I focus more on measurement strategy and thought leadership. For example, questions I ask myself include, “How can we better measure our campaigns and what are new and innovative ways to tackle measurement problems within those campaigns?”
Q> What is your favorite aspect of Carat?
Aaron> I love how close our teams are. Something I heard regarding large agencies is that teams are super siloed, and it is less common to interact with teams outside of your own. That is not the case at all here. All the teams across Microsoft interact and share helpful info with other client accounts and other service lines as well.
Q> Tell us about an accomplishment you’re most proud of during your time at Carat
Aaron> As cookies are being phased out, we are losing a major way of measuring campaign success. I have been working with dentsu and Microsoft on an initiative called the Attention Economy. The work I do with Microsoft is around how we can best compile a new metric that can replace measurement using cookies. This is done by using attention as a metric. We have used it across multiple campaigns and proved its effectiveness. I am proud that we have gotten ahead of the curve for when cookies ultimately go away entirely.
Q> What is something unique about you, your background, or your role that you bring to the Carat community?
Aaron> For someone with a role in analytics, I have a unique background. I was a creative writing major in college. With this skillset, I try to bring more of a storytelling perspective into how we talk about measurement. Clients will tune out if you just throw numbers at them, so I try to tell a story with their data. I also apply this to our reports to make sure they are more narrative focused.
Q> Working at Carat I’m designing for ____?
Aaron> I am designing for data cleanliness. So much of what we do is translating data for clients so it can be easily used and read. We have moved away from static excel reports and changed the way we are reporting to make it more user friendly and readable.
Carat is uniquely positioned to design for people on behalf of brands. Our people are our greatest asset, bringing diverse backgrounds together to bring insight and emotion to marketing. Interested in learning more? Check out the Carat LinkedIn page here.
Thu, 18 Aug 2022 13:24:00 GMT
v8.4.3
Production Coordinator – Pedestrian TV
Sydney
Posted 19 Aug 2022
Closes 18 Sep 2022
Ultimo, NSW
$30-$36 p/h + Super
Architects of Entertainment is seeking a live music production coordinator to fill a support role across a number of the live music events in our client portfolio, for immediate start. The successful candidate will have some practical experience in live music production and events and is looking to advance their production management career.
Reporting directly to the Head of Production and working from our Ultimo office, the production coordinator will:
The ideal candidate will have:
Please note this is a part time role, with opportunities for more hours and a more permanent position for the right team member. We estimate 30 hours / 4 days per week to start, with more hours to be worked during show weeks, and will require some evening and weekend availability.
Architects of Entertainment is Australia’s premier outdoor music event agency, specialising in large format live music event development, event management, and production management. Our client portfolio includes:
To express your interest in this role, please complete the form at the link below:
https://forms.gle/4P9YGtv2Uic21guB6
Hourly rate commensurate with experience.
Please note: only applications which include both a resume or CV and a short cover letter speaking to your suitability for the role will be considered. Only interview candidates will be contacted.
Sign up with your Facebook
or Linkedin account
Please select at least one of the following options to continue
By signing up, you agree to Pedestrian Group’s Terms of Service and consent to our Privacy Policy.
Already registered? Login here
Georgia Southern expands accessibility with new online Professional Communication and Leadership master's program | Newsroom – Georgia Southern University Newsroom
August 17, 2022
In a constantly changing world with new mediums for communication, it’s critical for professionals to be adaptive to the latest communication strategies. Georgia Southern University is continuing to lead the country in this digital transformation by expanding its Master of Arts (M.A.) program in Professional Communication and Leadership to online platforms.
The Master of Professional Communication and Leadership is designed to further professional development through coursework in written and verbal communications skills, critical thinking and leadership. The program is directed toward both traditional and nontraditional students who are either already in the workforce or are making the transition from an undergraduate degree to a professional setting. More information can be found here.
More than 70% of college students are enrolled in at least one course offered exclusively online, according to the National Center for Educational Statistics. Many experts believe this is not a short-term adjustment, but instead a reflection of a new norm in higher education.
Even before the pandemic, Georgia Southern University has been expanding accessibility to its undergraduate and graduate programs across all of its campuses and online. Now, another program is added to that list.
“If you’re already in a career and perhaps it’s too far to commute, this allows you to get an advanced degree, and then apply for that next step in whatever field you’re in,” said Pamela Sears, Communication Arts interim chair. “It’s beneficial to a great number of different industries.”
Previously, the program was a hybrid consisting of online and in-person courses. The addition of a fully online curriculum opens the door to an expanded student population.
Posted in Press Releases
Tags: College of Arts and Humanities, College of Graduate Studies, Department of Communication Arts
< Previous
University Communications and Marketing • P.O. Box 8055, Statesboro, GA 30460 • 912-478-6397 • [email protected]
Statesboro Campus
1332 Southern Drive
Statesboro, GA 30458
912-478-4636
Armstrong Campus
11935 Abercorn Street
Savannah, GA 31419
912-478-4636
Liberty Campus
175 West Memorial Drive
Hinesville, GA 31313
912-877-1906
Accreditation / Sitemap / Privacy / Ethics Hotline / Open Records / Human Trafficking Notice / Equal Opportunity & Title IX / University System of Georgia
Copyright © 2022 · All rights reserved
My Big Fat Fabulous Life: Why Fans Think They Know French Man Identity – Screen Rant
My Big Fat Fabulous Life viewers have turned into sleuths, hoping to figure out who the French man is, and some think that they’ve found his identity.
Sleuthing My Big Fat Fabulous Life fans believe that they have finally figured out who Whitney Way Thore's mystery Frenchman is. For two seasons, Whitney has made sure to keep her newest boyfriend under wraps. However, after some intense investigating, fans think that they have figured out his identity.
As TLC viewers are aware, Whitney has been seeing a man from Paris, whom she originally met over a language app, while trying to learn the language of love. My Big Fat Fabulous Life season 9 showed Whitney falling head over heels for her tutor. Viewers were a bit concerned that she was being catfished, but she Skyped with the man, who seemed to be real. At the time, Whitney had just gotten out of a bad breakup with Chase Severino. The UNC Charlotte alum Chase revealed that he had cheated on Whitney during the pandemic, and fathered a child. Thankfully, Whitney decided not to give up on romance.
Thanks to a TLC editing faux pas, My Big Fat Fabulous Life viewers feel that they may have cracked the case of the mystery Frenchman. As Reddit user u/anxiousanomly2 pointed out, production forgot to block out Whitney's boyfriend's name when they first decided to video chat, and he was shown under the name, Nail. After a bit more digging, it was revealed the man's full name was Nail Rayner, who is a Parisian rapper. He had worked with Rekyou, a Paris music production company, but his videos have since been deleted from the site.
Nail's social media has also been deleted. However, before it was lost, Nail's Facebook showed only his photograph, which spotlighted a rather young-looking man who could have easily been in his late 20s. The picture showed him wearing a flowered shirt, while sporting his seemingly natural dark curls. It is odd that an aspiring musical artist doesn't have active social media accounts, with fans questioning once again if this was a set-up by production. Viewers once believed that Chase was a hired boyfriend, and now, many fans wonder if Nail was indeed under contract.
For now, Whitney has not confirmed the identity of her secret boyfriend, but has promised My Big Fat Fabulous Life fans that he will be seen in the new season. For Whitney's sake, followers hope that the French love interest turns out to be her knight in shining armor. The dancer has already spent six weeks with him in France, and has reportedly even hired him to work for her fitness app.
Jennifer is an avid Reality TV follower and is fluent in all Real Housewives drama along with the ups and downs of the 90 Day Fiance sagas. When she is not writing she enjoys traveling the world in search of the best beaches! Jennifer has been writing for over 15 years and would like nothing more than to have a proper sit down with the women of RHONY to ‘Make It Nice.’
13 Things All Fruity Loops Producers Know To Be True – The FADER
From Kanye West and Jay-Z‘s “Ni**as in Paris” (produced by Hit-Boy) to Chief Keef‘s “I Don’t Like” (produced by Young Chop), countless hits have originated from a little music-making program called Fruity Loops. Created by a developer called Didier Dambrin for a Belgian software company 15 years ago, Fruity Loops began as a MIDI drum sequencer and has evolved into the equivalent of a portable, easy-to-use recording studio, with synths, drum machines, and the ability to record vocals or live instruments all in one place.
What differentiates Fruity Loops from similar programs is its simplicity, allowing for the prioritization of actually making music over fine-tuning every little thing about its construction. People have typically adopted Fruity Loops—which now goes by the more pro-sounding FL Studio—because of its accessibility. Admirers say its simple interface and easily attained demo version helped democratize music. But lots of professionals stick with it over other options because of how direct and fun it is to use. We talked to 10 star producers—Hit-Boy, Lex Luger, Metro Boomin, Vinylz, Young Chop, Sonny Digital, Sir Michael Rocks, Ikonika, Visionist, and E.M.M.A.—about why they love Fruity Loops, and what they all have in common.
“A close friend downloaded FL 3.0 off Kazaa back in 2002 and used to make beats for me to rap on,” Hit-Boy told TheFADER. “Around 2003 I met another friend who taught me how to program simple drums on the program and from there I’ve been on it just about every day.” Similarly, Lex Luger used Cake Walk and Acid Pro until a friend suggest FL. “He was like, ‘Man, you ain’t gotta do all that shit,” Luger said. “Fruity Loops is just boom boom bat. It’s so easy to compress shit and do this and that.”
“I had followed Soulja Boy, and I knew that’s what he was using. I knew 9th Wonder had used it too, and that a lot of EDM and dubstep was being done through it,” Metro Boomin told us. When Ikonika first tried FL, she said she “felt reassured that other producers [like] Skream and 9th Wonder were already using it.”
Ikonika got her first demo version on download.com. “I’m forever grateful for grabbing that first demo,” she said. Metro Boomin echoed that it was easy access that initially drew him to the program: “I could just download it on the computer.”
Sir Michael Rocks remembers how helpful it was when he was starting The Cool Kids with Chuck Inglish. “I had the free stolen version like everybody else had. Me and Chuck were in 6th or 7th grade fucking around rapping. Back then, if you didn’t work in a major recording studio, you couldn’t just be a kid that liked making beats, it didn’t work like that. Then Fruity Loops came and the internet started cracking where you could get shit for free. Once you could download it, it was like, Let’s go.”
“You can quickly put in a sample, chop it up, and then make whatever section of the sample you want a unique sample,” Visionist explained. “With the sampler on Logic, you had to open it up in the ESX24 to load the sample and then save the sample, and then you have to say the whole key range of the sample—it was too many steps.” Hit-Boy couldn’t agree more: “Fruity Slicer is one of the greatest samplers on earth. Being able to grab a sample and throw it in slicer makes catching an interesting groove easier than having to sit and listen to each part through the whole song.”
“Out of all the interfaces, Fruity Loops has the best way to edit and sequence and lay out shit,” Metro Boomin told us. When UK bass producer E.M.M.A. was working on her song “Dream Phone,” she decided mid-way through that she “wanted to make something in 3/4.” FL made it easy for her to do that. “I just literally went into the project and changed it to 3/4 and then made it,” she said. “It was so easy to throw down my ideas when I had all this motivation to create a tune that would break down a genre.”
“You can see all the parts of the music and move them around easily,” said Hit-Boy. “Some of my most interesting programming comes from trying things out on FL and stumbling upon timings that it makes it easy for you to see.” Vinylz likes that “it’s just a bunch of squares and patterns.” For Ikonika, using FL is a lot like gaming: “I always saw FL as a computer game,” she said.
“I tried Reason, Logic, all that, but I was still using Fruity Loops,” Young Chop said. “FL Studio was more everything in your face. I ain’t have to go search for nothin really that hard. On Logic it’s hard to find sounds, you gotta go click another button. On Fruity Loops, it’s everything on the side, everything is right there.”
“The way I write tunes, it’s quite quick. Something has to happen within the first ten minutes,” Visionist explained. “If I’m spending too much time trying to work things out then I’m just going to give up. That’s why I haven’t moved from Fruity Loops to other programs, because the process of writing the tunes just takes too long and I just lose inspiration and the desire to even do it.”
Sonny Digital agreed: “It’s really just an easy-ass layout. Once you start clickin’ around and shit you kinda get what’s goin’ on in it. I taught myself everything that I know on that program, it wasn’t like I had to read the manual.”
“When you’re adding too many instruments it slows up,” Vinylz explained. “So like when I’m playing a key it takes a while until you can hear it. It’s annoying.”
“I’ve had the demo version,” Lex Luger said, “so I wasn’t able to save work.”
Young Chop had the same experience. “On the demo version, you had to track the beat out every time to save it,” he explained. “This was so crazy to me. You had to go buy a hard drive, track every sound out, throw it in the mixer, cause after that it’s no mo beat. That was fucked up. But now I got a little check and some shit, so I don’t use that version.”
As did Sonny Digital. “Shit, that’s just the way to go get some money to get the real copy.”
“You really couldn’t close it,” Metro Boomin added. “When you were done you would just have to export the MP3 cause you knew you couldn’t go back and do nothin. You just had to bounce it like it is, have an MP3 version of a beat. Shit, I used to record straight into Fruity Loops. Like, raps. I used to do full songs in that shit.”
“It crashes sometimes” said Vinylz. “It makes you wanna throw your laptop somewhere.”
“I’m lazy, so I just like getting straight to the point,” Vinylz said. “It’s simple.” E.M.M.A. says its the simplicity of Fruity Loops that helped her develop a polished sound. “If you’ve got an idea of the kind of track you want to make, just keep your tools limited, especially for new producers,” she said. “People are like, ‘Wow, she’s really developed a concept here. She’s really got a sound which is like a pretty solid, well-rounded, and individual.’ Well that’s basically because I know what I like and I stick to it and I’m not trying to reinvent the wheel I suppose.”
“There are certain things I want to do that I can’t do on Fruity Loops,” Lex Luger explained. “That’s good in a way because I can make 10 beats in a day, but it’s like those 10 beats can only go but so far.”
“In music production, you get some people that come from a technical background and use really sophisticated tools and get obsessed with finding really high quality samples,” E.M.M.A. said. “Whereas if you’re like me and don’t fit into that mold, Fruity Loops is a really easy outlet.”
“You can make whatever you want if you just sit there,” Lex Luger said. “It’s amazing what you can create. You can take old songs and flip em and make em sound like fuckin whatever you want. Back in the day they had analog shit, and you really had to sit on a machine and work hard to create this sound, and now it’s a mouse and a click away.”
Live updates: Pujols delivers with a grand slam in the pinch – St. Louis Post-Dispatch
Keep up with the latest Cardinals coverage from our award-winning team of reporters and columnists.
Get live updates from the Busch Stadium press box and in-game highlights as the St. Louis Cardinals take on the Colorado Rockies.
The Cardinals’ Albert Pujols points to Tyler O’Neill in the dugout after hitting a grand slam in the third inning against the Colorado Rockies, scoring Lars Nootbaar, Dylan Carlson and O’Neill on Thursday, Aug. 18, 2022 at Busch Stadium.
St. Louis Cardinals Albert Pujols hits a grand slam, his 690th home run, in the third inning against the Colorado Rockies, scoring Lars Nootbaar, Tyler O’Neill and Dylan Carlson on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals Albert Pujols hits a grand slam, his 690th home run, in the third inning against the Colorado Rockies, scoring Lars Nootbaar, Tyler O’Neill and Dylan Carlson on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals Albert Pujols touches home plate after hitting a grand slam, his 690th home run, in the third inning against the Colorado Rockies, scoring Lars Nootbaar, Tyler O’Neill and Dylan Carlson on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals Lars Nootbaar has a hug for Albert Pujols, who hit a grand slam in the third inning against the Colorado Rockies, scoring Nootbaar, Tyler O’Neill and Dylan Carlson on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals Albert Pujols takes a curtain call after hitting a grand slam in the third inning against the Colorado Rockies, driving in Lars Nootbaar, Tyler O’Neill and Dylan Carlson on Thursday, Aug. 18, 2022 at Busch Stadium.
St. Louis Cardinals pitcher Adam Wainwright stretches before his start against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals pitcher Adam Wainwright and catcher Yadier Molina take the field for their start against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals pitcher Adam Wainwright and catcher Yadier Molina bump fists before their start against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals pitcher Adam Wainwright works the first inning against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals pitcher Adam Wainwright visits with catcher Yadier Molina in the second inning against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals pitcher Adam Wainwright visits with catcher Yadier Molina in the second inning against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals pitcher Genesis Cabrera works the eighth inning against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals catcher Yadier Molina grabs a soft grounder hit by Connor Joe of the Colorado Rockies for an out in the ninth inning on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals pitcher Chris Stratton works the ninth inning against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
St. Louis Cardinals Tommy Edman grounds out on a forced out in the seventh inning against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
The Cardinals’ Brendan Donovan slides in to score in the first inning of a game against the Rockies on Thursday, Aug. 18, 2022 at Busch Stadium.
Cardinals infielder Nolan Gorman takes the throw from catcher Yadier Molina and tags out the Rockies’ Ryan McMahon at second base on a steal attempt in the second inning on Thursday, Aug. 18, 2022, at Busch Stadium.
St. Louis Cardinals fans head for the exits after Albert Pujols’ final at-bat, a single, in the seventh inning against the Colorado Rockies on Thursday, Aug. 18, 2022 at Busch Stadium. Photo by Robert Cohen, [email protected]
Cardinals starting pitcher Adam Wainwright works the first inning against the Rockies on Thursday, Aug. 18, 2022, at Busch Stadium.
Cardinals pitcher Adam Wainwright, from left, visits with Albert Pujols and Yadier Molina during the second inning against the Rockies on Thursday, Aug. 18, 2022, at Busch Stadium.
–
–
–
–
–
–
–
–
Keep up with the latest Cardinals coverage from our award-winning team of reporters and columnists.
Hours before he hit two homers in a 6-3 victory, Pujols gave struggling young outfielder Carlson a tip that he used to hit the game-changing, tiebreaker homer.
Veteran gives up just three hits in nine innings and none until the seventh. Milwaukee and Cardinals are 7-7 for the season.
Cardinals are looking for their best option against right-handed pitching.
Struggling outfielders O’Neill and Carlson tie game and break tie, respectively, with home runs as Cardinals win series, oust Brewers with 6-3 victory.
O’Neill drives in game-winner without swinging the bat. Goldschmidt drives in three, including hitting 29th homer.
Right-hander allows just one hit to outfield in seven innings. He is 12-1 against Colorado in his career.
Two new left-handers have made six starts, and the Cardinals have won all six. Gorman knocked in three runs and Donovan had three hits in 5-1 victory.
Montgomery stretches scoreless streak to 11 innings since joining Cardinals from Yankees. Goldschmidt and Arenado both homer and Helsley saves.
The renowned broadcaster is known for sports but has a wide resumé and never has been shy about weighing in on political topics.
The Cardinals’ lineup is starting to take shape for the stretch run.
Get up-to-the-minute news sent straight to your device.
Visual Studio 2022 17.4 Preview 1 Furthers Arm64 Support – Visual Studio Magazine
News
Last week’s release of Visual Studio 2022 17.4 Preview 1 furthers Microsoft’s efforts to support the Arm64 architecture in its flagship IDE.
Released at the same time VS 2022 17.3 hit GA status last week, v17.4 Preview 1 improves on Arm64 support that was previewed back in June with VS 2022 17.3 Preview 2. In announcing v17.4 Preview 1, Microsoft said, “Version 17.4 will be the first version of Visual Studio generally available as a native Arm64 application.”
Typically, the Arm architecture is used to build CPUs for low-power mobile devices, but it’s increasingly being used instead of x86-based architectures in larger devices. Arm64 is an extension — or evolution — of the ARM architecture that supports 64-bit processing, and Visual Studio 2022 is 64-bit software.
At the time of the June preview launch of Arm64 support, three workloads were enabled:
With this week’s update, the UWP workload has been added to that list.
The update marks the latest initiative Microsoft has undertaken to provide Arm64 support, having earlier introduced a comprehensive Arm-native developer toolchain for Arm apps, including:
“For C++ we now bundle Arm64 native versions of CMake and Ninja with Arm64 releases,” Microsoft said. “We will continue adding more workloads in previews (based on your feedback) until we GA later this year. You can vote here to help in prioritizing additional workloads, components, and experiences.”
As can be seen in the above graphic illustrating Arm64-related developer feedback items, there are requests for support for SQL development, .NET MAUI, Node.js and many more applications.
Other non-Arm64-related highlights of today’s post about what’s new in VS 2022 v17.4 Preview 1 include:
About the Author
David Ramel is an editor and writer for Converge360.
Printable Format
A maintainer of JavaScript/TypeScript for the VS Code team has completely changed the way Markdown works in the editor, replacing (and adding to) functionality that was previously baked in and augmented by extensions.
Microsoft’s managed Dev Box service for developer-oriented, Azure-based cloud workstations is now available in a public preview.
The latest monthly update to Java on Azure Tooling adds support for Azure Kubernetes Service (AKS) in the IntelliJ toolkit, along with support of Azure virtual machines.
One use case for the analysis of variance statistics technique is asking if student performances are the same in three classrooms taught by the same teacher but with different textbooks, says Dr. James McCaffrey of Microsoft Research.
Visual Studio 2022 17.4 Preview 1 furthers Microsoft’s efforts to support the Arm64 architecture in its flagship IDE, adding a new supported workload among other improvements.
> More Webcasts
Problems? Questions? Feedback? E-mail us.
What you need to know about YouTube University – Businessday
Businessday Ng –
The term ” YouTube University” refers to the wide space of learning where students, children, adults, and various professionals in Nigeria and around the globe gather to learn by taking control of their learning journey and searching for materials on the platform that would help them make that a reality.
Many people have taken advantage of this platform by learning how to produce music, code, and design websites, and I fall into the category of people who have learned how to produce music through YouTube and practical experience, said Michael Ofomona, a 400-level student at Benson Idahosa University.
“During the lockdown and holiday seasons, I learned how to arrange the songs I produced and pan sounds from YouTube, and this gave me a better understanding of how to produce other songs afterwards.”
In society today, people tend to look up things they don’t know or understand and learn whole new things from the internet through apps and websites. Still, one of the most prominent places to learn things is Youtube, a free and easily-accessible video streaming platform owned by Google LLC that provides high-quality and informative videos.
During the global lockdown due to the coronavirus pandemic, educational and e-learning-related YouTube channels gained a huge number of new subscribers as students around the globe were asked to attend classes from home while other users of this platform used it as an opportunity to learn a new skill, and as numbers have shown, most people came out of the lockdown as entrepreneurs and income earners from the skills they learned.
Read also: A fascinating look as TECNO launches Camon 19 Mondrian edition
Students and parents have agreed on the effectiveness of online videos as a teaching and learning tool. The best thing about YouTube videos is that they can be integrated into a variety of educational systems, especially online education. Video-assisted learning is a new trend in the education industry as it provides students with an exciting way to learn and understand complex concepts and subjects.
Nigerians have found YouTube courses very useful and have learned various skills from the website due to the lack of understanding in a course and lack of practice that is needed as most people use it to learn job skills like coding, graphic design, a foreign language, music production, financial literacy, cryptocurrency trading, and UI/UX (User interface design for machines and software, such as computers and mobile devices, which is focused on maximizing usability and user experience).
I learned from PwC, Arise news, channels, and energy companies’ pages. Even in a situation whereby I didn’t fully understand what my lecturer had said, I went on YouTube and I got a much simpler and better understanding, said Chinedu Ndigwe, an energy journalist.
When I was learning web development, I went on YouTube to learn the course. I gained an understanding of Java, Python, and C++, and now I’m currently learning Bash, said Rhema Okeke, a computer science graduate.
I’m currently learning how to make beats on youtube from seventh’ beats Areola Samuel, a student at Crawford University.
YouTube Channels based on educational categories
Youtube channels that teach people about health include Ninja Nerd, Osmosis, Lecturio, and Dr Najeeb.
The Youtube channels that teach coding include The Net Ninja, The Futur Academy, and MIT open courseware.
Youtube channels that teach UI/UX and everything Adobe include Bring your laptop.
Youtube channels that teach SEO include Aferfs.
GaryVee teaches entrepreneurship through Youtube.
Youtube channels that teach beat-making include seventh’s beat, Landr Producer Grind, Servida Music, Kenny Beats, and Joey (Lucky Boy) Nato
Financing and business intelligence YouTube channels include Charlee Wayne, MIT Open Courseware, and Corporate Finance Institute.
Strategic management channels include City Lectures, nhyira premium, and Michael Nugent.
youtube also gives a course on how to become a creator
Nigerian service providers, YouTube Data Plan
Telecommunication companies in Nigeria like MTN, GLO, AIRTEL, and 9MOBILE have provided special YouTube data plans for their users to make it possible for them to learn and explore the app at a lower cost.
The MTN YouTube pack costs N150 and has a data volume of 750MB. You can activate this YouTube pack by texting VP1 to 131.
The 3-hour YouTube pack can be used to stream YouTube videos for 3 and it is valid for 24 hours. It costs N400 and has a data volume of 2.25GB. You can activate it by texting VP3 to 131.
You can easily check your MTN YouTube streaming data balance simply by dialing *559*18#.
GLO YouTube offers Glo customers the chance to use YouTube offers once they buy Glo data plans of N500 and above.
You can stream YouTube videos from 1:00 am to 5:30 am. The offer is auto-renewed once you renew your data plan with Glo Data of N500 and above. Glo YouTube’s offer is capped at 2.5GB.
Airtel YouTube offers three YouTube offers, namely: Airtel YouTube-Plus Pack, YouTube Weekly & Monthly Packs, and YouTube-Night Packs.
Airtel YouTube Plus is a standard data plan that allows you to stream YouTube videos all night, from 1 am to 5 am.
YouTube Plus is of four types, namely: YouTube Plus 1.0, YouTube Plus 2.0, YouTube Plus 3.0, YouTube Plus 4.0, and YouTube Plus 5.0, and you can subscribe by dialing *323 #.
The YouTube Weekly and Monthly Packs allow you to stream videos throughout the day and night. The YouTube Weekly costs N300 and is valid for 7 days with a data allowance of 300MB. You can activate the plan by dialing *323#. The YouTube monthly is valid for 30 days, costs N400, has a 600MB data allowance, and can be activated by dialing *323*11#.
The Night Weekly costs N150, is valid for 7 days, has a data volume of 300MB, and can be activated by dialing *323*22#.
9mobile youtube offers free YouTube offers in its data plans for streaming daily from 1:00 am to 5:00 am when you recharge a recommended 9mobile data plan.
The recommended 9mobile data plans are the N1000 for 1GB, the N3000 for 4GB, and the N4000 for 5.5GB data plans. Additionally, mobile9 offers unlimited video streaming, not limited to YouTube, with 9mobile video packs valid for 2 hrs, 3 hrs, or 7 hrs, which cost N400, N500, or N1000.
Get real time updates directly on you device, subscribe now.
Strengthening your financial wellbeing through investment
Talks on fintech growth and operations in Nigeria
PalmPay launches Wallet Safe Workshop to boost payment security awareness
Future of payments: The integration of instant messaging apps with payment services
Get the best of world News delivered to your inbox daily
latest news
2023: We’re moving out of PDP if crisis remains unresolved – Gana
Zylus Homes tackles housing deficit with launch of Zylus Court Phase II
Strengthening your financial wellbeing through investment
Talks on fintech growth and operations in Nigeria
FG to increase budget for staff housing loans in 2023 – Buhari
Business Day, established in 2001, is a daily business newspaper based in Lagos. It is the only Nigerian newspaper with a bureau in Accra, Ghana. It has both daily and Sunday titles. It circulates in Nigeria and Ghana
BDlead
Dollar-to-naira rent transition seen creating opportunities…
IATA expresses disappointment over $464m foreign airlines’…
Nigeria bleeds while Middle Eastern oil producers reap…
A weighted energy consumption minimization-based multi-hop uneven clustering routing protocol for cognitive radio sensor networks | Scientific Reports – Nature.com
Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.
Advertisement
Scientific Reports volume 12, Article number: 14039 (2022)
Metrics details
Aiming at solving the effective data delivery and energy hole problem in multi-hop cognitive radio sensor networks (CRSNs), a weighted energy consumption minimization-based uneven clustering (ECMUC) routing protocol is proposed in this paper. For the first time, the impact of control overhead on the network performance is taken into consideration, to be specific, the energy consumption of control overhead is integrated with that of data communication to model the network energy consumption. Through effective transformation and theoretical analysis, cluster radius of each ring is derived by minimizing the network energy consumption and balancing the residual energy among nodes in different rings. Distributed cluster heads (CHs) selection and cluster formation are carried out within this range to control the cluster size and the corresponding energy cost. Expected times for being CHs metric is defined to measure nodes’ energy and spectral potential and help select powerful CHs. Simulation results show that ECMUC protocol is superior to most clustering protocols designed for CRSNs in terms of network surveillance capability and network lifetime, and it is also demonstrated that taking control overhead into consideration is beneficial for improving the network performance.
Cluster-based cognitive radio sensor networks (CRSNs) are promising solutions to solve the energy efficiency and spectral efficiency problem faced by legacy wireless sensor networks (WSNs)1. Cognitive radio technology allows sensors to exploit licensed spectrum in an opportunistic manner and relieves the performance degradation incurred by spectrum shortage in unlicensed bands2. Due to the introduction of CR, the definition of neighbors has changed, i.e., two nodes are neighbors if they can satisfy the Euclidean distance requirement and share at least one common available channel. However, CR functions such as spectrum sensing and dynamic spectrum access will consume limited node energy, and the energy constraint problem of CRSNs is further aggravated. Therefore, minimizing the network energy consumption becomes the primary goal of protocol design for CRSNs. Clustering logically groups similar nodes in proximity and reduces traffic through data fusion and aggregation, which can help conserve energy3. In large-scale CRSNs, all nodes cannot reach the sink through single-hop communication, and multi-hop inter-cluster routing problem needs to be solved. Therefore, multi-hop clustering routing protocol design for CRSNs has become a hot topic in academia and industry.
The limitations of current research on multi-hop clustering routing protocol design for CRSNs can be summarized as follows:
Current literature just focuses on the energy consumed by data communication and ignores the control overhead incurred during cluster heads (CHs) selection, cluster formation and route selection when theoretically analyzing the optimal number of clusters. Control information exchange will bring non-negligible energy consumption to the whole network4. Ignoring this part of energy consumption is beneficial for simplifying the theoretical analysis, but the obtained results may be inappropriate for achieving the design goal.
Most existing clustering protocols for CRSNs are uniform clustering protocols which establish clusters with almost the same size. Due to the towards-the-sink type of traffic in CRSNs, CHs close to the sink need to perform more inter-cluster relay forwarding tasks which will accelerate their energy exhaustion. The energy hole problem incurred by uneven distribution of energy consumption among CHs will occur5. In addition, the early death of CHs which are close to the sink and network partition will significantly degrade the surveillance capability of CRSNs6.
Current uneven clustering protocols proposed for CRSNs usually adopt constant coefficients, and the cluster radius is designed to linearly increase as the Euclidean distance to the sink increases. However, the optimality of the simple linear relationship has not been proven, and the coefficients should be analyzed and optimized according to specific network configurations instead of fixing their values. Here, the specific network configurations refer to the network size, node density, maximum node transmission range, data packet size, control packet size and Euclidean distance to the sink.
In order to take full advantages of uneven clustering, i.e., enabling the CHs close to the sink to conserve more energy for inter-cluster relay and solving the energy hole problem effectively7, a weighted energy consumption minimization-based uneven clustering (ECMUC) routing protocol is proposed in this paper. By minimizing the network energy consumption and balancing the residual energy among nodes in different rings, the optimal cluster radius under specific network configurations is derived. ECMUC partitions the whole CRSNs into uniform rings and forms uneven clusters based on the obtained cluster radius within these rings. The innovations of ECMUC protocol are summarized as follows:
Energy consumption of data communication and control overhead are for the first time integrated to model the network energy consumption, and minimizing it is the primary design goal of ECMUC protocol.
The objective of minimizing the network energy consumption and balancing the residual energy among nodes in different rings to solve the energy hole problem is innovatively transformed into minimizing the weighted sum of the energy consumption of each ring and the additional energy consumption introduced to the whole network by it. Through theoretical analysis, cluster radius in each ring is reasonably set to control cluster size.
Expected times for being CHs (ETBCHs) metric is defined and leveraged to measure nodes’ energy and spectral potential. Based on ETBCHs comparison within the cluster radius, the most powerful node in the neighborhood becomes a final CH. ECMUC protocol can autonomously achieve distributed CHs selection, cluster construction and multihop inter-cluster route selection to forward the monitored data towards the sink. Extensive simulations show that ECMUC protocol can significantly improve the network surveillance capability and extend the network lifespan.
The rest of this paper is organized as follows. “Related work” section reviews clustering protocols designed for CRSNs, including uniform and uneven clustering protocols. System model is described and ECMUC protocol is explained in details in “Methods” section. “Results and discussion” section tests and evaluates the performance of ECMUC protocol. Finally, “Conclusions” section concludes the paper and points out our future research directions.
According to the data report model adopted, current clustering protocols for CRSNs can roughly be classified into event-driven clustering protocols and time-triggered clustering protocols. Event-driven clustering protocols, such as ESAC8, mESAC9 and ERP10, are triggered by emergent events and form temporary clusters in the corridor between the event and the sink until the event ends up. They are designed for event-driven applications and are not suitable for applications which require continuous and periodical information collection11. On the contrary, time-triggered clustering protocols form clusters in the whole network and maintain them by periodical calculation and communication until the end of network lifetime. They can be further divided into uniform clustering protocols and uneven clustering protocols based on the cluster size. In the following sub-sections, we will review related work from these two aspects.
Uniform clustering protocols for time-triggered CRSNs can be further divided into 3 sub-categories, i.e., centralized, distributed and hybrid protocols. CogLEACH-C12, ABCC13 and IMOCRP14 are typical representatives of centralized protocols. Though different factors are considered when selecting CHs, necessary information should be collected and handled by the sink, which requires that all CRSNs nodes should reach the sink through single-hop communication. Therefore, they all suffer problems such as network scalability and single point of failure, which limits their application field.
Most clustering protocols for time-triggered CRSNs are distributed and uniform cluster-based in nature, such as CogLEACH15, NSAC16, EACRP17, ESUCR18 and so on, as shown in Table 1. These protocols select CHs and form clusters in the locality through extensive information exchange. Among them, CogLEACH is a distributed spectrum-aware extension of LEACH protocol19. CogLEACH uses the number of idle available channels as probability weight for CHs selection, and each CRSNs node can independently judge whether itself can become a CH or not by comparing its CHs weight with a random number. NSAC builds stable clusters by taking the spectrum dynamics and energy consumption comprehensively into consideration. Nodes with the highest weight in the neighborhood win competition and become CHs, and other nodes in the maximum edge biclique become corresponding cluster members (CMs). These nodes will be excluded from clustering, and cluster formation continues until all CRSNs nodes are clustered. EACRP and ESUCR iteratively merge neighboring clusters until the optimal number of clusters is achieved. Except for the residual energy, the number of available channels, the number of neighbors and the distance to the sink are used to compute CHs weight. Primary and secondary gateway nodes are leveraged to relay packets between neighboring CHs.
WCM-based spectrum-aware clustering protocol (hereinafter refer to as WCM)20 is a typical case of hybrid clustering protocols. In WCM, a new weighted metric which simultaneously evaluates the temporal-spatial correlation, confidence level and residual energy is proposed to select CHs. Then the sink merges neighboring clusters with the highest temporal-spatial correlation until the objective function cannot be improved any more. Extensive control information exchange will quickly drain node battery, and then nodes will die.
In all uniform clustering protocols, besides intra-cluster data communication, CHs near the sink should also relay packets for other parts of the network, which means balanced energy distribution among CHs cannot be guaranteed. Therefore, early death of CHs near the sink will occur and this will further result in network partition.
Different from above uniform clustering protocols, cluster radius in uneven clustering protocols increases as the distance to the sink increases, which can help balance the residual energy among CHs. LEAUCH21 is a representative uneven clustering protocol for CRSNs, and it determines final CHs by competition among candidate CHs within the cluster radius. Cluster radius is calculated according to the Euclidean distance to the sink di,sink, as shown in Eq. (1).
where Rc0 is the maximum cluster radius of candidate CHs; c is a constant coefficient for uneven clustering; dmax and dmin are the maximum and minimum Euclidean distance to the sink from CRSNs nodes, respectively. However, the candidate CHs selection threshold 0.4 has a large impact on network performance, and in most cases, no candidate CHs can be selected at all. R-bUCRP22 adopts the same manner to calculate cluster radius, and its random candidate CHs selection cannot guarantee the optimal distribution of candidate CHs. Therefore, the CHs selection is largely affected. IACUCAPTEEN23 and ESAUC24 improve the cluster radius calculation of LEAUCH by taking more factors into consideration, such as the node residual energy, the number of neighbors and the number of available channels. However, they still adopt fixed weighted coefficients which need to be analyzed and optimized according to specific network configurations. In addition, the weighted coefficient ω in ESAUC is not given.
As stated above, current uneven clustering protocols are basically proposed on the basis of LEAUCH, therefore, cluster radius is not obtained by theoretical derivation with the purpose of balancing the residual energy among CHs. Instead, the cluster radius is designed to linearly increase as the Euclidean distance to the sink increases, which needs to be analyzed and optimized25.
From above table and analysis, we can obtain the following observations:
Current research on theoretical analysis of the optimal number of clusters wholly focuses on the energy consumption of data communication, while the energy cost of control information exchange is neglected. In addition, in order to simplify analysis, current literature usually simplifies the calculation process of energy consumption of inter-cluster communication, that is to say, assumptions are made that each data packet needs at most once relay to reach the sink. Actually, multi-hop inter-cluster relay is more practical, especially in large-scale CRSNs. This may restrict the network scalability and lead to the inapplicability of the derived results.
Current uniform clustering protocols cannot guarantee balanced energy distribution among CHs. Therefore, early death of the CHs which are close to the sink will occur and this will further result in network partition.
In existing uneven clustering protocols for CRSNs, the cluster radius is usually quantified under given constant coefficients, and it is assumed to be linearly proportional to the Euclidean distance to the sink. However, in order to take full advantages of the potentials of uneven clustering in balancing the residual energy among CRSNs nodes, these coefficients and cluster radius should be optimized according to specific network configurations.
All these motivate us to propose ECMUC protocol which integrates energy consumption of data communication and control information exchange together for the first time and solves the energy hole problem effectively by balancing the residual energy among nodes in different rings as much as possible.
N homogeneous CRSNs nodes with initial energy E0 are uniformly and randomly distributed in the surveillance area (the area is approximated as a circle), coexisting with P randomly-deployed primary users (PUs). The sink is located at the center to gather useful information about the whole area and provides it to end users26. Once deployed, CRSNs nodes no longer move unless their residual energy is exhausted. Each CRSNs node is configured with one transceiver, so it cannot send out and receive information at the same time. Additionally, it leverages received signal strength or certain localization algorithm to obtain its relative distance from the receiver, according to which it can adapt its transmission power. Competition-based method is applied for CHs selection, and the most qualified node in the neighborhood becomes final CH who is responsible for intra-cluster data collection and aggregation. The data aggregation effect of CHs can be measured by aggregation coefficient β. Here, perfect aggregation is assumed, which means packets from CMs can be fused into a single packet with fixed length, i.e., β is equal to the reciprocal of the number of CRSNs nodes in the whole cluster27. Restricted by limited node transmission range, multi-hop communication is exploited to realize inter-cluster data delivery.
In order to determine cluster membership based on the Euclidean distance to the sink, the surveillance area is partitioned into different rings around the sink. Uneven ring division usually results in more rings, especially for large-scale CRSNs. More rings mean more times of inter-cluster data relay which will lead to heavier energy consumption. Therefore, in order to reduce energy consumption and guarantee the minimum data transmission delay, we prefer to organize our CRSNs into uniform rings whose width is Rt, as shown in Fig. 1.
Uniform ring division with ring width Rt.
Each CRSNs node consumes energy in sending and receiving control and data packets, and the energy consumption of transmitting an l-bit packet over distance dj,k is quantified by19:
where Eelec is the energy consumption of transceiver electronics per bit; εfs and εmp are the energy consumption of power amplifier per bit in free-space and multi-path loss model, respectively; d0 is the distance threshold, and d0 = (εfs/εmp)1/2. The energy consumption of receiving corresponding packet is:
Markov renewal process is widely used in literature to imitate PUs activity, and it assumes ON/OFF model for PUs behavior28. In other words, PUs activity on given channel alternates between ON and OFF states whose duration are geometrically distributed random variables with parameters pc and qc.
As mentioned earlier, our design goal is to minimize the energy consumption of all rings in CRSNs and balance the residual energy among nodes in different rings to avoid energy holes. The energy hole problem occurs due to the uneven distribution of energy consumption among nodes in different rings, i.e., nodes in inner rings drain their battery more quickly than those in outer rings. Therefore, in order to solve this problem, ECMUC must slow down the node death rate of inner rings to guarantee that it should not be faster than outer rings. Based on uniform ring division with fixed ring width Rt, our clustering objective can be transformed into minimizing the weighted sum of the energy consumption of ring i (i ∈ [1, 2, …, Lmax]) and the additional energy consumption brought to the whole network by it. Here, Lmax is the maximum ring number of all CRSNs nodes, as shown in Eq. (4).
where N is the total number of CRSNs nodes; (xj, yj) and (xsink, ysink) are the coordinates of node j and the sink, respectively. Rt is the maximum transmission range of CRSNs nodes. Each node j determines its ring index according to Eq. (5) below.
where dj,sink is the Euclidean distance from node j to the sink. L(j) will be used for CHs selection and cluster formation later on.
In order to achieve our clustering objective, ECMUC enables all CRSNs nodes in ring 1 to act as separate CHs and share the inter-cluster data forwarding tasks, which can help reduce their energy consumption speed. In addition, ECMUC balances the residual energy among nodes in different rings by reasonably setting cluster radiuses, and we will show how to determine their values through theoretical analysis according to specific network configurations. Of course, ECMUC also tries to balance the residual energy of nodes in the same ring as much as possible, such as CHs rotation among nodes in ring i (i ≠ 1) based on the ETBCHs metric or enabling nodes in ring i (i ≠ Lmax) to take turns acting as relays. ETBCHs metric is defined by combining the energy potential and channel availability of CRSNs nodes. Based on this metric, CHs competition in the neighborhood is carried out to determine final CHs who are responsible for building their own clusters and search for available inter-cluster routing paths.
In CRSNs, due to the dynamic channel occupancy behavior of PUs, the channel availability is time- and position-dependent. At the beginning of each round, each CRSNs node j leverages CR functions such as spectrum sensing to perceive the channel availability at its position and decides its available channel list Cj, which determines whether CRSNs nodes can communicate with each other and whether information transmission can be successful. CHs selection, cluster formation and route selection of ECMUC are all based on the available channel information. In other words, channel availability obtained from CR functions will affect the clustering results and the next-hop relay selection, which will further affect node energy consumption. In ECMUC, CHs competition is conducted among neighboring nodes belonging to the same ring, and different strategies will be applied for distinct Lmax. To be specific, if all CRSNs nodes can reach the sink through single-hop communication, i.e., Lmax = 1, energy consumption of the whole network can be minimized by setting each CRSNs node as a separate CH. In other words, non-clustering is the most energy-efficient way of network organization in this scenario14. For example, if data from n normal nodes needs to be transmitted to the sink, for simplicity reason, distance from each node to the sink dtosink is assumed to be the same and dtosink ≤ d0.
Without clustering (as shown in Fig. 2a), the total energy consumption Etotal is:
Comparison of energy consumption in non-clustering and clustering scenarios.
In clustering case, assuming that data from other nodes is aggregated at node A and then the aggregated data is transmitted to the sink, as shown in Fig. 2b. The total energy consumption Etotal‘ is:
where the first item on the right side is the total energy consumption of data transmission from other nodes to A. The second item is the energy consumed by A in data reception. The third item is the energy cost of data aggregation at A, and the last item is the energy spent on data transfer from A to the sink.
The difference in the total energy consumption between above two cases is as follows:
For typical transmission range of CRSNs nodes, it is usually the case that ∆E > 0, which means non-clustering can lead to lower energy consumption. This conclusion will be verified by the simulation results in Performance analysis in Case 1 section. In this case, each living CRSNs node does not need to consume extra energy to exchange control information for CHs selection and cluster formation. Instead, it sends its monitored data to the sink directly to minimize the total energy consumption. In particular, data transmission is performed on randomly selected channel from available channel list, and the purpose is to reduce the number of competing CHs who contend for channel access when carrier sense multiple access with collision avoidance (CSMA/CA) protocol is applied.
If all CRSNs nodes cannot reach the sink through single-hop communication, i.e., Lmax ≥ 2, all CRSNs nodes in ring 1 still act as independent CHs. This enables more nodes to share the inter-cluster data forwarding tasks and reduce the energy consumption speed, which is beneficial for solving the energy hole problem. ETBCHs metric should be compared among neighbors in the same ring (except ring 1) to compete for CHs, and the one with the highest ETBCHs value in the neighborhood becomes final a CH. In round t, ETBCHs value of node j (in ring i) is defined as follows:
where Ej is the residual energy of node j; ECH_j(i) is the expected energy consumption of node j for being a CH once in ring i, and of course, it does not include the energy consumption of channel switching. Therefore, the energy spent on intra-cluster channel switching is further added. Esw is the energy consumption per channel switching, and intra_sw is the expected minimum times of channel switching performed by j. neighj is the number of neighbors of node j. ⌊x⌋ returns the nearest integer which is smaller than or equal to x. As CHs role will rotate among node j and its neighbors as network operation goes on, j will become a CH every neighj + 1 rounds on average. Therefore, the first item in Eq. (9) quantifies the maximum number of times to be a CH from energy perspective for node j. If node j does not have enough energy for being a CH in this round, its ETBCHs value is zero. This can avoid unnecessary energy waste during cluster formation and data transmission. cj is its number of available channels. C is the total number of licensed channels. ncommon_k is the number of neighbors who share channel k with j. We all know that if node j has no available channel or it does not share common channels with its neighbors, i.e., (sumnolimits_{k = 1}^{{c_{j} }} {n_{common_k} }) = 0, it should not become a CH. In order to guarantee this, we add 1 to the log function. Actually, the log function item represents the expected probability of being a CH from channel connectivity perspective. Therefore, ETBCHs value measures the potential times of node j for being a CH by combining its energy potential and spectral potential.
In order to calculate ETBCHs value, we need to obtain cj, neighj, ECH_j(i), intra_sw and ncommon_k. Among them, ECH_j(i) can be obtained through analysis in Theoretical analysis of cluster radius ri section, and we use Fig. 3 to illustrate how to acquire the values of other parameters.
Example of acquiring parameters for ETBCHs calculation.
Assuming that 5 nodes A, B, C, D and E are located within the cluster radius range (ri) of node j, we have neighj = 5. The bar with numbers next to each node shows the availability of all licensed channels. From Fig. 3, we can see that 5 licensed channels are all available to j, therefore, cj = 5. Node j can reach nodes B, C and D on channel 1, therefore, ncommon_1 = 3. Similarly, ncommon_2 = 2, ncommon_3 = 3, ncommon_4 = 4, ncommon_5 = 3. If node j can become a final CH, it will broadcast time division multiple access (TDMA) schedule which assigns dedicated time slot and channel to each CM within ri. The CH will choose the channel which is available to majority of its CMs as cluster channel. If above channel is not available to a certain CM, the CH will select one common available channel between them to enable their data delivery. We call this hybrid constraint, which means that groupwise constraint29 is the main constraint and pairwise constraint30 is used as supplement. intra_sw is relevant to above intra-cluster schedule. In Fig. 3, as j can reach 4 neighbors on channel 4, channel 4 is specified as cluster channel. However, node A cannot use channel 4 in this round, therefore, CH j should select one common available channel to communicate with A, say channel 5. In order to minimize extra energy consumption brought by channel switching, the best schedule strategy for node j is scheduling transmissions from nodes B, C, D and E in 4 consequent time slots on channel 4, and then it switches to channel 5 to communicate with node A. Therefore, it performs once channel switching in this case, that is, intra_sw = 1.
After ETBCHs calculation, all living CRSNs nodes compete for CHs according to Algorithm1, as shown in Fig. 4.
Pseudo code of CHs selection in ECMUC protocol.
Lines 4–9 show the exchange of ETBCHs value. Each living node j (L(j) ≠ 1) broadcasts its ETBCHs value within cluster radius rL(j), and its neighbors who are located in the same ring add j into their competing node set.
Each node, say j, compares its ETBCHs value with its neighbors in its competing node set Compenode(j). If ETBCHs(j) is smaller than one of them, node j quits from CHs competition, becomes a non-CHs node and waits for joining one cluster as a normal CM. It broadcasts quit message within rL(j) to notify its neighbors, and those who receive this message remove j from their competing node set, as shown in lines 11–18. Otherwise, if ETBCHs(j) is the highest in the neighborhood, j becomes a final CH and broadcasts CHs advertisement within rL(j) to announce its role. The advertisement includes its node ID, residual energy and available channel list to provide sufficient information for normal nodes. Nodes in Compenode(j) quit from CHs competition on receiving the CHs advertisement, as shown in lines 19–22.
During CHs selection, control packets such as node information, ETBCHs value, quit message and CHs advertisement are broadcast within the cluster radius. The energy consumed by these packets largely depends on the value of the cluster radius, and we will analyze how to obtain its value in the Theoretical analysis of cluster radius ri section.
After determining CHs in each ring, cluster formation simultaneously begins in all rings except ring 1. For each living non-CHs node, say j, it selects its CH according to the number of common available channels and the Euclidean distance between them. Node j sends out join request to the final CH and requests to become its member if such CH exists. The CH receives the join message and adds j into its CMs list. If such CH cannot be found, node j becomes a separate CH, and it will broadcast CHs advertisement similar to that in Algorithm1. Above process continues until all nodes are clustered.
For each CH, say k, if its ring index L(CH(k)) ≥ 2, it should select one CH (represented by CH(s)) from the next inner ring towards the sink to relay its packets. In order to provide information for next-hop relay selection, each CH whose ring index is larger than 1 but smaller than Lmax broadcasts its own information such as residual energy and Euclidean distance to the sink within Rt. The next-hop relay is chosen among candidate next-hop relays according to Eq. (10). Here, the candidate next-hop relay should satisfy the following conditions: L(CH(s)) = L(CH(k))-1 and dCH(k),CH(s) ≤ Rt.
where CCH(k) and CCH(s) are the available channel set of CH(k) and CH(s), respectively. The first item on the right side of Eq. (10) represents the number of common channels shared by CH(k) and CH(s). ECH(s) is the residual energy of CH(s). Econ(CH(k),CH(s)) is the energy consumption of data communication between CH(k) and CH(s), while Econ(CH(s),sink) is the energy consumption of data transmission from CH(s) to the sink. Actually, the ratio of these two items helps select appropriate next-hop relay which is located near the sink and a little far away from CH(k). The inner CH with more common available channels, more residual energy and closer to the sink has higher probability of being selected. A notification message is sent to the next-hop relay to inform about the final routing decision. If such CH cannot be found, one of its CMs who is closer to the sink is chosen to help relay the data packet towards the next inner ring. It should be noted that all nodes in ring 1 transmit their information which includes the residual energy, available channels and so on through direct link to the sink. The purpose is to reduce the energy cost during route selection, as there are numerous CHs in ring 1. Then the sink will broadcast above information to CHs in ring 2, and these CHs can choose them as next-hop relays according to Eq. (10).
In this section, we will theoretically analyze how to set cluster radius ri according to specific network configurations. Taking nodes in ring i (i ≠ 1) as an example, energy is consumed in the following 4 phases: CHs selection, cluster formation, route selection and data transmission.
The energy consumption of all nodes in ring i in CHs selection phase.
In order to compete for CHs, each CRSNs node broadcasts its own information and ETBCHs value within cluster radius ri, and these information will be received by neighbors in the same ring. The corresponding energy consumption are (Eelec + εfsri2) × l1 and Eelec × l1 × (ni − 1), respectively. ni is the number of nodes within ri. By comparison, some powerful CRSNs nodes become CHs and broadcast CHs advertisement, while others become non-CHs nodes and broadcast quit messages. These messages will also be received by neighbors within ri. Therefore, no matter for a CH or a CM, the energy consumption in CHs selection phase can be represented by:
Accordingly, the energy consumption of ring i in CHs selection phase is:
where Ni is the number of CRSNs nodes in ring i.
The energy consumption of ring i in cluster formation phase.
Each non-CHs node, say node j, selects its own CH and sends out join request message. The CH receives the message and records j as its member. The energy consumption of a CM and a CH in cluster formation phase are shown in Eqs. (13) and (14), respectively.
Consequently, the energy consumption of ring i in cluster formation phase is:
where Ki is the number of CHs in ring i.
The energy consumption of ring i and the additional energy consumption introduced to the whole network by ring i in route selection phase.
Each CH in ring i − 1 broadcasts its own information within Rt to enable next-hop relay selection, and the information will be received by CHs in ring i. Each CH in ring i determines its next hop towards the sink and sends out routing notification. The corresponding inner CH receives this notification and becomes its next-hop relay. Consequently, the energy consumption of ring i in route selection phase is:
where Ki−1 is the number of CHs in ring i − 1, and PinRt is the probability that an inner-ring CH is in the transmission range of ring-i CH. Therefore, Ki−1 × PinRt represents the excepted number of CHs in ring i − 1 from which ring-i CH can receive information. Fig. 5 is used to demonstrate how to calculate PinRt, and the detailed processes are as follows:
Illustration of PinRt calculation.
According to the Cosine Law, we have:
Consequently, the arch area S1 is obtained by subtracting the area of the triangle from the area of corresponding sector, as shown in Eq. (18).
Similarly, we can obtain:
Therefore, the probability PinRt is:
The additional energy consumption brought to the whole network by ring i in route selection phase is:
The energy consumption of ring i and the additional energy consumption introduced to the whole network by ring i in data transmission phase.
Each CH broadcasts TDMA schedule within its cluster, and it also receives and aggregates data from its members and then transfers the aggregated information to the sink. In addition, each CH should relay data packets from outer rings. Therefore, its energy consumption is calculated according to Eq. (22):
Each CM receives the TDMA schedule from its CH and transmits data according to the schedule. Its energy cost in this phase is:
We can obtain the energy consumption of ring i in data transmission phase as follows:
Data packets from ring i should be relayed to the sink with the help of inner rings, therefore, the additional energy consumption brought to the whole network by ring i can be obtained as follows:
Analysis of the final results.
The total energy consumption of ring i Etotal(i) can be obtained by merging Eqs. (12), (15), (16) and (24), while the additional energy consumption brought to the whole network by ring i ΔEadd can be derived by merging Eqs. (21) and (25).
As we know, the number of CRSNs nodes in ring i Ni = Ki × ni = Ki × πri2ρ, and here ρ is the node density. According to31, the expected squared distance from a CM to its CH ξ[dtoCH2] can be estimated by:
Our goal is to minimize the weighted sum of the energy consumption of ring i and the additional energy consumption brought to the whole network by it. The objective function can be expressed as:
where α is the weighted coefficient assigned to Etotal(i). Etotal(i) is closely related to the number of clusters Ki. Under given topology, by minimizing the energy consumption of each ring Etotal(i), we can achieve the goal of minimizing the network energy consumption and extending network lifespan. ΔEadd is the extra energy burden brought by ring i which is also related to the number of clusters Ki, and if we can minimize the additional energy consumption brought to inner rings by each ring, the residual energy among nodes in different rings can be well balanced and the energy hole problem can be solved effectively. When the area of ring i and the total number of nodes in ring i Ni are given, as can be seen from Eqs. (26) and (27), increasing the number of clusters Ki, Etotal(i) will decline while ΔEadd will rise. In this case, the energy hole problem may occur and network surveillance capability will be negatively affected. On the contrary, decreasing Ki, Etotal(i) will increase while ΔEadd will reduce. The increase of Etotal(i) will lead to faster node death in ring i, while the decrease of ΔEadd will lead to slower node death in inner rings. In this case, network lifetime will be shortened. In other words, there is a compromise between Etotal(i) and ΔEadd, i.e., there exists a reasonable Ki which can help avoid energy holes while extending network lifetime as much as possible. Therefore, by taking the derivative of Eq. (29) with respect to Ki and setting the result to 0, we can obtain the optimal number of clusters Ki, and then we can obtain the optimal cluster radius ri through Eq. (30).
In addition, by combining Eqs. (11), (14), (16) and (22), the expected energy consumption of being a CH in ring i ECH_i is shown in Eq. (31), and by substituting Rt with the actual Euclidean distance from node j to the sink, the obtained ECH_j(i) can be used in Eq. (9).
In this section, we test the performance of ECMUC protocol through extensive simulations by using Matlab which is one of the most commonly used simulation tools in evaluating the performance of clustering protocols designed for CRSNs14,20,21,26. In order to capture the impact of network size, we keep the node density ρ unchanged and analyze the performance of ECMUC protocol in three cases. In Case 1, N = 100 (Lmax = 1) is picked to assess the performance of ECMUC when all CRSNs nodes can reach the sink through single-hop communication. In Case 2 and Case 3, N = 400 (Lmax = 2) and N = 900 (Lmax = 3) are picked to evaluate the performance of ECMUC with multi-hop inter-cluster relay. Other parameter settings are shown in Table 2.
ECMUC protocol is compared with current clustering protocols for CRSNs to verify its effectiveness, such as IMOCRP14, CogLEACH15, NSAC16, EACRP17, WCM20 and LEAUCH21. These protocols have been explained in the Related work section. Evaluation metrics, such as the number of living nodes at the end of round t, the ratio of effective data gathering nodes, the total control overhead and the number of selected CHs per round, are leveraged for performance comparison.
Performance comparison results with respect to above evaluation metrics in Case 1 are provided in Fig. 6. Among them, Fig. 6a shows the variations of number of living nodes with time (represented by round number) when these clustering protocols are applied. From it, we can observe that the number of living nodes of all competing protocols decreases as round number increases. CRSNs nodes are powered by limited-capacity battery, and tasks such as information transmission and reception, data aggregation and so on all consume energy and result in rapid reduction in residual energy. When the energy left in the battery is exhausted, the node is neglected from network operation and the number of living nodes decreases.
Performance comparison results in Case 1.
In order to compare these protocols explicitly, we record the rounds in which the first death node appears. Among these competitors, ECMUC protocol achieves the best performance. The first death node of ECMUC appears in round 6,668 which is much later than other protocols. The reasons can be analyzed from the sources of energy dissipation, i.e., the total control overhead and the number of selected CHs per round. Detailed analysis is listed below:
As shown in Fig. 6b, the total control overhead of ECMUC in each round is always 0. In other words, there is no control information exchange among neighboring CRSNs nodes or between CRSNs nodes and the sink, which helps conserve energy. In this case, CRSNs nodes know that the sink is located within their communication range. They become separate CHs and directly deliver their monitored data to the sink. This explains why the number of selected CHs per round of ECMUC in Fig. 6c is obviously higher than its competitors, and this result is consistent with our theoretical analysis in Design details of ECMUC protocol section. Each living CRSNs node becomes an independent CH, which can result in the minimum network energy consumption. The only source of energy dissipation is data transmission from CRSNs nodes themselves to the sink, and their short Euclidean distance consumes a small amount of energy. Therefore, nodes can survive longer, which ensures strong network surveillance capability.
As for IMOCRP, it is a centralized clustering protocol in which CHs selection is carried out by the sink instead of normal nodes. Therefore, each CRSNs node should transmit necessary information to the sink once per round, such as location or residual energy, that is, control overhead of CHs selection is incurred by information exchange between CRSNs nodes and the sink, not among neighboring CRSNs nodes. In IMOCRP, with the purpose of minimizing the weighted sum of the average node energy consumption and the standard deviation of node residual energy, the sink leverages intelligent algorithm to determine CHs and cluster membership. Therefore, its number of selected CHs is always higher than others except ECMUC. In addition, no information is exchanged among neighboring nodes for cluster formation and cluster channel selection, and the total control overhead of IMOCRP is equal to the number of living nodes at the beginning of that round. Thanks to its low control overhead, the first death node of IMOCRP appears in round 5,411. However, in Case 2 and Case 3, many CRSNs nodes cannot satisfy the single-hop communication requirement to the sink. Therefore, they cannot run IMOCRP effectively, and it is omitted from these two cases.
Other protocols are distributed in nature, and their CHs selection and cluster formation rely on information exchange in the neighborhood. In CogLEACH, each CRSNs node can decide whether itself can become a CH or not by comparing its CHs weight with a randomly generated number (∈ [0,1]). Therefore, its control overhead for CHs selection is 0. However, it requires twice information exchange between CHs and normal nodes for temporary and final request and permission. The total control overhead of CogLEACH is about twice the number of living nodes at the beginning of each round. The random selection of CHs cannot guarantee the exact number and positions of optimal CHs, which can be observed from Fig. 6c. The number of CHs of CogLEACH in each round oscillates heavily. However, the optimal number of clusters used by CogLEACH is obtained by minimizing the total energy consumption of data transmission which is not quite comprehensive. This is the reason why their performance is worse than ECMUC. EACRP continuously merges neighboring clusters according to some predetermined rules until the termination condition is satisfied. A large number of control packets are exchanged during this process. Therefore, its total control overhead is very high. In addition, its control overhead is highly related to PUs activity, so dramatic oscillations can be observed from the total control overhead curve of EACRP in Fig. 6b. LEAUCH is an uneven clustering protocol. Its CHs selection is done through competition among candidate CHs, and its cluster formation process is the same as that of CogLEACH. Therefore, its total control overhead is usually smaller than four times the number of living nodes at the beginning of each round. It should be noted that candidate CHs in LEAUCH are selected by inheriting the CHs weight function from CogLEACH, and nodes whose weight is higher than the threshold can become candidate CHs. However, in Case 2 and Case 3, due to the high threshold defined by LEAUCH, none available candidate CHs can be picked out, not to mention the final CHs. Therefore, the performance of LEAUCH is omitted from Case 2 and Case 3. WCM and NSAC also require massive information exchange for CHs selection and cluster formation, so their number of living nodes reduces rapidly.
Apart from above performance metrics, we also care about the information collection capability each protocol can provide. This capability can be reflected by the ratio of effective data gathering nodes, and higher ratio means stronger capability. The comparison results among these protocols are shown in Fig. 6d. From it we can see that ECMUC can achieve the highest ratio of effective data gathering nodes. Each CRSNs node becomes a separate CH in ECMUC and it transmits data directly to the sink. The communication channel is randomly chosen from its available channel list, and the random channel selection decreases collision with PUs. Of course, channel reclaim from PUs is inevitable in ECMUC, as it only considers about the channel occupancy state at sensing time for simplicity purpose. If prediction of channel availability is included, the ratio of effective data gathering nodes can be further improved. As for other protocols, their curves of ratio of effective data gathering nodes oscillate heavily which depend on PUs activity. We can see from Fig. 6c that the number of clusters of these protocols is much fewer than that of ECMUC, and this means more CMs in each cluster. As common channels are required by each cluster, more CMs mean higher probability of collision with PUs, which will result in data transmission failures.
Case 2 and Case 3 are multi-hop communication scenarios which require inter-cluster relay. Performance comparison results in these two cases are shown in Figs. 7 and 8, respectively.
Performance comparison results in Case 2.
Performance comparison results in Case 3.
From Figs. 7 and 8, we can obtain the following observations:
For ECMUC protocol, the time when the first death node appears is much later than EACRP, NSAC and WCM, but it is earlier than CogLEACH. The reasons are explained as follows: ECMUC is a multi-hop clustering routing protocol, and CRSNs nodes in it should consume extra energy to search for available routing paths and relay inter-cluster data packets. Therefore, compared with CogLEACH, the energy consumption of data packet transmission in ECMUC is higher, but thanks to its low energy consumption of control information exchange, its node death rate is slower after the first death node appears. From Figs. 7b and 8b, we can see that the total control overhead of ECMUC is heavier than CogLEACH, which means the number of control packets exchanged in ECMUC is more than that in CogLEACH. However, in ECMUC, the control information for CHs selection and cluster formation are both exchanged within the cluster radius which is much smaller than the maximum node transmission range Rt, which helps reduce its energy consumed in control information exchange. Random CHs selection of CogLEACH results in the fluctuating number of CHs and their random positions, this may aggravate depletion of node energy. However, only CHs which can reach the sink through single-hop communication can successfully deliver their data, and this can help conserve energy to a certain extent. As for other protocols, especially EACRP, higher total control overhead of CHs selection and cluster formation together with routing overhead leads to faster node death. Its number of living nodes deteriorates rapidly.
Similar to Case 1, the number of selected CHs in ECMUC is still much higher than its competitors, and it decreases as network operation goes on. In ECMUC, CRSNs nodes with the sink in their single-hop communication range automatically become CHs, which means each living CRSNs node in ring 1 is an independent CH. CHs competition in other rings is performed within cluster radius, which restricts the cluster size. Therefore, many small clusters are formed in ECMUC, which is beneficial for conserving energy. In EACRP, neighboring clusters can be merged only if any two nodes in these clusters are within each other’s transmission range. This illustrates why more clusters are formed in EACRP than in CogLEACH and NSAC under the same network conditions.
As shown in Figs. 7d and 8d, the ratio of effective data gathering nodes of ECMUC is much higher than other competing protocols. As a multi-hop clustering routing protocol, ECMUC relies on effective intra-cluster data collection and inter-cluster relay to forward data packets towards the sink. It determines reasonable routing paths for packet delivery. Therefore, most data packets can reach the sink successfully. Similarly, living CRSNs nodes in EACRP can transmit their data successfully to the sink through the multi-hop forwarding paths which are found during route selection process, and this explains why EACRP can achieve high ratio of effective data gathering nodes at the beginning of network operation. However, fast energy exhaustion leads to poor network surveillance capability which cannot satisfy requirements of practical applications. CogLEACH, WCM and NSAC can only achieve low ratio of effective data gathering nodes. The reason is that they are all designed for scenarios which require single-hop communication between CHs and the sink, so they consider nothing about inter-cluster routing. Due to the limited node transmission range and long distance between CRSNs nodes and the sink in Case 2 and Case 3, data packets from many nodes cannot reach the sink at all.
By comparing Figs. 6 with 7 and 8, we can observe the impact of number of nodes on network performance. In general, when the node density ρ is kept unchanged, more nodes will lead to shorter network lifespan, higher total control overhead, higher number of selected CHs in each round and a little lower ratio of effective data gathering nodes. In order to compete for CHs in the neighborhood and form clusters, each CRSNs node j (L(j) ≠ 1) needs to broadcast or unicast related information, that is, the total control overhead is positively proportional to the number of living nodes. In addition, more nodes in outer rings will increase the relay burden of nodes in inner rings. Even though the energy consumption of control information exchange can be effectively controlled by reasonably setting the cluster radius, heavier inter-cluster data relay will accelerate the energy exhaustion of nodes in inner rings. In this case, network lifetime will be shortened.
As demonstrated above, in Case 1, ECMUC can achieve the best performance among all competing clustering protocols. All living CRSNs nodes automatically become independent CHs and transmit data directly to the sink. No control information is exchanged among CRSNs nodes, which results in the minimum network energy consumption. In Case 2 and Case 3, ECMUC is still superior to other competing protocols in terms of the ratio of effective data gathering nodes, which means ECMUC can guarantee strong network surveillance capability. However, its number of living nodes metric is inferior to CogLEACH, and this is the cost paid for route selection and multi-hop inter-cluster data relay. However, there are much more effective data gathering nodes in ECMUC during long-term network operation. In other words, ECMUC can provide powerful surveillance capability while compromising the lifespan of a portion of nodes.
Previous clustering protocols for CRSNs only consider about minimizing the total energy consumption of data communication and omit the impact of control overhead. Aiming at conquering this limitation and solving the multi-hop inter-cluster routing problem in large-scale CRSNs, an uneven clustering routing protocol ECMUC is proposed in this paper. ECMUC combines energy consumption of data communication and control information exchange together for the first time to form the first part of the clustering objective. Then minimizing the network energy consumption and balancing the residual energy among nodes in different rings are innovatively transformed into minimizing the weighted sum of the energy consumption of each ring and the additional energy consumption introduced to the whole network by it. Cluster radiuses of different rings are theoretically derived, and they control the cluster size as well as the corresponding energy consumption of control information exchange. ECMUC applies varied CHs selection and cluster formation strategies to different rings, and it selects nodes with the greatest energy and spectral potential as CHs. Through massive well-designed simulations, we demonstrate that control overhead has a large impact on energy consumption, and taking it into consideration is beneficial for improving network performance. In addition, ECMUC is superior to most current clustering protocols in terms of network surveillance capability and network lifetime. In the future, we will leverage energy harvesting and simultaneous wireless information and power transfer technology to further prolong network lifespan. In addition, we will research on how to determine the cluster radius automatically according to specific network configurations.
The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.
Wang, J. H. & Li, S. ECE: A novel performance evaluation metric for clustering protocols in cognitive radio sensor networks. IEEE Internet Things J. 8(3), 2078–2079 (2021).
Article Google Scholar
Liu, Z. X., Zhao, M. Y., Yuan, Y. Z. & Guan, X. P. Subchannel and resource allocation in cognitive radio sensor network with wireless energy harvesting. Comput. Netw. 167, 1–10 (2020).
Google Scholar
Prajapat, R., Yadav, R. N. & Misra, R. Energy efficient k-hop clustering in cognitive radio sensor network for Internet of Things. IEEE Internet Things J. 8(17), 13593–13607 (2021).
Article Google Scholar
Ren, Q. & Yao, G. S. An energy-efficient cluster head selection scheme for energy-harvesting wireless sensor networks. Sensors. 20(1), 1–17 (2020).
MathSciNet Article Google Scholar
Afsar, M. M. & Younis, M. A load-balanced cross-layer design for energy-harvesting sensor networks. J. Netw. Comput. Appl. 145, 1–19 (2019).
Article Google Scholar
Shahraki, A., Taherkordi, A., Haugen, O. & Eliassen, F. A survey and future directions on clustering: from WSNs to IoT and modern networking paradigms. IEEE Trans. Netw. Service Manag. 18(2), 2242–2274 (2021).
Article Google Scholar
Wang, J. H. & Shi, W. X. Survey on cluster-based routing protocols for cognitive radio sensor networks. J. Commun. 39(11), 156–169 (2018).
Google Scholar
Ozger, M. & Akan, O. B. Event-driven spectrum-aware clustering in cognitive radio sensor networks. In 2013 Proceedings IEEE INFOCOM. 1483–1491 (2013).
Ozger, M., Fadel, E. & Akan, O. B. Event-to-sink spectrum-aware clustering in mobile cognitive radio sensor networks. IEEE Trans. Mob. Comput. 15(9), 2221–2233 (2016).
Article Google Scholar
Tabassum, M. et al. An energy aware event-driven routing protocol for cognitive radio sensor networks. Wirel. Netw. 22(5), 1523–1536 (2016).
Article Google Scholar
Huang, L. Y. et al. Stochastic event-based sensor schedules for remote state estimation in cognitive radio sensor networks. IEEE Trans. Automat. Contr. 66(5), 2407–2414 (2021).
MathSciNet Article Google Scholar
Akrem, L. A. & Qiu, D. Y. Energy efficient spectrum aware clustering for cognitive sensor networks: CogLEACH-C. In 2015 10th International Conference on Communications and Networking in China. 515–520 (2015).
Kim, S. S., Mcloone, S., Byeon, J. H., Lee, S. & Liu, H. B. Cognitively inspired artificial bee colony clustering for cognitive wireless sensor networks. Cognit. Comput. 9(2), 207–224 (2017).
Article Google Scholar
Wang, J. H., Li, S. & Ge, Y. Y. Ions motion optimization-based clustering routing protocol for cognitive radio sensor network. IEEE Access. 8, 187766–187782 (2020).
Article Google Scholar
Eletreby, R. M., Elsayed, H. M. & Khairy, M. M. CogLEACH: A spectrum aware clustering protocol for cognitive radio sensor networks. In 2014 9th International Conference on Cognitive Radio Oriented Wireless Networks and Communications. 179–184 (2014).
Zheng, M., Chen, S., Liang, W. & Song, M. NSAC: A novel clustering protocol in cognitive radio sensor networks for Internet of Things. IEEE Internet Things J. 6(3), 5864–5865 (2019).
Article Google Scholar
Yadav, R. N., Misra, R. & Saini, D. Energy aware cluster based routing protocol over distributed cognitive radio sensor network. Comput. Commun. 129, 54–66 (2018).
Article Google Scholar
Stephan, T., Al-Turjman, F., Suresh Joseph, K., Balusamy, B. & Srivastava, S. Artificial intelligence inspired energy and spectrum aware cluster based routing protocol for cognitive radio sensor networks. J. Parallel Distrib. Comput. 142, 90–105 (2020).
Article Google Scholar
Heinzelman, W. B., Chandrakasan, A. P. & Balakrishnan, H. An application-specific protocol architecture for wireless microsensor networks. IEEE Trans. Wirel. Commun. 1(4), 660–670 (2002).
Article Google Scholar
Wang, T. J., Guan, X. J., Wan, X. L., Shen, H. & Zhu, X. M. A spectrum-aware clustering algorithm based on weighted clustering metric in cognitive radio sensor networks. IEEE Access. 7, 109555–109565 (2019).
Article Google Scholar
Pei, E. R., Han, H. Z., Sun, Z. H., Shen, B. & Zhang, T. Q. LEAUCH: low-energy adaptive uneven clustering hierarchy for cognitive radio sensor network. Eurasip J. Wirel. Comm. Netw. 2015(1), 1–8 (2015).
Article Google Scholar
Zhang, M. C., Zheng, R. J., Li, Y., Wu, Q. T. & Song, L. R-bUCRP: a novel reputation-based uneven clustering routing protocol for cognitive wireless sensor networks. J. Sensors. 2016, 1–9 (2016).
Google Scholar
Wang, C. Q. & Wang, S. B. Research on uneven clustering APTEEN in CWSN based on ant colony algorithm. IEEE Access. 7, 163654–163664 (2019).
Article Google Scholar
Stephan, T., Al-Turjman, F. & Balusamy, B. Energy and spectrum aware unequal clustering with deep learning based primary user classification in cognitive radio sensor networks. Int. J. Mach. Learn. Cybern. 12(11), 3261–3294 (2021).
Article Google Scholar
Yang, L., Lu, Y. Z., Zhong, Y. C., Wu, X. G. & Yang, S. X. A multi-hop energy neutral clustering algorithm for maximizing network information gathering in energy harvesting wireless sensor networks. Sensors. 16(1), 1–22 (2015).
ADS Article Google Scholar
Wang, J. H. & Ge, Y. Y. A radio frequency energy harvesting-based multihop clustering routing protocol for cognitive radio sensor networks. IEEE Sens. J. 22(7), 7142–7156 (2022).
ADS Article Google Scholar
Soro, S. & Heinzelman, W. B. Prolonging the lifetime of wireless sensor networks via unequal clustering. In 19th IEEE International Parallel and Distributed Processing Symposium. 1–8 (2015).
Zheng, M., Wang, C. Q., Song, M., Liang, W. & Yu, H. B. SACR: a stability-aware cluster-based routing protocol for cognitive radio sensor networks. IEEE Sensors J. 21(15), 17350–17359 (2021).
ADS Article Google Scholar
Zhang, H. Z., Zhang, Z. Y., Dai, H. Y., Yin, R. & Chen, X. M. Distributed spectrum-aware clustering in cognitive radio sensor networks. In 2011 IEEE Global Telecommunications Conference. 1–6 (2011).
Shah, G. A. & Akan, O. B. Spectrum-aware cluster-based routing for cognitive radio sensor networks. In 2013 IEEE International Conference on Communications. 2885–2889 (2013).
Peng, S., Wang, T. & Low, C. P. Energy neutral clustering for energy harvesting wireless sensors networks. Ad Hoc Netw. 28, 1–16 (2015).
Article Google Scholar
Download references
This work was supported in part by the National Natural Science Foundation of China under Grant 61901102.
School of Electrical Engineering, Northeast Electric Power University, Jilin, 132012, China
Jihong Wang & Conghui Li
You can also search for this author in PubMed Google Scholar
You can also search for this author in PubMed Google Scholar
Conceptualization, J.W.; Methodology, J.W. and C.L.; Software, C.L.; Writing-original draft presentation, J.W.; Writing-review & editing, J.W. and C.L.
Correspondence to Jihong Wang.
The authors declare no competing interests.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Reprints and Permissions
Wang, J., Li, C. A weighted energy consumption minimization-based multi-hop uneven clustering routing protocol for cognitive radio sensor networks. Sci Rep 12, 14039 (2022). https://doi.org/10.1038/s41598-022-18310-9
Download citation
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-022-18310-9
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.
Advertisement
Advanced search
© 2022 Springer Nature Limited
Sign up for the Nature Briefing newsletter — what matters in science, free to your inbox daily.
Double feature at BCHS Aug. 26-27 – The Baker County Press – Baker County Press
Tickets are on sale for two thrilling tales of terror, “Sorry, Wrong Number” and “The Whole Town’s Sleeping,” Aug. 26, 27 at 7:30 p.m. in the BCHS auditorium. With a top cast of BCHS and Baker County Community Theatre performers it is the perfect way to kick off the 40th anniversary season of BCHS Drama.
The show takes place in 1943 and is presented in a unique style. BCHS Drama has reproduced a radio station and presents the two suspense thrillers with commercials and musical performances for our live studio audience – you.
A woman using the telephone overhears a murder plot in “Sorry, Wrong Number,” but struggles to have the police believe her story. It slowly begins to dawn on her the victim might be her.
“The Whole Town’s Sleeping” is the chilling story of a serial killer loose in a tiny Illinois town. Ray Bradbury’s suspenseful story is sure to make you not want to walk outside alone.
Tickets are $5 at the door and reserved seats in the first two rows are $10 by calling 259-6286.
Pictured above in the photo courtesy of Bob Gerard are Cheyenne Dunnam, Aiden Andrews and Dallas Norman rehearsing for “The Whole Town’s Sleeping.”
August 18, 2022
August 18, 2022
You must be logged in to post a comment.
Best Master's in Data Science Programs in 2022 – Fortune – Fortune
The volume of data generated every day is growing exponentially, creating a steep demand for workers that can harness, analyze, and create value from the data available. Because of this, data science is one of the fastest growing fields today, and one of the best ways to break into the field is to pursue a master’s degree in the field. Fortune is launching its first-ever ranking of the top in-person master’s degree programs in data science.
Perspire Sauna Studio Doubles Down on the Treasure Valley with New 2-Unit Deal – PR Newswire
Searching for your content…
In-Language News
Contact Us
888-776-0942
from 8 AM – 10 PM ET
News provided by
Aug 16, 2022, 10:59 ET
Share this article
Premier Infrared Sauna Franchise to Ramp up Idaho Presence with Boise and Meridian Locations
COSTA MESA, Calif., Aug. 16, 2022 /PRNewswire/ — Perspire Sauna Studio, one of the nation’s fastest-growing infrared and red-light therapy (RLT) sauna franchise brands, is preparing to expand its market presence in the Boise area following the finalization of signed agreements for two new locations in Boise and Meridian, respectively. This most recent deal stems from the success of Idaho’s first Perspire Sauna Studio location in Eagle, which opened its doors in November of 2021 under the ownership of Brian and Nina Whalen, whom possess the strong desire to make the franchise brand and its wellness-centric services available to more residents throughout the region.
Former residents of Orange County, California, the Whalen family experienced the powerful healing benefits of red-light therapy treatment first-hand as clients. A reality Nina credits for helping progress her recovery from personal health issues. And which inspired them both to make the move to Boise, Idaho in an effort to bring Perspire’s holistic approach and healing properties to an untapped market in need.
"From an outsider’s perspective, Idaho might not come across as a state that’s primed for investment in the wellness space," said Brian Whalen. "In actuality, the Treasure Valley culture views outdoor activities and reconnecting with the outside world to be crucial to the fabric of what makes the area so unique. Which has helped our sauna studios tremendously in establishing a foothold with locals looking to supplement their already active lifestyles."
Despite straining financial pressures and inflationary concerns permeating into the daily lives of most Americans, the majority of men and women throughout the country have proven an intent to maintain some semblance of their wellness routine. Whether that’s meant cutting back on unnecessary membership packages or exploring cheaper alternatives, the rapid growth of the Perspire Sauna Studio franchise has been indicative of more families and individuals turning to the brand for their wellness needs than ever before.
"This is a pivotal time for our franchise opportunity as the concept continues to make its first foray into previously unaffiliated states and territories," said Lee Braun, Founder/CEO of Perspire Sauna Studio. "What’s equally significant in that process is ensuring the success of existing franchisees, as many will prove instrumental in amassing more Perspire locations and strengthening our presence in locales around the nation. Brian and Nina’s success has shown just that."
Perspire Sauna Studio is currently seeking single-unit and multi-unit franchisees interested in new career opportunities or those looking to diversify their current portfolios. Combined with the 46 franchises awarded year to date, Perspire has awarded 100 franchise agreements with 25 studios currently open.
To learn more about Perspire Sauna Studio and franchising opportunities, please visit https://www.perspiresaunastudio.com/franchise.
Perspire Sauna Studio is the fastest-growing infrared sauna and red light therapy franchise in the U.S. The science-based, technology-driven, and wellness-seeking company provides guests a modern-day experience to a centuries-old practice, allowing their body and mind to feel refreshed after each session. Founded and led by CEO Lee Braun, Perspire’s goal is to expand to major markets throughout the U.S. to further instill its vision of making infrared wellness accessible to all. The franchise having just recently awarded its 100th franchise agreement for future Perspire studios.
Founded in 2010 and based in Southern California, Perspire Sauna Studio currently offers franchise opportunities to qualifying entrepreneurs. For more information, please visit www.perspiresaunastudio.com, and follow the brand on social media @perspiresaunastudio. For franchising information, please contact Cory Lyons, [email protected].
Media Contact: Conner Gossel, Fishman Public Relations, [email protected] or 937-545-9812
SOURCE Perspire Sauna Studio
Cision Distribution 888-776-0942
from 8 AM – 9 PM ET
Erased Tapes Records – Label & Production Manager (UK) – Music Business Worldwide
Label & Production Manager (Full Time)
Erased Tapes is an independent record label that was founded in 2007, representing an internationally acclaimed roster of contemporary composers and electronic artists including Rival Consoles, Peter Broderick, Kiasmos, Penguin Cafe, Hatis Noit, Nils Frahm, Crayon, and Ben Lukas Boysen.
We are currently seeking an experienced Label & Production Manager to manage our label team. Working in our East London office and reporting to the company’s Director, the chosen candidate will oversee daily label operations and maintain close relationships with our international manufacturers, designers, distributors, and retail partners to ensure the smooth and timely delivery of our releases.
To Apply:
We champion new perspectives and encourage all applicants to apply regardless of colour, gender, religion, sexual orientation, marital status or age.
To apply, please send a short covering letter and CV no later than Wednesday 31st August 2022 to: [email protected]. Please list “Label & Production Manager” in the subject line. For more information, visit: www.erasedtapes.com.
Music Business Jobs is the most effective way for the global music industry to find the best candidates for their open positions.
In addition to being seen by over 300,000 monthly unique readers online, our listings are also emailed direct to more than 50,000 professional subscribers every week – across the US, UK, Europe, Asia-Pacific and beyond.
Click through below for details on how to submit a Music Business Jobs listing – and learn why our advertisers ‘strongly recommend’ us to their peers…
Can genes explain our choice of jobs? – Human Resources Online
Why do people take up different jobs? Some say we all have different preferences; others say the environment dictates their choice. One thing is true. People vary in their skills, knowledge and motivation.
Behind that are individual personalities and wide-ranging levels of intelligence, emotional and physical abilities. If you look deeper, behavioural geneticists will say that such individual differences can ultimately be explained by heredity or one’s genetic makeup. In other words, inheritance can partly explain how we end up in different jobs. Indeed, scientists have studied pairs of twins and found evidence supporting such a claim.
To answer deeper questions on the relationships between jobs and genetics, my co-researchers from the National University of Singapore and the Chinese University of Hong Kong analysed job data and whole genome information from more than 200,000 individuals mainly from the United Kingdom. They were selected from half a million participants in the UK Biobank, a large biomedical study that has made its data open to global researchers. Such investigations were previously not possible due to the lack of large, publicly accessible datasets. Now, technology has enabled us to explore these questions further.
There are indeed certain relationships between our genes and jobs, which we point out in our paper published in the journal Scientific Reports. Altogether, we identified 39 genetic markers on the whole genome that are significantly associated with different aspects of jobs, such as their informational, emotional and physical demands. Interestingly, other studies have shown that these genetic markers are related to genes associated with one’s intelligence and education levels as well.
Furthermore, we also found that the cognitive demands of a job, but not emotional and physical demands, may explain the relationship between one’s education attainment and income.
Such findings suggest that an individual’s attainments in education, occupation, and income are more related to cognitive ability rather than emotional or physical abilities. There has been a long debate on whether IQ or EQ is more important for one to thrive in the workplace. No doubt both are important, but our findings seem to suggest that IQ may have a larger role to play.
We also found significant genetic associations between job requirements and one’s wellbeing, such as mental and physical health outcomes, which suggests that our genes may influence our wellbeing partially through our jobs. Hence, genes may influence our job attainments and thereby influence our wellbeing. For example, the study found that genes related to information-processing job demands were also related to better health conditions.
While our study is based on an European sample, we next plan to launch further investigations on the relationship between genes and occupational health using Asian samples. Genes do not account for all our work success—there are too many factors at play—but digging deep into such relationships can help to answer some of our long-held questions about nature versus nurture at work.
The opinions expressed are those of the writer and do not represent the views and opinions of NUS.
Image / Shutterstock
Follow us on Telegram @humanresourcesonline or click here for all the latest weekly HR and manpower news from around the region!
We use cookies and other tracking technologies to improve your browsing experiences on our website, to show you personalised content and targeted ads, to analyze our website traffic and to understand where our visitors are coming from. By browsing our website, you consent to our use of cookies and other tracking technologies. Click here for more information.