A Protected and Proficient ID-Based Cumulative Mark Format ... · 5156 T.Satish Kumar Reddy and...

Global Journal of Pure and Applied Mathematics.

ISSN 0973-1768 Volume 13, Number 9 (2017), pp. 5155-5172

© Research India Publications

http://www.ripublication.com

A Protected and Proficient ID-Based Cumulative

Mark Format for Information Centers

T.Satish Kumar Reddy 1 and D.Ganesh 2

1PG Scholar, Department Of Computer Science and Engineering,

Sree Vidyanikethan Engineering College, Tirupati, India

2 Assistant .Professor, Department Of Computer Science And Engineering,

Sree Vidyanikethan Engineering College, Tirupati, India

Abstract

The reward process investigates the score of staff paths, i.e., obtaining

quantized measures of path houses just like circular-go from aspect to side

time and on hand bandwidth. In evaluation with excessive-great-grained

measurements, coarse-grained rankings are attractive in that they don't seem to

be simplest informative however additionally affordable to accumulate.

Encouraged by way of this perception, we first care for the scalable

acquisition of route rankings through statistical inference. Via looking at at

similarities to recommender tactics, we evaluate the applicability of options to

a recommender procedure and exhibit that our inference major undertaking

will also be solved with the help of a category of matrix factorization methods.

A technical contribution is an vigorous and innovative inference framework

that not satisfactory improves the accuracy with the support of using

selectively measuring further informative paths, but also accelerates the

convergence for to be had bandwidth with the aid of incorporating its

dimension methodology. Then, evaluation the usability of rating-based

community dimension and inference in purposes. A case be trained is carried

out on whether or not or no longer or now not locality recognition can also be

5156 T.Satish Kumar Reddy and D.Ganesh

complete for overlay networks of Pastry and BitTorrent utilizing inferred

rankings. We show off that such coarse-grained capabilities can give a boost

to the effectivity of peer resolution and that finer granularities don't regularly

affect in higher enhancements. Evolved wi-fi applied sciences paying homage

to a couple of- enter more than one-output (MIMO) require each telephone

station (MS) to ship particularly a few ideas to the backside station. This

periodic tactics consumes a lot of the uplink bandwidth. This high priced

bandwidth might be very most of the time visible as a principal hindrance to

the deployment of MIMO and one-of-a-kind developed closed-loop wi-fi

utilized sciences. This paper is the primary to propose a framework for

amazing allocation of periodic suggestions channels to the nodes of a wi-fi

nearby. A wide variety of major optimization problems are outlined and

effective algorithms for fixing them are furnished. A scheme for finding out

when the backside station (BS) will need to invoke each algorithm can be

proposed and validated via simulations to perform excellent.

Index Terms- Matrix factorization, network inference, ratingbased network

measurement, recommender system. Channel state information, wireless

networks.

1. INTRODUCTION

Network measurement is a predominant concern within the core of the networking be

informed. Over time, in particular particularly just a few instruments had been

developed to acquire path residences paying homage to round-shuttle time (RTT), on

hand bandwidth (ABW), packet loss fee, and so on. . As inmost scientific disciplines,

the ordinary expertise within the area is that a measurement ought to be made as

ample-grained and right as possible. That is considered most important to permit

quantitative analysis of community effectivity.

In an effort to accumulate excessive throughput in wireless networks, the transmitter

desires to gather up to date capabilities related to the channel first-class positioned via

the receiver. To this conclude, developed wi-fi requisites require each mobile station

(MS) to periodically transmit to the backside station (BS) its Channel fine Indicator

(CQI). CQI is a measure of the downlink mobile channel and is used by the BS to

adapt the modulation and coding parameters to the channel fame of the corresponding

node. These measurements in addition play a major role throughout the scheduling

algorithm [5], [6]. When a couple of-enter a couple of-output (MIMO) science is

incorporated into 4G wi-fi networks, the wide variety of recommendations which

have acquired to be transmitted from the MSs to the BS raises dramatically. Within

A Protected and Proficient ID-Based Cumulative Mark Format for Information Centers 5157

the MIMO closed-loop spatial multiplexing mode, for illustration, this strategies

entails the Rank Indicator (RI), the Precoding Matrix Indicator (PMI), and the CQI.

