NDLI: Cooperative Coverage Extension for Relay-Union Networks

Content Provider	IEEE Xplore Digital Library
Author	Yong Cui Xiao Ma Xiuzhen Cheng Minming Li Jiangchuan Liu Tianze Ma Yihua Guo Biao Chen
Copyright Year	1990
Abstract	Multi-hop coverage extension can be utilized as a feasible approach to facilitating uncovered users to get Internet service in public area WLANs. In this paper we introduce a relay-union network (RUN), which refers to a public area WLAN in which users often wander in the same area and have the ability to provide data forwarding services for others. We develop a RUN framework to model the cost of providing forwarding services and the utility obtained by gaining services. The objective of the RUN is to maximize the total Quality of Cooperation (QoC) of users in the RUN. Two optimal bandwidth allocation schemes are proposed for both free and dynamic bandwidth demand models. To make our scheme more pragmatic, we then consider a more practical scenario in which the bandwidth capacity of the relays and the minimum demand of the clients are bounded. We prove that the problems under both the single relay and the multi-relay scenario are NP-hard. Three heuristic algorithms are proposed to deal with bandwidth allocation and relay-client association. We also propose a distributed signaling protocol and divide the centralized MRMC algorithm into three distributed ones to better adapt for real network environment. Finally, extensive simulations demonstrate that our RUN framework can significantly improve the efficiency of cooperation in the long term.
Sponsorship	IEEE Computer Society
Starting Page	371
Ending Page	381
Page Count	11
File Size	1614621
File Format	PDF
ISSN	10459219
Volume Number	26
Issue Number	2
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Bandwidth Relays Bismuth Channel allocation Cost function Mathematical model Heuristic algorithms cooperative Coverage extension relay-union network bandwidth allocation association
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

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

Max-Min Lifetime Optimization for Cooperative Communications in Multi-Channel Wireless Networks

Bandwidth and power allocation for cooperative relay in cognitive radio networks

Leveraging Cooperative, Channel and Multiuser Diversities for Efficient Resource Allocation in Wireless Relay Networks

Towards Cheat-Proof Cooperative Relayfor Cognitive Radio Networks

Enabling P2P One-View Multiparty Video Conferencing

Topology Design of Network-Coding-Based Multicast Networks

Dynamic Channel Assignment for Wireless Sensor Networks: A Regret Matching Based Approach

Coding-Aware Proportional-Fair Scheduling in OFDMA Relay Networks

Network Coding Aware Cooperative MAC Protocol for Wireless Ad Hoc Networks

Cooperative Coverage Extension for Relay-Union Networks

Similar Documents

Max-Min Lifetime Optimization for Cooperative Communications in Multi-Channel Wireless Networks

Bandwidth and power allocation for cooperative relay in cognitive radio networks

Leveraging Cooperative, Channel and Multiuser Diversities for Efficient Resource Allocation in Wireless Relay Networks

Towards Cheat-Proof Cooperative Relayfor Cognitive Radio Networks

Enabling P2P One-View Multiparty Video Conferencing

Topology Design of Network-Coding-Based Multicast Networks

Dynamic Channel Assignment for Wireless Sensor Networks: A Regret Matching Based Approach

Coding-Aware Proportional-Fair Scheduling in OFDMA Relay Networks

Network Coding Aware Cooperative MAC Protocol for Wireless Ad Hoc Networks

Cooperative Coverage Extension for Relay-Union Networks