Shiva Shankar Reddy, K. Murthy, V MNSSVKR GUPTA, D. Ravibabu
{"title":"数据分层整理无线传感器网络","authors":"Shiva Shankar Reddy, K. Murthy, V MNSSVKR GUPTA, D. Ravibabu","doi":"10.21172/1.73.5779","DOIUrl":null,"url":null,"abstract":"WSNs are significantly used in many of the real-world applications in the last decade, like wild habitat monitoring, volcano and fire monitoring, urban sensing, and military surveillance. In many of the situations, the sensor nodes shape a multi-hop network as the base station (BS) operates as the Central point of the control. Usually, sensor nodes computing power and resources of energy are limited. The BS wishes to gather the sensed information from the network. The familiarpath is to permitevery sensor node to send its reading to the BS, probablythroughthe other intermediate nodes. Lastly, the BS progresses the data that is received from the individual nodes. On the other hand, this procedure is prohibitively costly in terms of communication overhead. Data aggregation in a networkis able todecrease the amount of communication and therefore the energy consumed, particularly in big WSNs. The most importantplan is to merge partial outcomes at intermediate nodes throughout message routing. One of the approaches is to build a spanning tree rooted at BS, and nextcarry out in-network aggregation along the tree. The significant aggregates taken by the research community comprise Count, and the Sum. It is simple to simplify these","PeriodicalId":92913,"journal":{"name":"International journal of latest trends in engineering & technology : IJLTET","volume":"7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data stratified collation wireless sensor networks\",\"authors\":\"Shiva Shankar Reddy, K. Murthy, V MNSSVKR GUPTA, D. Ravibabu\",\"doi\":\"10.21172/1.73.5779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"WSNs are significantly used in many of the real-world applications in the last decade, like wild habitat monitoring, volcano and fire monitoring, urban sensing, and military surveillance. In many of the situations, the sensor nodes shape a multi-hop network as the base station (BS) operates as the Central point of the control. Usually, sensor nodes computing power and resources of energy are limited. The BS wishes to gather the sensed information from the network. The familiarpath is to permitevery sensor node to send its reading to the BS, probablythroughthe other intermediate nodes. Lastly, the BS progresses the data that is received from the individual nodes. On the other hand, this procedure is prohibitively costly in terms of communication overhead. Data aggregation in a networkis able todecrease the amount of communication and therefore the energy consumed, particularly in big WSNs. The most importantplan is to merge partial outcomes at intermediate nodes throughout message routing. One of the approaches is to build a spanning tree rooted at BS, and nextcarry out in-network aggregation along the tree. The significant aggregates taken by the research community comprise Count, and the Sum. It is simple to simplify these\",\"PeriodicalId\":92913,\"journal\":{\"name\":\"International journal of latest trends in engineering & technology : IJLTET\",\"volume\":\"7 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of latest trends in engineering & technology : IJLTET\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21172/1.73.5779\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of latest trends in engineering & technology : IJLTET","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21172/1.73.5779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Data stratified collation wireless sensor networks
WSNs are significantly used in many of the real-world applications in the last decade, like wild habitat monitoring, volcano and fire monitoring, urban sensing, and military surveillance. In many of the situations, the sensor nodes shape a multi-hop network as the base station (BS) operates as the Central point of the control. Usually, sensor nodes computing power and resources of energy are limited. The BS wishes to gather the sensed information from the network. The familiarpath is to permitevery sensor node to send its reading to the BS, probablythroughthe other intermediate nodes. Lastly, the BS progresses the data that is received from the individual nodes. On the other hand, this procedure is prohibitively costly in terms of communication overhead. Data aggregation in a networkis able todecrease the amount of communication and therefore the energy consumed, particularly in big WSNs. The most importantplan is to merge partial outcomes at intermediate nodes throughout message routing. One of the approaches is to build a spanning tree rooted at BS, and nextcarry out in-network aggregation along the tree. The significant aggregates taken by the research community comprise Count, and the Sum. It is simple to simplify these