NDLI: General lower and best case upper bounds on energy optimal multicasting in wireless ad hoc and sensor networks

Content Provider	IEEE Xplore Digital Library
Author	Frey, H.
Copyright Year	2010
Description	Author affiliation: University of Paderborn, Germany (Frey, H.)
Abstract	Given a source node and a set of k destination nodes, what is the minimum total energy required for sending a message from source to destinations when multicasting along optimal placed relaying nodes is applied? In this work I will answer this question under the assumption that non-cooperative relaying is applied and that communication over a distance d requires energy proportional to $d^{α}$ + β for some a > 1 and β > 0. I derive lower bound expressions for a MAC layer model which does not exploit the broadcast property of wireless communication and for a MAC layer model which exploits it. I show further, in case of optimal relay positions, how multicasts can be constructed whose energy consumption always stays below the derived lower bound plus an additive constant expression depending on α, β, k. The usefulness of the bound derived in this work is exemplified with three different example applications.
Starting Page	1
Ending Page	9
File Size	185537
Page Count	9
File Format	PDF
ISBN	9781424472642
e-ISBN	9781424472659
e-ISBN	9781424472635
DOI	10.1109/WOWMOM.2010.5534900
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-06-14
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Steiner trees Energy consumption Upper bound Unicast Receivers Joining processes Relays
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Lower and Upper Bounds for Multicasting under Distance Dependent Forwarding Cost Functions

Best case energy analysis of localized euclidean minimum spanning tree based multicasting in ad hoc and sensor networks

Approximating node-weighted multicast trees in wireless ad-hoc networks

Lower and upper bounds for multicasting under distance dependent forwarding cost functions

Total Energy Optimal Multicasting in Wireless Ad Hoc Networks ∗

Effectiveness of overlay multicasting in mobile ad-hoc network

Statistically optimal routing scheme in multihop wireless ad-hoc networks

Efficient relay node displacement mechanism for improvement of lifetime in WSN

Best and worst-case coverage problems for arbitrary paths in wireless sensor networks

General lower and best case upper bounds on energy optimal multicasting in wireless ad hoc and sensor networks

Similar Documents

Lower and Upper Bounds for Multicasting under Distance Dependent Forwarding Cost Functions

Best case energy analysis of localized euclidean minimum spanning tree based multicasting in ad hoc and sensor networks

Approximating node-weighted multicast trees in wireless ad-hoc networks

Lower and upper bounds for multicasting under distance dependent forwarding cost functions

Total Energy Optimal Multicasting in Wireless Ad Hoc Networks ∗

Effectiveness of overlay multicasting in mobile ad-hoc network

Statistically optimal routing scheme in multihop wireless ad-hoc networks

Efficient relay node displacement mechanism for improvement of lifetime in WSN

Best and worst-case coverage problems for arbitrary paths in wireless sensor networks

General lower and best case upper bounds on energy optimal multicasting in wireless ad hoc and sensor networks