The BS makes use of the PMI stories to assess how the precoding matrix ought to be

configured for transmission. The RI experiences aspect out the number of MIMO

transmission layers available to the reporting MS. All these indicators require

reasonably a form of luxurious uplink bandwidth, quite often due to the fact they're

dispatched periodically provided that there is also transmission on the downlink

channel. This highly-priced bandwidth mainly very more often than not obvious as a

predominant difficulty to the deployment of MIMO and precise developed closed-

loop wi-fi utilized sciences. As a outcome, the uplink bandwidth to these warning

warning signs ought to be dispensed very cautiously, at the same time achieving

distinctive optimization ambitions. Our framework encompasses all average warning

indications, at the part of CQI, RI, and PMI. CQI feedbacks may also be each and

every wideband CQI, the predicament the CQI is measured for the whole downlink

channel bandwidth, or sub band CQI, the situation each CQI is measured over a sub

band. We don't distinguish between the particularly fairly numerous indications and

consider them collectively as channel reputation figuring out (CSI) channels. Each

and every 3GPP/LTE [1] and Wi MAX/802.Sixteen [11] help periodic and a periodic

CSI approaches. Even as a periodic CSI strategies requires the BS to ship a signaling

message at any time when it desires to acquire a CSI file from an MS, periodic CSI

ideas requires only one signaling message for the allocation of a CSI channel and one

for its liberate. The allocation message suggests the neighborhood and periodicity of

the CSI slots that include the disbursed CSI channel. As soon as a CSI channel is

disbursed, the MS transmits CSI messages on the slots of this channel besides it

receives a deallocation message. The contribution of this paper is threefold. It can be,

to the high-first-rate of our capabilities, the predominant to present a compatible

framework for the allocation of periodic CSI channels. It in addition defines, all over

again for the predominant time, a number of problems significant to this framework

and presents you robust algorithms for fixing them. Eventually, it offers you a holistic

scheme that shows when the BS have received to invoke each of the proposed

algorithms. The framework proposed on this paper defines a revenue/utility perform

for the allocation of a CSI channel to each and every MS. Whilst the proposed

framework and algorithms are normal abundant to manipulate each earnings

participate in, we endorse and discuss a unique participate in, for which the income is

equal to the expected quantity of packets transmitted to an MS making use of a

correct CSI price for this reason of the allocation of a CSI channel with a distinctive

bandwidth. Two rather more more commonly than not used BS scheduling items are

proportional inexpensive [21] and semi-steady [13]. A proportional affordable

scheduler adjusts the instantaneous transmission price to every patron dynamically,

even on the subframe granularity. A semi-continuous scheduler adjusts the

instantaneous transmission premiums so much a lot much less particularly most often;


e.G., as rapidly as every 10 000 subframes. Whilst the framework offered on this

paper is generally happening and may work with every scheduling schemes, to make

the speak extra concrete, we reward a exact earnings take part in, which is dependent

upon the variety of packets transmitted to every MS. This kind of income scheme is

extra in general than not suitable for semi- vigour schedulers.

2. PRELIMINARIES

A. CSI Channels

Resolution-making schemes that could come to a decision to now not ship special CSI

studies [7], [9], [10], [12], [19], [22], e.G., if the channel obstacle has not transformed

in particular, can't without problems take potential of the unused slots. That is

considering that that these slots are too brief for natural packets and due to the fact

that the MS cannot depend on their availability. The approach taken through our paper

is certainly one of a kind within the sense that the BS allocates detailed bandwidth to

exotic CSI channels in keeping with each channels character revenue function.

Making use of the scheme we advise, the BS views the CSI bandwidth (i.E., the

uplink bandwidth dedicated to the CSI channels) as a shared resource, to be

dynamically disbursed to the MSs. The BS could additionally alter the scale of this

priceless resource. For illustration, when it realizes that there are usually not so many

dynamic MSs in its mobile, the BS can minimize the entire CSI bandwidth and use it

for specific functions. The CSI bandwidth is divided into a few giant-channels. A

ideal-channel consists of one slot in each uplink physique [Fig. 1(a)]. For this reason,

the number of such large-channels is the equal as the variety of CSI slots in every

body. Each and every massive-channel is split into more than one CSI channels, every

