{"title":"Event boundary detection and gathering in wireless sensor networks","authors":"Srabani Kundu, Nabanita Das","doi":"10.1109/AIMOC.2015.7083831","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083831","url":null,"abstract":"Given a large number of sensor nodes distributed randomly over a 2D region, we address the problem of estimating the boundary of an area affected by an event. The boundaries are often irregular shaped and accurate estimation of such boundaries requires complex computation and data structures which the tiny inexpensive sensor nodes, in general, can not support. In this paper, given a random distribution of homogeneous sensor nodes, in case of an event, the affected nodes execute a simple O(d) distributed algorithm based on local information only, that can identify a small set of boundary nodes, where d is the maximum node degree in the network. Next, a nearly load balanced shortest path routing algorithm based on farthest-first technique is proposed for gathering the information of the boundary nodes to the sink node with low latency. Simulation results show that compared to the earlier algorithms, the proposed algorithm with less neighborhood information and simpler computing results better estimation of the covered area and gather the information at the sink node with nearly minimum latency.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"30 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131894589","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}
{"title":"An analytical method to identify social ambassadors for a mobile service provider's brand page on facebook","authors":"Adrija Majumdar, Debashis Saha, P. Dasgupta","doi":"10.1109/AIMOC.2015.7083839","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083839","url":null,"abstract":"Social media is emerging as the mode of choice of internet users to communicate, collaborate and share content. Marketers are also increasingly making use of this media to identify potential customers and get them connected to their brand. An important aspect of using social media for advertising is the scope for utilizing word-of-mouth and endorsements from existing customers and subscribers. In this way, advertisers can identify users who can act as social ambassadors to influence other users to buy, try or subscribe to their products or services. In this work, we propose an analytical method to identify potential social ambassadors of brand pages of mobile service providers. The study makes use of a set of users on social media, specifically Facebook, who have high degree of association with the brand page. Users with higher association values could be shown more updates about the brand page and vice versa. We propose a method to ascertain the weights associated with the metric “association value” and show statistically that the results determined by the proposed method are intuitively valid because they match with the opinions given by domain experts.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122648704","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}
{"title":"A distributed approach towards trusted cloud computing platform","authors":"Partha Sen, Pritam Saha, Sunirmal Khatua","doi":"10.1109/AIMOC.2015.7083844","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083844","url":null,"abstract":"Cloud computing is one of the emerging fields in both the academics and the IT Industry. It offers different service models and provides an on-demand, pay-per-use, multitenant, pervasive model which makes it suitable to adapt in the fast growing industries. But this new technology suffers from some of the security concerns, since our data and computations are handled by third party infrastructure. In this paper, we deal with different infrastructure level attacks and through the use of trusted cloud computing platform we provide a distributed solution to implement it.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122679682","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}
{"title":"Congestion avoidance topology in wireless sensor network using Karnaugh map","authors":"R. Dasgupta, Ritwick Mukherjee, Amitava Gupta","doi":"10.1109/AIMOC.2015.7083835","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083835","url":null,"abstract":"Wireless Sensor Network (WSN) is an ad-hoc network consisting of sensor nodes having limited computational power fitted with a radio transceiver. Main constraint of a sensor node is the limitation of its energy resource in the form of a short battery life. Battery power conservation is very important in a sensor device since battery life is usually one of the critical components in extending the life time of sensor nodes and its network. Therefore energy optimization techniques must be performed while designing a network system. Problems of how to reduce energy consumption to maximize network lifetime has been studied extensively. But most of the approaches focus on selecting the shortest or energy-efficient routing path, often change in leader nodes based on residual energy, packet size optimization to prolong network lifetime. Work has been done on congestion control and minimization of packet collision, however congestion avoidance in sensor network has not received serious study until recently. The paper describes a network using congestion avoidance topology or CATopology where every wireless sensor is deterministically deployed throughout the sensing area. A congestion avoidance data retrieval strategy is proposed by forming an optimal congestion avoidance tree or CATree of sensor nodes using K-map and K-graph. Network ensures congestion free multi-hop data routing that significantly reduces packet collision and retransmission. As a result sink packet loss ratio and network end-to-end delay improves and maximizes energy efficiency and network lifetime.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"605 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133269985","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}
{"title":"Multi criteria routing in wireless sensor network using weighted product model and relative rating","authors":"Bijoy Das, S. Bhunia, Sarbani Roy, N. Mukherjee","doi":"10.1109/AIMOC.2015.7083841","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083841","url":null,"abstract":"Nowadays WSNs are expected to be an integral part of the extensive computing environment. But because of limited resource of the sensor nodes, it requires to manage an everincreasing need for efficient energy and resource management for both the sensor nodes as well as the overall sensor network. In sensor network, to provide the energy efficiency across all the sensor nodes, finding of efficient route is very important. Our algorithm proposes an efficient and multi-hop routing algorithm which is able to choose an efficient route between available routes by considering multiple important criteria for taking routing decision and at the same time to provide balanced energy consumption across all the sensor nodes.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134604813","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}
P. R. Ravi Teja, Subarna Chatterjee, S. Das, S. Misra
{"title":"Two-level mapping to mitigate congestion in machine to machine (M2M) cloud","authors":"P. R. Ravi Teja, Subarna Chatterjee, S. Das, S. Misra","doi":"10.1109/AIMOC.2015.7083837","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083837","url":null,"abstract":"This work focuses on mitigation of the network congestion in a Machine to Machine (M2M) cloud. Since the inception of M2M cloud communication technology, the number of M2M devices has radically increased. This has consequently increased the overall traffic of the network which, in turn, makes the entire network congestion prone. The work assumes an underlying clustered network topology of the M2M devices. We propose a hierarchical congestion control scheme in which we distinctly manage the network traffic by a two-level mapping - i) from the cluster heads (CHs) to the sink nodes and ii) from the sink nodes to the cloud gateways. To ensure \"fairness\", the mapping is based on the Theory of Social Choice. Results are demonstrated at the end which provide fair allocation of CHs to sink nodes and sink nodes to cloud gateways.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134293915","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}
{"title":"Optimized HMIPv6 (O-HMIPv6): reducing handoff latency in HMIPv6 networks","authors":"M. Rana, S. Mandal, B. Sardar","doi":"10.1109/AIMOC.2015.7083824","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083824","url":null,"abstract":"In this paper, we propose a seamless handoff management technique called optimized HMIPv6 (O-HMIPv6), an extension of HMIPv6, which eliminates the DAD procedure and router advertisement latency involved in regular HMIPv6 handoff procedure. The O-HMIPv6 is based on homogeneous prefix concept. The 64 bit IPv6 prefix is divided into two parts: network identifier (NID) and subnet identifier (SID). The HMIPv6 network is designed in such a way that each AR of a domain advertises the same NID. When an MN configures RCoA, MAP guarantees the uniqueness of NID and MN's IID pair within the MAP domain in a robust manner, so that the LCoA configuration does not require DAD procedure resulting in decreased handoff latency. When MN performs IP handoff, AR handles MN's movement detection process and it transfers the local mobility messages through the L2 messages. It eliminates the router advertisement latency and reduces the location update latency further. Through numerical results, we have shown that O-HMIPv6 reduces handoff latency almost 91% from HMIPv6 still keeping the signalling cost same.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"39 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124111627","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}
{"title":"Multiple sink deployment in multi-hop wireless sensor networks to enhance lifetime","authors":"Punyasha Chatterjee, Nabanita Das","doi":"10.1109/AIMOC.2015.7083829","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083829","url":null,"abstract":"For single sink multi-hop wireless sensor networks, the nodes close to the sink node forward the total network traffic to the sink. Hence, they exhaust their energy faster and energy-holes are formed near the sink node that reduces the lifetime of the network. To enhance the network lifetime and to reduce the packet delay, multiple sink node deployment strategies are proposed for better load balancing, where the network is partitioned into a number of subgraphs or clusters around unique sinks to gather data. For a large WSN, network lifetime is inversely proportional to the cluster diameter in terms of number of hops and the cost is directly proportional to the number of clusters i.e. the number of sinks. In this paper, a novel multi-sink deployment technique is proposed to optimize both the number of clusters and the cluster diameter, following a graph theoretic approach. Based on the classical random graph decomposition theorem [13], given a bound D on the cluster diameter, we propose a distributed greedy cluster-formation algorithm on randomly generated networks to generate a predefined number of clusters. Extensive simulation studies show that, the proposed algorithm generates clusters and the cluster diameter remains close to the bound D, in most of the cases.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127218663","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}
{"title":"An IPv6 based hierarchical address configuration scheme for smart grid","authors":"Manali Chakraborty, N. Chaki","doi":"10.1109/AIMOC.2015.7083838","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083838","url":null,"abstract":"Smart Grid (SG) is an intelligent and adaptive energy delivery network that combines the traditional power grid and IT communication network. It aims to provide more efficient, better fault-resilient and reliable energy support. Robust communication architecture is the key that differentiates Smart Grid from the traditional energy delivery system. IP enabled devices are necessary to build such network spread over a large geographic region and connecting devices starting from common household electrical appliances up to power generation units. With the huge number of devices including the smart electrical appliances, increasingly being used in homes, IPv6 become an obvious choice for Smart Grid for its bandwidth. However, one of the main challenges of connecting IPv6 with Smart Grid will be address configuration. In this paper, a new IPv6 address configuration schema for Smart Grid has been proposed. The proposed schema is consistent with the demands of large, dynamic, hierarchical smart grid network. The schema improves accessibility and scalability in terms of configuring a huge number of devices in the smart grid, thereby, fully extracting the potential of 128-bit IPv6 addressing mode.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115706035","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}
{"title":"Gathering of Asynchronous Mobile Robots in a Tree","authors":"Sumitro Bhaumik, S. Chaudhuri","doi":"10.1109/AIMOC.2015.7083836","DOIUrl":"https://doi.org/10.1109/AIMOC.2015.7083836","url":null,"abstract":"This paper addresses a robot-based distributed model which makes use of a group of small, inexpensive, identical, oblivious mobile robots placed in nodes of an anonymous and unoriented tree. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of its adjacent nodes (Compute), and in the latter case makes an instantaneous move to this neighbour (Move). Cycles are performed asynchronously for each robot. In this paper, we present a distributed algorithm by which κ robots deterministically gather at a single uniquely marked node in a tree with η nodes. The robots have limited visibility and have no common agreement in coordinate axes.","PeriodicalId":441902,"journal":{"name":"2015 Applications and Innovations in Mobile Computing (AIMoC)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115216515","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}