[특허]Power control based admission methods for maximum throughput in DS-CDMA networks with multi-media traffic

Verizon Laboratories Inc.; University of Maryland

검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
검색연산자

검색도움말
검색연산자	기능	검색시 예
()	우선순위가 가장 높은 연산자	예1) (나노 (기계 \| machine))
공백	두 개의 검색어(식)을 모두 포함하고 있는 문서 검색	예1) (나노 기계) 예2) 나노 장영실
\|	두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색	예1) (줄기세포 \| 면역) 예2) 줄기세포 \| 장영실
!	NOT 이후에 있는 검색어가 포함된 문서는 제외	예1) (황금 !백금) 예2) !image
*	검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색	예) semi*
""	따옴표 내의 구문과 완전히 일치하는 문서만 검색	예) "Transform and Quantization"

과학기술 지식인프라 ScienceON

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison, Kafe, Webinar 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

특허 상세정보

MyON담기

내보내기 페이스북 공유 트위터 공유 카카오톡 공유

Power control based admission methods for maximum throughput in DS-CDMA networks with multi-media traffic

특허상세정보
국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	H04B-007/216
미국특허분류(USC)	370/342; 370/335
출원번호	US-0732359 (2000-12-07)
발명자 / 주소	Ayyagari, Deepak V. Ephremides, Anthony
출원인 / 주소	Verizon Laboratories Inc. University of Maryland
대리인 / 주소	Rader, Fishman &
인용정보	피인용 횟수 : 14 인용 특허 : 2

초록
▼

A method for maximizing the data throughput over a multi-code DS-CDMA network by controlling the number of codes assigned to each user while controlling the power budget of each user so that each users bit energy to noise ratio is met along with the quality of service and frame error rate requirements. A method is also provided for maximizing the throughput over a variable gain DS-CDMA network in which each user uses only one code and changes the data rate and power to meet quality of service requirements. In both systems, new users will be admitted so l...

대표
청구항
▼

