Matches in SemOpenAlex for { <https://semopenalex.org/work/W2799281246> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2799281246 abstract "There has been an enormous interest towards cooperative communication in recent years. Cooperative communication plays a signi cant role in providing a reliable communication in wireless networks. Cooperative communication helps overcome fading and attenuation in wireless networks. Its main purpose is to increase the communication rates across the network and to increase reliability of time-varying links. It is known that wireless communication from a source to a destination can bene t from the cooperation of nodes that overhear the transmission. In this thesis we consider problem of resource allocation in cooperative network consisting of Primary User (PU) and (N - 1) Secondary Users (SUs), operating in a shared wireless medium. In our network scenario, PU's dedicated channel su ers from fading. PU, in order to overcome fading and attenuation, grants access of its dedicated channel to other SUs conditioned on their cooperation. Whenever PU's dedicated channel is OFF, its packet can be relayed through SU's. Our ultimate goal is to design a distributed algorithm to achieve optimal throughput properties. Maximum Weight Scheduling can achieve throughput optimality by exploiting opportunistic gain in general network topology with fading channels. Despite the advantage of opportunistic scheduling, this mechanism requires that the existing central scheduler is aware of network conditions such as channel state and queue length information of users. We break this assumption by considering that only individual information is available at each user. We design a Carrier Sense Multiple Access (CSMA) based algorithm which only uses individual queue length information. We derive exact capacity region of the cooperative network for two user scenario thus establishing superiority of the cooperative network over non cooperative network. Then we prove throughput optimality of our proposed algorithm for two scenarios; rst being a cooperative network consisting of N users with only PU having fading channel and second a two user scenario where all existing links su er from fading." @default.
- W2799281246 created "2018-05-17" @default.
- W2799281246 creator A5080355245 @default.
- W2799281246 date "2015-01-01" @default.
- W2799281246 modified "2023-09-27" @default.
- W2799281246 title "Optimal distributed scheduling algorithm for cooperative communication networks" @default.
- W2799281246 hasPublicationYear "2015" @default.
- W2799281246 type Work @default.
- W2799281246 sameAs 2799281246 @default.
- W2799281246 citedByCount "0" @default.
- W2799281246 crossrefType "dissertation" @default.
- W2799281246 hasAuthorship W2799281246A5080355245 @default.
- W2799281246 hasConcept C107568181 @default.
- W2799281246 hasConcept C108037233 @default.
- W2799281246 hasConcept C120314980 @default.
- W2799281246 hasConcept C126255220 @default.
- W2799281246 hasConcept C127162648 @default.
- W2799281246 hasConcept C148063708 @default.
- W2799281246 hasConcept C157764524 @default.
- W2799281246 hasConcept C160403385 @default.
- W2799281246 hasConcept C175893541 @default.
- W2799281246 hasConcept C206729178 @default.
- W2799281246 hasConcept C29722447 @default.
- W2799281246 hasConcept C31258907 @default.
- W2799281246 hasConcept C33923547 @default.
- W2799281246 hasConcept C41008148 @default.
- W2799281246 hasConcept C5119721 @default.
- W2799281246 hasConcept C555944384 @default.
- W2799281246 hasConcept C76155785 @default.
- W2799281246 hasConcept C81978471 @default.
- W2799281246 hasConceptScore W2799281246C107568181 @default.
- W2799281246 hasConceptScore W2799281246C108037233 @default.
- W2799281246 hasConceptScore W2799281246C120314980 @default.
- W2799281246 hasConceptScore W2799281246C126255220 @default.
- W2799281246 hasConceptScore W2799281246C127162648 @default.
- W2799281246 hasConceptScore W2799281246C148063708 @default.
- W2799281246 hasConceptScore W2799281246C157764524 @default.
- W2799281246 hasConceptScore W2799281246C160403385 @default.
- W2799281246 hasConceptScore W2799281246C175893541 @default.
- W2799281246 hasConceptScore W2799281246C206729178 @default.
- W2799281246 hasConceptScore W2799281246C29722447 @default.
- W2799281246 hasConceptScore W2799281246C31258907 @default.
- W2799281246 hasConceptScore W2799281246C33923547 @default.
- W2799281246 hasConceptScore W2799281246C41008148 @default.
- W2799281246 hasConceptScore W2799281246C5119721 @default.
- W2799281246 hasConceptScore W2799281246C555944384 @default.
- W2799281246 hasConceptScore W2799281246C76155785 @default.
- W2799281246 hasConceptScore W2799281246C81978471 @default.
- W2799281246 hasLocation W27992812461 @default.
- W2799281246 hasOpenAccess W2799281246 @default.
- W2799281246 hasPrimaryLocation W27992812461 @default.
- W2799281246 hasRelatedWork W149060916 @default.
- W2799281246 hasRelatedWork W1979539576 @default.
- W2799281246 hasRelatedWork W1980997223 @default.
- W2799281246 hasRelatedWork W2002777799 @default.
- W2799281246 hasRelatedWork W2014690293 @default.
- W2799281246 hasRelatedWork W2038279219 @default.
- W2799281246 hasRelatedWork W2042490359 @default.
- W2799281246 hasRelatedWork W2074775353 @default.
- W2799281246 hasRelatedWork W2078409770 @default.
- W2799281246 hasRelatedWork W2097688585 @default.
- W2799281246 hasRelatedWork W2103065423 @default.
- W2799281246 hasRelatedWork W2123613894 @default.
- W2799281246 hasRelatedWork W2159731678 @default.
- W2799281246 hasRelatedWork W2168356310 @default.
- W2799281246 hasRelatedWork W2288777868 @default.
- W2799281246 hasRelatedWork W2297177633 @default.
- W2799281246 hasRelatedWork W2390125562 @default.
- W2799281246 hasRelatedWork W2542248659 @default.
- W2799281246 hasRelatedWork W2788704629 @default.
- W2799281246 hasRelatedWork W2962711230 @default.
- W2799281246 isParatext "false" @default.
- W2799281246 isRetracted "false" @default.
- W2799281246 magId "2799281246" @default.
- W2799281246 workType "dissertation" @default.