of which makes use of only one slot each frames [Fig. 1(b)]. This paper grants

algorithms for the division of a super-channel into a couple of channels and for the

allocation and deallocation of these CSI channels. To allocate a CSI channel, the BS

sends to an MS a manipulate message with the following parameters:

1) the sequence quantity of the first frame that comprises a slot of this channel;

2) the quantity of frames between two consecutive slots of this channel;

3) the time for the period of which this CSI channel is distributed to the MS. The BS

might also allocate the channel with out a expiration time, after which explicitly

request it again. A CSI channel is denoted , the situation is the sequence number of

the primary body that includes a slot of this channel and is the periodicity of the slots.

A smaller valued at of Tj system additional probably taking place CSI reports, which

furnish the BS with more correct information regarding the channel state of the

corresponding MS. Nevertheless, if Tj is too small, the BS is prone to obtain too

many identical CSI reviews. As a consequence, the top-quality fee of Tj depends upon


the steadiness of the channel, which is littered with many factors akin to MS mobility

velocity, bodily boundaries, climate stipulations, interference from exceptional

BSs/MSs, or different wi-fi networks.

B. Power-of-2 Allocation

A energy-of-2 allocation is an allocation of CSI channels for which T=2i holds for

each channel, the place i is an integer between zero and C . Such an allocation is

useful when you consider that it may restrict collisions between slots of two distinct

CSI channels.

Definition 1: Two or extra CSI channels are mentioned to collide if they incorporate

the same slot. In different words, a collision occurs between and if for some integers

x>zero and , y>zero

We now exhibit how a vigour-of-2 allocation will also be carried out when the

bandwidth of each and every super-channel is maintained making use of a whole

binary tree Tc whose peak is C . We consult with the sort of tree as a CSI allocation

tree. Then, we will see how such an allocation may also be guaranteed to be collision-

free. The leaves of Tc are in stage 0, their moms and dads are in level 1, and so forth.

We assign a label to each tree node within the following way. For a node in stage , the

assigned label contains C-l digits from which the first C-l-1 are the same as of the


nodes father or mother and the last digit is set to 0 for a left child or to 1 for a proper

youngster. Fig. 2 offers an illustration.

C. CSI Allocation Framework

Following the communicate above,we now describe our standards from a CSI

allocation framework: R1) Collisions and fragmentation of CSI channels ordinarily

are almost always now not allowed. For this reason: a) an quality-channel is cut up

into multiple CSI channels utilizing a complete binary tree; b) each CSI channel

consists of at most one tree node, which is the foundation of a sub tree; c) sub trees

distributed to distinct CSI channels are collectively disjoint. R2) for every tree

measure and , a earnings function indicates the income of the procedure from

allocating this CSI channel to this MS. At the same time our framework is common

adequate to manage every participate in, in the course of the paper we middle of

concentration on the subsequent designated

one:

3. ALGORITHMS FOR CSI ALLOCATION

A. Optimization Criterion

On this section, we care for the next issues involving the CSI allocation framework

described in part III:

1) methods to allocate bandwidth to CSI channels when a tree (tremendous-channel)

is empty;

2) convenient approaches to reallocate the bandwidth of a launched CSI channel;


three) the correct solution to allocate a CSI channel to a new MS when the to be had

CSI bandwidth is fragmented;

4) the proper strategy to alternate the bandwidth of a CSI channel in an effort to recall

changes within the earnings operate of some MS(s), eg., seeing that of a new mobility

sample.

B. CSI Allocation When the Tree Is Empty

We with the predominant crisis, the place we count on that the tree is empty and the

motive is to search out the first-rate allocation for a given set of active MS s. This

predicament is often called Collision-Free CSI allocation in an Empty tree (CF-CSI-

E) and is formally outlined as follows:

crisis 1 (CF-CSI-E): illustration: the height of the allocation tree and the sales

participate in for each and every vigorous . Intent: to look out an allocation of CSI

channels to the animated MSs such that the whole revenue is maximized.

C. CSI Allocation With No Change to Previously Allocated CSI Channels

We now define the 2d difficulty, known as Collision- Free CSI allocation and not

using a change to beforehand allotted CSI channels (CF-CSI-NC). Here, some

