NDLI: Distributed Approximation Algorithms for Spectrum Allocation in Wireless ad Hoc Networks

Content Provider	Springer Nature Link
Author	Shi, Yalin Chen, Jian Wang, Limin Chen, Ming Zhang, Xiaoyan
Copyright Year	2016
Abstract	Spectrum allocation is a difficult and hot issue in wireless ad hoc networks. An efficient method of spectrum allocation is a key factor to improve quality of service and performance of wireless networks. In this paper, we consider the spectrum allocation problem which asks how to allocate the least number of spectrum blocks in a field to ensure the service on any random k locations simultaneously. Our solution to the spectrum allocation problem is the minimum k-Roman dominating set. We propose two distributed algorithms for the issue of spectrum allocation in wireless ad hoc networks. One is a distributed 6k-approximation algorithm for the spectrum allocation of satisfying any random k (k ≥ 2) locations in the class of unit ball graphs. The other one is a better distributed algorithm for finding a (1 + ε)-approximation for the spectrum allocation problem of serving any random two locations, in the class of growth-bounded graphs. We also describe the simulation results and analyze them.
Starting Page	962
Ending Page	973
Page Count	12
File Format	PDF
ISSN	1383469X
Journal	Mobile Networks and Applications
Volume Number	21
Issue Number	6
e-ISSN	15728153
Language	English
Publisher	Springer US
Publisher Date	2016-03-31
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Distributed approximation scheme Spectrum allocation Roman dominating set Unit ball graph Growth-bounded graph Communications Engineering, Networks Computer Communication Networks Electrical Engineering IT in Business
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Information Systems Hardware and Architecture Software

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

Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks

Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks (0)

Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks

Distributed heuristics for connected dominating sets in wireless ad hoc networks

Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks (2003)

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

New distributed algorithm for connected dominating set in wireless ad hoc networks

Approximating minimum independent dominating sets in wireless networks.

Distributed Approximation Algorithms for Spectrum Allocation in Wireless ad Hoc Networks

Similar Documents

Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks

Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks (0)

Connected Dominating Sets in Wireless Networks with Different Transmission Ranges

On routing with guaranteed delivery in three-dimensional ad hoc wireless networks

Distributed heuristics for connected dominating sets in wireless ad hoc networks

Polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks (2003)

Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

New distributed algorithm for connected dominating set in wireless ad hoc networks

Approximating minimum independent dominating sets in wireless networks.

Distributed Approximation Algorithms for Spectrum Allocation in Wireless ad Hoc Networks