A. P. Shukla, Hitendra Garg, G. Varshneya, A. Srivastava
{"title":"Real time acquisition of vehicle diagnostic data using wireless sensor network","authors":"A. P. Shukla, Hitendra Garg, G. Varshneya, A. Srivastava","doi":"10.1109/WCSN.2009.5434800","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434800","url":null,"abstract":"Every manufacturer wants to produce quality products for that they required to implement some analytical procedure on the products, Live Data brings the real facts for the manufacturer to optimize the product performance in real time. By getting live data manufacturer decreases the risk and improve the quality of the products. Launching of new models is the result of past products, feedback through on and off line market survey. The launch of new product undergo through simulation. If simulation works properly then company launches a model based on the simulation. These models are tested against different parameter on different conditions. On these bases modification are done accordingly. The New approaches are to get real feedback or real /live data of the vehicle from wireless sensor network. These live data can be collected by embedding the different microprocessors which communicate with each other and also with the outside world. The system consists of a large number of sensors communicating through a wireless network, thus it is capable of tolerating multiple sensor failures, provides good coverage and high accuracy. The OSGi gateway will work as middleware. Wireless sensor network that is intended to operate as a sensing and monitoring system. The detected events are collected and transmitted to an external monitoring entity by a PDA inside the monitored model. PDA will use mobile service provider's GPRS gateway for out side communication.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124750269","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":"Throughput enhancement of starved TCP flow through concurrent transmission","authors":"R. Verma, A. Prakash, R. Tripathi, N. Tyagi","doi":"10.1109/WCSN.2009.5434784","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434784","url":null,"abstract":"Unfairness problems are critical to TCP flows in wireless multi-hop ad hoc networks. Unfortunately, the traditional TCP has poor interaction with the IEEE 802.11 MAC protocol. The spatial reuse of the channel can improve the performance of wireless ad hoc network. IEEE 802.11 MAC protocol uses DCF mode with extensions to RTS/ CTS, along with the limitation of at least four hop distance between two simultaneously transmitting nodes because of the control signal range which is slightly larger than twice the transmission range of a node. Due to this limitation along with greedy nature of TCP, starvation problem of TCP flows with longer paths is severe. By using concurrent transmission protocols at the MAC layer, like CTMAC, we can achieve simultaneous transmissions within the interference regions and thus increasing the spatial reuse of the channel. In this paper, we have shown with extensive simulations in NS-2 that scheduling multiple concurrent transmissions along the path links, the starvation problem can be reduced considerably and higher flow throughput is achieved.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187650","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 hop multi anchor geometrical computation based localization algorithm for wireless sensor networks with limited communication","authors":"S. B. Kotwal, Suryansh Nigam, S. Verma, R. Abrol","doi":"10.1109/WCSN.2009.5434804","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434804","url":null,"abstract":"This paper presents analysis of a geometrical computation based localization mechanism for wireless sensor networks. Authors analyze its accuracy for parameters like number of reference nodes, number of communications and different power level. Multiple anchors are used to analyze the performance of algorithm in terms of mean square error (m.s.e) of localization and no. of communications required. An unknown node determines its feasibility region of location from all communicable anchors with the help of available inaccurate distance and angle measurements. The advertisement of feasibility region of this node helps other nodes to further reduce their own feasibility region. The overall effect is reduction in the mean square error of localization. The number of iteration to achieve acceptable level of precision and accuracy is also taken into consideration. The results indicate that an increase in no of anchors or transmission range has a limited effect on localization error.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130852195","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}
V. K. Dwivedi, S. Tripathi, V. Tripathi, R. Tripathi, S. Tiwari
{"title":"Power sharing in wireless OFDM systems","authors":"V. K. Dwivedi, S. Tripathi, V. Tripathi, R. Tripathi, S. Tiwari","doi":"10.1109/WCSN.2009.5434789","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434789","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) has several properties which make it an attractive modulation scheme for high speed wireless transmission links. In this paper, a novel power sharing technique is proposed for different users to improve the system performance. The proposed technique is based on use of variable amplitude of subcarriers (VAS). Power can be increased to the users who are crossing the reference boundary (RB) and moving farther towards foot print (FP) of a cell. In this way the users having weak SNR can sustain their call even in multipath fading environment. Assuming knowledge of the instantaneous channel gain estimation for all users, we propose an OFDM dynamic adaptive subcarriers scheme to maintain optimum SNR level of the subchannels which are in deep fade. Simulation results show that the performance of the proposed algorithm is much better than that of other algorithms.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127335799","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":"LBAA: Level based address auto-configuration for ad hoc networks","authors":"S. Chetan, A. Potluri","doi":"10.1109/WCSN.2009.5434797","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434797","url":null,"abstract":"Mobile ad-hoc networks (MANETs) are infrastructure-less, multi-hop wireless networks. Nodes in the MANET have to be configured with unique addresses for unicast communications. As the nodes are mobile, the centralized administration does not suit for auto-configuration. So, we need a distributed address auto-configuration scheme for MANETs. Most of the existing schemes use DAD to ensure uniqueness, which consumes a lot of bandwidth which, in turn, causes energy wastage. In this paper, we propose the LBAA scheme which uses a large pool of unique addresses at each node with negligible space complexity. This scheme can be extended to large-scale MANETs with 100% uniqueness in address allocation. DAD is not needed for our scheme as each node maintains a dis-joint set of addresses. In the simulation results, we show that LBAA performs best in guaranteeing uniqueness and performs quite well in energy efficiency, allocation latency and nodes configured ratio.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124931562","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":"MOADRP: Mobile Ad-hoc Network Routing Protocol","authors":"Soumyabrata Saha, Suparna Das Gupta, R. Chaki","doi":"10.1109/WCSN.2009.5434793","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434793","url":null,"abstract":"Mobile Ad-hoc Networks (MANETs) have gained a lot of importance in the recent years due to their flexible ways of operation, where mobile nodes form the network to communicate with each other, without the aid of any fixed infrastructure. Routing in MANETs is a challenging task mostly for its rapidly changing topology. Several routing protocols have already been proposed and implemented for ad-hoc networks. This paper proposes a new approach to evolve a suitable algorithm named Mobile Ad-hoc Network Routing Protocol (MOADRP). This algorithm is used to find routes for message transmission between mobile nodes in MANETs. The main objective of this newly implemented routing protocol is to reduce the overhead of maintaining a large routing table and also reduce the time delay for finding the route.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123022904","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":"Strong law for number of edges on surface of a unit sphere","authors":"B. Gupta, Arvind Pandey","doi":"10.1109/WCSN.2009.5434812","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434812","url":null,"abstract":"In this article, we consider ‘N’ spherical caps of area 4πp were uniformly distributed over the surface of a unit sphere. We study the random intersection graph G<inf>N</inf> constructed by these caps. we derive the strong law results for the number of isolated vertices in G<inf>N</inf>: for p = c/N<sup>r</sup>, c > 0 for r < 1, there is no isolated vertex in G<inf>N</inf> almost surely i.e., there are atleast N/2 edges in G<inf>N</inf> and for r > 3, every vertex in G<inf>N</inf> is isolated i.e., there is no edge in edge set ε<inf>N</inf>.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116451223","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":"Improved cluster head election protocol (ICHEP) for heterogeneous wireless sensor networks","authors":"R. Singh, S. Verma, Y. Dewangan","doi":"10.1109/WCSN.2009.5434799","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434799","url":null,"abstract":"The lifetime of a wireless sensor network is constrained by the limited energy and processing capabilities of its nodes. The network lifetime can be maximized when the energy of different nodes of the network depletes uniformly during the sensing, processing and forwarding the data to the sink. Since, the energy required per bit for communication is around two orders of magnitude higher than computation, hence the task of sending the sensed data to the sink requires proper designation of nodes for this energy intensive task. In this paper we have considered the heterogeneity of the sensor network in terms of the initial energy of the sensor nodes. We assume that some of the nodes are having more energy than the normal nodes. Due to the heterogeneity present in the network, it is not possible to use the same protocol which is used for the homogeneous network. In this paper, the proposed cluster head selection technique uses the additional energy of the sensor node to increase the life time of the sensor network. The technique is a modification of LEACH (Low energy adaptive clustering hierarchy) protocol which is hierarchically clustered protocol. Our protocol also removes the instability caused with the death of first node.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128283104","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}
B. Kaarthick, V. J. Yeshwenth, P. Sudarsan, N. Nagarajan, Rajeev
{"title":"A robust estimation of the performance of various vocoders for a novel scheduling algorithm in IEEE 802.16e","authors":"B. Kaarthick, V. J. Yeshwenth, P. Sudarsan, N. Nagarajan, Rajeev","doi":"10.1109/WCSN.2009.5434785","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434785","url":null,"abstract":"The design of an efficient scheduling mechanism for providing QoS in IEEE 802.16e is usually left to the designers and is a serious challenge for system developers. The performance of various services catered by WiMAX depends on a proper scheduling algorithm combined with a proper mapping and encoding scheme. The contribution of this work is twofold. The first is that we infuse an efficient scheduling algorithm that would provide fair and effective resource allocations to all the Subscriber Stations in the network in different vocoders and determine the best vocoder that is suited for the algorithm. The second contribution of this work is that we provide an effective mapping technique to manage resource allocation to a number of voice CODECS along with the scheduling algorithm. The performance of the vocoders is later analyzed with the algorithm implemented along with the mapping technique. We evaluate the performance of the vocoders based on the following performance metrics: 1. Throughput 2. Delay, 3. MOS, 4. Jitter.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122153645","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 novel architecture for intelligent and adaptive wireless sensor network based alarming system","authors":"S. Udgata, G. Sindhura, S. L. Sabat","doi":"10.1109/WCSN.2009.5434805","DOIUrl":"https://doi.org/10.1109/WCSN.2009.5434805","url":null,"abstract":"Wireless Sensor Networks (WSN) play very important role in information and communication Technology (ICT) and have attracted a lot of attention lately. The importance of these networks are increasing exponentially due to its usage in monitoring wide variety of applications. In this paper, we propose a novel architecture for intelligent alarm generation in a wireless sensor zone. We developed a decision support system for continuous monitoring the logged data for quality assurance across the zone, to raise alerts in terms of mail or message or alarm following any violation in the safety norm in an intelligent and adaptive manner. We implemented the system, by creating a Wireless Sensor Network Zone using Crossbow Imote2 sensor nodes. The standard Zigbee 802.15.4 protocol is used for communication. Our prototype system generates alerts in terms of SMS to predefined and authenticated mobile number(s) following detection of alarm in terms of fire, light, object movement and pH, Temperature, Salinity, Dissolved Oxygen of drinking water.","PeriodicalId":260842,"journal":{"name":"2009 Fifth International Conference on Wireless Communication and Sensor Networks (WCSN)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126326586","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}