bandwidth of a perfect-channel tree turns into to be had following the release of a CSI

channel when an energetic MS leaves the mobile phone or turns into inactive. This

bandwidth may also be allocated by way of the BS to support the complete revenue

received by using the current lively MSs.

Main issue 2 (CF-CSI-NC):

Example: the height of the allocation tree C , the profit perform Pj for each active ,

and knowledge about already allotted CSI channels.


Function: Allocate the unused CSI bandwidth such that the won revenue is

maximized.

If is an -approximation to MC-MKP, Algorithm 2 is an -approximation

to CF-CSI-NC. In [4], it is proven that even with out a couple of option, MC-MKP is

tough to approximate in a entirely polynomial time.

We now present a 2-approximation grasping algorithm for MC-MKP. This algorithm

combines the two-approximation grasping algorithm for MCKP [14] and the 2-

approximation algorithm for MKP [14].


4. SIMULATION STUDY AND A COMPLETE BS SCHEME

We now present Monte Carlo simulation outcome of the especially plenty of

algorithms offered within the paper. The intention of this part is twofold: to evaluate

the efficiency of those algorithms; use the simulation outcome to enhance a complete

BS allocation scheme that implies when the BS will need to invoke each algorithm.

At some point of this segment, we recollect CSI allocation bushes whose heights are

C=10 and C=8 . The traditional time window between sign-to-interference-plus-noise

ratio (SINR) transformations is randomly chosen between 32 and 1024 sub frames.

Consequently, for each MS , holds. The natural advantage packet cost rj for each

MS is uniformly chosen between 50 and one thousand packets/s. For every MS j , Ej

is capable to rj, wj and the income function is as described in (1). An pleasant first-

class pseudo polynomial time algorithm is used to resolve the reduced MCKP

example in Algorithm 1, and a 2-approximation algorithm is used to comfort the

diminished MC-MKP instance in Algorithm 2.

A. Performance of Algorithms 1 and Algorithms 2

We first overview Algorithm 1 to an algorithm that allocates simplest stage-zero CSI

channels (i.e., easiest tree leaves). So far as we know, this is the lengthy-founded

scheme used at reward with the help of BS. We do not forget as a lot as 1600 active

MSs. For every quantity of MSs, we repeat the simulation a thousand events with

precise seeds and usual the effect. In Fig. 7, the -axis suggests the huge sort of lively

MSs (load), and the -axis suggests the normalized sales bought by way of Algorithm

1, i.e., the earnings got via Algorithm 1 divided by means of the earnings purchased

with the support of an algorithm that allocates most strong measure-zero CSI channel

to every MS. As expected, when the number of MSs is small, allocating every of them

a stage-zero CSI channel leaves lots of the allocation tree unused. As a consequence,

the normalized income of Algorithm 1 is immoderate. Considering the fact that the

quantity of MSs raises, additional of the tree will also be utilized through allocating

most strong measure-zero nodes and the profits ratio decreases. Seeing that a tree

whose prime is has fewer leaves (bandwidth) than a tree with , degree-zero allocation

takes a greater a part of the CSI tree. Hence, the normalized sales is smaller for than

for . Subsequent, we evaluate the effectivity of Algorithm 1 to that of Algorithm 2.

The entire sales bought by utilizing Algorithm 2 is expected to be smaller in view that

of the fragmentation that would have an effect on when you consider that that we do

not permit this algorithm to delete already dispensed CSI channels. For instance, take

into account the CSI allocation tree in Fig. 6 and rely on that all MSs are dispensed a

CSI channel of their maximal stage. Depend on that a company new MS whose

maximal stage is 3 turns into animated. Considering the fact that the peak of the

perfect max-free sub tree is 2, the brand new MS will also be allocated a node in stage

2. In difference,Algorithm1 deletes the proper now allotted CSI channels and returns

an allocation the place all MSs get their pleasant measure CSI channel, thereby


acquiring a better sales. If the brand new MS has a greater rate, the change in sales is

healthier.

Fig. 3. Normalized profit of Algorithm 1 versus the number of MSs (load).

Inside the following trial, we with an preliminary record ofMSs and invoke

Algorithm 1 to allocate them CSI channels. Then, we simulate a thousand random

