首页 > 最新文献

2017 9th International Conference on Communication Systems and Networks (COMSNETS)最新文献

英文 中文
Designing an energy efficient WBAN routing protocol 设计一种节能的无线局域网路由协议
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945390
M. Roy, C. Chowdhury, N. Aslam
Advancement of medical science brings together new trend of proactive health care which gives rise to the era of Wireless Body Area Networks (WBAN). A number of issues including energy efficiency, reliability, optimal use of network bandwidth need to be considered for designing any multi-hop communication protocol for WBANs. Energy consumption depends on many factors like amount and frequency of forwarding traffic, node activity, distance from sink etc. Energy consumption gives rise to other issues like heated nodes. Existing routing protocols are mostly single hop or multi-hop, and generally focus on one issue ignoring the others. In this paper, we first identify the sources of energy drain, and then propose a 2-hop cost based energy efficient routing protocol for WBAN that formulates the energy drain of a node due to various reasons and incorporates it in the routing decision. Relative node mobility due to posture change is also considered here. The protocol is simulated in Castalia simulator and compared with state of the art protocols. It is found to outperform state of the art protocols in terms of packet delivery ratio for a given transmission power level. Moreover, only a small number of relays are found to be sufficient to stabilize packet delivery ratio.
医学的进步带来了主动医疗的新趋势,催生了无线体域网络(WBAN)时代。在设计多跳通信协议时,需要考虑能效、可靠性、网络带宽的最佳利用等问题。能量消耗取决于许多因素,如转发流量的数量和频率、节点活动、到sink的距离等。能源消耗也会引起其他问题,比如加热节点。现有的路由协议大多是单跳或多跳的,通常只关注一个问题而忽略了其他问题。在本文中,我们首先识别能量损耗的来源,然后提出了一种基于2跳成本的WBAN节能路由协议,该协议制定了节点由于各种原因造成的能量损耗,并将其纳入路由决策。这里还考虑了由于姿态变化引起的相对节点移动。在Castalia模拟器上对该协议进行了仿真,并与现有协议进行了比较。研究发现,在给定的传输功率水平下,它在分组传输率方面优于现有的技术协议。此外,发现只有少量的中继就足以稳定数据包的发送率。
{"title":"Designing an energy efficient WBAN routing protocol","authors":"M. Roy, C. Chowdhury, N. Aslam","doi":"10.1109/COMSNETS.2017.7945390","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945390","url":null,"abstract":"Advancement of medical science brings together new trend of proactive health care which gives rise to the era of Wireless Body Area Networks (WBAN). A number of issues including energy efficiency, reliability, optimal use of network bandwidth need to be considered for designing any multi-hop communication protocol for WBANs. Energy consumption depends on many factors like amount and frequency of forwarding traffic, node activity, distance from sink etc. Energy consumption gives rise to other issues like heated nodes. Existing routing protocols are mostly single hop or multi-hop, and generally focus on one issue ignoring the others. In this paper, we first identify the sources of energy drain, and then propose a 2-hop cost based energy efficient routing protocol for WBAN that formulates the energy drain of a node due to various reasons and incorporates it in the routing decision. Relative node mobility due to posture change is also considered here. The protocol is simulated in Castalia simulator and compared with state of the art protocols. It is found to outperform state of the art protocols in terms of packet delivery ratio for a given transmission power level. Moreover, only a small number of relays are found to be sufficient to stabilize packet delivery ratio.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 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":"121720733","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}
引用次数: 37
Modeling creativity in social networks 为社交网络中的创造力建模
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945449
Akhil Shetty, Sharayu Moharir
Studies on creativity, largely recognized as a precursor to innovation, have rapidly multiplied in the recent past. In particular, the impact of social network parameters on creativity has received increased attention. As an individual's social network regulates access to diverse ideas and perspectives, it has been observed to play a pivotal role in influencing creativity. In this paper, we propose a model which encapsulates the relationship between creativity and several social network parameters. We show that our model is consistent with the results of empirical studies in this domain. We also suggest how organizations could use our model to modify their network structure so as to boost creativity.
对创造力的研究在很大程度上被认为是创新的先驱,在最近的过去迅速增加。特别是,社会网络参数对创造力的影响受到越来越多的关注。由于个人的社会网络调节着获取不同想法和观点的途径,因此人们观察到它在影响创造力方面发挥着关键作用。在本文中,我们提出了一个模型,其中封装了创造力和几个社会网络参数之间的关系。我们的模型与该领域的实证研究结果一致。我们还建议组织如何使用我们的模型来修改他们的网络结构,从而提高创造力。
{"title":"Modeling creativity in social networks","authors":"Akhil Shetty, Sharayu Moharir","doi":"10.1109/COMSNETS.2017.7945449","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945449","url":null,"abstract":"Studies on creativity, largely recognized as a precursor to innovation, have rapidly multiplied in the recent past. In particular, the impact of social network parameters on creativity has received increased attention. As an individual's social network regulates access to diverse ideas and perspectives, it has been observed to play a pivotal role in influencing creativity. In this paper, we propose a model which encapsulates the relationship between creativity and several social network parameters. We show that our model is consistent with the results of empirical studies in this domain. We also suggest how organizations could use our model to modify their network structure so as to boost creativity.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"10 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":"122700318","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
A novel approach for multi-dimensional variable sized virtual machine allocation and migration at cloud data center 云数据中心多维可变大小虚拟机分配与迁移的新方法
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945404
N. Sharma, G. R. M. Reddy
In this paper, we propose a branch-and-bound based exact algorithm for allocating multi-dimensional variable sized VMs at the cloud data center. Further, an energy efficient VMs migration technique is proposed to reduce the energy consumption and thus avoids the Service Level Agreement (SLA) violation at the cloud data center.
在本文中,我们提出了一种基于分支绑定的精确算法,用于在云数据中心分配多维可变大小的虚拟机。在此基础上,提出了一种节能的虚拟机迁移技术,以减少云数据中心的能耗,从而避免违反云数据中心的服务水平协议(SLA)。
{"title":"A novel approach for multi-dimensional variable sized virtual machine allocation and migration at cloud data center","authors":"N. Sharma, G. R. M. Reddy","doi":"10.1109/COMSNETS.2017.7945404","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945404","url":null,"abstract":"In this paper, we propose a branch-and-bound based exact algorithm for allocating multi-dimensional variable sized VMs at the cloud data center. Further, an energy efficient VMs migration technique is proposed to reduce the energy consumption and thus avoids the Service Level Agreement (SLA) violation at the cloud data center.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"668 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":"122965876","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
Efficient device-to-device association and data aggregation in industrial IoT systems 工业物联网系统中高效的设备间关联和数据聚合
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945392
Shilpa Rao, R. Shorey
Internet of things (IoT) encompass a plethora of connected smart devices and support diverse applications. IoT is likely to be an integral feature of next generation cellular systems. In the manufacturing and supply chain industry, the Industrial IoT (IIoT), which consists of sensors, actuators and machinery, is deployed for monitoring, data collection and analysis, asset management, maintenance planning, and plant control and optimization. In this work, we consider the uplink transmission of an IIoT system, in which the IoT devices transmit their data to the Base Station (BS) through User Equipments (UEs). The BS, in turn, transmits the data to the cloud for further processing. The UEs receive the data from the IoT devices, aggregate with their uplink data, and transmit the aggregated data to the BS. Our investigation shows that the IoT devices require less transmit energy when UEs are used as relays. We study the system when the IoT devices associate themselves with the UEs through the fixed, random, and greedy schemes, and evaluate the end-to-end outage probability at the devices for each of the three schemes. We show that the greedy association scheme has the minimum outage probability at the IoT device. We study the effect of the number of IoT devices, the number of UEs, the data arrival rates at the IoT devices, and the uplink data evolution process of UEs on the outage probability, and draw meaningful insights into IIoT system design.
物联网(IoT)包含大量连接的智能设备,并支持各种应用。物联网很可能成为下一代蜂窝系统的一个组成部分。在制造业和供应链行业,工业物联网(IIoT)由传感器、执行器和机械组成,用于监控、数据收集和分析、资产管理、维护计划以及工厂控制和优化。在这项工作中,我们考虑了IIoT系统的上行传输,其中IoT设备通过用户设备(ue)将其数据传输到基站(BS)。然后,BS将数据传输到云端进行进一步处理。终端接收来自物联网设备的数据,并将其与上行链路数据进行汇总,然后将汇总后的数据发送给BS。我们的调查表明,当ue被用作继电器时,物联网设备需要更少的传输能量。我们研究了物联网设备通过固定、随机和贪婪三种方案与终端关联时的系统,并评估了三种方案下设备端到端中断的概率。我们证明了贪婪关联方案在物联网设备上具有最小的中断概率。我们研究了物联网设备数量、终端数量、数据到达物联网设备的速率以及终端的上行数据演化过程对中断概率的影响,并为工业物联网系统设计提供有意义的见解。
{"title":"Efficient device-to-device association and data aggregation in industrial IoT systems","authors":"Shilpa Rao, R. Shorey","doi":"10.1109/COMSNETS.2017.7945392","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945392","url":null,"abstract":"Internet of things (IoT) encompass a plethora of connected smart devices and support diverse applications. IoT is likely to be an integral feature of next generation cellular systems. In the manufacturing and supply chain industry, the Industrial IoT (IIoT), which consists of sensors, actuators and machinery, is deployed for monitoring, data collection and analysis, asset management, maintenance planning, and plant control and optimization. In this work, we consider the uplink transmission of an IIoT system, in which the IoT devices transmit their data to the Base Station (BS) through User Equipments (UEs). The BS, in turn, transmits the data to the cloud for further processing. The UEs receive the data from the IoT devices, aggregate with their uplink data, and transmit the aggregated data to the BS. Our investigation shows that the IoT devices require less transmit energy when UEs are used as relays. We study the system when the IoT devices associate themselves with the UEs through the fixed, random, and greedy schemes, and evaluate the end-to-end outage probability at the devices for each of the three schemes. We show that the greedy association scheme has the minimum outage probability at the IoT device. We study the effect of the number of IoT devices, the number of UEs, the data arrival rates at the IoT devices, and the uplink data evolution process of UEs on the outage probability, and draw meaningful insights into IIoT system design.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"90-C 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":"123465704","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}
引用次数: 18
Cross layer approach for effective multi hop broadcast in VANET VANET中有效多跳广播的跨层方法
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945414
Dr. Mahadev A. Gawas, L. Gudino, K. Anupama
Cooperative communication in VANET has become the de-facto in enabling technology to improve safety and efficiency on inter-vehicle communication (IVC). The safety related messages broadcast on emergency must have a minimum delay and high reliability. This paper proposes a cross-layer approach to efficiently broadcast the safety messages by minimizing the message redundancy and maintaining low end-to-end communication delays. We propose a scheme to select a one-hop neighbor relay as a potential forwarder for relaying the broadcast messages to improve the transmission reliability in a platoon of vehicles. The relay selection metrics compose of vehicular density, velocity, and the geographical location. The selected relay controls the broadcast messages with minimum overhead and with minimum bandwidth consumption. Similarly, a multimedia emergency message needs high priority with a shorter transmission delay. To provide the service differentiation to different traffic classes, we adopt 802.11e MAC. The cross layer is further extended to the transport layer to dynamically adapt the data transmission rate based on the physical channel state. The extensive simulation analysis conducted reveals that the proposed cross-layer scheme effectively propagates the critical broadcast messages with lesser packet latency and higher packet delivery ratio.
协同通信技术已成为提高车际通信安全性和效率的重要技术。在紧急情况下广播安全相关信息必须具有最小的延迟和高的可靠性。本文提出了一种跨层的安全消息广播方法,通过最小化消息冗余和保持低端到端通信延迟来有效地广播安全消息。我们提出了一种选择一跳邻居中继作为潜在转发器的方案来中继广播消息,以提高车辆排中的传输可靠性。继电器选择指标包括车辆密度、速度和地理位置。所选中继以最小的开销和最小的带宽消耗控制广播消息。同样,多媒体紧急消息需要高优先级和较短的传输延迟。为了给不同的流量分类提供差异化的服务,我们采用了802.11e MAC,并将交叉层进一步扩展到传输层,根据信道的物理状态动态调整数据传输速率。大量的仿真分析表明,所提出的跨层方案能够有效地传播关键广播消息,具有较小的分组延迟和较高的分组分发率。
{"title":"Cross layer approach for effective multi hop broadcast in VANET","authors":"Dr. Mahadev A. Gawas, L. Gudino, K. Anupama","doi":"10.1109/COMSNETS.2017.7945414","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945414","url":null,"abstract":"Cooperative communication in VANET has become the de-facto in enabling technology to improve safety and efficiency on inter-vehicle communication (IVC). The safety related messages broadcast on emergency must have a minimum delay and high reliability. This paper proposes a cross-layer approach to efficiently broadcast the safety messages by minimizing the message redundancy and maintaining low end-to-end communication delays. We propose a scheme to select a one-hop neighbor relay as a potential forwarder for relaying the broadcast messages to improve the transmission reliability in a platoon of vehicles. The relay selection metrics compose of vehicular density, velocity, and the geographical location. The selected relay controls the broadcast messages with minimum overhead and with minimum bandwidth consumption. Similarly, a multimedia emergency message needs high priority with a shorter transmission delay. To provide the service differentiation to different traffic classes, we adopt 802.11e MAC. The cross layer is further extended to the transport layer to dynamically adapt the data transmission rate based on the physical channel state. The extensive simulation analysis conducted reveals that the proposed cross-layer scheme effectively propagates the critical broadcast messages with lesser packet latency and higher packet delivery ratio.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"17 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132546584","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}
引用次数: 9
Building a web based cognitive restructuring program for promoting resilience in a college campus 建立一个基于网络的认知重构项目,以促进大学校园的弹性
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945446
Romil Roy, Rajlakshmi Guha, S. D. Bhattacharya, J. Mukhopadhyay
College mental health is an area of significant importance. A number of stressors relating to career, relationships and life events collide during this life phase, when young adults learn to be autonomous. A major developmental task is making appropriate life choices in the face of freedom and contradictory messages from a wide range of sources. Thus identifying individuals in distress and building means to promote resilience would be relevant to any college setting. Resilience building has been a major area of concern to educators across the world. The main reason is that it is impossible to conduct face to face counselling on several occasions in a large college setting. This present study aims to build a web-based multi-step cognitive restructuring program to help young adults identify and deal with maladaptive, negative thoughts, and emotions, thereby effectively attempting to promote resilience, and improve psychological health among college students. Considering the sensitivity of the data present in the system, it has been developed following the multitier architecture with an intention to block access by unauthorized users. The system is meant to be interactive and regular feedback should be taken from the subjects. The counsellor should be given access to the full information of the subjects for evaluation. Additional tools for psychological assessment can be incorporated by the therapist into the system for an individual subject, if further evaluations are required. The system offers a generic platform for the development of other web-based interactive Computer Assisted Cognitive Behavioural Training programs addressing needs of specific populations.
大学生心理健康是一个非常重要的领域。在这个年轻人学会自主的人生阶段,许多与事业、人际关系和生活事件有关的压力源相互碰撞。一项主要的发展任务是在面对自由和来自广泛来源的相互矛盾的信息时作出适当的生活选择。因此,识别处于困境中的个人,并建立提高适应力的方法,这与任何大学环境都是相关的。韧性建设一直是全世界教育工作者关注的一个主要领域。主要原因是,在一个大的大学环境中,不可能进行多次面对面的咨询。本研究旨在建立一个基于网络的多步骤认知重构程序,以帮助年轻人识别和处理不适应、消极的思想和情绪,从而有效地提高大学生的心理弹性,改善心理健康。考虑到系统中存在的数据的敏感性,它遵循多层架构开发,旨在阻止未经授权的用户访问。该系统是交互式的,应该定期从受试者那里获得反馈。应让辅导员获得评价对象的全部资料。如果需要进一步的评估,治疗师可以将心理评估的其他工具纳入个体受试者的系统中。该系统为开发其他基于网络的交互式计算机辅助认知行为训练项目提供了一个通用平台,以满足特定人群的需求。
{"title":"Building a web based cognitive restructuring program for promoting resilience in a college campus","authors":"Romil Roy, Rajlakshmi Guha, S. D. Bhattacharya, J. Mukhopadhyay","doi":"10.1109/COMSNETS.2017.7945446","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945446","url":null,"abstract":"College mental health is an area of significant importance. A number of stressors relating to career, relationships and life events collide during this life phase, when young adults learn to be autonomous. A major developmental task is making appropriate life choices in the face of freedom and contradictory messages from a wide range of sources. Thus identifying individuals in distress and building means to promote resilience would be relevant to any college setting. Resilience building has been a major area of concern to educators across the world. The main reason is that it is impossible to conduct face to face counselling on several occasions in a large college setting. This present study aims to build a web-based multi-step cognitive restructuring program to help young adults identify and deal with maladaptive, negative thoughts, and emotions, thereby effectively attempting to promote resilience, and improve psychological health among college students. Considering the sensitivity of the data present in the system, it has been developed following the multitier architecture with an intention to block access by unauthorized users. The system is meant to be interactive and regular feedback should be taken from the subjects. The counsellor should be given access to the full information of the subjects for evaluation. Additional tools for psychological assessment can be incorporated by the therapist into the system for an individual subject, if further evaluations are required. The system offers a generic platform for the development of other web-based interactive Computer Assisted Cognitive Behavioural Training programs addressing needs of specific populations.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 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":"131385400","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
Topology based path computation for provisioning in transport networks 传输网络中基于拓扑的路径计算
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945373
Madanagopal Ramachandran, K. Sivalingam
Service providers employ different transport technologies like PDH, SDH/SONET, WDM/DWDM, ATM, DSL etc. to support different types of traffic and service requirements. Dynamic service provisioning requires the use of on-line algorithms which automatically compute the path to be taken to satisfy the given service request. Transport networks are deployed such that they follow different topologies such as linear, ring, mesh, protected linear, dual homing etc. In this work, a new mechanism for path computation is proposed. Here, two types of graphs are considered: a super graph containing the topologies as nodes and common nodes as edges and the base graph containing network elements as nodes and physical links as edges. An algorithm to compute the best path taking into account the topologies present in the super graph and then finding the basic path from the topology path is proposed. It takes into account topologies with and without protection and protection path is found wherever required. When every edge in the network belongs to a topology, then the performance of the proposed algorithms is much better when compared with the traditional path computation algorithms. But, when many of the edges do not belong to any topology in the network, then the performance of the algorithms were poor when compared with the traditional path computation algorithms.
服务提供商采用不同的传输技术,如PDH、SDH/SONET、WDM/DWDM、ATM、DSL等,以支持不同类型的流量和业务需求。动态服务提供需要使用在线算法,该算法自动计算满足给定服务请求所采取的路径。传输网络的部署使得它们遵循不同的拓扑结构,如线性、环形、网状、受保护的线性、双归巢等。本文提出了一种新的路径计算机制。这里考虑两种类型的图:包含拓扑作为节点和公共节点作为边的超级图和包含网络元素作为节点和物理链路作为边的基本图。提出了一种考虑超级图中存在的拓扑计算最佳路径,然后从拓扑路径中找到基本路径的算法。它考虑了有保护和没有保护的拓扑结构,并在需要的地方找到保护路径。当网络中的每条边都属于一个拓扑结构时,与传统的路径计算算法相比,所提算法的性能要好得多。但是,当网络中的许多边不属于任何拓扑时,与传统的路径计算算法相比,算法的性能较差。
{"title":"Topology based path computation for provisioning in transport networks","authors":"Madanagopal Ramachandran, K. Sivalingam","doi":"10.1109/COMSNETS.2017.7945373","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945373","url":null,"abstract":"Service providers employ different transport technologies like PDH, SDH/SONET, WDM/DWDM, ATM, DSL etc. to support different types of traffic and service requirements. Dynamic service provisioning requires the use of on-line algorithms which automatically compute the path to be taken to satisfy the given service request. Transport networks are deployed such that they follow different topologies such as linear, ring, mesh, protected linear, dual homing etc. In this work, a new mechanism for path computation is proposed. Here, two types of graphs are considered: a super graph containing the topologies as nodes and common nodes as edges and the base graph containing network elements as nodes and physical links as edges. An algorithm to compute the best path taking into account the topologies present in the super graph and then finding the basic path from the topology path is proposed. It takes into account topologies with and without protection and protection path is found wherever required. When every edge in the network belongs to a topology, then the performance of the proposed algorithms is much better when compared with the traditional path computation algorithms. But, when many of the edges do not belong to any topology in the network, then the performance of the algorithms were poor when compared with the traditional path computation algorithms.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"8 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":"127660714","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
The m-Ranking of nodes in complex networks 复杂网络中节点的m-排序
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945419
K. Kumar, Shibu Manuel, Deepu Benson
Identifying influential nodes in complex networks has attracted much attention because of its great theoretical significance and wide application. The m-Ranking method takes into account degree of all nodes and weight of all edges to rank nodes of the network with different weight. This ranking method can be used for unweighted networks also by fixing the value of the parameter α = 1. In addition, we demonstrate our new method on a real air traffic network and show that the ranks calculated using the new method is more meaningful compared with other methods.
复杂网络中影响节点识别因其重要的理论意义和广泛的应用而备受关注。m-排序法考虑所有节点的度和所有边的权值,对网络中不同权值的节点进行排序。这种排序方法也可以通过固定参数α = 1来用于非加权网络。最后,在一个实际的空中交通网络中进行了实例验证,结果表明,与其他方法相比,新方法计算出的秩更有意义。
{"title":"The m-Ranking of nodes in complex networks","authors":"K. Kumar, Shibu Manuel, Deepu Benson","doi":"10.1109/COMSNETS.2017.7945419","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945419","url":null,"abstract":"Identifying influential nodes in complex networks has attracted much attention because of its great theoretical significance and wide application. The m-Ranking method takes into account degree of all nodes and weight of all edges to rank nodes of the network with different weight. This ranking method can be used for unweighted networks also by fixing the value of the parameter α = 1. In addition, we demonstrate our new method on a real air traffic network and show that the ranks calculated using the new method is more meaningful compared with other methods.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"10 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133086661","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
Power efficient resource allocation algorithms for provisioning in SDH networks SDH网络中高效的资源分配算法
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945388
Madanagopal Ramachandran, K. Sivalingam
Synchronous Digital Hierarchy (SDH) is a widely used technology in access and core networks for carrying different types of traffic. It defines a hierarchy for multiplexing lower rate traffic containers into higher rate traffic containers. Provisioning refers to the process of allocation of resources to carry a given traffic demand. Due to the continued expansion of the networks employing SDH technology, the power consumption of the network increases becoming a bottleneck for further expansion. Allocation of resources to traffic demands in power-efficient ways will therefore help in minimizing the capital and operational costs in running the network. In this work, the power consumed by a switch matrix having the capability to switch different traffic containers in different amounts is considered. The objective is to minimize the number of network elements deployed in the network by allocating resources to traffic demands in power-efficient ways. A formulation based on Integer Linear Programming (ILP) is presented; three different heuristic approaches, based on how higher order trails are used and the use of grooming, are proposed. It is found that the grooming-based heuristic performs better in terms of the total power consumption relative to the weighted number of requests accepted. It is also found that, for small networks, the grooming heuristic performs identical to the optimal solution found by an LP solver when the problem is feasible. It can be noted that the power-efficient design is also a cost-efficient design since the capacity of the switch matrix determines the number of network elements that are required for deployment in the network.
同步数字层次(SDH)是一种广泛应用于接入网和核心网的技术,用于承载不同类型的业务。它定义了将低速率流量容器多路复用到高速率流量容器的层次结构。供给是指为满足一定的流量需求而分配资源的过程。由于采用SDH技术的网络不断扩展,网络的功耗不断增加,成为进一步扩展的瓶颈。因此,以节能的方式分配资源以应付交通需求,将有助减低网络的资本及营运成本。在这项工作中,考虑了具有不同流量容器交换能力的交换矩阵所消耗的功率。其目标是通过以节能的方式将资源分配给流量需求,从而最大限度地减少网络中部署的网络元素数量。提出了一种基于整数线性规划(ILP)的计算公式;提出了三种不同的启发式方法,基于如何使用高阶轨迹和修饰的使用。研究发现,基于梳理的启发式算法相对于接受请求的加权数量而言,在总功耗方面表现更好。研究还发现,对于小型网络,当问题可行时,梳理启发式算法的执行与LP求解器找到的最优解相同。可以注意到,节能设计也是一种成本效益设计,因为交换机矩阵的容量决定了在网络中部署所需的网元数量。
{"title":"Power efficient resource allocation algorithms for provisioning in SDH networks","authors":"Madanagopal Ramachandran, K. Sivalingam","doi":"10.1109/COMSNETS.2017.7945388","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945388","url":null,"abstract":"Synchronous Digital Hierarchy (SDH) is a widely used technology in access and core networks for carrying different types of traffic. It defines a hierarchy for multiplexing lower rate traffic containers into higher rate traffic containers. Provisioning refers to the process of allocation of resources to carry a given traffic demand. Due to the continued expansion of the networks employing SDH technology, the power consumption of the network increases becoming a bottleneck for further expansion. Allocation of resources to traffic demands in power-efficient ways will therefore help in minimizing the capital and operational costs in running the network. In this work, the power consumed by a switch matrix having the capability to switch different traffic containers in different amounts is considered. The objective is to minimize the number of network elements deployed in the network by allocating resources to traffic demands in power-efficient ways. A formulation based on Integer Linear Programming (ILP) is presented; three different heuristic approaches, based on how higher order trails are used and the use of grooming, are proposed. It is found that the grooming-based heuristic performs better in terms of the total power consumption relative to the weighted number of requests accepted. It is also found that, for small networks, the grooming heuristic performs identical to the optimal solution found by an LP solver when the problem is feasible. It can be noted that the power-efficient design is also a cost-efficient design since the capacity of the switch matrix determines the number of network elements that are required for deployment in the network.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"1 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":"131295649","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
Temperature sensor based ultra low cost respiration monitoring system 基于温度传感器的超低成本呼吸监测系统
Pub Date : 1900-01-01 DOI: 10.1109/COMSNETS.2017.7945448
Anshul Basra, Bodhibrata Mukhopadhyay, Subrat Kar
Measurement of respiration rate is a vital parameter for adequate health monitoring. An abnormal respiration rate can indicate a variety of pathological conditions like respiratory, cardiovascular and metabolic disorders. We have developed a non-invasive, portable, easy to use and economic respiratory sensor. It measures the temperature difference between inhalation and exhalation phases of respiratory cycle. The difference in temperature has been converted into a digital signal using 8 bit microcontroller (Atmega 328). By analyzing the digital signal, we can detect abnormalities like tachypnea, bradypnea and apnea. To track the unusual or sudden change in respiratory rate a buzzer system has been incorporated with the device. Graphical recordings corresponding to the calculated respiratory rate has been simultaneously obtained for the reference. This device can be used to detect sleeping disorder and abnormal respiration rate.
呼吸速率的测量是健康监测的重要参数。呼吸频率异常可提示多种病理状况,如呼吸、心血管和代谢紊乱。我们开发了一种无创、便携、易用、经济的呼吸传感器。它测量呼吸循环中吸入和呼出阶段的温差。使用8位微控制器(atmega328)将温差转换为数字信号。通过分析数字信号,我们可以检测到呼吸急促、呼吸缓慢和呼吸暂停等异常情况。为了跟踪呼吸频率的异常或突然变化,该设备还配备了蜂鸣器系统。同时得到与计算呼吸率相对应的图形记录,以供参考。该装置可用于检测睡眠障碍和呼吸异常。
{"title":"Temperature sensor based ultra low cost respiration monitoring system","authors":"Anshul Basra, Bodhibrata Mukhopadhyay, Subrat Kar","doi":"10.1109/COMSNETS.2017.7945448","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945448","url":null,"abstract":"Measurement of respiration rate is a vital parameter for adequate health monitoring. An abnormal respiration rate can indicate a variety of pathological conditions like respiratory, cardiovascular and metabolic disorders. We have developed a non-invasive, portable, easy to use and economic respiratory sensor. It measures the temperature difference between inhalation and exhalation phases of respiratory cycle. The difference in temperature has been converted into a digital signal using 8 bit microcontroller (Atmega 328). By analyzing the digital signal, we can detect abnormalities like tachypnea, bradypnea and apnea. To track the unusual or sudden change in respiratory rate a buzzer system has been incorporated with the device. Graphical recordings corresponding to the calculated respiratory rate has been simultaneously obtained for the reference. This device can be used to detect sleeping disorder and abnormal respiration rate.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"90 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":"115729405","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}
引用次数: 18
期刊
2017 9th International Conference on Communication Systems and Networks (COMSNETS)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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