2008 Fourth International Conference on Wireless Communication and Sensor Networks最新文献

{"title":"Decentralised clustered and hash based intrusion detection system for wireless sensor networks","authors":"S. Patel, K. Pandey, V. Rathod","doi":"10.1109/WCSN.2008.4772676","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772676","url":null,"abstract":"Looking at the future of the wireless sensor networks and the applications which are likely to be deployed on it, the security is now becoming an evident feature. Lot many security architectures are proposed, but looking to the energy and memory constraints, the implementation still demands good amount of research. The simpler way seems is, to detect the intruder as early as possible and take the corrective steps for damage control. Here we propose an improved secured hash based IDS strategy using deployment knowledge. This knowledge and strategy can be used to prevent exterior and interior intruders using one way spatial and temporal hash functions.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"23 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":"124534825","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":"Performability and survivability analysis of GSM","authors":"N. Purohit, S. Tokekar","doi":"10.1109/WCSN.2008.4772710","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772710","url":null,"abstract":"The concept of performability takes into accounts both availability and performance of a system [1][2] and survivability is broadly defined as the degree to which a system is able to provide critical services [3]. The ideal survivability goal is to make a network failure imperceptible to the users by providing service continuity and minimizing network congestion. This paper addresses above issues for a Global System for Mobile (GSM) network. There exist many failure scenarios in GSM networks like base transreceiver station (BTS) failure, VLR, HLR or other database failure etc. When a BTS stops all functioning, it is designated as BTS failure which is primarily considered in developing models and further analysis. Markov models have been developed for accessing the performance, availability and survivability of GSM with a scheme developed for minimizing the impact of failure. Its merits over ordinary GSM network are established in terms of performability and various attributes of survivability following general framework discussed in [Yun Liu and Trivedi, 2003].","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":"131902878","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 analysis of space-time trellis codes with receive antenna selection","authors":"A. Hiwale, Ashok A. Ghatol, S. Bhad","doi":"10.1109/WCSN.2008.4772700","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772700","url":null,"abstract":"This paper discusses the performance analysis of multi-antennas systems with receive antenna selection over quasistatic fading channels. In performing the analysis with antenna selection, the selection criterion adopted is based on selecting best Nr antennas out of the available NR receive antennas such that the instantaneous signal-to-noise ratio (SNR) at the receiver is maximized. It is assumed that the total number of transmit antennas, NT = 2, are equal to or greater than the total number of receive antennas. From the analysis it is shown that the resulting diversity order with antenna selection is maintained as that of full complexity system, however the coding gain deteriorates in proportion with reduced number of receive antennas. The results obtained with antenna selection with NR = 2 and NR = 3 multi-antenna systems are compared.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"1 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":"132672372","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":"Distributed energy efficient routing in ad hoc networks","authors":"R. Joshi, P. Rege","doi":"10.1109/WCSN.2008.4772674","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772674","url":null,"abstract":"Ad hoc networks are non-infrastructure networks consisting of mobile nodes. Since the mobile nodes have limited battery power, it is very important to use energy efficiently in ad hoc networks. In order to maximize the lifetime of an ad hoc network, traffic should be sent via a route that can avoid nodes with low energy while minimizing the total transmission power. In addition, considering that the nodes of ad hoc networks are mobile, on-demand routing protocols are preferred for ad hoc networks. Existing power-aware routing algorithm need to be modified to meet the requirement of energy efficient routing and also this on demand protocol should be addressing mobility issue. In this paper we propose a novel on-demand power aware routing algorithm, DEEAR (Distributed Energy-efficient AODV Routing) protocol. DEEAR prolongs the network lifetime by compromising between minimum energy consumption and fair energy consumption without additional control packets. DEEAR also improves network throughput as well as improvement in data packet delivery ratio.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"31 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":"126687085","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":"Length-based anchor-free distributed localization in a covered sensor network","authors":"B. Sau, K. Mukhopadhyaya","doi":"10.1109/WCSN.2008.4772686","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772686","url":null,"abstract":"Centralized localization dissipates a lot of energy in pooling the proximity information of the individual nodes. In contrast a distributed algorithm usually uses only local information at each node. Most localization algorithms available in the literature are are anchor based or they estimate the position of the sensors at the cost of losing accuracy. In this paper, we propose an anchor-free length-based distributed localization technique under a restricted model which solves a specialized case of this problem. The model assumes that all known distances between the sensors are less than the communication range of the sensors and all unknown distances are greater. We also assume that communication range is at least twice as much as the sensing range. Every point in the field of interest is assumed to be covered by some sensor. Each sensor localizes some of its neighbours with information from its neighbours. Each node communicates information for localization to its neighbours only; thus reducing traffic over the network. We also show that, the time required to localize all sensors uniquely under this model is linear in the number of sensors.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"22 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":"125222040","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":"Spectrum hand-off schemes and optimum utilization of spectrum holes in cognitive radio networks","authors":"C. Viz, S. Udgata","doi":"10.1109/WCSN.2008.4772707","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772707","url":null,"abstract":"Two main problems in wireless communications are (1) limited available spectrum and (2) inefficiency in the spectrum allocation policy. These problems lead to the blocking of both initial and hand-off calls. We propose a spectrum allocation scheme in two phases. In the first phase, a collision between two calls for spectral band allocation is resolved. In second phase, spectral band allocation among a number of calls is considered. The main objective for the schemes is to minimize the forced termination of hand-off calls and an opportunistic spectrum channel allocation is achieved by assigning different priority levels to different calls.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"41 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":"125254360","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":"Smart vibration sensor with wireless communication for recording & analyzing Train Vibration","authors":"A. Dubey, A. Verma","doi":"10.1109/WCSN.2008.4772695","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772695","url":null,"abstract":"High-speed trains are one of the most impressive developments of the recent years having brought a new degree of comfort for travelers. These train posed serious accidents because of the high level of vibration, which they can generate. In the present paper a smart vibration sensor is developed which is a self-sensation device equipped with recording and wireless communication interface. One programmed microcontroller 89C52 is used, which record vibration of trains with real time into memory.There is certain limit of vibrations, which is acceptable by track. Beyond this limit track can be damaged and may result major casualty.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"24 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":"126673778","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":"Secure path loss prediction using fuzzy logic approach","authors":"A. Gupta, S.C. Sharma, Sandip Vijay, V. Gupta","doi":"10.1109/WCSN.2008.4772717","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772717","url":null,"abstract":"Efficiency of present path loss models suffers when they are used in the environment other than for which they have been designed. The aim of this paper is to propose the predicting the path loss with the field measurement models and represent them in a more convenient form for the proposed fuzzy logic modeling. This paper proposes method to predict path loss for correct location of base station in cellular mobile communication systems using fuzzy logic. The propagation medium is classified in to several well-established propagation environments defined as a fuzzy set such as free space, flat area terrain, light vegetation terrain, heavy vegetation terrain, and village terrain. A unique mean path loss exponent (n) is assigned to each propagation environment, which is established by means of the experimental. Fuzzy logic is used to determine ldquonrdquo number for an unknown environment, which will be obtained using linguistic rules that provide a fine-tuning of the known propagation environments. HATA model proposed by M. Hata has been used for the present analysis.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"26 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":"125920206","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":"Security topology in wireless sensor networks with routing optimisation","authors":"M. Ismail, M. Y. Sanavullah","doi":"10.1109/WCSN.2008.4772673","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772673","url":null,"abstract":"Multiple sensor nodes deployed in a common neighborhood to sense an event and subsequently transmit sensed information to a remote processing unit or base station, has been the recent focus of research. Tiny sensor nodes, which consist of sensing, data processing, and communicating components, leverage the idea of sensor networks based on collaborative effort of a large number of nodes. These numerous sensors are used (similar to different sensory organs in human beings) for delivering crucial information in real-time from environments and processes, where data collection is impossible previously with wired sensors [1]. Typically, wireless sensor networks are composed of low power sensor nodes and integrate general-purpose computing with heterogeneous sensing and wireless communication. Their emergence has enabled observation of the physical world at an unprecedented level of granularity. One of the most important components of a sensor node is the power unit and may be supported in most applications by a power scavenging unit such as solar cells. Hence, there is a major limitation in a wireless sensor networks, such as, the sensor nodes must consume extremely low power. Also, wireless networks are subject to various kinds of attacks and wireless communication links can be eavesdropped on without noticeable effort and communication protocols on all layers are vulnerable to specific attacks. In contrast to wire-line networks, known attacks like masquerading, man-in-the-middle, and replaying of messages can easily be carried out. Hence, a fundamental issue in the design of wireless sensor networks is the reliability i.e. how long can the wireless sensor networks survive and how well are the wireless sensor networks recovery after the malicious attacks. In this context, in this thesis, the power, mobility, and task management planes that can monitor the power, movement, and task distribution among the sensor nodes are proposed. These planes help the sensor nodes coordinate the sensing task and also lower the overall power consumption. In addition, a secure topology discovery algorithm is proposed and its performance is studied for different types of node distributions. The proposed work is the development of architecture for secure communication in mobile wireless networks. The approach divides the network into clusters and implements a decentralized certification authority. Decentralization is achieved using threshold cryptography and a network secret that is distributed over a number of nodes. While this basic idea has been proposed earlier partially, its application on a clustered network is a novelty.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"8 1 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":"132020399","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 algorithm of encryption in non-cooperation IFF system","authors":"Ya Zhang, Bo Li, Shizhong Li","doi":"10.1109/WCSN.2008.4772696","DOIUrl":"https://doi.org/10.1109/WCSN.2008.4772696","url":null,"abstract":"The technology of identification of friend or foe(IFF) has been extensively applied in the information warfare with the development of science and technology. The Algorithm of dynamic encryption based on current date as seed, two times operation to the seed by two groups of keys, is put in Non-Cooperation IFF system in this paper, which data quantity is smaller and security, reliability, confidentiality also could meet the need of requirement, so it fit high dynamic and high mobility weapon system.","PeriodicalId":338962,"journal":{"name":"2008 Fourth International Conference on Wireless Communication and Sensor Networks","volume":"111 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":"132158202","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}