movements of including or deleting randomly chosen MSs. Accordingly, the original

load is proportional to the preliminary quantity

of MSs. We hold two separate CSI allocation bushes. After each MS insertion or

deletion, we invoke Algorithm 1 on the important tree and Algorithm2 on the 2nd.

The influence are shown in Fig. Eight, the place the -axis shows the ordinary quantity

of preliminary MSs (load) and the -axis shows the complete profit ratio between the

tree maintained through utilizing Algorithm 1 and the tree maintained through

Algorithm 2. All over again, we reward two curves: one for and one for . When the

quantity of MSs is small, there could also be ample CSI bandwidth to accommodate

every arriving MS in its maximal measure. Consequently, the revenue ratio would be

very virtually 1. Due to the fact the number of MSs raises, Algorithm 2 is unable to

allocate CSI channels on the easiest high-quality levels, and the revenue ratio raises.

When the wide variety of MSs raises additional, each Algorithm 1 and a couple of are

ready to allocate CSI channels (at low stages) most robust to MSs whose is excessive,

and the revenue ratio decreases back to 1.


Fig. 4. Total profit of Algorithm 1 divided by total profit of Algorithm 2 versus the

number of MSs (load).

B. Complete BS Scheme

We now combine Algorithms 1 and a few proper proper right into a whole allocation

scheme for the BS. An action is required from the BS within the next instances: 1) a

brand new MS turns into lively; 2) an animated MS leaves the mobile or turns into

inactive; three) the revenue perform of an lively MS alterations (e.g., seeing that that

of a metamorphosis inside the consumer mobility p.C.). Algorithm 2 allows for an

beef up inside the income without the overhead associated with the putting off of

reward CSI channels. However, Algorithm 2 is extra more commonly unable to

allocate a CSI channel, no longer due to the fact the bandwidth is insufficient,

however when you consider that it can be fragmented. In such occasions it generally

extra most important for the BS to clear the CSI allocation tree and invoke Algorithm

1. For this reason, Algorithm 1 brings two essential benefits to the scheduler. First, it

serves as a benchmark for Algorithm 2 considering the fact that it suggests the highest

entire income that may be acquired at each and every moment. 2nd, it can be every so

typically invoked with the support of the BS as a way to swap the present tree with a

organization new one for the rationale of maximizing the revenue. All these issues are

combined into the whole BS scheme awarded in Fig. 9. The scheme is invoked when

a brand new celebration is precipitated at the BS. When a manufacturer new MS turns

into animated or an lively MS turns into inactive, the BS assessments the ratio


between the revenue acquired by the use of updating the present tree utilizing

Algorithm 2 and that obtained with the aid of utilizing making use of developing a

manufacturer new tree utilizing Algorithm 1. If this ratio is smaller than a detailed

threshold , then the organization new tree developed by way of Algorithm 1 is used.

Or else, the gift tree is updated utilizing Algorithm 2. This ensures that the acquired

revenue is definitely not worse by the use of a aspect of than the maximum

conceivable. However, as techniques 1, the range of CSI manipulate (allocation and

deallocation) messages dispatched to the MSs raises.

Fig. 5. Complete BS scheme (scheme 1).


Fig. 6. Profit achieved by the proposed scheme divided by the maximum profit that

can be achieved using Algorithm 1, as a function of the threshold .

We analysis the above scheme for a CSI allocation tree with. We set the typical broad

style of MSs to 250, which is the place, as Fig. 6 suggests, the ratio between the profit

bought via Algorithm 1 and that purchased via Algorithm 2 might be very excessive

for . A thousand random ambitions are regarded and averaged for each and every

worth of . Fig. 7 suggests the ratio between the profits accomplished by way of the

entire BS scheme and the (maximal) sales completed by way of Algorithm 1 as a take

part in of . As predicted, when the worth of raises, the earnings of the scheme is

toward probably the most desirable on the grounds that the allocation of Algorithm 1

is used further fairly usually. To learn the rate of utilizing the allocation of Algorithm

1 additional more in general than not, we fashioned the wide variety of changes per

party for the proposed scheme as a participate in of t.

.

Fig. 7. Average number of changes per event of the proposed scheme as a function of

the threshold .


Fig. 8. Average number of changes per event of the proposed scheme as a function of

