2011
A. Sarigiannidis; P. Nicopolitidis; G. Papadimitriou; P. Sarigiannidis; M. Louta
2011.
Abstract | BibTeX | Tags: IEEE 802.16, Learning automata, mapping, OFDMA, WiMAX | Links:
@conference{Sarigiannidis2011353,
title = {Using learning automata for adaptively adjusting the downlink-to-uplink ratio in IEEE 802.16e wireless networks},
author = { A. Sarigiannidis and P. Nicopolitidis and G. Papadimitriou and P. Sarigiannidis and M. Louta},
url = {https://www.researchgate.net/publication/221504931_Using_learning_automata_for_adaptively_adjusting_the_downlink-to-uplink_ratio_in_IEEE_80216e_wireless_networks},
doi = {10.1109/ISCC.2011.5983863},
year = {2011},
date = {2011-01-01},
journal = {Proceedings - IEEE Symposium on Computers and Communications},
pages = {353-358},
abstract = {IEEE 802.16e allows for flexibly defining the relation of the downlink and uplink sub-frames' width from 3:1 to 1:1, respectively. However, the determination of the most suitable ratio is left open to the network designers and the research community. Existing scheduling and mapping schemes are inflexibly designed. In this paper, a novel adaptive mapping scheme is proposed aiming to dynamically adjust the downlink-to-uplink ratio, following adequately the modification of the load requests with respect to both downlink and uplink directions. A learning automaton is exploited in order to sense the performance of the downlink and uplink mapping processes and to determine the most appropriate length ratio of both sub-frames in order to maximize the network performance. The suggested ratio determination scheme is evaluated through realistic scenarios and it is compared with static schemes that maintain a fixed ratio. The results show that our proposed scheme introduces considerable improvement, increasing the network's service ratio and reducing the bandwidth waste. © 2011 IEEE.},
keywords = {IEEE 802.16, Learning automata, mapping, OFDMA, WiMAX},
pubstate = {published},
tppubtype = {conference}
}
IEEE 802.16e allows for flexibly defining the relation of the downlink and uplink sub-frames' width from 3:1 to 1:1, respectively. However, the determination of the most suitable ratio is left open to the network designers and the research community. Existing scheduling and mapping schemes are inflexibly designed. In this paper, a novel adaptive mapping scheme is proposed aiming to dynamically adjust the downlink-to-uplink ratio, following adequately the modification of the load requests with respect to both downlink and uplink directions. A learning automaton is exploited in order to sense the performance of the downlink and uplink mapping processes and to determine the most appropriate length ratio of both sub-frames in order to maximize the network performance. The suggested ratio determination scheme is evaluated through realistic scenarios and it is compared with static schemes that maintain a fixed ratio. The results show that our proposed scheme introduces considerable improvement, increasing the network's service ratio and reducing the bandwidth waste. © 2011 IEEE.
M. Louta; P. Zournatzis; S. Kraounaws; P. Sarigiannidis; I. Demetropoulos
Towards realization of the ABC vision: A comparative survey of Access Network Selection Conference
2011.
Abstract | BibTeX | Tags: access network selection, always best connectivity, vertical handover | Links:
@conference{Louta2011472,
title = {Towards realization of the ABC vision: A comparative survey of Access Network Selection},
author = { M. Louta and P. Zournatzis and S. Kraounaws and P. Sarigiannidis and I. Demetropoulos},
url = {https://www.researchgate.net/publication/221505821_Towards_realization_of_the_ABC_vision_A_comparative_survey_of_Access_Network_Selection},
doi = {10.1109/ISCC.2011.5983882},
year = {2011},
date = {2011-01-01},
journal = {Proceedings - IEEE Symposium on Computers and Communications},
pages = {472-477},
abstract = {Access Network Selection (ANS) providing the most appropriate networking technology for accessing and using services in a heterogeneous wireless environment constitutes the heart of the overall handover management procedure. The aim of this paper is to survey representative vertical handover schemes proposed in related research literature with emphasis laid on the design of the ANS mechanism. Schemes' distinct features are analyzed and the authors discuss on their relative merits and weaknesses. © 2011 IEEE.},
keywords = {access network selection, always best connectivity, vertical handover},
pubstate = {published},
tppubtype = {conference}
}
Access Network Selection (ANS) providing the most appropriate networking technology for accessing and using services in a heterogeneous wireless environment constitutes the heart of the overall handover management procedure. The aim of this paper is to survey representative vertical handover schemes proposed in related research literature with emphasis laid on the design of the ANS mechanism. Schemes' distinct features are analyzed and the authors discuss on their relative merits and weaknesses. © 2011 IEEE.
T. Lagkas; D.G. Stratogiannis; G.I. Tsiropoulos; P. Sarigiannidis; M. Louta
2011.
Abstract | BibTeX | Tags: Buffer load, Cooperative wireless network, delay, MAC, QoS, Simulation | Links:
@conference{Lagkas2011185,
title = {Load dependent resource allocation in cooperative multiservice wireless networks: Throughput and delay analysis},
author = { T. Lagkas and D.G. Stratogiannis and G.I. Tsiropoulos and P. Sarigiannidis and M. Louta},
url = {https://www.researchgate.net/publication/221505003_Load_dependent_resource_allocation_in_cooperative_multiservice_wireless_networks_Throughput_and_delay_analysis},
doi = {10.1109/ISCC.2011.5983838},
year = {2011},
date = {2011-01-01},
journal = {Proceedings - IEEE Symposium on Computers and Communications},
pages = {185-190},
abstract = {Cooperative wireless networks supporting multiple services necessitate the application of a robust bandwidth allocation policy to ensure Quality of Service (QoS) provision to different applications. In this work, a load dependent bandwidth allocation technique is presented considering traffic priority and buffer load in the relay nodes of a cooperative communication network. An analytical approach for bandwidth sharing is provided along with a delay analysis, verifying that the proposed scheme can efficiently provide traffic differentiation, satisfying, also, the QoS requirements in terms of bandwidth, packet transmission rate and delay. The results obtained by the analysis are validated via simulations, confirming the improved network performance in terms of throughput and delay. © 2011 IEEE.},
keywords = {Buffer load, Cooperative wireless network, delay, MAC, QoS, Simulation},
pubstate = {published},
tppubtype = {conference}
}
Cooperative wireless networks supporting multiple services necessitate the application of a robust bandwidth allocation policy to ensure Quality of Service (QoS) provision to different applications. In this work, a load dependent bandwidth allocation technique is presented considering traffic priority and buffer load in the relay nodes of a cooperative communication network. An analytical approach for bandwidth sharing is provided along with a delay analysis, verifying that the proposed scheme can efficiently provide traffic differentiation, satisfying, also, the QoS requirements in terms of bandwidth, packet transmission rate and delay. The results obtained by the analysis are validated via simulations, confirming the improved network performance in terms of throughput and delay. © 2011 IEEE.
K. Christidis; P. Nicopolitidis; G.I. Papadimitriou; P.G. Sarigiannidis; A.S. Pomportsis
Utilizing locality of demand for lower response times in underwater data broadcasting Conference
2011.
Abstract | BibTeX | Tags: | Links:
@conference{Christidis2011,
title = {Utilizing locality of demand for lower response times in underwater data broadcasting},
author = { K. Christidis and P. Nicopolitidis and G.I. Papadimitriou and P.G. Sarigiannidis and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/221641077_Utilizing_Locality_of_Demand_for_Lower_Response_Times_in_Underwater_Data_Broadcasting},
doi = {10.1109/VETECS.2011.5956160},
year = {2011},
date = {2011-01-01},
journal = {IEEE Vehicular Technology Conference},
abstract = {Despite being a fundamental networking primitive, data broadcasting has so far received little attention in underwater networks. This paper proposes an adaptive push system for data broadcasting in underwater acoustic wireless networks with locality of client demands. It achieves adaptation of its broadcast schedule according to the a-priori unknown needs of the clients, it efficiently combats the problem of high latency of the underwater acoustic wireless environment and it exploits the bandwidth-distance relationship of this environment in order to improve performance in topologies with locality of client demands. Simulation results show superior performance of the proposed approach compared to existing systems. © 2011 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Despite being a fundamental networking primitive, data broadcasting has so far received little attention in underwater networks. This paper proposes an adaptive push system for data broadcasting in underwater acoustic wireless networks with locality of client demands. It achieves adaptation of its broadcast schedule according to the a-priori unknown needs of the clients, it efficiently combats the problem of high latency of the underwater acoustic wireless environment and it exploits the bandwidth-distance relationship of this environment in order to improve performance in topologies with locality of client demands. Simulation results show superior performance of the proposed approach compared to existing systems. © 2011 IEEE.
V.L. Kakali; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A novel adaptive framework for wireless push systems based on distributed learning automata Journal Article
In: Wireless Personal Communications, vol. 57, no. 4, pp. 591-606, 2011.
Abstract | BibTeX | Tags: Distributed learning automata, Fairness, Locality of demand, Wireless push systems | Links:
@article{Kakali2011591,
title = {A novel adaptive framework for wireless push systems based on distributed learning automata},
author = { V.L. Kakali and P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/233846012_A_Novel_Adaptive_Framework_for_Wireless_Push_Systems_Based_on_Distributed_Learning_Automata?_sg=Ym015TvpDlDVKlU13wezchacetj4IV-v5ySnGHJ45BUx860oyjTpYKK8o2HHFXt_QuecNyPhZlw5IEE},
doi = {10.1007/s11277-009-9863-4},
year = {2011},
date = {2011-01-01},
journal = {Wireless Personal Communications},
volume = {57},
number = {4},
pages = {591-606},
abstract = {A novel adaptive scheme for wireless push systems is presented in this paper. In this wireless environment two entities play the most important role: the server side and the client side that is connected to the system. The server side is responsible to broadcast an item per transmission in order to satisfy the clients' requests. The performance of the server side depends on item selections. Hence, the server broadcasts an item and the clients are satisfied if the transmitted item was the desired one. In this work, a set of learning automata try to estimate the client demands in a distributed manner. More specifically, an autonomous learning automaton is utilized on each client group, since the clients are gathered into groups based on their location. The output of each automaton is combined in order to produce a well-performed transmission schedule. Concurrently, a round robin phase is adopted, giving the opportunity to the non-popular items to be transmitted. In this manner, the various client demands are treated fairly. The introduced technique is compared with a centralized adaptive scheme and the results indicate that the proposed scheduling framework outperforms the centralized one, in terms of response time and fairness. © 2009 Springer Science+Business Media, LLC.},
keywords = {Distributed learning automata, Fairness, Locality of demand, Wireless push systems},
pubstate = {published},
tppubtype = {article}
}
A novel adaptive scheme for wireless push systems is presented in this paper. In this wireless environment two entities play the most important role: the server side and the client side that is connected to the system. The server side is responsible to broadcast an item per transmission in order to satisfy the clients' requests. The performance of the server side depends on item selections. Hence, the server broadcasts an item and the clients are satisfied if the transmitted item was the desired one. In this work, a set of learning automata try to estimate the client demands in a distributed manner. More specifically, an autonomous learning automaton is utilized on each client group, since the clients are gathered into groups based on their location. The output of each automaton is combined in order to produce a well-performed transmission schedule. Concurrently, a round robin phase is adopted, giving the opportunity to the non-popular items to be transmitted. In this manner, the various client demands are treated fairly. The introduced technique is compared with a centralized adaptive scheme and the results indicate that the proposed scheduling framework outperforms the centralized one, in terms of response time and fairness. © 2009 Springer Science+Business Media, LLC.
V.L. Kakali; P.G. Sarigiannidis; G.I. Papadimitriou; A.S. Pomportsis
A novel HMM-based learning framework for improving dynamic wireless push system performance Journal Article
In: Computers and Mathematics with Applications, vol. 62, no. 1, pp. 474-485, 2011.
Abstract | BibTeX | Tags: Hidden Markov models, machine learning, Scheduling, wireless networks | Links:
@article{Kakali2011474,
title = {A novel HMM-based learning framework for improving dynamic wireless push system performance},
author = { V.L. Kakali and P.G. Sarigiannidis and G.I. Papadimitriou and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/220511276_A_novel_HMM-based_learning_framework_for_improving_dynamic_wireless_push_system_performance},
doi = {10.1016/j.camwa.2011.05.028},
year = {2011},
date = {2011-01-01},
journal = {Computers and Mathematics with Applications},
volume = {62},
number = {1},
pages = {474-485},
abstract = {A new machine learning framework is introduced in this paper, based on the hidden Markov model (HMM), designed to provide scheduling in dynamic wireless push systems. In realistic wireless systems, the clients' intentions change dynamically, hence a cognitive scheduling scheme is needed to estimate the desirability of the connected clients. The proposed scheduling scheme is enhanced with self-organized HMMs, supporting the network with an estimated expectation of the clients' intentions, since the system's environment characteristics alter dynamically and the base station (server side) has no a priori knowledge of such changes. Compared to the original pure scheme, the proposed machine learning framework succeeds in predicting the clients' information desires and overcomes the limitation of the original static scheme, in terms of mean delay and system efficiency. © 2011 Elsevier Ltd. All rights reserved.},
keywords = {Hidden Markov models, machine learning, Scheduling, wireless networks},
pubstate = {published},
tppubtype = {article}
}
A new machine learning framework is introduced in this paper, based on the hidden Markov model (HMM), designed to provide scheduling in dynamic wireless push systems. In realistic wireless systems, the clients' intentions change dynamically, hence a cognitive scheduling scheme is needed to estimate the desirability of the connected clients. The proposed scheduling scheme is enhanced with self-organized HMMs, supporting the network with an estimated expectation of the clients' intentions, since the system's environment characteristics alter dynamically and the base station (server side) has no a priori knowledge of such changes. Compared to the original pure scheme, the proposed machine learning framework succeeds in predicting the clients' information desires and overcomes the limitation of the original static scheme, in terms of mean delay and system efficiency. © 2011 Elsevier Ltd. All rights reserved.
P. Nicopolitidis; G.I. Papadimitriou; A.S. Pomportsis; P. Sarigiannidis; M.S. Obaidat
Adaptive Wireless Networks Using Learning Automata Journal Article
In: IEEE Wireless Communications, vol. 18, no. 2, pp. 75-81, 2011.
Abstract | BibTeX | Tags: | Links:
@article{Nicopolitidis201175,
title = {Adaptive Wireless Networks Using Learning Automata},
author = { P. Nicopolitidis and G.I. Papadimitriou and A.S. Pomportsis and P. Sarigiannidis and M.S. Obaidat},
url = {https://www.researchgate.net/publication/224230435_Adaptive_wireless_networks_using_learning_automata},
doi = {10.1109/MWC.2011.5751299},
year = {2011},
date = {2011-01-01},
journal = {IEEE Wireless Communications},
volume = {18},
number = {2},
pages = {75-81},
abstract = {Wireless networks operate in environments with unknown and time-varying characteristics. The changing nature of many of these characteristics will significantly affect network performance. This fact has a profound impact on the design of efficient protocols for wireless networks and as a result adaptivity arises as one of the most important properties of these protocols. Learning automata are artificial intelligence tools that have been used in many areas where adaptivity to the characteristics of the wireless environment can result in a significant increase in network performance. This article reviews state of the art approaches in using learning automata to provide adaptivity to wireless networking. © 2011 IEEE.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Wireless networks operate in environments with unknown and time-varying characteristics. The changing nature of many of these characteristics will significantly affect network performance. This fact has a profound impact on the design of efficient protocols for wireless networks and as a result adaptivity arises as one of the most important properties of these protocols. Learning automata are artificial intelligence tools that have been used in many areas where adaptivity to the characteristics of the wireless environment can result in a significant increase in network performance. This article reviews state of the art approaches in using learning automata to provide adaptivity to wireless networking. © 2011 IEEE.
P. Nicopolitidis; K. Christidis; G.I. Papadimitriou; P.G. Sarigiannidis; A.S. Pomportsis
Performance evaluation of acoustic underwater data broadcasting exploiting the bandwidth-distance relationship Journal Article
In: Mobile Information Systems, vol. 7, no. 4, pp. 285-298, 2011.
Abstract | BibTeX | Tags: acoustic communications, data broadcasting, Locality of demand, Underwater networks | Links:
@article{Nicopolitidis2011285,
title = {Performance evaluation of acoustic underwater data broadcasting exploiting the bandwidth-distance relationship},
author = { P. Nicopolitidis and K. Christidis and G.I. Papadimitriou and P.G. Sarigiannidis and A.S. Pomportsis},
url = {https://www.researchgate.net/publication/220056798_Performance_Evaluation_of_Acoustic_Underwater_Data_Broadcasting_Exploiting_the_Bandwidth-Distance_Relationship},
doi = {10.3233/MIS-2011-0123},
year = {2011},
date = {2011-01-01},
journal = {Mobile Information Systems},
volume = {7},
number = {4},
pages = {285-298},
abstract = {Despite being a fundamental networking primitive, data broadcasting has so far received little attention in the context of underwater networks. This paper proposes an adaptive push system for data broadcasting in underwater acoustic wireless networks with locality of client demands. The proposed system exploits the characteristic relationship between the bandwidth of an underwater acoustic link and the transmitter-receiver distance in order to improve performance in environments with locality of client demands. Simulation results show superior performance of the proposed approach in the underwater environment compared to existing systems. © 2011 - IOS Press and the authors. All rights reserved.},
keywords = {acoustic communications, data broadcasting, Locality of demand, Underwater networks},
pubstate = {published},
tppubtype = {article}
}
Despite being a fundamental networking primitive, data broadcasting has so far received little attention in the context of underwater networks. This paper proposes an adaptive push system for data broadcasting in underwater acoustic wireless networks with locality of client demands. The proposed system exploits the characteristic relationship between the bandwidth of an underwater acoustic link and the transmitter-receiver distance in order to improve performance in environments with locality of client demands. Simulation results show superior performance of the proposed approach in the underwater environment compared to existing systems. © 2011 - IOS Press and the authors. All rights reserved.
2010
P.G. Sarigiannidis; M.D. Louta; P. Chatzimisios
A novel fair mapping scheme for IEEE 802.16 downlink sub-frame Conference
2010.
Abstract | BibTeX | Tags: Fairness, IEEE 802.16, mapping, OFDMA, Simulation | Links:
@conference{Sarigiannidis2010763,
title = {A novel fair mapping scheme for IEEE 802.16 downlink sub-frame},
author = { P.G. Sarigiannidis and M.D. Louta and P. Chatzimisios},
url = {https://www.researchgate.net/publication/221003449_A_novel_fair_mapping_scheme_for_IEEE_80216_downlink_sub-frame},
doi = {10.1109/ICUMT.2010.5676550},
year = {2010},
date = {2010-01-01},
journal = {2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2010},
pages = {763-768},
abstract = {A novel fair mapping scheme is proposed in this paper for the IEEE 802.16 downlink sub-frame. The mapping process is critical since it allocates the users' requests into the downlink sub-frame in order to be sent to the mobile stations. One of the most noticeable issues in this area lies on the fairness aspect. Giving that the mapping process defines the order and the way that the users' requests are being serviced, some users may be treated unfairly. In this work this issue is considered and a new mapping scheme is introduced. The proposed scheme encloses fair and more efficient mapping process, compared to the leading scheme, according to the presented simulation results. ©2010 IEEE.},
keywords = {Fairness, IEEE 802.16, mapping, OFDMA, Simulation},
pubstate = {published},
tppubtype = {conference}
}
A novel fair mapping scheme is proposed in this paper for the IEEE 802.16 downlink sub-frame. The mapping process is critical since it allocates the users' requests into the downlink sub-frame in order to be sent to the mobile stations. One of the most noticeable issues in this area lies on the fairness aspect. Giving that the mapping process defines the order and the way that the users' requests are being serviced, some users may be treated unfairly. In this work this issue is considered and a new mapping scheme is introduced. The proposed scheme encloses fair and more efficient mapping process, compared to the leading scheme, according to the presented simulation results. ©2010 IEEE.
P.G. Sarigiannidis; M. Louta; D.G. Stratogiannis; G.I. Tsiropoulos
Towards a QoS-aware IEEE 802.16 downlink sub-frame mapping scheme Conference
2010.
Abstract | BibTeX | Tags: Downlink mapping, IEEE 802.16, OFDMA, QoS, Simulation | Links:
@conference{Sarigiannidis20101243,
title = {Towards a QoS-aware IEEE 802.16 downlink sub-frame mapping scheme},
author = { P.G. Sarigiannidis and M. Louta and D.G. Stratogiannis and G.I. Tsiropoulos},
url = {https://www.researchgate.net/publication/233833066_Towards_a_QoS-Aware_IEEE_80216_downlink_sub-frame_mapping_scheme},
doi = {10.1109/GLOCOMW.2010.5700136},
year = {2010},
date = {2010-01-01},
journal = {2010 IEEE Globecom Workshops, GC'10},
pages = {1243-1247},
abstract = {IEEE 802.16 (WiMAX) is considered as one of the most promising wireless access technologies supporting high-capacity and long-distance communications as well as user mobility. A problem that should be addressed in the context of multi-access communications is the efficient accommodation of traffic requests to the downlink subframe. The allocation operation in downlink sub-frame is not standardized, while only restrictions on the usage of downlink sub-frame's bandwidth are defined. The most noticeable restriction is the rectangular restriction, requiring all downlink allocations to be mapped in a two-dimensions rectangular shaping. This study is a first step towards defining a QoS-aware mapping scheme, prioritizing traffic requests in accordance with the strict delay requirements they pose. The mapping scheme applies horizon scheduling, permitting bursts to be scheduled efficiently and in a simple way, following the horizons as pilots. The QoS-aware mapping scheme is evaluated by means of simulation experiments, which indicate that the proposed scheme operates effectively and efficiently, by reducing the number of unserviced users and traffic requests, and the portion of the dropped real-time traffic. ©2010 IEEE.},
keywords = {Downlink mapping, IEEE 802.16, OFDMA, QoS, Simulation},
pubstate = {published},
tppubtype = {conference}
}
IEEE 802.16 (WiMAX) is considered as one of the most promising wireless access technologies supporting high-capacity and long-distance communications as well as user mobility. A problem that should be addressed in the context of multi-access communications is the efficient accommodation of traffic requests to the downlink subframe. The allocation operation in downlink sub-frame is not standardized, while only restrictions on the usage of downlink sub-frame's bandwidth are defined. The most noticeable restriction is the rectangular restriction, requiring all downlink allocations to be mapped in a two-dimensions rectangular shaping. This study is a first step towards defining a QoS-aware mapping scheme, prioritizing traffic requests in accordance with the strict delay requirements they pose. The mapping scheme applies horizon scheduling, permitting bursts to be scheduled efficiently and in a simple way, following the horizons as pilots. The QoS-aware mapping scheme is evaluated by means of simulation experiments, which indicate that the proposed scheme operates effectively and efficiently, by reducing the number of unserviced users and traffic requests, and the portion of the dropped real-time traffic. ©2010 IEEE.
Address
Internet of Things and Applications Lab
Department of Electrical and Computer Engineering
University of Western Macedonia Campus
ZEP Area, Kozani 50100
Greece
Contact Information
tel: +30 2461 056527
Email: ithaca@uowm.gr
