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

Int. J. Commun. Networks Distributed Syst.最新文献

筛选
英文 中文
Optimal picocell base station density for energy-efficient heterogeneous cellular network under received power constraint 接收功率约束下高能效异构蜂窝网络的最优皮蜂窝基站密度
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-05-01 DOI: 10.1504/IJCNDS.2020.10021764
Jie Yang, Ziyu Pan, Han Hu
{"title":"Optimal picocell base station density for energy-efficient heterogeneous cellular network under received power constraint","authors":"Jie Yang, Ziyu Pan, Han Hu","doi":"10.1504/IJCNDS.2020.10021764","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10021764","url":null,"abstract":"Heterogeneous cellular networks (HCNs) have emerged as the primary solution for overwhelming traffic demands. However, the dense deployment of small cell base stations (BSs) inevitably triggers a tremendous escalation of energy consumption. In this paper, we apply tools from stochastic geometry to investigate and optimise the energy efficiency (EE) for a two-tier HCN. The average successful transmission rate per unit area of a two-tier HCN is derived, and then the total power consumption of all the BSs in per unit area of a two-tier HCN is derived. Based on that, the EE expression of the whole HCN is formulated. We analysis the received signal power constraint for a typical user and convert the power constraint to density constraint. Finally, we use a one-dimensional optimisation algorithm to maximise the EE by optimising picocell BS density. Simulation results validate the accuracy of the theoretical analysis and demonstrate the proposed optimal picocell BS density can obviously improve EE.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122055295","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
New multi-secret sharing scheme based on superincreasing sequence for level-ordered access structure 基于超增长序列的等级有序访问结构多秘密共享新方案
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-04-24 DOI: 10.1504/IJCNDS.2020.10020864
A. Basit, Patibandla Chanakya, V. Venkaiah, S. A. Moiz
{"title":"New multi-secret sharing scheme based on superincreasing sequence for level-ordered access structure","authors":"A. Basit, Patibandla Chanakya, V. Venkaiah, S. A. Moiz","doi":"10.1504/IJCNDS.2020.10020864","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10020864","url":null,"abstract":"A new multi-secret sharing scheme (MSSS) that uses a superincreasing sequence and realizes level-ordered access structure (LOAS) is proposed. The novelty of the scheme is that not only a single share for all the secrets is sufficient but also the secrets can be changed without renewing the shares of the participants. The proposed scheme has low communication cost and less overhead for the participant.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125893434","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}
引用次数: 1
Energy-efficient and spectral-efficient mixed line rate optical WDM networks: a comparison 高能效和频谱效率混合线速率光WDM网络:比较
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-04-24 DOI: 10.1504/IJCNDS.2020.10019472
R. Bajpai, S. Iyer, Shree Prakash Singh, S. Sengar
{"title":"Energy-efficient and spectral-efficient mixed line rate optical WDM networks: a comparison","authors":"R. Bajpai, S. Iyer, Shree Prakash Singh, S. Sengar","doi":"10.1504/IJCNDS.2020.10019472","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10019472","url":null,"abstract":"The tremendous increase in volume and heterogeneity of traffic has resulted in significant innovations in telecommunication networks. In view of optical networks, by adopting a mixed line rate (MLR) strategy, wavelength division multiplexed networks can cost-effectively respond to diverse variety of traffic requirements which have heterogeneous service demands. From existing studies on MLR networks, it can be inferred that depending upon channel configuration, modulation format and link length, a spectral-efficient network can outperform a power-efficient network. In the current work, we compare the performance of a MLR network which is spectral-efficient and power-efficient. We conduct extensive simulations considering realistic parameters and physical layer impairments. To the network designers, our study advocates a MLR network which is spectrally efficient since; our results demonstrate that, in addition to achieving close packing of the channels, a spectrally-efficient MLR network is also able to achieve close performances to that shown by power-efficient MLR network.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129873257","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}
引用次数: 1
SAHAR: a control plane architecture for high available software-defined networks SAHAR:用于高可用性软件定义网络的控制平面架构
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-04-24 DOI: 10.1504/IJCNDS.2020.10022188
Mehran Shetabi, A. Akbari
{"title":"SAHAR: a control plane architecture for high available software-defined networks","authors":"Mehran Shetabi, A. Akbari","doi":"10.1504/IJCNDS.2020.10022188","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10022188","url":null,"abstract":"Software-defined networking (SDN) is an architectural paradigm which enables a centralised control by decoupling the data and control planes of a network. In reactive mode of SDN, the significant variation in flow arrival events places considerable stress on the control plane. Also, the existence of frequent events such as network-wide statistics collection which significantly interfere with the basic functions of control plane can drastically affect performance of control plane. Therefore, this paper introduces a new architectural model named SAHAR that uses a controller box consisting of a coordinator controller and a primary flow-setup controller and one or more secondary flow-setup controllers as needed. Assigning monitor and management tasks to the coordinator controller reduces the load on the flowsetup controllers. Also, dividing input traffic between flow-setup controllers by the coordinator controller distributes the load in the control plane. In this way, SAHAR achieves a high available SDN which can be scalable.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130249946","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
Research and application of intersection traffic signal control algorithm based on vehicle location 基于车辆定位的交叉口交通信号控制算法研究与应用
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-02-28 DOI: 10.1504/ijcnds.2020.106355
Zhichao Wang, Min Li, L. Tang, Jun Steed Huang
{"title":"Research and application of intersection traffic signal control algorithm based on vehicle location","authors":"Zhichao Wang, Min Li, L. Tang, Jun Steed Huang","doi":"10.1504/ijcnds.2020.106355","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.106355","url":null,"abstract":"This paper focuses on the optimising algorithms of signal timing of urban intersection combined with vehicle location using the platform of the new type of wireless electronic license plate system. With the traffic flow information obtained from the platform, a dynamic optimisation model with optimal control parameters of green light time of all four phases for single intersection is constructed. Then genetic algorithm is applied to obtain the satisfying signal timing scheme. In simulation examples, the proposed dynamic distribution method and the traditional time control method are compared. The results show that compared with the traditional time control method, in traffic rush hour, the genetic optimisation algorithm can reduce the waiting time by 23% with the same road vehicle capacity. At non-peak time, the proposed method can reduce the waiting time by 10%. Therefore, the introduced method can effectively reduce the total queue delay, and improve the traffic capacity of the intersection.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133329866","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}
引用次数: 1
Distributed chronicle for the fault diagnosis in distributed systems 用于分布式系统故障诊断的分布式编年史
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-02-28 DOI: 10.1504/IJCNDS.2020.10018751
J. Aguilar, Juan Vizcarrondo
{"title":"Distributed chronicle for the fault diagnosis in distributed systems","authors":"J. Aguilar, Juan Vizcarrondo","doi":"10.1504/IJCNDS.2020.10018751","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10018751","url":null,"abstract":"The chronicle paradigm has been used to determine the faults in distributed systems, through the modelled of temporal relationships between observable events, which describe the patterns of the system behaviour. Normally, the diagnostic mechanisms based on chronicles are semi-centralised methods, based on the information from local diagnoses. These models have scalability problems when they are implemented in very large systems. This paper represents the system to be diagnosed as a distributed system composed of several components, and the behaviour of each component is described by its own subchronicles. A chronicle recognition module is assigned to each component, and each local diagnosis result (the recognition of a sub-chronicle) is sent (as an event) to the neighbouring components, so as it can be exploited during the recognition of other sub-chronicles. Additionally, this paper uses continuous query language (CQL), instead of the classic language to define chronicles, to give them more expressiveness.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127939312","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}
引用次数: 1
Introducing robustness in DBR routing protocol 引入DBR路由协议的鲁棒性
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-02-28 DOI: 10.1504/ijcnds.2020.10027256
Tariq Mahmood, F. Akhtar, K. Rehman, Muhammad Azeem, Azhar Imran Mudassir, Sher Muhammad Daudpota
{"title":"Introducing robustness in DBR routing protocol","authors":"Tariq Mahmood, F. Akhtar, K. Rehman, Muhammad Azeem, Azhar Imran Mudassir, Sher Muhammad Daudpota","doi":"10.1504/ijcnds.2020.10027256","DOIUrl":"https://doi.org/10.1504/ijcnds.2020.10027256","url":null,"abstract":"Exploration of advanced technologies employed for streamlining UWSN devices is a hot issue. Challenges faced by UWSN are high power consumption, increased propagation latency and dynamic topology of nodes. Depth-based routing protocols are designed to cope these challenges that use depth information to forward data toward surface sink. Depth-based routing and energy efficient depth-based routing are widely used routing protocols in UWSN. DBR has low stability period due to un-necessary data forwarding and high load on mid and low-depth nodes. In DBR quick energy consumption of nodes creates large holes in the network. The path connectivity hole leads retransmission of packets that consumes excessive energy, route-update cost and end-to-end delay. In this paper, the proposed robust depth-based routing protocol is used to overcome deficiencies of DBR by limiting number of forwarding nodes considering variation in depth-threshold, holding-time and distance-differences to minimise end-to-end delay.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131663128","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}
引用次数: 4
A study of situation awareness-based resource management scheme in cloud environment 云环境下基于态势感知的资源管理方案研究
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-01-21 DOI: 10.1504/IJCNDS.2020.10021258
Junshe Wang, Zhengbo Li, Hongbin Zhang, Yuzi Yi
{"title":"A study of situation awareness-based resource management scheme in cloud environment","authors":"Junshe Wang, Zhengbo Li, Hongbin Zhang, Yuzi Yi","doi":"10.1504/IJCNDS.2020.10021258","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10021258","url":null,"abstract":"In view of the defects of the current cloud resource management, which results in low utilisation of resources. This paper proposes a new method for the cloud environment, which is based on situation awareness. Meanwhile it is particularly important to collect historical load data of resources in the process of situation awareness. In order to improve the quality of data acquisition and reduce the burden of the data collection system, a new adaptive data acquisition algorithm is also designed. The proposed scheme comprehensively evaluates the current situation of the use of resources using FAHP (fuzzy analytic hierarchy process). Meanwhile, the cycle of data acquisition is adjusted in real-time, according to the result of resource evaluation. Then, in order to improve the utilisation of resources and achieve its efficient use, the improved BP algorithm is used to forecast the resource requirement of the next time which can provide the basis for rational allocation.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130200149","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
An online routing algorithm for space division multiplexing-based elastic optical networks 一种基于空分复用的弹性光网络在线路由算法
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-01-21 DOI: 10.1504/IJCNDS.2020.10016957
S. Iyer
{"title":"An online routing algorithm for space division multiplexing-based elastic optical networks","authors":"S. Iyer","doi":"10.1504/IJCNDS.2020.10016957","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10016957","url":null,"abstract":"We focus on the optimisation of lightpath routing in an online space division multiplexing-based elastic optical network (SDM-b-EON). We propose a new online routing algorithm, named as online routing algorithm (ORA), which accounts for the presence of the transceivers in the network, and also ensures the routing of the transparent lightpaths through the spectral super-channels over spatial multiple core fibres (MCFs) links. We conduct extensive simulations considering two realistic network topologies and two different MCF crosstalk values which result in different transmission reach values. The obtained results demonstrate that: 1) ORA significantly outperforms the various reference routing techniques in terms of the bandwidth blocking probability (BwBP); 2) in regard to the use of modulation formats, for low crosstalk values, the most used format is QPSK rather than BPSK which results in lesser traffic being accepted by the SDM-b-EON; 3) as the transceivers amount increases, more frequent demands blocking occurs owing to spectrum scarcity. Overall, our study shows that in a SDM-b-EON, larger amount of transceivers can be efficiently used in comparison to the less efficient spectrum usage, since the spectrum significantly experiences fragmentation owing to the spectrum-contiguity and spectrum-continuity constraints.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128912138","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}
引用次数: 1
Performance analysis of non-exhaustive wireless sensor networks based on queueing theory 基于排队理论的非穷举无线传感器网络性能分析
Int. J. Commun. Networks Distributed Syst. Pub Date : 2020-01-21 DOI: 10.1504/IJCNDS.2020.10017314
Jian Cao, Zhanyou Ma, Shanshan Guo, Xiangran Yu
{"title":"Performance analysis of non-exhaustive wireless sensor networks based on queueing theory","authors":"Jian Cao, Zhanyou Ma, Shanshan Guo, Xiangran Yu","doi":"10.1504/IJCNDS.2020.10017314","DOIUrl":"https://doi.org/10.1504/IJCNDS.2020.10017314","url":null,"abstract":"An operation mechanism of wireless sensor networks with non-exhaustive service, multiple adaptive sleep and wake-up strategies is presented on the basis of the queueing theory. The operation mechanism is proposed to dominate the workload of the necessary topology maintenance and reduce the energy consumption. The wireless sensor networks are modelled as a complex discrete-time queueing system. We derive the probability generating functions of the number of the data packets, the access delay, and we obtain the expressions of the mean number of the data packets, the mean response time, the utilisation rate and the throughput, etc. The sensitivity analyses of the performance measures are presented by the numerical experiments. Furthermore, the mathematical analyses are made on the energy consumption. Nash equilibrium and the social optimisation strategies are analysed in detail on the utility by using game theory.","PeriodicalId":209177,"journal":{"name":"Int. J. Commun. Networks Distributed Syst.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115665870","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学术官方微信