{"title":"Wireless sensor network prototype in virtual automation networks: Implementation and coexistence aspects","authors":"V. Lakkundi, J. Beran, M. Kratzig","doi":"10.1109/WCSN.2008.4772688","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772688","url":null,"abstract":"Wireless sensor networks enable scalable, self organizing, self-healing networks that can manage various data traffic patterns. They are fast gaining prominence in a multitude of applications including industrial communications and automation. This paper presents the research and development activities carried out within the virtual automation networks project towards realizing a wireless sensor network prototype and its implementation as well as its coexistence with other chosen wireless technologies.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121256439","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":"Design of low power multiplier with reduced spurious transition activity technique for wireless sensor network","authors":"S. Saravanan, M. Madheswaran","doi":"10.1109/WCSN.2008.4772678","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772678","url":null,"abstract":"This paper explores the implementation approaches of a low power modified booth multiplier (MBM) with reduced spurious transition activity technique (RSTAT) for DSP functions that encounter a wide diversity of operating scenarios in battery powered wireless sensor network system. This RSTAT approach has been applied on both the compression tree of multipliers and the modified booth encoder to enlarge the power clampdown, for high speed and low power purposes. To filter out the spurious switching power of the multiplier, there are two approaches, one is using registers and using AND gates, to assert the data signals of the multipliers after the data transition has been proposed. The RSTAT approach leads to a 40% power consumption reduction and speed improvement when compared with the other power minimization technique.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127558261","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 dynamic, real-time and on-demand heuristic broadcasting scheme for multiple data-item transactions in wireless environment","authors":"S. Udgata","doi":"10.1109/WCSN.2008.4772679","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772679","url":null,"abstract":"Broadcasting is used as a means of efficient and fast communication between an information-server to all the clients. Many broadcasting schemes have been proposed in the literature to achieve better performance in different communication scenario. In this paper, a new adaptive dynamic heuristic real-time multiple data-item broadcast-on-demand scheme is proposed. This proposed scheme (DHST-alpha,beta), which runs on the server, is used for preparing a broadcast schedule for temporal data (having a validity period) to satisfy client requests having multiple data-items with a fixed hard deadline time. Each request is considered as an atomic transaction i.e., a request transaction is supposed to be complete if and only if all the requested data-items in the request transaction could be broadcasted within the specified time limit. Simulation is done to study the performance of the proposed scheme together with the existing schemes.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130626216","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":"Node stability based clustering algorithm for mobile ad hoc networks","authors":"M. Chawla, J. Singhai, S. Jain, A. Shrivastava","doi":"10.1109/WCSN.2008.4772677","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772677","url":null,"abstract":"Node mobility is an important factor at the time of clustering in ad hoc network because it directly affects the stability of cluster. In the proposed work a distributed clustering algorithm which uses node mobility as a main concern with battery power and connectivity in terms of no. of neighbouring nodes for selecting cluster heads to achieve better stability is being introduced. The proposed node stability based clustering algorithm (NSBCA) improves cluster stability, manageability and energy efficiency in MANET. The algorithm does not require to know the location of the node to be monitored by external means like GPS or mobility to be calculated by monitoring signal strength, the node itself monitor and records its movement and uses this information to elect cluster-head.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116994252","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 new measure of survivability for a cellular network","authors":"N. Purohit, S. Tokekar","doi":"10.1109/WCSN.2008.4772711","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772711","url":null,"abstract":"Survivability is one of many words which were coined as a measure of degree to which a system is able to provide critical services. Many definitions have been proposed but the precise definition of survivability is still being debated. Especially the available measures of survivability for cellular networks do not cover many inherent features simultaneously. Many measures has been used to describe survivability of cellular systems such as the number of functioning units, the maximum traffic capacity, blocking probability and the service restoration time, etc. but a compact and effective measure of cellular network survivability is still required. In this work a new measure, survivability index (SI) has been introduced to fulfill the above requirement. It takes into account a few important features of cellular network viz. dropping probability, blocking probability, availability and voice quality, in terms of carrier to cochannel interference ratio (C/I). A weighted sum form is proposed and various desirable features of cellular network are mapped into constraint expressions. Then weights {w(k)} are evaluated using desired values of above features within the above constraints such that SI is maximized, which has been designated as SIref. The genetic algorithm (GA) has been used to get the optimum value of w(k) up to four place of decimal. QoS provided by the cellular network is proposed to be measured as % of SI provided by it above or below the SIref. An example cellular network is considered for discussions.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115412484","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":"Efficient localization scheme for wireless sensor networks","authors":"S. Ganesh","doi":"10.1109/WCSN.2008.4772685","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772685","url":null,"abstract":"Wireless sensor networks are shaping many activities in our society as they have become the epitome of pervasive technology. In Many Circumstances, it is useful or even necessary for a node in a wireless sensor network to be aware of its location in the physical world. For example tracking or event detection functions are not particularly useful if the WSN cannot provide any information where an event has happened. For WSN, placement of nodes will be mostly arbitrarily. For this reason grid- based approaches do not hold. Despite the efforts made, no system has emerged as a practical and robust solution for the node localization problem in realistic, complex, outdoor environments. In this paper we present a localization approach allows the execution of multiple localization schemes. This method ensure that a considerable decrease in localization error in comparison with the existing methods.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"139 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126213931","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":"GPS-less animal tracking system","authors":"Apurva Joshi, Naga VishnuKanth, Navkar Samdaria, Sumit Bagla","doi":"10.1109/WCSN.2008.4772694","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772694","url":null,"abstract":"mobile target tracking in sensor network field is an important area of wireless sensor network (WSN) application. The speed of target and constraints on WSN nodes vary from one application to another. In this paper, we report our work on application of WSN to track movements of small turtles in Wildlife Institute of India (WII) campus. This would allow wildlife researchers to understand behaviour of these turtles. These turtles are very small in size and Global Positioning System (GPS) based monitoring is not very useful. So we have developed a GPS-less system to track movement of these turtles. In addition, we monitor the micro-climate around the animal as well as monitor period of hibernation during winter time. We have carried out trial of this system in our campus with a simulated mobile target carrying one node with a grid of four fixed sensor nodes. This system uses incremental grid based approach to localize moving target. The data obtained is passed on to a Web based data server through a gateway and movement is shown on a digital map using a browser based visualization software utilizing Google Map APIs (application programming interface).","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124253941","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":"Analysis of MIMO capacity for spatial channel model with partial CSI knowledge","authors":"R. Saxena, R. Kumar","doi":"10.1109/CNC.2010.17","DOIUrl":"https://doi.org/10.1109/CNC.2010.17","url":null,"abstract":"Multiple-input multiple-output (MIMO) antenna systems provide high capacity gain over a single-antenna system. Much attention has been given to MIMO systems in recent past. In this paper, analysis over the capacity of the MIMO channel systems with spatial channel has been considered when the channel state information (CSI) is considered partially or imperfect since because only partial information can be obtained at the receiver end. It is known that channel gain is maximised when CSI is available at the transmitter. It is found that in the case of partial or imperfect CSI the capacity depends on the statistical properties of the error in the CSI. Based on the knowledge of statistical distributions of the deviations in CSI knowledge, a new approach which maximises a capacity of spatial channel model has been tried.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124729731","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 efficient hybrid MAC layer protocol utilized for wireless sensor networks","authors":"Ketan J. Sarvakar, P. Patel","doi":"10.1109/WCSN.2008.4772675","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772675","url":null,"abstract":"Wireless sensor networking is an emerging technology that has a wide range of potential applications. In this paper an efficient hybrid MAC layer protocol has been proposed, utilized ZigBee MAC (EZ-MAC), for sensor networks. Sensor networks have to manage variety of traffics such as real-time traffics and sensor traffics. Since most of real-time traffics are time-restricted, service access delay is a hot issue. In addition, sensor traffic has peculiar properties. In these points of view, EZ-MAC is one of the efficient solutions for MAC protocol in sensor networks. EZ-MAC has two main properties. First, it transmits data with low service access delay keeping access blocking ratio low by optimized structural sequence. Second, it consumes slightly lower power than conventional MAC protocols by introducing a scheduling scheme for sensor networks. Simulation results show both how much EZ-MAC can reduce the time-sensitive service access delay and how much it can enhance energy efficiency.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114985292","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":"Performance comparison of TCP NewReno and Vegas for IEEE 802.11e in multihop wireless networks","authors":"Rekha Jain, A. Gaiwak, P. D. Vyavahare","doi":"10.1109/WCSN.2008.4772713","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772713","url":null,"abstract":"As wireless local area networks (WLAN) become ubiquitous and an integral part of data networks, they will also be increasingly used for applications ranging from standard Internet services like ftp to time bound multimedia applications, such as Voice (or Video) over IP (VoIP/VIP), HDTV etc. with strict latency, throughput or jitter restrictions. These applications on WLAN will also be more bandwidth and QoS demanding. Earlier versions of 802.11, and its variants used in WLAN deployment, did not have provisions for such QoS features. In order to minimize redesign in medium access control (MAC) protocol, QoS support has been incorporated in 802.11e that has provision to map QoS metric into existing 802.11 MAC parameters for priority assignment and fair scheduling. In this paper, we investigate the performance of TCP NewReno and Vegas in static multihop wireless network over AODV routing protocol and evaluate it over MAC protocol IEEE 802.11e. Throughput has been quantitatively evaluated for various network topologies such as chain, cross and grid using network simulator NS-2.29. Simulation results show that IEEE 802.11e with TCP Vegas over AODV can be used as one of the strong candidate for real time multimedia applications such as voice or video over IP in WLAN.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128556204","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}