1. An admission control procedure for traffic in a DS-CDMA system comprising the following steps:a) admitting to the system and activating codes for users with increasing order of signal to noise ratios starting with the lowest signal to noise ratio; b) determining the power level of all active users and raising the power levels to compensate for the interference caused by the admission of new users; and c) activating new codes in steps of one while ensuring no active user is power limited. 2. An admission control procedure as set forth in claim 1 wherein the admission control procedure activates the code with the least impact on power levels and interferences.3. An admission control procedure as set forth in claim 1 wherein the admission control procedure is terminated when at least one user becomes power limited.4. An admission control procedure as set forth in claim 1 wherein the power levels of active users is reduced as codes leave the system.5. An admission control procedure as set forth in claim 1 wherein the DS-CDMA system is one of local area network, wide area network, metropolitan area network and a fixed wireless network.6. A procedure for admission control in a DS-CDMA network comprising the following steps:a) arranging network users in increasing order based on their bit energy to noise requirements; b) beginning network admission with a first network user and allocating as many codes as requested and feasible; c) continuing network admission for each consecutive network user; and d) testing to see if an additional number of potential codes can be activated simultaneously and if an acceptable overall power allocation exists for each of the potential codes, comprising the sub-step of activating the potential codes if the acceptable overall power allocation exists and the sub-steps of rejecting the potential codes and terminating network admission if the acceptable overall power allocation does not exist. 7. A procedure for admission control as set forth in claim 6 wherein the number of codes allocated to the first network user is limited by power and performance constraints.8. A procedure for admission control as set forth in claim 6 wherein the number of codes assigned to all network users is limited by power and performance constraints.9. A procedure for admission control as set forth in claim 6 wherein successively smaller numbers of potential codes are tested for simultaneous activation until an acceptable overall power allocation is found such that the code activation requests corresponding to the smaller numbers of potential codes is accepted.10. A procedure for admission control as set forth in claim 6 wherein the acceptance of the number of codes terminates the admission process.11. A procedure for admission control in a DS-CDMA network comprising:a) considering new potential codes for activation in increments of 1; b) checking each new code to make certain that there is a feasible power allocation for all active codes and each new potential code; and; c) admitting the new potential code if the feasible power allocation exists; and rejecting the potential code and terminating the procedure if the feasible power does not exist. 12. A procedure for admission control as set forth in claim 11 wherein the feasible power allocation does not exist if the power that would be required by all active users upon activation of the new code, is greater than a maximum transmission power capability of all users.13. A procedure for admission control as set forth in claim 12 wherein the feasible power allocation further does not exist if a received bit energy to noise power ratio minimum threshold target is not met for the active codes.14. A method for implementing potential users on a DS-CDMA network comprising the following steps:a) relating data rates of all users in terms of powers; b) separating the users into different power groups and selecting a power group for further processing; c) classifying the users into different data rate sets; d) deriving powers of the users in the different sets based on a maximum acceptable in-cell interference for the selected power group; e) determining data rates of the users from the derived powers; and f) selecting a different power group and undertaking the classifying, deriving and determining steps to provide various data rate and power allocations. 15. A method for implementing potential users as set forth in claim 14 further comprising the step of picking the allocation that yields the highest sum of data rates for the users.16. A method for implementing potential users as set forth in claim 14 wherein the different power groups are arbitrarily separated, the separation comprising maximum power limited and maximum power not limited.17. A method for implementing potential users as set forth in claim 14 wherein the different rate sets comprises a first set of users at a minimum data rate, a second set of users at a maximum data rate, and a third set of users at a data rate between the minimum data rate and the maximum data rate.18. A method for implementing potential users as set forth in claim 14 wherein the VG-CDMA network is one of local area network, wide area network, metropolitan area network and a fixed wireless network.19. A method for implementing potential users as set forth in claim 14 wherein said separating step comprises the sub-step of considering the location of the users relative to a nearest reception/transmission cell of the network, placing the users operating at maximum power in view of their distance from the cell in a maximum power group.20. A method for selecting the optimum power and data rate to be used to maximize the throughput through a DS-CDMA network comprising the following steps:a) organizing the users into the following sets: 0) users operating at less than the maximum power; 1) users not operating at the maximum data rate or the minimum data rate; 2) users operating at the minimum data rate; and 3) users operating at the maximum data rate; b) determining the constant coefficients, which relate the powers of the users in sets 2 and 3, to the powers of the users in set 1; c) determining the powers of all users in set 1 in terms of the power of any single arbitrarily chosen user denoted by i, c) determining the power of the single user with undetermined power si in set 1, d) determining the power of the remaining users in set 1 and then determining the powers of the users in sets 2 and 3; e) determining the total interferences generated by the users in the network; f) determining the optimal power vector using the maximum value of interference; g) determining the optimal rate allocation for the particular choice of sets; and h) comparing the rate allocations for all possible combinations of the sets and solving for an optimal rate allocation. 21. A method for selecting the optimum power and data rates as set forth in claim 20 wherein the total in-cell interference in step e) is the sum of the received power of all users.22. A method for selecting the optimum power and data rate as set forth in claim 20 wherein the power of all users of the network are functions of the total in-cell interference.23. A method for selecting the optimum power and data rate as set forth in claim 20 wherein the organizing of the users into the first set based on the power being used is an in or out test based on the power levels of the users relative to the maximum received power.24. A method for selecting the optimum power and data rate as set forth in claim 23 wherein all users having power levels less than the maximum received power are included in the set.25. A method for selecting the optimum power and data rates as set forth in claim 20 wherein at the optimal power and rate allocation the rates of the interference experienced by any two users is equal to the square met of the reciprocal of their bit energy to noise targets.26. A method for selecting the power and data rates to be used to substantially maximize the throughput through a DS-CDMA network comprising the following steps:a) organizing users into the following sets: 0) users having high values of signal to noise ratio; 1) users with high signal to noise ratio requirements; 2) users with lower values of 3) users with lower values of Tmax. b) determining the constant coefficients, which relate the powers of the users insets 2 and 3 to the powers of the users in set 1; c) determining the power of the users in set 1 with the lowest maximum signal to noise ratio; d) determining the power of the remaining users in set 1 and then sets 2 and 3; e) determining the total interference of the users on the network; f) determining the power vector using the value of in-cell interference; g) determining the rate allocation based on the determined power vector; h) determining the power and data rate vector for all possible classifications of the users in the different sets; i) comparing the rate allocations for all possible combinations of the above sets to determine the optimal rate allocation the yields the maximum sum of the data rates. 27. A method for selecting the optimum power and data rate for use in a DS-CDMA network comprising the following steps:a) organizing network users into sets based on their data rates; b) determining the constants that relate the powers of the latter set members to the power of the user in the earlier sets; c) determining the power of the first member of the first set; d) determining the powers of the remaining members of the first set, and the power of all members of the remaining sets; e) determining the power vector from the total in-cell interference; f) determining the rate allocation for the particular choice of sets; and g) comparing the rate allocations as determined to select the optimal rate allocation. 28. A method for selecting the optimum power and data rates as set forth in claim 27 wherein the transmit powers have to be recalculated when a multi-media user changes data rates to meet a data transmission requirement.29. A method for selecting the optimum power and data rates as set forth in claim 27 wherein the users are divided into sets based on the use of maximum rate, minimum rate, and a rate between maximum and minimum.30. A method for selecting the optimum power and data rates as set forth in claim 27 wherein at the optimal power and rate allocation, the ratio of interference experienced by the users is equal to the square root of the reciprocal of their bit energy to noise targets.31. A DS-CDMA network comprising:a plurality of users having different bit energy to noise requirements; a limited number of potential codes available to be used by the users; a limited overall power allocation available for each of the potential codes; and an admission protocol, the admission protocol maximizing the capacity utilization within the network with the limited overall power allocation, whereby the admission protocol may be used to admit users to the network. 32. A DS-CDMA network as set forth in claim 31 wherein the admission protocol arranges the networks in increasing order based on the bit energy to noise requirements.33. A DS-CDMA network as set forth in claim 32 wherein the admission protocol includes testing of multiple potential codes for generally simultaneous activation, the number of multiple potential codes being reduced until an acceptable threshold is met.34. A DS-CDMA network as set forth in claim 33 wherein the acceptable threshold is limited by the limited overall power allocation such that code failure is minimized for every user within the network.35. A DS-CDMA network as set forth in claim 31 wherein the admission protocol includes:a second plurality of the users being at different powers, the users being separated into different power groups; a third plurality of the users being at different data rates, the users being separated into different data rate sets; and a maximum in-cell interference being available for the users in each of the different power groups, wherein the allocation process optimizes the different powers and the different data rates to determine the data rate and the power for each user. 36. A DS-CDMA network as set forth in claim 35 wherein the users are placed in at least two different power groups, a first power group being limited in power and a second power group operational at maximum power.37. A DS-CDMA network as set forth in claim 36 wherein a user at a high power in view of its remote location from a nearest/transmission cell is placed into the second power group.38. A DS-CDMA network as set forth in claim 35 wherein the different rate sets comprise a first rate act of users at a minimum data rate, a second set of users at a maximum data rate, and a third set of users at a data rate between the minimum data rate and the maximum data rate.

이 특허에 인용된 특허 (2)

이 특허를 인용한 특허 피인용횟수: 14

IPC 상위 출원인

내보내기

상세정보
내보내기 구분	파일저장 인쇄 메일전송
구성항목	관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	> 총 건의 자료가 검색되었습니다. > 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) > 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. > 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) > 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오 > ~ > Text(ASCII format) Excel format

과학기술 지식인프라 ScienceON

ScienceON Chatbot

연합인증

특허 상세정보

Power control based admission methods for maximum throughput in DS-CDMA networks with multi-media traffic

초록
▼

대표
청구항
▼

이 특허에 인용된 특허 (2)

이 특허를 인용한 특허 피인용횟수: 14

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

ScienceON Chatbot

연합인증

특허 상세정보

Power control based admission methods for maximum throughput in DS-CDMA networks with multi-media traffic

초록 ▼

대표청구항 ▼

이 특허에 인용된 특허 (2)

이 특허를 인용한 특허 피인용횟수: 14

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

초록
▼

대표
청구항
▼