Device Selection of Distributed Primal-Dual Algorithms Over Wireless Networks

Author(s):  
Zhaohui Yang ◽  
Chongwen Huang ◽  
Hao Xu ◽  
Wei Xu ◽  
Yue Cao
Author(s):  
Pramod Kumar Goyal ◽  
Pawan Singh

In a heterogeneous wireless network (HWN) environment, performing an efficient vertical handoff requires the efficient qualitative evaluation of all stakeholders like wireless networks (WN) and mobile users (MU) and mutual selection of best WN-MU. In the literature, most of the work deals with both these requirements jointly in the techniques proposed by them for the vertical handoffs (VHO) in HWNs, leaving very little scope to manipulate the above requirements independently. This may result in inefficient vertical handoffs. Hence, this chapter proposed a generalized two-stage two players, iterative non-cooperative game model. This model presents a modular framework that separates the quantitative evaluation of WNs and MUs (at Stage 1) from the game formulation and solution (at Stage 2) for mutual selection of best WN-MU pair for VHO. The simulation results show a substantial reduction in the number of vertical handoffs with the proposed game theory-based two-stage model as compared to a single-stage non-game theory method like multiple attribute decision making.


2012 ◽  
Vol 18 (10) ◽  
pp. S141
Author(s):  
Toru Kuratani ◽  
Kei Torikai ◽  
Kouichi Maeda ◽  
Isamu Mizote ◽  
Yasuharu Takeda ◽  
...  

2014 ◽  
Vol 8 (6) ◽  
pp. 964-971 ◽  
Author(s):  
Mingming Li ◽  
Jia Zhou ◽  
Jing Qu ◽  
Xiaoxiang Wang

Author(s):  
Qiaoqiao Lou ◽  
Zhijin Zhao

Broadcast is an important link in mobile ad hoc wireless networks (MANETs). In order to improve broadcast coverage, reduce forwarding probability and broadcast collision, a dynamic space-covered broadcast algorithm based on neighbor-degree in MANETs is proposed. The concepts of neighbor-degree, available-angel and available-distance are introduced. The neighbor-degree is used to generate the initial forwarding probability of a node. Based on the available-angle and available-distance, the node weight is proposed to calculate the final forwarding probability, thereby realizing the dynamic selection of forwarding node and reflecting the dynamic space-covered of node. The forwarding strategy is proposed to reduce broadcast collision. Simulation results show that, compared with dynamic probability broadcast and node location based space-covered broadcast, proposed broadcast algorithm reduces the broadcast collision, improves the broadcast coverage, and reduces the forwarding probability when the number of nodes is large.


2017 ◽  
Vol 9 (4) ◽  
pp. 369
Author(s):  
Muntaqo Alfin Amanaf ◽  
Achmad Rizal Danisya ◽  
Robi Rodian

Abstract�¢??The Pathloss model is an important component for wireless communication network planning. This Pathloss model can predict how bad the Pathloss that occurs in the wireless communication network planning area. but predicting the pathloss need the selection of some pathloss model according the characteristic of the certain area so that when the implementation of wireless networks, the network can provide optimal wireless communication services as the planning result. In this study we compare Pathloss model COST-231 Hata and Pathloss Model Walfisch Ikegami with Pathloss Measurements in Banyumas Area to select which Pathloss model that corresponds to the characteristics of banyumas region in each Urban, Suburban and Rural Cluster. Pathloss measurement is obtained by measuring the received power of mobile phones with the Drivetest method at a frequency of 1800 Hz. In this study, we analyzed the pathloss graph and MSE (Mean Square Error) from Pathloss Measurement of each Pathloss model in each Cluster. The results of this study, Pathloss COST-231 Urban and Rural Pathloss model had compatibility with Pathloss measurement by MSE value are 18.16 dB and 10.33 dB, while in the Suburban Cluster had compatibility with Pathloss Walfisch Ikegami with MSE value 5.58 dB.


Sign in / Sign up

Export Citation Format

Share Document