NDLI: Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks

Content Provider	Springer Nature Link
Author	Ghiyasvand, Mehdi Keshtkar, Iman
Copyright Year	2014
Abstract	A sequence of online messages for connections is given, each message is important and thide failure of delivering a message is a critical event. The maximum lifetime problem maximizes the total number of messages that can be successfully sent over the network. Given a $$h\ge 1$$ , this paper presents two new problems on ad hoc networks (called the min–max and min–sum cost online problems), which adjust the initial energies of nodes such that the network can send the first $$h$$ messages. We consider the min–sum and min–max norms for minimizing the cost of adjusting the initial energies. This paper presents an algorithm for these problems and computes upper bounds for the total cost of the min–sum and min–max norms. Mohanoor et al. (Ad hoc Networks 7: 918–931, 2009) presented three algorithms (called SWRP, SFWP and SWCRP algorithms) to online energy aware routing, which, in practice, are better than other algorithms on lifetime in the cases: the effect of session length, transmission radius and node density. This paper modifies these algorithms (the modifies algorithms are called TSWRP, TSFWP and TSWCRP) so that they compute the total cost of the min–sum and min–max norms. Then, we show, in practice, the total cost of the min–sum and min–max norms computed by our algorithm are smaller than the values computed by the TSWRP, TSFWP and TSWCRP algorithms in the cases: the transmission radius and node density. Also, in practice, the lifetime of our algorithm is more than the lifetime of the SWRP, SFWP and SWCRP algorithms in the cases: the effect of session length and node density.
Starting Page	757
Ending Page	768
Page Count	12
File Format	PDF
ISSN	10220038
Journal	Wireless Networks
Volume Number	21
Issue Number	3
e-ISSN	15728196
Language	English
Publisher	Springer US
Publisher Date	2014-09-23
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Ad hoc networks Online algorithms Off-line algorithms Relative load Communications Engineering, Networks Computer Communication Networks Electrical Engineering IT in Business
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Information Systems Electrical and Electronic Engineering

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

Minimum average relative load for online routing

QoE-based routing algorithms for H.264/SVC video over ad-hoc networks

HierHybNET: Cut-set upper bound of ad hoc networks with cost-effective infrastructure

A Store-and-Forward Cooperative MAC for Wireless Ad Hoc Networks

A characterization of max–min SIR-balanced power allocation with applications

A hybrid multi-channel MAC protocol for wireless ad hoc networks

Joint multi-cost routing and power control in wireless ad hoc networks

Load-aware channel hopping protocol design for mobile ad hoc networks

Maximum-residual multicasting and aggregating in wireless ad hoc networks

Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks

Similar Documents

Minimum average relative load for online routing

QoE-based routing algorithms for H.264/SVC video over ad-hoc networks

HierHybNET: Cut-set upper bound of ad hoc networks with cost-effective infrastructure

A Store-and-Forward Cooperative MAC for Wireless Ad Hoc Networks

A characterization of max–min SIR-balanced power allocation with applications

A hybrid multi-channel MAC protocol for wireless ad hoc networks

Joint multi-cost routing and power control in wireless ad hoc networks

Load-aware channel hopping protocol design for mobile ad hoc networks

Maximum-residual multicasting and aggregating in wireless ad hoc networks

Upper bounds for the min–max and min–sum cost online problems in wireless ad hoc networks