Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413607
Jitendra Gupta, Aneek Adhya
In this paper we propose a novel clustering based multi-hop protection (referred to as CMHP) heuristic scheme to protect against single shared-risk link group (SRLG) failure in a long-reach passive optical network. We allocate the residual capacity of backup optical network units (ONUs) among the ONUs that require protection by employing bypass-based multi-hop traffic transmission through backup fibers. CMHP scheme also enables sharing of backup fibers to reduce the total number of dedicated backup fibers to be deployed between an ONU and its backup ONUs. In the study we enable a given network to be reliable by considering different reliability requirements (viz., 75%, 85% and 95%) based on the degree of reliability required by each ONU as determined by the network operator. We perform exhaustive simulation study to analyse the performance of CMHP scheme and show that CMHP scheme significantly reduces the total length of backup fiber with reference to existing scheme to protect against single SRLG failure.
{"title":"A cost-efficient protection scheme for service recovery against single shared-risk link group failure in long-reach passive optical network","authors":"Jitendra Gupta, Aneek Adhya","doi":"10.1109/ANTS.2015.7413607","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413607","url":null,"abstract":"In this paper we propose a novel clustering based multi-hop protection (referred to as CMHP) heuristic scheme to protect against single shared-risk link group (SRLG) failure in a long-reach passive optical network. We allocate the residual capacity of backup optical network units (ONUs) among the ONUs that require protection by employing bypass-based multi-hop traffic transmission through backup fibers. CMHP scheme also enables sharing of backup fibers to reduce the total number of dedicated backup fibers to be deployed between an ONU and its backup ONUs. In the study we enable a given network to be reliable by considering different reliability requirements (viz., 75%, 85% and 95%) based on the degree of reliability required by each ONU as determined by the network operator. We perform exhaustive simulation study to analyse the performance of CMHP scheme and show that CMHP scheme significantly reduces the total length of backup fiber with reference to existing scheme to protect against single SRLG failure.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130824381","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413627
Srabani Kundu
In many real life applications of WSN, to monitor a wide inaccessible area, a large number of sensor nodes are deployed randomly over the region. When an event occurs, to identify the affected area immediately, it is necessary that the data and the locations of the affected nodes are reported to the sink node with minimum latency. In this paper, for 2D region, using some light-weight distributed in-node processing, a reduced set of boundary nodes are identified, which report to the sink node following the proposed routing strategy to minimize the latency. Simulation results show that compared to the earlier works, the proposed algorithm performs better in terms of the number of boundary nodes to be reported, accuracy of the estimated area and the packet latency with less neighborhood information and without any dependency on sensed data.
{"title":"Low latency event boundary detection in wireless sensor networks","authors":"Srabani Kundu","doi":"10.1109/ANTS.2015.7413627","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413627","url":null,"abstract":"In many real life applications of WSN, to monitor a wide inaccessible area, a large number of sensor nodes are deployed randomly over the region. When an event occurs, to identify the affected area immediately, it is necessary that the data and the locations of the affected nodes are reported to the sink node with minimum latency. In this paper, for 2D region, using some light-weight distributed in-node processing, a reduced set of boundary nodes are identified, which report to the sink node following the proposed routing strategy to minimize the latency. Simulation results show that compared to the earlier works, the proposed algorithm performs better in terms of the number of boundary nodes to be reported, accuracy of the estimated area and the packet latency with less neighborhood information and without any dependency on sensed data.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125599398","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413642
S. K. Addya, A. K. Turuk, B. Sahoo, M. Sarkar
Virtual Machine (VM) placement is an important research area for power conservation in data centers. In this paper, we introduce a hybrid queuing model for VM placement for data centers to improve total placement time and earn more revenue. For the large data center management smaller placement times lead to greater quality of service (QoS) experienced by an user of the cloud infrastructure. Similarly, the larger the number of VMs that can be placed in a server racks, higher the justification of the placement cost. We thus propose a ILP, that provides maximum justification of the revenue earn along with minimizing placement time. In addition, we also study the rate of loss of VM placement requests and total utilization of the system as the arrival rate of VMs increase.
{"title":"A hybrid queuing model for Virtual Machine placement in cloud data center","authors":"S. K. Addya, A. K. Turuk, B. Sahoo, M. Sarkar","doi":"10.1109/ANTS.2015.7413642","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413642","url":null,"abstract":"Virtual Machine (VM) placement is an important research area for power conservation in data centers. In this paper, we introduce a hybrid queuing model for VM placement for data centers to improve total placement time and earn more revenue. For the large data center management smaller placement times lead to greater quality of service (QoS) experienced by an user of the cloud infrastructure. Similarly, the larger the number of VMs that can be placed in a server racks, higher the justification of the placement cost. We thus propose a ILP, that provides maximum justification of the revenue earn along with minimizing placement time. In addition, we also study the rate of loss of VM placement requests and total utilization of the system as the arrival rate of VMs increase.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133121043","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413634
Nazatul Haque Sultan, F. Barbhuiya, N. Sarma
With the increase in popularity of electronic voting, it has become necessary to have secure online voting mechanism. This paper presents a novel online voting scheme by using combination of biometric and password based security. The scheme uses Fuzzy Extractor to provide biometric based authentication, while secret password is used to provide password based protection of the voter. In addition, Pairing-Based Cryptography is used to provide the necessary security requirements of an online voting system. A prototype of the proposed scheme is implemented and its performance and security analysis shows that the proposed scheme is cost-effective and at the same time satisfies the security requirements of an online voting system.
{"title":"PairVoting: A secure online voting scheme using Pairing-Based Cryptography and Fuzzy Extractor","authors":"Nazatul Haque Sultan, F. Barbhuiya, N. Sarma","doi":"10.1109/ANTS.2015.7413634","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413634","url":null,"abstract":"With the increase in popularity of electronic voting, it has become necessary to have secure online voting mechanism. This paper presents a novel online voting scheme by using combination of biometric and password based security. The scheme uses Fuzzy Extractor to provide biometric based authentication, while secret password is used to provide password based protection of the voter. In addition, Pairing-Based Cryptography is used to provide the necessary security requirements of an online voting system. A prototype of the proposed scheme is implemented and its performance and security analysis shows that the proposed scheme is cost-effective and at the same time satisfies the security requirements of an online voting system.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121780275","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413638
Aditya Vamsi Mamidi, Sarath Babu, B. S. Manoj
Software Defined Networking (SDN) allows network administrators to customize the network according to the requirements. The centralized control plane in SDN finds its application in several areas of networking, especially in Wireless Mesh Networks (WMNs). In this paper we propose two dynamic switch handoff schemes for Software Defined Wireless Mesh Networks (SDWMNs) with multiple controller architectures. We use the metrics end-to-end Round-Trip-Time (RTT) and multi-hop Expected Transmission Count (ETX) for computing the handoff decision. Two schemes are analyzed by deploying a testbed consisting of mobile routers and multiple controllers. Our results show that ETX is a better metric for switch handoffs compared to RTT in mobile environments. Further, we propose an anticipatory handoff algorithm, based on multi-hop ETX, which predicts the near future of network behavior and makes the handoff decision prior to actual handoff. Finally, we observe significant performance improvement with our ETX-based handoff scheme as compared to architectures with a single controller.
SDN (Software Defined Networking)，即软件定义网络，允许网络管理员根据需要定制网络。SDN中的集中控制平面在网络的许多领域都有其应用，尤其是在无线Mesh网络中。在本文中，我们提出了两种具有多控制器架构的软件定义无线网状网络(SDWMNs)的动态切换方案。我们使用端到端往返时间(RTT)和多跳预期传输计数(ETX)来计算切换决策。通过部署由移动路由器和多个控制器组成的测试平台，对两种方案进行了分析。我们的结果表明，在移动环境中，与RTT相比，ETX是一个更好的切换度量。此外，我们提出了一种基于多跳ETX的预期切换算法，该算法可以预测网络行为的近未来，并在实际切换之前做出切换决策。最后，我们观察到与单一控制器的架构相比，基于etx的切换方案的性能有了显著提高。
{"title":"Dynamic multi-hop switch handoffs in Software Defined Wireless Mesh Networks","authors":"Aditya Vamsi Mamidi, Sarath Babu, B. S. Manoj","doi":"10.1109/ANTS.2015.7413638","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413638","url":null,"abstract":"Software Defined Networking (SDN) allows network administrators to customize the network according to the requirements. The centralized control plane in SDN finds its application in several areas of networking, especially in Wireless Mesh Networks (WMNs). In this paper we propose two dynamic switch handoff schemes for Software Defined Wireless Mesh Networks (SDWMNs) with multiple controller architectures. We use the metrics end-to-end Round-Trip-Time (RTT) and multi-hop Expected Transmission Count (ETX) for computing the handoff decision. Two schemes are analyzed by deploying a testbed consisting of mobile routers and multiple controllers. Our results show that ETX is a better metric for switch handoffs compared to RTT in mobile environments. Further, we propose an anticipatory handoff algorithm, based on multi-hop ETX, which predicts the near future of network behavior and makes the handoff decision prior to actual handoff. Finally, we observe significant performance improvement with our ETX-based handoff scheme as compared to architectures with a single controller.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115010180","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413666
Pratik Tiwari, Seemanti Saha
This paper presents a Particle Swarm Optimization (PSO) based co-channel interference constrained efficient and low-complexity novel spectrum allocation scheme with simultaneous power and network capacity optimization for a Cognitive Radio Network (CRN) with a system model of multiple secondary user (SU) pairs and one primary user (PU) pair in a spectrum underlay fashion. A novel weighted fitness function is proposed subject to the constraint that all primary users and secondary users are supported with their target signal-to-interference-noise ratio (SINR). MATLAB simulation shows that total transmitted-power-per- node (TPPN) decreases while the network capacity remains almost constant for proper choice of weight ratio of the fitness function involved and hence, in the real-time situation, we can avoid the high computational burden of multi-objective optimization by predetermining the weight ratio through parametric study.
{"title":"Co-channel interference constrained spectrum allocation with simultaneous power and network capacity optimization using PSO in Cognitive Radio Network","authors":"Pratik Tiwari, Seemanti Saha","doi":"10.1109/ANTS.2015.7413666","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413666","url":null,"abstract":"This paper presents a Particle Swarm Optimization (PSO) based co-channel interference constrained efficient and low-complexity novel spectrum allocation scheme with simultaneous power and network capacity optimization for a Cognitive Radio Network (CRN) with a system model of multiple secondary user (SU) pairs and one primary user (PU) pair in a spectrum underlay fashion. A novel weighted fitness function is proposed subject to the constraint that all primary users and secondary users are supported with their target signal-to-interference-noise ratio (SINR). MATLAB simulation shows that total transmitted-power-per- node (TPPN) decreases while the network capacity remains almost constant for proper choice of weight ratio of the fitness function involved and hence, in the real-time situation, we can avoid the high computational burden of multi-objective optimization by predetermining the weight ratio through parametric study.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121416169","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413650
Soumen Moulik, S. Misra, C. Chakraborty
This paper presents a context-aware Personal Area Network (PAN) coordinator selection algorithm - CAPCoS, for real-time acquisition of physiological data of soldiers in battle-field. PAN coordinator selection procedure in Wireless Body Area Networks (WBANs), must have some WBAN specific attributes and scenario specific attributes. In this work, we consider three criteria such as - successful delivery of data packets at sink, cooperation among different hops during multi-hop routing, and health severity of individual soldiers. CAPCoS uses the concept of absorbing Markov chain in order to quantify the rate of successful delivery of packets or the Absorption Rate (AR) of each hop. The cooperation Index (CI) represents the ratio of data-out to data-in, for each hop. Priority of Health (PH) represents the normalized health severity of each soldier. In order to select the most preferable Local Processing Unit (LPU) as the PAN coordinator among all WBAN-equipped soldiers, we employ the concept of Analytical Hierarchy Processing (AHP), which generates a proper ranking of the LPUs, based on the aforementioned three criteria. We achieve around 50% improvement in both network lifetime and traffic using the proposed algorithm.
{"title":"CAPCoS: Context-aware PAN coordinator selection for health monitoring of soldiers in battlefield","authors":"Soumen Moulik, S. Misra, C. Chakraborty","doi":"10.1109/ANTS.2015.7413650","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413650","url":null,"abstract":"This paper presents a context-aware Personal Area Network (PAN) coordinator selection algorithm - CAPCoS, for real-time acquisition of physiological data of soldiers in battle-field. PAN coordinator selection procedure in Wireless Body Area Networks (WBANs), must have some WBAN specific attributes and scenario specific attributes. In this work, we consider three criteria such as - successful delivery of data packets at sink, cooperation among different hops during multi-hop routing, and health severity of individual soldiers. CAPCoS uses the concept of absorbing Markov chain in order to quantify the rate of successful delivery of packets or the Absorption Rate (AR) of each hop. The cooperation Index (CI) represents the ratio of data-out to data-in, for each hop. Priority of Health (PH) represents the normalized health severity of each soldier. In order to select the most preferable Local Processing Unit (LPU) as the PAN coordinator among all WBAN-equipped soldiers, we employ the concept of Analytical Hierarchy Processing (AHP), which generates a proper ranking of the LPUs, based on the aforementioned three criteria. We achieve around 50% improvement in both network lifetime and traffic using the proposed algorithm.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121477928","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413618
Sibendu Paul, Bitan Banerjee, Rajdeep Das, A. Mukherjee, M. K. Naskar
It is a paradigm shift in internet architecture from receiver centric model to the information centric networking (ICN) model to improve the end-users' latency experience. With exponential increment in number of users and data volume, efficient usage of the nodes (caches) and content forwarding methodology are key issues in an ICN architecture. In ICN intra-domain routers have storage capacity and they can act as temporary content provider, therefore it reduces average hop count and correspondingly average delay for content download. In this article, we formulate the content management issues in a cache having finite storage capability and propose an efficient content management policy that metamorphoses a node to a self-sustained cache. We address how content packets are stored in buffer of the cache before processing and how they suffer from several finite propagation delays during the processing in a cache. We simulate our proposition with deploying real-life network environment and calculate user experience metrics like average latency, throughput and good-put. From simulation results we observe that our proposed model outperforms the existing state-of-the-art on-path caching policies.
{"title":"A generic delay tolerant routing strategy for information centric networking (ICN)","authors":"Sibendu Paul, Bitan Banerjee, Rajdeep Das, A. Mukherjee, M. K. Naskar","doi":"10.1109/ANTS.2015.7413618","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413618","url":null,"abstract":"It is a paradigm shift in internet architecture from receiver centric model to the information centric networking (ICN) model to improve the end-users' latency experience. With exponential increment in number of users and data volume, efficient usage of the nodes (caches) and content forwarding methodology are key issues in an ICN architecture. In ICN intra-domain routers have storage capacity and they can act as temporary content provider, therefore it reduces average hop count and correspondingly average delay for content download. In this article, we formulate the content management issues in a cache having finite storage capability and propose an efficient content management policy that metamorphoses a node to a self-sustained cache. We address how content packets are stored in buffer of the cache before processing and how they suffer from several finite propagation delays during the processing in a cache. We simulate our proposition with deploying real-life network environment and calculate user experience metrics like average latency, throughput and good-put. From simulation results we observe that our proposed model outperforms the existing state-of-the-art on-path caching policies.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124386331","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413632
K. Sharma, Venkataramana Badarla
Data center technology is growing in last few years because it can accommodate variety of applications. Some data-intensive applications are deadline sensitive and require minimum flow completion time. In literature, many proposals exist for either reducing average flow completion time or the long tail of flow completion. The state of art proposal is pFabric [3] with shortest remaining size first scheduling. Data centers are generally built on layer 3 switching to reduce broadcast domain. Hosts are assigned IP address hierarchically to reduce the size of forwarding table across all data center switches. With the help of destination IP address, a sender can find the distance to the receiver. In the proposed protocol, Topology Aware pFabric (TAP), the distance information with remaining size of flow is used for flow prioritization. TAP outperforms existing protocol pFabric. The simulation results show that prioritizing long distance flows1 further reduces average flow completion time and minimizes the total number of timeout events.
{"title":"Topology aware flow scheduling for data center network","authors":"K. Sharma, Venkataramana Badarla","doi":"10.1109/ANTS.2015.7413632","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413632","url":null,"abstract":"Data center technology is growing in last few years because it can accommodate variety of applications. Some data-intensive applications are deadline sensitive and require minimum flow completion time. In literature, many proposals exist for either reducing average flow completion time or the long tail of flow completion. The state of art proposal is pFabric [3] with shortest remaining size first scheduling. Data centers are generally built on layer 3 switching to reduce broadcast domain. Hosts are assigned IP address hierarchically to reduce the size of forwarding table across all data center switches. With the help of destination IP address, a sender can find the distance to the receiver. In the proposed protocol, Topology Aware pFabric (TAP), the distance information with remaining size of flow is used for flow prioritization. TAP outperforms existing protocol pFabric. The simulation results show that prioritizing long distance flows1 further reduces average flow completion time and minimizes the total number of timeout events.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131714420","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}
Pub Date : 2015-12-01DOI: 10.1109/ANTS.2015.7413626
Tathagata Das, Sarbani Roy
Nowadays wireless sensor network (WSN) of mobile nodes is used in most of the sensor applications especially in event-driven applications. The choice of mobile nodes are obvious as they are much more versatile than static sensors. Mobile nodes can be deployed in any scenario and cope with rapid changes in the environment. One of the fundamental problem of mobile WSN is energy consumption and this is a more serious issue than in static WSN because all sensors are moving continuously and as a result they are prone to consume more energy. Network lifetime is inversely dependent on the overall energy consumption of nodes in the network. In this paper, we present an energy efficient and event driven mobility model (E3DM) where mobile sensors inform each other about a static event and adjust their route to reach to the nearest point of that event. Sensors exchange some useful information between themselves by packet transmissions. Through this information exchange, movement of one sensor influences the movements of its neighbors. The objective is to minimize the energy consumption and thus increase the network lifetime. Although some overhead involved due to packet exchange between nodes, an enhanced version of energy efficient and event driven mobility model (E4DM) is also introduced to reduce this complexity. The effectiveness of the proposed approaches are evaluated and compared with random way-point mobility model (RWP), one variant of RWP where constant velocity (RWPCV) and Gauss Markov mobility model (GMKV) using NS-3 simulation.
{"title":"Energy efficient and event driven mobility model in mobile WSN","authors":"Tathagata Das, Sarbani Roy","doi":"10.1109/ANTS.2015.7413626","DOIUrl":"https://doi.org/10.1109/ANTS.2015.7413626","url":null,"abstract":"Nowadays wireless sensor network (WSN) of mobile nodes is used in most of the sensor applications especially in event-driven applications. The choice of mobile nodes are obvious as they are much more versatile than static sensors. Mobile nodes can be deployed in any scenario and cope with rapid changes in the environment. One of the fundamental problem of mobile WSN is energy consumption and this is a more serious issue than in static WSN because all sensors are moving continuously and as a result they are prone to consume more energy. Network lifetime is inversely dependent on the overall energy consumption of nodes in the network. In this paper, we present an energy efficient and event driven mobility model (E3DM) where mobile sensors inform each other about a static event and adjust their route to reach to the nearest point of that event. Sensors exchange some useful information between themselves by packet transmissions. Through this information exchange, movement of one sensor influences the movements of its neighbors. The objective is to minimize the energy consumption and thus increase the network lifetime. Although some overhead involved due to packet exchange between nodes, an enhanced version of energy efficient and event driven mobility model (E4DM) is also introduced to reduce this complexity. The effectiveness of the proposed approaches are evaluated and compared with random way-point mobility model (RWP), one variant of RWP where constant velocity (RWPCV) and Gauss Markov mobility model (GMKV) using NS-3 simulation.","PeriodicalId":347920,"journal":{"name":"2015 IEEE International Conference on Advanced Networks and Telecommuncations Systems (ANTS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115753167","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：