发布求助
文献互助 智能选刊 最新文献

Int. J. Wirel. Networks Broadband Technol.最新文献

筛选
英文 中文
Cooperation Among Members of Online Communities: Profitable Mechanisms to Better Distribute Near-Real-Time Services 在线社区成员之间的合作:更好地分配近实时服务的盈利机制
Int. J. Wirel. Networks Broadband Technol. Pub Date : 2011-07-01 DOI: 10.4018/ijwnbt.2011070101
M. L. Merani, Marco Capetta, D. Saladino
{"title":"Cooperation Among Members of Online Communities: Profitable Mechanisms to Better Distribute Near-Real-Time Services","authors":"M. L. Merani, Marco Capetta, D. Saladino","doi":"10.4018/ijwnbt.2011070101","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011070101","url":null,"abstract":"Today some of the most popular and successful applications over the Internet are based on Peer-to-Peer P2P solutions. Online Social Networks OSN represent a stunning phenomenon too, involving communities of unprecedented size, whose members organize their relationships on the basis of social or professional friendship. This work deals with a P2P video streaming platform and focuses on the performance improvements that can be granted to those P2P nodes that are also members of a social network. The underpinning idea is that OSN friends and friends of friends might be more willing to help their mates than complete strangers in fetching the desired content within the P2P overlay. Hence, an approach is devised to guarantee that P2P users belonging to an OSN are guaranteed a better service when critical conditions build up, i.e., when bandwidth availability is scarce. Different help strategies are proposed, and their improvements are numerically assessed, showing that the help of direct friends, two-hops away friends and, in the limit, of the entire OSN community brings in considerable advantages. The obtained results demonstrate that the amount of delivered video increases and the delay notably decreases, for those privileged peers that leverage their OSN membership within the P2P overlay.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"18 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113967574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 35
Mobile WiMAX Bandwidth Reservation Thresholds: A Heuristic Approach 移动WiMAX带宽保留阈值:一种启发式方法
Int. J. Wirel. Networks Broadband Technol. Pub Date : 2011-04-01 DOI: 10.4018/ijwnbt.2011040105
Sondes Khemiri, K. Boussetta, N. Achir, G. Pujolle
{"title":"Mobile WiMAX Bandwidth Reservation Thresholds: A Heuristic Approach","authors":"Sondes Khemiri, K. Boussetta, N. Achir, G. Pujolle","doi":"10.4018/ijwnbt.2011040105","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011040105","url":null,"abstract":"This paper addresses the issue of wireless bandwidth partitioning of a Mobile WiMAX cell. The authors consider a Complete Partitioning strategy, where the wireless bandwidth capacity of a cell is divided into trunks. Each partition is strictly reserved to a particular type of connection. Four IEEE 802.16e 2005 service classes are distinguished: UGS, rtPS, nrtPS, and ErtPS. The authors consider mobility and differentiate new call request from handoffs. In addition, the authors take into consideration the Adaptive Modulation and Coding AMC scheme, through the partition of the cell into different areas associated to a particular modulation and coding scheme. The purpose of the paper is to determine, using an analytical model and a heuristic approach, the nearly optimal sizes of the partition sizes dedicated to each type of connection, which is characterized by its service class, type of request and modulation, and coding scheme.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124289747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
BER Fairness and PAPR Study of Interleaved OFDMA System 交错OFDMA系统的误码率公平性和PAPR研究
Int. J. Wirel. Networks Broadband Technol. Pub Date : 2011-04-01 DOI: 10.4018/ijwnbt.2011040101
Sabbir Ahmed, M. Kawai
{"title":"BER Fairness and PAPR Study of Interleaved OFDMA System","authors":"Sabbir Ahmed, M. Kawai","doi":"10.4018/ijwnbt.2011040101","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011040101","url":null,"abstract":"For an OFDMA system, the role of interleavers is analyzed to ensure fairness of BER performance among the active users and investigate their respective PAPR properties. In this paper, the authors consider a generic system and show that for a slowly changing multipath channel, individual user's BER performance can vary, implying that the propagation channel effect is unfairly distributed on the users. Applying different types of frequency interleaving mechanisms, the authors demonstrate that random interleaving can ensure BER fairness on an individual user basis but the associated system overhead for de-interleaving is very high. In this context, the authors introduce the application of cyclically shifted random interleaver and demonstrate its effectiveness in achieving BER fairness dispersion in individual users BER reduced by 94% compared to no interleaving at 20dB SNR with little system overhead. The authors also explore the comparative performance of different interleavers for scenarios with varying number of total subcarriers and subcarriers per user. Based on the scenario specific results, the authors conclude that for a heavily loaded system, i.e., relatively low number of subcarriers per user, cyclically shifted random interleavers can effectively ensure uniform performance among active users with reduced system complexity and manageable PAPR.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
IP Paging for Mobile Hosts in Distributed and Fixed Hierarchical Mobile IP 分布式和固定分层移动IP中移动主机的IP寻呼
Int. J. Wirel. Networks Broadband Technol. Pub Date : 2011-04-01 DOI: 10.4018/ijwnbt.2011040106
P. C. Upadhyay, S. Tiwari
{"title":"IP Paging for Mobile Hosts in Distributed and Fixed Hierarchical Mobile IP","authors":"P. C. Upadhyay, S. Tiwari","doi":"10.4018/ijwnbt.2011040106","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011040106","url":null,"abstract":"The concept of Paging has been found useful in existing cellular networks for mobile users with low call-to-mobility ratio CMR. It is necessary for fast mobility users to minimize the signaling burden on the network. Reduced signaling, also, conserves scarce wireless resources and provides power savings at user terminals. However, Mobile IP MIP, a base protocol for IP mobility, does not support paging concept in its original form. Several paging schemes and micro-mobility protocols, centralized and distributed, have been proposed in literature to alleviate the inherent limitations of Mobile IP. In this paper, the authors propose three paging schemes for Distributed and Fixed Hierarchical Mobile IP DFHMIP and develop analytical models for them. Performance evaluations of these schemes have been carried out and results have been compared with DFHMIP without paging and with Dynamic Hierarchical Mobile IP DHMIP for low CMR values.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133487897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
Synchronous Relaying in Vehicular Ad-hoc Networks 车载自组织网络中的同步中继
Int. J. Wirel. Networks Broadband Technol. Pub Date : 2011-04-01 DOI: 10.4018/ijwnbt.2011040104
D. Moltchanov, A. Vinel, Jakub Jakubiak, Y. Koucheryavy
{"title":"Synchronous Relaying in Vehicular Ad-hoc Networks","authors":"D. Moltchanov, A. Vinel, Jakub Jakubiak, Y. Koucheryavy","doi":"10.4018/ijwnbt.2011040104","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011040104","url":null,"abstract":"In this paper, the authors propose a simple concept for emergency information dissemination in vehicular ad-hoc networks. Instead of competing for the shared wireless medium when transmitting the emergency information, the authors' proposed method requires nodes to cooperate by synchronizing their transmissions. The proposed scheme is backward compatible with IEEE 802.11p carrier sense multiple access with collision avoidance. The authors also briefly address some of the implementation issues of the proposed scheme.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117252392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Lifetime Maximization in Wireless Sensor Networks 无线传感器网络的生命周期最大化
Int. J. Wirel. Networks Broadband Technol. Pub Date : 2011-04-01 DOI: 10.4018/ijwnbt.2011040102
V. Katiyar, N. Chand, S. Soni
{"title":"Lifetime Maximization in Wireless Sensor Networks","authors":"V. Katiyar, N. Chand, S. Soni","doi":"10.4018/ijwnbt.2011040102","DOIUrl":"https://doi.org/10.4018/ijwnbt.2011040102","url":null,"abstract":"One of the fundamental requirements in wireless sensor networks WSNs is to prolong the lifetime of sensor nodes by minimizing the energy consumption. The information about the energy status of sensor nodes can be used to notify the base station about energy depletion in any part of the network. An energy map of WSN can be constructed with available remaining energy at sensor nodes. The energy map can increase the lifetime of sensor networks by adaptive clustering, energy centric routing, data aggregation, and so forth. In this paper, the authors describe use of energy map techniques for WSNs and summarize the applications in routing, aggregation, clustering, data dissemination, and so forth. The authors also present an energy map construction algorithm that is based on prediction.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"46 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113944193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
A Novel QoS Aware Shortest Path Algorithm for VSDN 一种新的感知QoS的VSDN最短路径算法
Int. J. Wirel. Networks Broadband Technol. Pub Date : 1900-01-01 DOI: 10.4018/IJWNBT.2017010101
A. Sandhu, J. Malhotra
{"title":"A Novel QoS Aware Shortest Path Algorithm for VSDN","authors":"A. Sandhu, J. Malhotra","doi":"10.4018/IJWNBT.2017010101","DOIUrl":"https://doi.org/10.4018/IJWNBT.2017010101","url":null,"abstract":"Thisarticledescribeshowarapidincreaseinusageofinternethasemergedfromlastfewyears.This highusageofinternethasoccurredduetoincreaseinpopularityofmultimediaapplications.However, thereisnoguaranteeofQualityofServicetotheusers.Tofulfillthedesiredrequirements,Internet ServiceProviders(ISPs)establishaservicelevelagreement(SLA)withclientsincludingspecific parameterslikebandwidth,reliability,cost,powerconsumption,etc.ISPsmakemaximumSLAsand decreaseenergyconsumptiontoraisetheirprofit.Asaresult,usersdonotgetthedesiredservices forwhichtheypay.VirtualSoftwareDefinedNetworksareflexibleandmanageablenetworkswhich canbeusedtoachievethesegoals.Thisarticlepresentsshortestpathalgorithmwhichimprovesthe matriceslikeenergyconsumption,bandwidthusage,successfulallocationofnodesinthenetwork usingVSDNapproach.Theresultsshowa40%increaseintheperformanceofproposedalgorithms witharespecttoexistingalgorithms. KeyWoRDS Bandwidth Usage, Energy Consumption, Network Virtualization, Reliability, Saturated Links, Service Level Agreement(Sla), Software Defined Networking, Successful Allocation, Virtual Software Define Network","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123336644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Power-Aware and QoS Provisioned Real Time Multimedia Transmission in Small Cell Networks 小蜂窝网络中功率感知和QoS提供的实时多媒体传输
Int. J. Wirel. Networks Broadband Technol. Pub Date : 1900-01-01 DOI: 10.4018/ijwnbt.2016010102
C. Bouras, Anastasios N. Bikos, Dimitrios Bilios, A. Alexiou
{"title":"Power-Aware and QoS Provisioned Real Time Multimedia Transmission in Small Cell Networks","authors":"C. Bouras, Anastasios N. Bikos, Dimitrios Bilios, A. Alexiou","doi":"10.4018/ijwnbt.2016010102","DOIUrl":"https://doi.org/10.4018/ijwnbt.2016010102","url":null,"abstract":"The recent emergence of ultra-high-speed and high-definition data and video services has pushed wireless network capacity to its limits. Cellular network capacity is therefore a valuable resource, whereas indoor coverage poses itself as a challenging issue. At the same time, real-world paradigms of multimedia transmission require effective Quality-of-Service (QoS) provisioning as well as power admission. To confront issues like delay-sensitive QoS requirements and traffic provisioning, as well as meet the mobile customer needs, this paper presents a traffic-aware Orthogonal Frequency-Division Multiple-Access (OFDMA) hybrid small-cell deployment for QoS provisioning and an optimal admission control strategy for 4G cellular systems. The traffic awareness in the proposed framework is provided by a utility function, which differentiates the traffic QoS levels with the user's grouping priority indexes, channel conditions, and traffic characteristics. To further enhance the proposed framework, an admission power control algorithm based on an efficient algorithm handover is also proposed.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126374392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Demonstration of Practical DNS Attacks and their Mitigation Using DNSSEC 实际DNS攻击的演示及其使用DNSSEC的缓解
Int. J. Wirel. Networks Broadband Technol. Pub Date : 1900-01-01 DOI: 10.4018/ijwnbt.2020010104
Israr Khan, William Farrelly, K. Curran
{"title":"A Demonstration of Practical DNS Attacks and their Mitigation Using DNSSEC","authors":"Israr Khan, William Farrelly, K. Curran","doi":"10.4018/ijwnbt.2020010104","DOIUrl":"https://doi.org/10.4018/ijwnbt.2020010104","url":null,"abstract":"The authors implement common attacks on a DNS server and demonstrate that DNSSEC is an effectivesolutiontocounterDNSsecurityflaws.Thisresearchdemonstrateshowtocounterthezone transferattackviathegenerationofDNSSECkeysonthenameserverswhichpreventattackersfrom obtainingafullzonetransferasitsrequestforthetransferwithoutthekeyswasdeniedbytheprimary server.ThisarticlealsoprovidesadetailedscenarioofhowDNSSECcanbeusedasamechanism toprotectagainsttheattackifanattackertriedtoperformCachePoisoning.Theauthorsultimately showthataDNSSECserverwillnotacceptresponsesfromunauthorisedentitiesandwouldonly acceptresponseswhichareauthenticatedthroughouttheDNSSECchainoftrust. KEyWoRDS Cybersecurity, Security, DNS, Domain Name System, Internet, Routing, DNSSEC","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127947063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A Cross-Layer Predictive and Preemptive Routing Protocol for Underwater Wireless Sensor Networks Using the Lagrange Interpolation 基于拉格朗日插值的水下无线传感器网络跨层预测抢占路由协议
Int. J. Wirel. Networks Broadband Technol. Pub Date : 1900-01-01 DOI: 10.4018/IJWNBT.2021070105
Manel Baba Ahmed, M. A. Cherif, Sofiane Boukli-Hacene
{"title":"A Cross-Layer Predictive and Preemptive Routing Protocol for Underwater Wireless Sensor Networks Using the Lagrange Interpolation","authors":"Manel Baba Ahmed, M. A. Cherif, Sofiane Boukli-Hacene","doi":"10.4018/IJWNBT.2021070105","DOIUrl":"https://doi.org/10.4018/IJWNBT.2021070105","url":null,"abstract":"Underwater wireless sensor networks have become enabling technology for the seawater exploration. Since they raise numerous challenges and problems such as their limited battery and bandwidth, energy-constraint, 3D deployment, and temporary losses of connectivity or link failure, in this paper, a predictive and preemptive cross-layer protocol CLPP-VBF is proposed based on the vector-based forwarding protocol (VBF) for UWSNs, aimed to predict a future loss of connectivity or link failure problems using the Lagrange interpolation method, avoiding unnecessary transmission and rediscovering another new forwarder node in order to guarantee the data packets transmission reliability. The approach is a cooperation between the medium access layer (MAC) and network layer. The study has been implemented and evaluated using the well-known NS2 network simulator with an extension Aqua-sim; the simulation performance shows the merit of CLPP-VBF against VBF in term of delivered packets, average end-to-end delay, and energy consumption.","PeriodicalId":422249,"journal":{"name":"Int. J. Wirel. Networks Broadband Technol.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132800895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信