Pub Date : 2009-03-23DOI: 10.1109/ISADS.2009.5207328
S. Reddy, V. Samanta, J. Burke, D. Estrin, Mark H. Hansen, M. Srivastava
Cellular and Wi-Fi networks now form a global substrate that provides billions of mobile phone users with consistent, location-aware communication and multimedia data access. On this substrate is emerging a new class of mobile phone applications that use the phones location, image and acoustic sensors, and enable people to choose what to sense and when to share data about themselves and their surroundings. Peoples' natural movement through and among living, work, and “third” spaces, provides spatial and temporal coverage for these modalities, the character of which is impossible to achieve through embedded instrumentation alone. This paper proposes a network service architecture for participatory sensing, describing challenges in (1) network coordination services enabling applications to efficiently select, incentivize and task mobile users based on measures of coverage, capabilities and interests; (2) attestation mechanisms to enable data consumers to assign trust to the data they access; and (3) participatory privacy regulation mechanisms used by data contributors to control what data they share.
{"title":"MobiSense — mobile network services for coordinated participatory sensing","authors":"S. Reddy, V. Samanta, J. Burke, D. Estrin, Mark H. Hansen, M. Srivastava","doi":"10.1109/ISADS.2009.5207328","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207328","url":null,"abstract":"Cellular and Wi-Fi networks now form a global substrate that provides billions of mobile phone users with consistent, location-aware communication and multimedia data access. On this substrate is emerging a new class of mobile phone applications that use the phones location, image and acoustic sensors, and enable people to choose what to sense and when to share data about themselves and their surroundings. Peoples' natural movement through and among living, work, and “third” spaces, provides spatial and temporal coverage for these modalities, the character of which is impossible to achieve through embedded instrumentation alone. This paper proposes a network service architecture for participatory sensing, describing challenges in (1) network coordination services enabling applications to efficiently select, incentivize and task mobile users based on measures of coverage, capabilities and interests; (2) attestation mechanisms to enable data consumers to assign trust to the data they access; and (3) participatory privacy regulation mechanisms used by data contributors to control what data they share.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123548694","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207383
Hiroshi Nakagawa, Kazuyuki Nakamaru, T. Ohta, Y. Kakuda
Recently in ad hoc networks, routing schemes using location information which is provided by GPS (Global Position System) have been proposed. This paper proposes a new hierarchical routing protocol based on the autonomous clustering scheme using the location information of nodes and shows the effectiveness of the proposed hierarchical routing in comparison with GPSR, Hi-AODV and AODV through simulation experiments with respect to the amount of control packets and the data delivery ratio.
{"title":"A hierarchical routing scheme with location information on autonomous clustering for mobile ad hoc networks","authors":"Hiroshi Nakagawa, Kazuyuki Nakamaru, T. Ohta, Y. Kakuda","doi":"10.1109/ISADS.2009.5207383","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207383","url":null,"abstract":"Recently in ad hoc networks, routing schemes using location information which is provided by GPS (Global Position System) have been proposed. This paper proposes a new hierarchical routing protocol based on the autonomous clustering scheme using the location information of nodes and shows the effectiveness of the proposed hierarchical routing in comparison with GPSR, Hi-AODV and AODV through simulation experiments with respect to the amount of control packets and the data delivery ratio.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124804458","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207354
S. Karnouskos, Mian Mohammad Junaid Tariq
A common practice in enterprise environments is the usage of Service Oriented Architectures (SOA) which implies heavy usage of web services. Lately the trend is to extend these approaches down to the embedded device layer i.e. have devices running web services natively and offer their functionality as a service. The Internet of Things (IoT) envisions millions of such heterogeneous, usually mobile, devices communicating with each other creating a very dynamic infrastructure. In this paper we concentrate on our efforts to use a multi-agent system to simulate this emerging dynamic infrastructure populated with large number of web-service enabled devices.
{"title":"Using multi-agent systems to simulate dynamic infrastructures populated with large numbers of web service enabled devices","authors":"S. Karnouskos, Mian Mohammad Junaid Tariq","doi":"10.1109/ISADS.2009.5207354","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207354","url":null,"abstract":"A common practice in enterprise environments is the usage of Service Oriented Architectures (SOA) which implies heavy usage of web services. Lately the trend is to extend these approaches down to the embedded device layer i.e. have devices running web services natively and offer their functionality as a service. The Internet of Things (IoT) envisions millions of such heterogeneous, usually mobile, devices communicating with each other creating a very dynamic infrastructure. In this paper we concentrate on our efforts to use a multi-agent system to simulate this emerging dynamic infrastructure populated with large number of web-service enabled devices.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121876080","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207323
Alexandros Antonopoulos, K. Stefanidis, A. Voyiatzis
A spammer is making profit and stays in business even when a tiny fraction of recipients replies to spam messages. Despite enormous effort put in spam identification and elimination, spam is still dominating our inbox. We seek a novel and complementary approach to force spammers stop sending unsolicited messages. Our approach is to artificially inflate the number of available recipients by contaminating spammers' databases with addresses not monitored by human beings. Thus, we aim to drastically reduce the number of messages delivered to human beings as to reduce the response rate.
{"title":"Fighting spammers with spam","authors":"Alexandros Antonopoulos, K. Stefanidis, A. Voyiatzis","doi":"10.1109/ISADS.2009.5207323","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207323","url":null,"abstract":"A spammer is making profit and stays in business even when a tiny fraction of recipients replies to spam messages. Despite enormous effort put in spam identification and elimination, spam is still dominating our inbox. We seek a novel and complementary approach to force spammers stop sending unsolicited messages. Our approach is to artificially inflate the number of available recipients by contaminating spammers' databases with addresses not monitored by human beings. Thus, we aim to drastically reduce the number of messages delivered to human beings as to reduce the response rate.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121279769","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207360
T. Kunifuji, G. Kogure, K. Mori, Jun Nishiyama
Amount of construction about railway signalling system is steadily increasing to improve the transport service for the customer. But, at present efficiency of signal construction is very low. For example it is caused by that the period for the construction is limited to very short time at mid-night or flexibility of the signalling system is low from its system architecture. To solve these problems innovative railway signalling system utilizing network and autonomous technology are proposed. In this paper, first the network signalling system which is the basis of this innovation is described. Next, integrated logical controller which applied autonomous decentralized architecture to its software is proposed as future plan.
{"title":"Innovation of the railway signalling system utilizing the network and the autonomous decentralized technology","authors":"T. Kunifuji, G. Kogure, K. Mori, Jun Nishiyama","doi":"10.1109/ISADS.2009.5207360","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207360","url":null,"abstract":"Amount of construction about railway signalling system is steadily increasing to improve the transport service for the customer. But, at present efficiency of signal construction is very low. For example it is caused by that the period for the construction is limited to very short time at mid-night or flexibility of the signalling system is low from its system architecture. To solve these problems innovative railway signalling system utilizing network and autonomous technology are proposed. In this paper, first the network signalling system which is the basis of this innovation is described. Next, integrated logical controller which applied autonomous decentralized architecture to its software is proposed as future plan.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129605771","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207347
Marcelo Cheminn Madruga, S. Loest, C. Maziero
The peer-to-peer model and the bandwidth availability are fostering the creation of new distributed file systems. However, files belonging to local application and distributed applications are usually handled in the same way by the local file system, so both contribute equally to consume storage space. This paper presents a peer-to-peer distributed file system which uses the “transparent file” concept to improve its fault tolerance and file availability. Files are kept as transparent/volatile replicas, using the free space available in each local file system. When a replica is invalidated, peers cooperate to restore it. The proposed architecture was implemented and tested; experiments showed its feasilibity, and that its costs are proportional to the size of files being replicated. The occurrence of multiple simultaneous replica invalidations did not impose a significant overhead.
{"title":"Using transparent files in a fault tolerant distributed file system","authors":"Marcelo Cheminn Madruga, S. Loest, C. Maziero","doi":"10.1109/ISADS.2009.5207347","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207347","url":null,"abstract":"The peer-to-peer model and the bandwidth availability are fostering the creation of new distributed file systems. However, files belonging to local application and distributed applications are usually handled in the same way by the local file system, so both contribute equally to consume storage space. This paper presents a peer-to-peer distributed file system which uses the “transparent file” concept to improve its fault tolerance and file availability. Files are kept as transparent/volatile replicas, using the free space available in each local file system. When a replica is invalidated, peers cooperate to restore it. The proposed architecture was implemented and tested; experiments showed its feasilibity, and that its costs are proportional to the size of files being replicated. The occurrence of multiple simultaneous replica invalidations did not impose a significant overhead.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127196452","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207332
K. Mahmood, S. Niki, Xiaodong Lu, K. Mori
Community Time-distance-oriented Context-aware Information Environment (CTCIE) incorporates time-awareness and demand-oriented perspectives to revamp one-dimensional rudimentary Location Based Services (LBS) into threedimensional Community Pervasive Services (CPS). Proposed Autonomous Decentralized Community System (ADCS) framework enables provision of customized CPS to specific users in specific place at specific time. ADCS employs novel idea of Ripple-based Multi-target Context-cognizant Service Discovery (RMCSD) technique to empower flexible means to sophisticated selection of right service to right user at right place in transparent way, by utilizing context information of surrounding situations (traffic conditions, topographical features, service validity time etc). To further enhance timeliness, hybrid pull-push mechanism of RMCSD is extended to cache the service contents of the most relevant service. However, given multiple service providers, there exists tradeoff between accuracy of information and overall response time perceived by the users. The vigilant design of proposed Autonomous Community Service Area Reconstruction Technology (ACS-ART) procures high assurance: provision of right service with least access time. Simulation results verify the effectiveness of the proposed techniques.
{"title":"Autonomous hybrid pull-push Context-aware community service dissemination technology to achieve high assurance","authors":"K. Mahmood, S. Niki, Xiaodong Lu, K. Mori","doi":"10.1109/ISADS.2009.5207332","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207332","url":null,"abstract":"Community Time-distance-oriented Context-aware Information Environment (CTCIE) incorporates time-awareness and demand-oriented perspectives to revamp one-dimensional rudimentary Location Based Services (LBS) into threedimensional Community Pervasive Services (CPS). Proposed Autonomous Decentralized Community System (ADCS) framework enables provision of customized CPS to specific users in specific place at specific time. ADCS employs novel idea of Ripple-based Multi-target Context-cognizant Service Discovery (RMCSD) technique to empower flexible means to sophisticated selection of right service to right user at right place in transparent way, by utilizing context information of surrounding situations (traffic conditions, topographical features, service validity time etc). To further enhance timeliness, hybrid pull-push mechanism of RMCSD is extended to cache the service contents of the most relevant service. However, given multiple service providers, there exists tradeoff between accuracy of information and overall response time perceived by the users. The vigilant design of proposed Autonomous Community Service Area Reconstruction Technology (ACS-ART) procures high assurance: provision of right service with least access time. Simulation results verify the effectiveness of the proposed techniques.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129059052","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207351
Y. Teranishi, Y. Yokohata, S. Shimojo, M. Takemoto, Makoto Hamada, Keita Kumamaru, Toshirou Nakamura
We have been studying a service coordination technology that enables users to use the various types of service elements that are available in a ubiquitous computing and networking environment. We have adopted a user context handling mechanism to choose suitable service components. In this paper, we proposed an adaptive information delivery method for personalized recommendation and information provisioning. This method can provide information services based on user location, preferences, or moving history to everyone, everywhere, using a mobile phone. This system is an information circulation system based on social capital, which refers to connections between social networks. Users can obtain information about events, sightseeing information, gourmet information, disaster prevention information from SNS by marking the location information. We also applied a location-dependent recommendation method based on user's movement history. We conducted a field trial to evaluate feasibility of the system. According to the results of our questionnaire, the information-provision style is acceptable to the users. In addition, according to the analysis of the user movement and user preferences, there was a correlation between user's visited place and interested genres.
{"title":"Field trial evaluation of a location-aware social capital service","authors":"Y. Teranishi, Y. Yokohata, S. Shimojo, M. Takemoto, Makoto Hamada, Keita Kumamaru, Toshirou Nakamura","doi":"10.1109/ISADS.2009.5207351","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207351","url":null,"abstract":"We have been studying a service coordination technology that enables users to use the various types of service elements that are available in a ubiquitous computing and networking environment. We have adopted a user context handling mechanism to choose suitable service components. In this paper, we proposed an adaptive information delivery method for personalized recommendation and information provisioning. This method can provide information services based on user location, preferences, or moving history to everyone, everywhere, using a mobile phone. This system is an information circulation system based on social capital, which refers to connections between social networks. Users can obtain information about events, sightseeing information, gourmet information, disaster prevention information from SNS by marking the location information. We also applied a location-dependent recommendation method based on user's movement history. We conducted a field trial to evaluate feasibility of the system. According to the results of our questionnaire, the information-provision style is acceptable to the users. In addition, according to the analysis of the user movement and user preferences, there was a correlation between user's visited place and interested genres.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129134874","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207340
Euisin Lee, Soochang Park, Hosung Park, Jeongchul Lee, Sang-Ha Kim
Geographic routing has been considered as a scalable approach in ad-hoc and sensor networks since it exploits pure position information of neighbors and a destination node instead of global topology information to route data packets. To obtain the position information of the neighbors, many geographic routing protocols assume that each node exchange periodically its own position information with its neighbors. However, these periodically position exchanges in regions without packet forwarding make nodes consume unnecessary energy. In addition, given that the nodes have mobility, when a node forwards a packet, the position information of its neighbor nodes may be invalid. Hence, in these mobile networks, it is more efficient that a mobile node collects the position information of its neighbors when it needs to forward a packet. Because every sender node in geographic routing also selects the nearest neighbor node to the destination node as the receiver node, obtaining the position information of only closer neighbor nodes to the destination node can save more wireless resources than obtaining that of all neighbor nodes. In large-scale networks, because many wireless collisions can happen due to position exchanges of many neighbor nodes, they should share limited wireless resources. Therefore, we propose a mechanism to solve these issues of geographic routing in large-scale mobile networks. Simulation results show that the proposed mechanism has better performance than the existing geographic routing protocols.
{"title":"Geographic routing based on on-demand neighbor position information in large-scale mobile sensor networks","authors":"Euisin Lee, Soochang Park, Hosung Park, Jeongchul Lee, Sang-Ha Kim","doi":"10.1109/ISADS.2009.5207340","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207340","url":null,"abstract":"Geographic routing has been considered as a scalable approach in ad-hoc and sensor networks since it exploits pure position information of neighbors and a destination node instead of global topology information to route data packets. To obtain the position information of the neighbors, many geographic routing protocols assume that each node exchange periodically its own position information with its neighbors. However, these periodically position exchanges in regions without packet forwarding make nodes consume unnecessary energy. In addition, given that the nodes have mobility, when a node forwards a packet, the position information of its neighbor nodes may be invalid. Hence, in these mobile networks, it is more efficient that a mobile node collects the position information of its neighbors when it needs to forward a packet. Because every sender node in geographic routing also selects the nearest neighbor node to the destination node as the receiver node, obtaining the position information of only closer neighbor nodes to the destination node can save more wireless resources than obtaining that of all neighbor nodes. In large-scale networks, because many wireless collisions can happen due to position exchanges of many neighbor nodes, they should share limited wireless resources. Therefore, we propose a mechanism to solve these issues of geographic routing in large-scale mobile networks. Simulation results show that the proposed mechanism has better performance than the existing geographic routing protocols.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133569420","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 : 2009-03-23DOI: 10.1109/ISADS.2009.5207336
Jeongcheol Lee, Hosung Park, Taehee Kim, Min-Sook Jin, Sang-Ha Kim
Typical multicasting saves efficiently both bandwidth and energy in static wireless sensor networks. Such benefits make the research of multicast which is a transmission from a data source to multiple destinations (sinks), actively. Most of these researches focused on the way how to make efficient multicast tree only, they are weak for supporting mobile sinks. In practical applications, sinks move around and collect information from a sensor field. If the mobile sinks apply to these approaches, frequent entire multicast tree reconstructions are needed to support mobile sinks. Unfortunately, it leads to exhaustion of sensors' limited power supply, consequently it reduces whole network lifetime. In this paper, we propose an energy-efficient multicast protocol to support multiple mobile sinks by the local multicast tree reconstruction, called Local Updated-based geographic Multicasting for Mobile sinks (LUMM) for wireless sensor networks. A value of BOD (benefit of distance) used a standard from a local multicast tree reconstruction with minimal overhead. Our simulation results show that LUMM support the mobility of sinks efficiently.
{"title":"LUMM: Local Update-based geographic Multicasting for Mobile sinks","authors":"Jeongcheol Lee, Hosung Park, Taehee Kim, Min-Sook Jin, Sang-Ha Kim","doi":"10.1109/ISADS.2009.5207336","DOIUrl":"https://doi.org/10.1109/ISADS.2009.5207336","url":null,"abstract":"Typical multicasting saves efficiently both bandwidth and energy in static wireless sensor networks. Such benefits make the research of multicast which is a transmission from a data source to multiple destinations (sinks), actively. Most of these researches focused on the way how to make efficient multicast tree only, they are weak for supporting mobile sinks. In practical applications, sinks move around and collect information from a sensor field. If the mobile sinks apply to these approaches, frequent entire multicast tree reconstructions are needed to support mobile sinks. Unfortunately, it leads to exhaustion of sensors' limited power supply, consequently it reduces whole network lifetime. In this paper, we propose an energy-efficient multicast protocol to support multiple mobile sinks by the local multicast tree reconstruction, called Local Updated-based geographic Multicasting for Mobile sinks (LUMM) for wireless sensor networks. A value of BOD (benefit of distance) used a standard from a local multicast tree reconstruction with minimal overhead. Our simulation results show that LUMM support the mobility of sinks efficiently.","PeriodicalId":342911,"journal":{"name":"2009 International Symposium on Autonomous Decentralized Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133638703","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
扫码关注我们
求助内容：
应助结果提醒方式：