the average number of MSs for t=0.94

Subsequent, we put into outcome an larger designated of t=zero. Ninety 4 and scan

the efficiency of the proposed scheme for unusual numbers of lively MS s. The effect

are tested in Fig. 12, the place the axis suggests the typical wide variety of MSs (load)

and the -axis suggests the common quantity of transformations per occasion. The

easiest kind of alterations per party occurs when the natural style of MSs is 250,

which is expected seeing that, as Fig. 6 indicates, that's the position the best possible

gains ratio between Algorithms 1 and a pair of is obtained.

Fig 9: Adapted BS scheme (scheme 2).


Fig. 10. Normalized profit achieved by scheme 2 versus the average number

of MSs (load).

Subsequent, we achieve capabilities of the price incurred via scheme 2 seeing that of

invoking Algorithm 1. To this conclude, we compute the typical number of

modifications per event for scheme 2 as a function of the traditional number of MSs.

The end result are proven in Fig. 9. On account that the typical quantity of MSs

increases, the tree becomes more fragmented, Algorithm 1 is invoked extra most

commonly, and the traditional number of variations raises as good. Because the

natural number of MSs increases additional, the tree is much less fragmented, and as a

consequence Algorithm 1 is infrequently invoked.

Subsequent, we gain capabilities of the rate incurred with the aid of scheme 2 given

that of invoking Algorithm 1. To this end, we compute the common number of

transformations per event for scheme 2 as a operate of the usual quantity of MSs. The

effect are established in Fig. 11. Because the ordinary wide variety of MSs raises, the

tree turns into more fragmented, Algorithm 1 is invoked additional in most cases, and

the common quantity of alterations increases as good. Because the usual wide variety

of MSs raises additional, the tree is much less fragmented, and as a result Algorithm 1

is rarely invoked.

Fig. 11. Average number of changes per event of scheme 2 versus the number of MSs

(load).


5. CONCLUSION

We furnished a appropriate framework for the allocation of periodic CSI channels.

Within the proposed framework, the disbursed bandwidth is maintained as a tree.

Every MS is regarding a income perform that implies the sales of the procedure from

allocating a CSI channel of distinctive bandwidth to this MS. We outlined two

optimization disorders for this framework and proposed most first-rate polynomial-

time algorithms for them. Our simulation be educated indicates how the proposed

algorithms can even be combined appropriate into a unified scheme, to be invoked by

way of the BS when a manufacturer new social gathering takes challenge. One of the

crucial essential causes of the proposed scheme is the definition of the profits operate

to be optimized through the BS.

On this paper, we used a perform whose intention is to maximise the range of packets

dispatched utilizing the correct CSI valued at. We feel that strong offerings with

distinguished parameters need to even be studied, and we go away this for future

work.

REFERENCES

[1] 3GPP, “Technical specification group radio access network; Evolved

Universal Terrestrial Radio Access (E-UTRA); physical layer procedures

(Release 10),” 3GPP TS 36.213, Jun. 2010.

[2] Z. Bai, C. Spiegel, G. Bruck, P. Jung, M. Horvat, J. Berkmann, C. Drewes,

and B. Gunzelmann, “Closed loop transmission with precoding selection in

LTE/LTE-Advanced system,” in Proc. Int. Symp. Appl. Sci. Biomed. Commun. Technol., Nov. 2010, pp. 1–5.

[3] G. Berardinelli, T. Søandrensen, P. Mogensen, and K. Pajukoski, “SVD-based

vs. release 8 codebooks for single user MIMO LTE-A uplink,” in Proc. IEEE Veh. Technol. Conf., May 2010, pp. 1–5.

[4] C. Chekuri and S. Khanna, “A PTAS for the multiple knapsack problem,” in

Proc. SODA, 2000, pp. 213–222.

[5] R.Cohen, G. Grebla, and L.Katzir, “Cross-layer hybrid FEC/ARQ reliable

multicast with adaptivemodulation and coding in broadband wireless

networks,” IEEE/ACM Trans. Netw., vol. 18, no. 6, pp. 1908–1920, Dec.

2010.

[6] R. Cohen and L. Katzir, “Computational analysis and efficient algorithms for

micro and macro OFDMA scheduling,” IEEE/ACM Trans. Netw., vol. 18, no.

