NDLI: Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)

Content Provider	IEEE Xplore Digital Library
Author	Calinescu, G.
Copyright Year	2006
Description	Author affiliation: Dept. of Comput. Sci., Illinois Inst. of Technol. (Calinescu, G.)
Abstract	Summary form only given. There have been papers indicating that the maximal ratio combiner device can result in energy savings in wireless ad hoc networks by using hitch-hiking. We study the min-energy broadcast with hitch-hiking problem, an idealized version of broadcast using hitch-hiking, a problem studied experimentally in the INFOCOM 2004 paper of Agarwal et al. min-energy broadcast with hitch-hiking captures the maximum savings one can achieve in broadcasting using maximal ratio combiners. We show that the optimum of the classical min-energy broadcast problem is at most $O(log^{2}$ n) times the optimum of min-energy broadcast with hitch-hiking, where n is the number of nodes in the networks. We show that this bound is tight up to a constant. Moreover, the same bounds hold for Unicast. In the special case when the nodes are on a line and the power requirement for node u to reach node v is d(u, $v)^{K},$ where d(u, v) the Euclidean distance between u and v and k is the signal attenuation exponent, which is assumed to be in between 2 and 5, we show that the optimum of the min-energy broadcast problem is at most a constant times optimum of min-energy broadcast with hitch-hiking. A formal definition of min-energy broadcast with hitch-hiking is given below. The input consists of a complete directed graph G = (V, E) with power requirement function c : E rarr R+ , and a source s epsi V. The output consists of a permutation tau =< $v_{1},$ $v_{2},$ ..., v $_{n}$ > of V with $v_{n}$ = s and power assignment p(v) of every vertex v. For every 1 les i les i < j les n, define $q(v_{i},$ vj ) = $p(v_{i})/c(v_{i})_{j}).$ An output is feasible if for every j > 1 we have Sigmai = 1 j - 1 $q(v_{i}v_{j})$ ges 1. The objective is to minimize Sigmai = 1 $^{n}$ $p(v_{i})$
Sponsorship	Int. Assoc. for Comput. and Inf. Sci
Starting Page	225
Ending Page	225
File Size	87298
Page Count	1
File Format	PDF
ISBN	076952611X
DOI	10.1109/SNPD-SAWN.2006.25
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-06-19
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer science Intelligent networks Unicast Broadcast technology Euclidean distance Broadcasting Attenuation Ad hoc networks Mobile ad hoc networks Software engineering
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

Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks

Energy efficient broadcast in wireless ad hoc networks with Hitch-hiking

1Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking (2005)

Load Aware Broadcast in Mobile Ad Hoc Networks

Investigating data broadcast performance in mobile ad-hoc networks

Dynamic hybrid routing (DHR) in mobile ad hoc networks

Probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks

Low Power Hitch-hiking Broadcast in Ad Hoc Wireless Networks

Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks

Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)

Similar Documents

Analytical bounds on broadcast with hitch-hiking in wireless ad-hoc networks

Energy efficient broadcast in wireless ad hoc networks with Hitch-hiking

1Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking (2005)

Load Aware Broadcast in Mobile Ad Hoc Networks

Investigating data broadcast performance in mobile ad-hoc networks

Dynamic hybrid routing (DHR) in mobile ad hoc networks

Probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks

Low Power Hitch-hiking Broadcast in Ad Hoc Wireless Networks

Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks

Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)