M phil-computer-science-wireless-communication-projects
1 like538 views
The document outlines various projects related to wireless communication in computer science, detailing their objectives and contributions. Key projects include an energy-efficient clustering solution for wireless sensor networks, privacy preservation in multihop networks using network coding, and data collection algorithms utilizing mobile robots in partitioned networks. Performance evaluations demonstrate notable improvements in energy efficiency and privacy protection across the proposed methods.
M phil-computer-science-wireless-communication-projects
- 1. M.Phil Computer Science Wireless Communication Projects Web : www.kasanpro.com Email : sales@kasanpro.com List Link : http://kasanpro.com/projects-list/m-phil-computer-science-wireless-communication-projects Title :An Energy Efficient Clustering Solution for Wireless Sensor Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/energy-efficient-clustering-wireless-sensor-network Abstract : Hot spots in a wireless sensor network emerge as locations under heavy traffic load. Nodes in such areas quickly deplete energy resources, leading to disruption in network services. This problem is common for data collection scenarios in which Cluster Heads (CH) have a heavy burden of gathering and relaying information. The relay load on CHs especially intensifies as the distance to the sink decreases. To balance the traffic load and the energy consumption in the network, the CH role should be rotated among all nodes and the cluster sizes should be carefully determined at different parts of the network. This paper proposes a distributed clustering algorithm, Energy-efficient Clustering (EC), that determines suitable cluster sizes depending on the hop distance to the data sink, while achieving approximate equalization of node lifetimes and reduced energy consumption levels. We additionally propose a simple energy-efficient multihop data collection protocol to evaluate the effectiveness of EC and calculate the end-to-end energy consumption of this protocol; yet EC is suitable for any data collection protocol that focuses on energy conservation. Perfor- mance results demonstrate that EC extends network lifetime and achieves energy equalization more effectively than two well- known clustering algorithms, HEED and UCR. Title :Network Coding Based Privacy Preservation against Traffic Analysis in Multi-hop Wireless Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/network-coding-based-privacy-preservation-multi-hop-wireless-networks Abstract : Privacy threat is one of the critical issues in multihop wireless networks, where attacks such as traffic analysis and flow tracing can be easily launched by a malicious adversary due to the open wireless medium. Network coding has the potential to thwart these attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve the goal once enough packets are collected by the adversaries. On the other hand, the coding/mixing nature precludes the feasibility of employing the existing privacy-preserving techniques, such as Onion Routing. In this paper, we propose a novel network coding based privacy-preserving scheme against traffic analysis in multihop wireless networks. With homomorphic encryption, the proposed scheme offers two significant privacy-preserving features, packet flow untraceability and message content confidentiality, for efficiently thwarting the traffic analysis attacks. Moreover, the proposed scheme keeps the random coding feature. Theoretical analysis and simulative evaluation demonstrate the validity and efficiency of the proposed scheme. Title :Distributed Adaptation of Quantized Feedback for Downlink Network MIMO Systems Language : C# Project Link : http://kasanpro.com/p/c-sharp/distributed-adaptation-quantized-feedback-downlink-network-mimo-systems Abstract : This paper focuses on quantized channel state information (CSI) feedback for downlink network MIMO systems. Specifically, we propose to quantize and feedback the CSI of a subset of BSs, namely the feedback set. Our analysis reveals the tradeoff between better interference mitigation with large feedback set and high CSI quantization precision with small feedback set. Given the number of feedback bits and instantaneous/long-term channel conditions, each user optimizes its feedback set distributive according to the expected SINR derived from our analysis. Simulation results show that the proposed feedback adaptation scheme provides substantial performance gain over non-adaptive schemes, and is able to effectively exploit the benefits of network MIMO under various feedback bit budgets. Title :A Spatiotemporal Approach for Secure Range Queries in Tiered Sensor Networks Language : C#
- 2. Project Link : http://kasanpro.com/p/c-sharp/spatiotempora-secure-range-queries-tiered-sensor-networks Abstract : We target a two-tier sensor network with resource rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier. Master nodes collect data from sensor nodes and answer the queries from the network owner. The reliance on master nodes for data storage and query processing raises serious concerns about both data confidentiality and query-result correctness in hostile environments. In particular, a compromised master node may leak hosted sensitive data to the adversary; it may also return juggled or incomplete data in response to a query. This paper presents a novel spatiotemporal approach to ensure secure range queries in event-driven two tier sensor networks. It offers data confidentiality by preventing master nodes from reading hosted data and also enables efficient range-query processing. More importantly, it allows the network owner to verify with very high probability whether a query result is authentic and complete by examining the spatial and temporal relationships among the returned data. The high efficacy and efficiency of our approach are confirmed by detailed performance evaluations. Title :On Data Collection Using Mobile Robot in Wireless Sensor Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/on-data-collection-using-mobile-robot-wireless-sensor-networks Abstract : A novel data-collecting algorithm using a mobile robot to acquire sensed data from a wireless sensor network (WSN) that possesses partitioned/islanded WSNs is proposed in this paper. This algorithm permits the improvement of data- collecting performance by the base station by identifying the locations of partitioned/islanded WSNs and navigating a mobile robot to the desired location. To identify the locations of the partitioned/islanded WSNs, two control approaches, a global- and local-based approach, are proposed. Accordingly, the navigation strategy of the robot can be scheduled based on time and loca- tion using three scheduling strategies: time based, location based, and dynamic moving based. With these strategies, the mobile robot can collect the sensed data from the partitioned/islanded WSNs. Therefore, the efficiency of sensed data collected by the base station in partitioned/islanded WSNs is improved. Through simulation under the environment of an ns-2 simulator, the results, from various aspects, show that the collecting strategies proposed can dramatically improve sensed data-collecting performance in partitioned or islanded WSNs. M.Phil Computer Science Wireless Communication Projects Title :An Energy Efficient Clustering Solution for Wireless Sensor Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/energy-efficient-clustering-wireless-sensor-networks Abstract : Hot spots in a wireless sensor network emerge as locations under heavy traffic load. Nodes in such areas quickly deplete energy resources, leading to disruption in network services. This problem is common for data collection scenarios in which Cluster Heads (CH) have a heavy burden of gathering and relaying information. The relay load on CHs especially intensifies as the distance to the sink decreases. To balance the traffic load and the energy consumption in the network, the CH role should be rotated among all nodes and the cluster sizes should be carefully determined at different parts of the network. This paper proposes a distributed clustering algorithm, Energy-efficient Clustering (EC), that determines suitable cluster sizes depending on the hop distance to the data sink, while achieving approximate equalization of node lifetimes and reduced energy consumption levels. We additionally propose a simple energy-efficient multihop data collection protocol to evaluate the effectiveness of EC and calculate the end-to-end energy consumption of this protocol; yet EC is suitable for any data collection protocol that focuses on energy conservation. Performance results demonstrate that EC extends network lifetime and achieves energy equalization more effectively than two well-known clustering algorithms, HEED and UCR. Title :On Data Collection Using Mobile Robot in Wireless Sensor Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/data-collection-using-mobile-robot-wireless-sensor-networks Abstract : A novel data-collecting algorithm using a mobile robot to acquire sensed data from a wireless sensor network (WSN) that possesses partitioned/islanded WSNs is proposed in this paper. This algorithm permits the improvement of data-collecting performance by the base station by identifying thelocations of partitioned/islanded WSNs and navigating a mobile robot to the desired location. To identify the locations of the partitioned/islanded WSNs, two control approaches, a global and local-based approach, are proposed. Accordingly, the navigation strategy of the robot can be scheduled based on time and location using three scheduling strategies: time based, location based, and dynamic moving based. With these strategies, the mobile robot can collect the sensed data from
- 3. the partitioned/islanded WSNs. Therefore, the efficiency of sensed data collected by the base station in partitioned/islanded WSNs is improved. Through simulation under the environment of an ns-2 simulator, the results, from various aspects, show that the collecting strategies proposed can dramatically improve sensed data-collecting performance in partitioned or islanded WSNs. Title :Data Collection using Multiple Mobile Collectors in Partitioned Wireless Sensor Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/data-collection-multiple-mobile-collectors-partitioned-wireless-sensor-networks Abstract : Energy depletion of a sensor node results in a dead node that is unable to communicate with other nodes, this creates a partition in a WSN. Therefore the base station could not collect sensed data from some partitions. In this paper, vehicle routing problem (VRP) algorithm is proposed to allot navigation plans to the mobile elements (Mobile Collectors). This algorithm permits the improvement of data collecting performance by the base station by navigating the mobile collectors to the designed partition. The network partition detections are made by two control approaches, a global and local based approach. By this VRP algorithm, the efficiency of sensed data collected by the base station in partitioned large scale WSNs is improved. http://kasanpro.com/ieee/final-year-project-center-karur-reviews Title :Data Collection using Mobile Robot TSPN Scheduling in Wireless Sensor Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/data-collection-mobile-robot-tspn-scheduling-wireless-sensor-networks Abstract : A novel data-collecting algorithm using a mobile robot to acquire sensed data from a wireless sensor network (WSN) that possesses partitioned/islanded WSNs is proposed in this paper. This algorithm permits the improvement of data- collecting performance by the base station by identifying the locations of partitioned/islanded WSNs and navigating a mobile robot to the desired location. To identify the locations of the partitioned/islanded WSNs, two control approaches, a global- and local-based approach, are proposed. Accordingly, the navigation strategy of the robot can be scheduled based on TSPN(Traveling Salesman Problem with Neighborhoods). With these strategies, the mobile robot can collect the sensed data from the partitioned/islanded WSNs. Therefore, the efficiency of sensed data collected by the base station in partitioned/islanded WSNs is improved. Title :Data Collection using Multiple Mobile Collectors in Partitioned Wireless Sensor Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/data-collection-multiple-mobile-collectors-partitioned-wireless-sensor-networks-code Abstract : Energy depletion of a sensor node results in a dead node that is unable to communicate with other nodes, this creates a partition in a WSN. Therefore the base station could not collect sensed data from some partitions. In this paper, vehicle routing problem (VRP) algorithm is proposed to allot navigation plans to the mobile elements (Mobile Collectors). This algorithm permits the improvement of data collecting performance by the base station by navigating the mobile collectors to the designed partition. The network partition detections are made by two control approaches, a global and local based approach. By this VRP algorithm, the efficiency of sensed data collected by the base station in partitioned large scale WSNs is improved. M.Phil Computer Science Wireless Communication Projects Title :Diversity-Multiplexing-Delay Tradeoff in Selection Cooperation Networks with ARQ Language : NS2 Project Link : http://kasanpro.com/p/ns2/diversity-multiplexing-delay-tradeoff-selection-cooperation-networks-arq Abstract : Selection cooperation is an attractive cooperative strategy for its simplicity and automatic repeat request (ARQ) mechanism can bring additional diversity benefit for wireless networks. In this paper, we combine the distributed selection cooperation protocols with ARQ mechanism to develop more powerful cooperative schemes for delay-tolerant wireless networks and analyze their performance from the perspective of diversity multiplexing- delay
- 4. (D-M-D) trade off. For small networks where any two nodes have direct links, we investigate the general ARQ scheme which directly extends the selection cooperation protocol with single round of feedback to multiple rounds. We show that the D-M-D trade off is determined by the ability of relays in signal combining and demonstrate that allowing relays to perform combining reception can achieve optimal D-M-D trade off. Then we propose a simplified scheme which greatly reduces the number of feedbacks and almost achieves the optimal performance. For large networks where direct links are limited in the neighbors of each node, we present a diffusion ARQ protocol which can effectively exploit the channels of nodes that have no direct links with the source. The D-M-D trade off analysis and simulation results demonstrate the significant performance improvement of all the proposed schemes. Title :Diversity-Multiplexing-Delay Tradeoff in Selection Cooperation Networks with ARQ Language : C# Project Link : http://kasanpro.com/p/c-sharp/diversity-multiplexing-delay-tradeoff-selection-cooperation-networks-arq-code Abstract : Selection cooperation is an attractive cooperative strategy for its simplicity and automatic repeat request (ARQ) mechanism can bring additional diversity benefit for wireless networks. In this paper, we combine the distributed selection cooperation protocols with ARQ mechanism to develop more powerful cooperative schemes for delay-tolerant wireless networks and analyze their performance from the perspective of diversity multiplexing- delay (D-M-D) trade off. For small networks where any two nodes have direct links, we investigate the general ARQ scheme which directly extends the selection cooperation protocol with single round of feedback to multiple rounds. We show that the D-M-D trade off is determined by the ability of relays in signal combining and demonstrate that allowing relays to perform combining reception can achieve optimal D-M-D trade off. Then we propose a simplified scheme which greatly reduces the number of feedbacks and almost achieves the optimal performance. For large networks where direct links are limited in the neighbors of each node, we present a diffusion ARQ protocol which can effectively exploit the channels of nodes that have no direct links with the source. The D-M-D trade off analysis and simulation results demonstrate the significant performance improvement of all the proposed schemes. Title :A Multi-Relay-Selection Scheme with Cyclic Delay Diversity Language : NS2 Project Link : http://kasanpro.com/p/ns2/multi-relay-selection-scheme-cyclic-delay-diversity Abstract : In our proposed multi-relay-selection scheme with cyclic delay diversity (CDD), relays with spectral efficiency above a threshold are chosen to forward information, and a distinct cyclic shift is assigned to each selected relay. We derive an approximate expression of the end-to-end mutual information for the proposed scheme. We further analyze the outage prob- ability and diversity-multiplexing tradeoff (DMT) performance. Numerical results show that the proposed scheme can realize full diversity and achieve the same outage probability and DMT performance as that of the selection cooperation scheme without the need for feedback information and strict synchronization among relays. Title :A Multi-Relay-Selection Scheme with Cyclic Delay Diversity Language : C# Project Link : http://kasanpro.com/p/c-sharp/multi-relay-selection-scheme-cyclic-delay-diversity-code Abstract : In our proposed multi-relay-selection scheme with cyclic delay diversity (CDD), relays with spectral efficiency above a threshold are chosen to forward information, and a distinct cyclic shift is assigned to each selected relay. We derive an approximate expression of the end-to-end mutual information for the proposed scheme. We further analyze the outage prob- ability and diversity-multiplexing tradeoff (DMT) performance. Numerical results show that the proposed scheme can realize full diversity and achieve the same outage probability and DMT performance as that of the selection cooperation scheme without the need for feedback information and strict synchronization among relays. Title :USOR: An Unobservable Secure On-Demand Routing Protocol for Mobile Ad Hoc Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/usor-unobservable-secure-on-demand-routing-protocol-mobile-ad-hoc-networks Abstract : Privacy-preserving routing is crucial for some ad hoc networks that require stronger privacy protection. A number of schemes have been proposed to protect privacy in ad hoc networks. However, none of these schemes offer complete unlinkability or unobservability property since data packets and control packets are still linkable and
- 5. distinguishable in these schemes. In this paper, we define stronger privacy requirements regarding privacy-preserving routing in mobile ad hoc networks. Then we propose an unobservable secure routing scheme USOR to offer complete unlinkability and content unobservability for all types of packets. USOR is efficient as it uses a novel combination of group signature and ID-based encryption for route discovery. Security analysis demonstrates that USOR can well protect user privacy against both inside and outside attackers. We implement USOR on ns2, and evaluate its performance by comparing with AODV and MASK. The simulation results show that USOR not only has satisfactory performance compared to AODV, but also achieves stronger privacy protection than existing schemes like MASK. M.Phil Computer Science Wireless Communication Projects Title :USOR: An Unobservable Secure On-Demand Routing Protocol for Mobile Ad Hoc Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/usor-an-unobservable-secure-on-demand-routing-protocol-mobile-ad-hoc-networks Abstract : Privacy-preserving routing is crucial for some ad hoc networks that require stronger privacy protection. A number of schemes have been proposed to protect privacy in ad hoc networks. However, none of these schemes offer complete unlinkability or unobservability property since data packets and control packets are still linkable and distinguishable in these schemes. In this paper, we define stronger privacy requirements regarding privacy-preserving routing in mobile ad hoc networks. Then we propose an unobservable secure routing scheme USOR to offer complete unlinkability and content unobservability for all types of packets. USOR is efficient as it uses a novel combination of group signature and ID-based encryption for route discovery. Security analysis demonstrates that USOR can well protect user privacy against both inside and outside attackers. We implement USOR on ns2, and evaluate its performance by comparing with AODV and MASK. The simulation results show that USOR not only has satisfactory performance compared to AODV, but also achieves stronger privacy protection than existing schemes like MASK. http://kasanpro.com/ieee/final-year-project-center-karur-reviews Title :A Design of a WSN System for Pollution Monitoring and Positioning Based on GAF Routing Algorithms Language : NS2 Project Link : http://kasanpro.com/p/ns2/pollution-monitoring-positioning-based-gaf-routing-algorithms Abstract : The background of this paper is about water quality monitoring and pollution source positioning as the main function of telemetry for large-scale drainage basins. The paper introduces wireless sensor network technology, designs and proposes an overall architecture of a hydrologic telemetry and pollution tracking and positioning system based on the public mobile communications network, and chooses network protocols based on the GAF routing algorithm. The paper emphasizes issues when the GAF algorithm is used as routing protocols in practical application of the system such as network lifecycle, pollution source positioning, limited node energy, network quality and etc., and puts forward a preliminary solution. Title :A Design of a WSN System for Pollution Monitoring and Positioning Based on GAF Routing Algorithms Language : C# Project Link : http://kasanpro.com/p/c-sharp/pollution-monitoring-positioning-based-gaf-routing-algorithms-code Abstract : The background of this paper is about water quality monitoring and pollution source positioning as the main function of telemetry for large-scale drainage basins. The paper introduces wireless sensor network technology, designs and proposes an overall architecture of a hydrologic telemetry and pollution tracking and positioning system based on the public mobile communications network, and chooses network protocols based on the GAF routing algorithm. The paper emphasizes issues when the GAF algorithm is used as routing protocols in practical application of the system such as network lifecycle, pollution source positioning, limited node energy, network quality and etc., and puts forward a preliminary solution. Title :Detection and Localization of Multiple Spoofing Attackers in Wireless Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/detection-localization-multiple-spoofing-attackers-wireless-networks Abstract : Wireless spoofing attacks are easy to launch and can significantly impact the performance of networks.
- 6. Although the identity of a node can be verified through cryptographic authentication, conventional security approaches are not always desirable because of their overhead requirements. In this paper, we propose to use spatial information, a physical property associated with each node, hard to falsify, and not reliant on cryptography, as the basis for 1) detecting spoofing attacks; 2) determining the number of attackers when multiple adversaries masquerading as the same node identity; and 3) localizing multiple adversaries. We propose to use the spatial correlation of received signal strength (RSS) inherited from wireless nodes to detect the spoofing attacks. We then formulate the problem of determining the number of attackers as a multiclass detection problem. Cluster-based mechanisms are developed to determine the number of attackers. When the training data are available, we explore using the Support Vector Machines (SVM) method to further improve the accuracy of determining the number of attackers. In addition, we developed an integrated detection and localization system that can localize the positions of multiple attackers. We evaluated our techniques through two testbeds using both an 802.11 (WiFi) network and an 802.15.4 (ZigBee) network in two real office buildings. Our experimental results show that our proposed methods can achieve over 90 percent Hit Rate and Precision when determining the number of attackers. Our localization results using a representative set of algorithms provide strong evidence of high accuracy of localizing multiple adversaries. Title :Detection and Localization of Multiple Spoofing Attackers in Wireless Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/detection-localization-multiple-spoofing-attackers-wireless-networks-code Abstract : Wireless spoofing attacks are easy to launch and can significantly impact the performance of networks. Although the identity of a node can be verified through cryptographic authentication, conventional security approaches are not always desirable because of their overhead requirements. In this paper, we propose to use spatial information, a physical property associated with each node, hard to falsify, and not reliant on cryptography, as the basis for 1) detecting spoofing attacks; 2) determining the number of attackers when multiple adversaries masquerading as the same node identity; and 3) localizing multiple adversaries. We propose to use the spatial correlation of received signal strength (RSS) inherited from wireless nodes to detect the spoofing attacks. We then formulate the problem of determining the number of attackers as a multiclass detection problem. Cluster-based mechanisms are developed to determine the number of attackers. When the training data are available, we explore using the Support Vector Machines (SVM) method to further improve the accuracy of determining the number of attackers. In addition, we developed an integrated detection and localization system that can localize the positions of multiple attackers. We evaluated our techniques through two testbeds using both an 802.11 (WiFi) network and an 802.15.4 (ZigBee) network in two real office buildings. Our experimental results show that our proposed methods can achieve over 90 percent Hit Rate and Precision when determining the number of attackers. Our localization results using a representative set of algorithms provide strong evidence of high accuracy of localizing multiple adversaries. M.Phil Computer Science Wireless Communication Projects Title :Energy-Aware Sensor Node Design With Its Application in Wireless Sensor Networks Language : C# Project Link : http://kasanpro.com/p/c-sharp/energy-aware-sensor-node-design-with-its-application-wireless-sensor-networks Abstract : Energy consumption remains as a major obstacle for full deployment and exploitation of wireless sensor network (WSN) technology nowadays. This paper presents the design and implementation of an energy-aware sensor node, which can help in constructing energy-efficient WSNs. An energy-efficient strategy, which aims at minimizing energy consumption from both the sensor node level and the network level in a WSN, is proposed. To minimize the communication energy consumption of the sensor node, the distance between the transmitter and the receiver is estimated before available transmission, and then, the lowest transmission power needed to transmit the measurement data is calculated and determined. The sensor nodes are also set to sleep mode between two consecutive measurements for energy saving in normal operating conditions. Furthermore, energy saving can be achieved by estimating the energy consumption within the whole network under different network configurations and then by choosing the most energy-efficient one. Title :Energy-Aware Sensor Node Design With Its Application in Wireless Sensor Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/energy-aware-sensor-node-design-with-its-application-wireless-sensor-networks-code Abstract : Energy consumption remains as a major obstacle for full deployment and exploitation of wireless sensor network (WSN) technology nowadays. This paper presents the design and implementation of an energy-aware sensor node, which can help in constructing energy-efficient WSNs. An energy-efficient strategy, which aims at minimizing
- 7. energy consumption from both the sensor node level and the network level in a WSN, is proposed. To minimize the communication energy consumption of the sensor node, the distance between the transmitter and the receiver is estimated before available transmission, and then, the lowest transmission power needed to transmit the measurement data is calculated and determined. The sensor nodes are also set to sleep mode between two consecutive measurements for energy saving in normal operating conditions. Furthermore, energy saving can be achieved by estimating the energy consumption within the whole network under different network configurations and then by choosing the most energy-efficient one. Title :Optimum Relay Selection for Energy-Efficient Cooperative Ad Hoc Networks Language : NS2 Project Link : http://kasanpro.com/p/ns2/optimum-relay-selection-energy-efficient-cooperative-ad-hoc-networks Abstract : The Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. We identify the challenges in the development of a centralized topology control scheme, named Cooperative Bridges, which reduces transmission power of nodes as well as increases network connectivity. Prior research on topology control with CC only focuses on maintaining the network connectivity, minimizing the transmission power of each node, whereas ignores the energy efficiency of paths in constructed topologies. This may cause inefficient routes and hurt the overall network performance in cooperative ad hoc networks. In this paper, to address this problem, we studied topology control problem for energy-efficient topology control problem with cooperative communication. We proposed optimum relay nodes selection for CC network to reduce overall power consumption of network. Title :Energy-Aware QoS Provisioning for Wireless Sensor Networks: Analysis and Protocol Language : NS2 Project Link : http://kasanpro.com/p/ns2/energy-aware-qos-provisioning-wireless-sensor-networks-analysis-protocol Abstract : Wireless sensor networks (WSNs) are envisioned to facilitate information gathering for various applications and depending on the application types they may require certain quality of service (QoS) guarantee for successful and guaranteed event perception. Therefore, QoS in WSNs is an important issue and two most important parameters that hinder the goal of guaranteed event perception are time-sensitive and reliable delivery of gathered information, while a minimum energy consumption is desired. In this paper, we propose an energy-aware, multi-constrained and multipathQoS provisioning mechanism forWSNs based on optimization approach. Hence, a detailed analytical analysis of reliability, delay and energy consumption is presented to formulate the optimization problem in an analytical way. A greedy algorithm is proposed to achieve the desired QoS guarantee while keeping the energy consumption minimum. Also, a simple but efficient retransmission mechanism is proposed to enhance the reliability further, while keeping the delay within delay bound. Simulation results demonstrate the effectiveness of our scheme. http://kasanpro.com/ieee/final-year-project-center-karur-reviews Title :Map-Aware Models for Indoor Wireless Localization Systems: An Experimental Study Language : C# Project Link : http://kasanpro.com/p/c-sharp/map-aware-models-indoor-wireless-localization-systems Abstract : The accuracy of indoor wireless localization systems can be substantially enhanced by map-awareness, i.e., by the knowledge of the map of the environment in which localization signals are acquired. In fact, this knowledge can be exploited to cancel out, at least to some extent, the signal degradation due to propagation through physical obstructions, i.e., to the so called non-line-of-sight bias. This result can be achieved by developing novel localization techniques that rely on proper mapaware statistical modelling of the measurements they process. In this manuscript a unified statistical model for the measurements acquired in map-aware localization systems based on time-ofarrival and received signal strength techniques is developed and its experimental validation is illustrated. Finally, the accuracy of the proposed map-aware model is assessed and compared with that offered by its map-unaware counterparts. Our numerical results show that, when the quality of acquired measurements is poor, map-aware modelling can enhance localization accuracy by up to 110% in certain scenarios. M.Phil Computer Science Wireless Communication Projects Title :Map-Aware Models for Indoor Wireless Localization Systems: An Experimental Study Language : NS2
- 8. Project Link : http://kasanpro.com/p/ns2/map-aware-models-indoor-wireless-localization-systems-code Abstract : The accuracy of indoor wireless localization systems can be substantially enhanced by map-awareness, i.e., by the knowledge of the map of the environment in which localization signals are acquired. In fact, this knowledge can be exploited to cancel out, at least to some extent, the signal degradation due to propagation through physical obstructions, i.e., to the so called non-line-of-sight bias. This result can be achieved by developing novel localization techniques that rely on proper mapaware statistical modelling of the measurements they process. In this manuscript a unified statistical model for the measurements acquired in map-aware localization systems based on time-ofarrival and received signal strength techniques is developed and its experimental validation is illustrated. Finally, the accuracy of the proposed map-aware model is assessed and compared with that offered by its map-unaware counterparts. Our numerical results show that, when the quality of acquired measurements is poor, map-aware modelling can enhance localization accuracy by up to 110% in certain scenarios.