An iterative allocation mechanism in the edgeworth box

1998 ◽  
Vol 4 (3) ◽  
pp. 253-258
Author(s):  
Nejat Anbarci ◽  
Gyoseob Yi
Keyword(s):  
Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 602
Author(s):  
Monisha Devi ◽  
Nityananda Sarma ◽  
Sanjib K. Deka

Cognitive radio (CR) has evolved as a novel technology for overcoming the spectrum-scarcity problem in wireless communication networks. With its opportunistic behaviour for improving the spectrum-usage efficiency, CR enables the desired secondary users (SUs) to dynamically utilize the idle spectrum owned by primary users. On sensing the spectrum to identify the idle frequency bands, proper spectrum-allocation mechanisms need to be designed to provide an effectual use of the radio resource. In this paper, we propose a single-sided sealed-bid sequential-bidding-based auction framework that extends the channel-reuse property in a spectrum-allocation mechanism to efficiently redistribute the unused channels. Existing auction designs primarily aim at maximizing the auctioneer’s revenue, due to which certain CR constraints remain excluded in their models. We address two such constraints, viz. the dynamics in spectrum opportunities and varying availability time of vacant channels, and formulate an allocation problem that maximizes the utilization of the radio spectrum. The auctioneer strategises winner determination based on bids collected from SUs and sequentially leases the unused channels, while restricting the channel assignment to a single-channel-multi-user allocation. To model the spectrum-sharing mechanism, we initially developed a group-formation algorithm that enables the members of a group to access a common channel. Furthermore, the spectrum-allocation and pricing algorithms are operated under constrained circumstances, which guarantees truthfulness in the model. An analysis of the simulation results and comparison with existing auction models revealed the effectiveness of the proposed approach in assigning the unexploited spectrum.


2013 ◽  
Vol 22 (3) ◽  
pp. 437-461 ◽  
Author(s):  
Chathurika Ranaweera ◽  
Elaine Wong ◽  
Christina Lim ◽  
Ampalavanapillai Nirmalathas ◽  
Chamil Jayasundara

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1593
Author(s):  
Ismael Amezcua Valdovinos ◽  
Patricia Elizabeth Figueroa Millán ◽  
Jesús Arturo Pérez-Díaz ◽  
Cesar Vargas-Rosales

The Industrial Internet of Things (IIoT) is considered a key enabler for Industry 4.0. Modern wireless industrial protocols such as the IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) deliver high reliability to fulfill the requirements in IIoT by following strict schedules computed in a Scheduling Function (SF) to avoid collisions and to provide determinism. The standard does not define how such schedules are built. The SF plays an essential role in 6TiSCH networks since it dictates when and where the nodes are communicating according to the application requirements, thus directly influencing the reliability of the network. Moreover, typical industrial environments consist of heavy machinery and complementary wireless communication systems that can create interference. Hence, we propose a distributed SF, namely the Channel Ranking Scheduling Function (CRSF), for IIoT networks supporting IPv6 over the IEEE 802.15.4e TSCH mode. CRSF computes the number of cells required for each node using a buffer-based bandwidth allocation mechanism with a Kalman filtering technique to avoid sudden allocation/deallocation of cells. CRSF also ranks channel quality using Exponential Weighted Moving Averages (EWMAs) based on the Received Signal Strength Indicator (RSSI), Background Noise (BN) level measurements, and the Packet Delivery Rate (PDR) metrics to select the best available channel to communicate. We compare the performance of CRSF with Orchestra and the Minimal Scheduling Function (MSF), in scenarios resembling industrial environmental characteristics. Performance is evaluated in terms of PDR, end-to-end latency, Radio Duty Cycle (RDC), and the elapsed time of first packet arrival. Results show that CRSF achieves high PDR and low RDC across all scenarios with periodic and burst traffic patterns at the cost of increased end-to-end latency. Moreover, CRSF delivers the first packet earlier than Orchestra and MSF in all scenarios. We conclude that CRSF is a viable option for IIoT networks with a large number of nodes and interference. The main contributions of our paper are threefold: (i) a bandwidth allocation mechanism that uses Kalman filtering techniques to effectively calculate the number of cells required for a given time, (ii) a channel ranking mechanism that combines metrics such as the PDR, RSSI, and BN to select channels with the best performance, and (iii) a new Key Performance Indicator (KPI) that measures the elapsed time from network formation until the first packet reception at the root.


Sign in / Sign up

Export Citation Format

Share Document