1, pp. 15–26, Feb. 2010.


[7] M.Dottling, B. Raaf, and J. Michel, “Efficient channel quality feedback

schemes for adaptive modulation and coding of packet data,” in Proc. IEEE Veh. Technol. Conf., Sep. 2004, vol. 2, pp. 1243–1247.

[8] T. Erlebach, R. Jacob, M. Mihalak, M. Nunkesser, G. Szabo, and P.

Widmayer, “An algorithmic view on OVSF code assignment,” Algorithmica,

vol. 47, no. 3, pp. 269–298, 2007.

[9] N. Fukui, “Study of channel quality feedback in UMTS HSPDA,” in Proc. IEEE Int. Symp. Pers., Indoor Mobile Radio Commun., Sep. 2003, vol. 1, pp.

336–340.

[10] T. Hui, S. Qiaoyun, D. Kun, and L. Xingmin, “A hybrid CQI feedbackscheme

for 4G wireless systems,” in Proc. IEEE Veh. Technol. Conf., Apr. 2009, pp.

1–4.

[11] Institute of Electrical and Electronics Engineers, Inc., Piscataway, NJ, USA,

“IEEE draft standard for local and metropolitan area networks— Part 16: Air

interface for broadband wireless access systems,” Jun. 2008.

[12] S. Y. Jeon and D. H. Cho, “Channel adaptive CQI reporting schemes for

HSDPA systems,” IEEE Commun. Lett., vol. 10, no. 6, pp. 459–461, Jun.

2006.

[13] D. Jiang, H. Wang, E. Malkamaki, and E. Tuomaala, “Principle and

performance of semi-persistent scheduling for VoIP in LTE system,” in Proc. IEEE WiCom, 2007, pp. 2861–2864.

[14] H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems. New Yoek,

NY, USA: Springer, 2004.

[15] W. Lee and D. H. Cho, “CQI feedback reduction based on spatial correlation

in OFDMA system,” in Proc. IEEE Veh. Technol. Conf., Sep. 2008, pp. 1–5.

[16] W. Lilei,W. Xiaoyi, and X. Huimin, “Strategies to improve the utilization ratio

of CQI channels in IEEE 802.16 systems,” in Proc. WiCOM, 2008, pp. 1–4.

[17] S. Schwarz, C. Melführer, and M. Rupp, “Calculation of the spatial

preprocessing and link adaption feedback for 3GPP UMTS/LTE,” in Proc. IEEE Conf. Wireless Adv., Jun. 2010, pp. 1–6.

[18] S. Schwarz, M.Wrulich, andM. Rupp, “Mutual information based calculation

of the precoding matrix indicator for 3GPP UMTS/LTE,” in Proc. Int. ITG Workshop Smart Antennas, Feb. 2010, pp. 52–58.

[19] J. Su, B. Fan, K. Zheng, and W. Wang, “A hierarchical selective CQI

feedback scheme for 3GPP long-term evolution system,” in Proc. IEEE Int.


Symp. Microw., Antenna, Propag. EMC Technol. Wireless Commun., Aug.

2007, pp. 5–8.

[20] R. Vannithamby, G. Li, H. Yin, and S. Ahmadi, “Proposal for IEEE 802.16m

CQI feedback framework,” May 2008.

[21] C. Wengerter, J. Ohlhorst, and A. von Elbwart, “Fairness and throughput

analysis for generalized proportional fair frequency scheduling in OFDMA,”

in Proc. IEEE VTC, 2005, vol. 3, pp. 1903–1907.

[22] X. Wu, J. Zhou, G. Li, and M. Wu, “Low overhead CQI feedback in multi-

carrier systems,” in Proc. IEEE GLOBECOM, 2007, pp. 371–375.

[23] W. Xiaoyi and W. Lilei, “A new mathematical model for analyzing CQI

channel allocation mechanism in IEEE 802.16 systems,” in Proc. ICCSC,

2008, pp. 177–181.

A Protected and Proficient ID-Based Cumulative Mark Format ... · 5156 T.Satish Kumar Reddy and...

Documents

Transcript of A Protected and Proficient ID-Based Cumulative Mark Format ... · 5156 T.Satish Kumar Reddy and...