Scheduling periodic sensors for instantaneous aggregated traffic minimization

IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Wireless Networks Pub Date : 2024-04-17 DOI:10.1007/s11276-024-03722-4
Sunanda Bose, Akash Chowdhury, Nandini Mukherjee
{"title":"Scheduling periodic sensors for instantaneous aggregated traffic minimization","authors":"Sunanda Bose, Akash Chowdhury, Nandini Mukherjee","doi":"10.1007/s11276-024-03722-4","DOIUrl":null,"url":null,"abstract":"<p>In IoT paradigm, Sensor-Cloud Infrastructure provides sensor nodes that sense various environmental parameters, generates the data and sends the same to the desired destination, say a cloud server through a common gateway. Sensor nodes with different data streaming specifications, can generate huge amount of traffic, if streams data simultaneously towards the destination, according to a random schedule. This can lead to higher bandwidth requirements in the wireless medium and increase the amount of data to be received at the gateway in any time slot. This further increases the channel capacity required at the access link to transmit the received data from gateway to the server. An optimal schedule of the sensor nodes will lead to minimization of instantaneous aggregated traffic in both the wireless medium and the access link. Thus leading to minimization of required bandwidth at the wireless medium and channel capacity at the access link. This would further increase the resource utilization of minimize the service provisioning cost of the sensor-cloud infrastructure. A straight forward optimization of the problem of minimizing the instantaneous aggregated traffic load generated from n sensor nodes require an exponential time to find the optimal schedule. Thus, in this paper, an ILP formulation and a polynomial-time heuristic algorithm is presented.</p>","PeriodicalId":23750,"journal":{"name":"Wireless Networks","volume":"144 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11276-024-03722-4","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In IoT paradigm, Sensor-Cloud Infrastructure provides sensor nodes that sense various environmental parameters, generates the data and sends the same to the desired destination, say a cloud server through a common gateway. Sensor nodes with different data streaming specifications, can generate huge amount of traffic, if streams data simultaneously towards the destination, according to a random schedule. This can lead to higher bandwidth requirements in the wireless medium and increase the amount of data to be received at the gateway in any time slot. This further increases the channel capacity required at the access link to transmit the received data from gateway to the server. An optimal schedule of the sensor nodes will lead to minimization of instantaneous aggregated traffic in both the wireless medium and the access link. Thus leading to minimization of required bandwidth at the wireless medium and channel capacity at the access link. This would further increase the resource utilization of minimize the service provisioning cost of the sensor-cloud infrastructure. A straight forward optimization of the problem of minimizing the instantaneous aggregated traffic load generated from n sensor nodes require an exponential time to find the optimal schedule. Thus, in this paper, an ILP formulation and a polynomial-time heuristic algorithm is presented.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
调度周期性传感器,实现瞬时聚合流量最小化
在物联网范例中,传感器-云基础设施提供传感器节点,这些节点可感知各种环境参数,生成数据并通过普通网关将数据发送到所需的目的地,例如云服务器。具有不同数据流规格的传感器节点,如果按照随机时间表同时向目的地发送数据流,就会产生巨大的流量。这可能会导致无线介质的带宽要求更高,并增加网关在任何时隙内接收的数据量。这进一步增加了接入链路将接收到的数据从网关传输到服务器所需的信道容量。传感器节点的最佳调度将导致无线介质和接入链路中的瞬时聚合流量最小化。从而使无线介质所需的带宽和接入链路的信道容量最小化。这将进一步提高资源利用率,最大限度地降低传感器云基础设施的服务供应成本。要直接优化 n 个传感器节点产生的瞬时聚合流量负载最小化问题,需要指数级的时间才能找到最佳时间表。因此,本文提出了一个 ILP 公式和一种多项式时间启发式算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Wireless Networks
Wireless Networks 工程技术-电信学
CiteScore
7.70
自引率
3.30%
发文量
314
审稿时长
5.5 months
期刊介绍: The wireless communication revolution is bringing fundamental changes to data networking, telecommunication, and is making integrated networks a reality. By freeing the user from the cord, personal communications networks, wireless LAN''s, mobile radio networks and cellular systems, harbor the promise of fully distributed mobile computing and communications, any time, anywhere. Focusing on the networking and user aspects of the field, Wireless Networks provides a global forum for archival value contributions documenting these fast growing areas of interest. The journal publishes refereed articles dealing with research, experience and management issues of wireless networks. Its aim is to allow the reader to benefit from experience, problems and solutions described.
期刊最新文献
An EEG signal-based music treatment system for autistic children using edge computing devices A DV-Hop localization algorithm corrected based on multi-strategy sparrow algorithm in sea-surface wireless sensor networks Multi-Layer Collaborative Federated Learning architecture for 6G Open RAN Cloud-edge collaboration-based task offloading strategy in railway IoT for intelligent detection Exploiting data transmission for route discoveries in mobile ad hoc networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1