NDLI: OVSF-CDMA code assignment in wireless ad hoc networks

Please wait, while we are loading the content...

On the fundamental limits of topology control

Localized techniques for broadcasting in wireless sensor networks

LLS: a locality aware location service for mobile ad hoc networks

Virtual coordinates for ad hoc and sensor networks

A resource--efficient time estimation for wireless sensor networks

Improved approximation results for the minimum energy broadcasting problem

Unit disk graph approximation

Gathering correlated data in sensor networks

OVSF-CDMA code assignment in wireless ad hoc networks

Connectivity in evolving graph with geometric properties

Accuracy vs. lifetime: linear sketches for approximate aggregate range queries in sensor networks

Experimental analysis of adjustable sectorized topologies for static ad hoc networks: extended abstract

Batch conflict resolution algorithm with progressively accurate multiplicity estimation

OVSF-CDMA code assignment in wireless ad hoc networks

Content Provider	ACM Digital Library
Author	Frieder, Ophir Li, Xiang-Yang Wan, Peng-Jun
Abstract	Orthogonal Variable Spreading Factor (OVSF) CDMA code provides a means of support of variable rate data service at low hardware cost. In contrast to the conventional orthogonal fixed-spreading-factor CDMA code, OVSF-CDMA code consists of an infinite number of codewords with variable rates but not every pair of codewords are orthogonal to each other. In an OVSF-CDMA wireless ad hoc network, a code assignment has to be conflict-free, i.e., two nodes can be assigned the same codeword or two non-orthogonal codewords if and only if neither of them is within the transmission range of the other and no other node is located in the intersection of their transmission ranges. The throughput (resp., bottleneck) of a code assignment is the sum (resp., minimum) of the rates of the assigned codewords. The max-throughput (resp., max-bottleneck) conflict-free code assignment problem seeks a conflict-free code assignment which achieves the maximum throughput (resp., bottleneck). In this paper, we present several heuristics for conflict-free code assignment in OVSF-CDMA wireless ad hoc networks. Each heuristic is proved to be either a constant-approximation for max-throughput conflict-free code assignment problem, or a constant-approximation for max-bottleneck conflict-free code assignment problem, or constant-approximations for both problems simultaneously.
Starting Page	92
Ending Page	101
Page Count	10
File Format	PDF
ISBN	1581139217
DOI	10.1145/1022630.1022645
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2004-10-01
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Ovsf-cdma Approximation algorithms System design Graph theory Code assignment
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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