Attack-resistant sensor localization under realistic wireless signal fading
- Authors: Iqbal, Anindya , Murshed, Manzur
- Date: 2010
- Type: Text , Conference paper
- Relation: 2010 IEEE Wireless Communications and Networking Conference p. 1-6
- Full Text: false
- Reviewed:
- Description: In a decentralized sensor network, localization process relies on the integrity of participating sensors. Existence of malicious beacon nodes in the vicinity of non-beacon nodes affects this process. This paper presents a trilateration-based secure localization technique, which is capable of estimating the location of a sensor with high accuracy so long four neighbouring beacon nodes are benign, irrespective of the number of neighbouring liars and without assuming any trust model. In realistic scenarios of wireless environment where transmitted signals attenuate randomly due to fading, the liar-tolerance level of this attack-resistant technique has to be relaxed accordingly. Superiority of this technique against the state-of-the-art has been established with extensive simulation results in terms of location estimation accuracy and liar-filtering probability.
A subset coding based k-anonymization technique to trade-off location privacy and data integrity in participatory sensing systems
- Authors: Murshed, Manzur , Iqbal, Anindya , Sabrina, Tishna , Alam, K.
- Date: 2011
- Type: Text , Conference paper
- Full Text: false
- Reviewed:
A novel anonymization technique to trade off location privacy and data integrity in participatory sensing systems
- Authors: Murshed, Manzur , Sabrina, Tishna , Iqbal, Anindya , Alam, K.
- Date: 2010
- Type: Text , Conference paper
- Relation: 2010 Fourth International Conference on Network and System Security p. 345-350
- Full Text: false
- Reviewed:
- Description: Abstract—Preserving privacy in participatory sensing systems has recently gained research interest as voluntary contribution in such systems is not worthy if the privacy of the participants is not protected. On the other hand, data integrity is desired imperatively to make the service trustworthy and user-friendly. In this paper, we have proposed an adaptive location anonymization technique, which is capable of retaining an acceptable level of data integrity while keeping its vulnerability to eavesdropping adversaries low. Experimental results establish the proposed concept as a superior approach in balancing, somehow orthogonal, user privacy and data integrity.
On demand-driven movement strategy for moving beacons in sensor localization
- Authors: Iqbal, Anindya , Murshed, Manzur
- Date: 2014
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 44, no. (2014), p. 46-62
- Full Text: false
- Reviewed:
- Description: In wireless sensor networks, estimating sensor location demands a large number of neighbor location references due to the unavoidable wireless signal attenuation problem. However, the cost of deployment increases with the increase in beacon location references. This limitation can be overcome using moving beacons exploiting the control over the number, position, and strength of beacon transmissions. In this scenario, the trade-off between localization cost and accuracy, which are directly linked up with anchor movement and transmission pattern, introduces many challenges that have recently attracted research interest. This paper aims to propose a noise-tolerant and cost-effective range-free localization technique using moving beacons that localize randomly deployed sensor nodes within a maximum localization error bound while minimizing the cost of beacon traversal and transmissions. We found that the mean localization error can be kept within 20–35% of the maximum transmission radius by selecting the movement and beacon transmission parameters according to user demand. The proposed schemes are compared with other works and also shown to be robust against positional errors of the moving beacon.
A hybrid wireless sensor network framework for range-free event localization
- Authors: Iqbal, Anindya , Murshed, Manzur
- Date: 2015
- Type: Text , Journal article
- Relation: Ad Hoc Networks Vol. 27, no. (2015), p. 81-98
- Full Text: false
- Reviewed:
- Description: In event localization, wireless sensors try to locate the source of an event from its emitted power. This is more challenging than sensor localization as the power level at the source of an event is neither predictable with precision nor can be controlled. Considering the emerging trend of long sensing range for cost-effective sensor deployment, locating events within a region much smaller than the sensing area of a single sensor has gained research interest. This paper proposes the first range-free event localization framework, which avoids expensive hardware needed by the range-based counterparts. Our approach first develops a sensing range model from the statistical information on the emitted power of a type of events so that user-defined event-detection quality can be provisioned using a minimal network of static sensors. Then an accurate event location boundary estimation technique is developed from the sensing feedbacks, which also facilitates guided expansion of the area of possible event location (APEL) to deal with sensing errors. Finally, user-defined event-localization quality guarantee is provisioned cost-effectively by inviting mobile sensors on-demand to target positions. Analytical solutions are provided whenever appropriate and comprehensive simulations are carried out to evaluate localization performance. The proposed event localization technique outperforms the state-of-the-art range-based counterpart (Xu et al., 2011) in realistic environment with path loss, shadow fading, and sensor positioning errors.
Modelling sensing radius for efficient wireless sensor deployment
- Authors: Iqbal, Anindya , Murshed, Manzur
- Date: 2012
- Type: Text , Conference paper
- Relation: Proceedings of the International Symposium on Communications and Information Technologies, (ISCIT 2012), Gold Coast, 2nd-5th October. pp. 365-370
- Full Text: false
- Reviewed:
- Description: In many application scenarios, wireless sensors are deployed deterministically throughout a wide area to detect and report specific events or monitor environmental parameters. To cover a large area with minimal number of sensors, it is important to determine sensing radius of the operating sensors. Since the emitted energy of a random event is neither predictable nor fixed, accurate sensing radius modelling is a challenging problem. To the best of our knowledge, no work has considered how the event intensity factor reduces probability of event detection while assuming a sensing radius despite its high significance in important areas such as coverage, detection, localization, etc. In this paper, we have proposed a novel stochastic model of the maximum sensing radius to guarantee a user-defined event detection probability from the pdf of average event intensity and the quality of sensors. Comprehensive theoretical and numerical analyses are presented to evaluate the event detection performance of this model against different relevant parameters and these are also verified by simulation. Provision for event location trajectory computation is analysed for high-intensity events.
Range-free passive localization using static and mobile sensors
- Authors: Iqbal, Anindya , Murshed, Manzur
- Date: 2012
- Type: Text , Conference proceedings
- Relation: 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), San Francisco, CA, 25th-28th June, 2012 p. 1-6
- Full Text: false
- Reviewed:
- Description: In passive localization, sensors try to locate an event without any knowledge of event's emitted power. So, this is a more challenging problem compared to active localization. Existing passive localization schemes use expensive and noise-vulnerable range-based techniques. In this paper, we propose, to the best of our knowledge for the first time, a cost-effective range-free passive localization scheme exploiting hybrid sensor network model where mobile sensors are deployed on demand once an event is sensed by a static sensor. Efficient use of mobile sensors leads to two concomitant optimization problems: (1) positioning the mobile sensors so that the expected possible event location area is minimized; and (2) minimizing their overall traversed distance. To solve the first problem, we have developed a novel arc-coding based range-free localization technique that can accurately define the area of possible event location from the feedback of arbitrarily placed sensors without relying on expensive hardware to estimate range of signals. We have achieved significantly high localization accuracy with a low number of mobile sensors even after considering significant environmental noise. To solve the second problem, three alternative deployment strategies for the mobile sensors were simulated to recommend the best.
Poster : Privacy protection for real world participatory sensing system
- Authors: Abrar, Nafeez , Iqbal, Anindya , Zaman, Shaolin , Murshed, Manzur
- Date: 2016
- Type: Text , Conference paper
- Relation: 14th Annual International Conference on Mobile Systems, Applications, and Services Companion
- Full Text: false
- Reviewed:
- Description: Participatory Sensing System (PSS) is an emerging technology for collection of useful information as the use of smart-phones has been increasing lately among community people. It has a wide range of applications like environmental monitoring, product price sharing, health monitoring etc. But people have to share their location and other information which is a high privacy risk. Our main contribution of this work is to develop a technique for PSS which can provide privacy protection for the participants in manageable time in real world.
Verifiable and privacy preserving electronic voting with untrusted machines
- Authors: Murshed, Manzur , Sabrina, Tishna , Iqbal, Anindya , Ali, Mortuza
- Date: 2013
- Type: Text , Conference proceedings
- Relation: Proceedings of the 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2013) Melbourne, Vic, 16-18th July, 2013 p. 798-804
- Full Text: false
- Reviewed:
- Description: Designing a trustworthy voting system that uses electronic voting machines (EVMs) for efficiency and accuracy is a challenging task. It is difficult, if not impossible, to ensure the trustworthiness of EVMs that possess computation, storage, and communication capabilities. Thus an electronic voting system that does not assume trusted EVMs is clearly desirable. In this paper, we have proposed a k-anonymized electronic voting scheme that achieves this goal by assuming a hardware-controlled trusted random number generator external to the EVM. The proposed scheme relies on a k-anonymization technique to protect privacy and resort to joint de-anonymization of the votes for counting. Since the joint de-anonymization takes into account all the votes, it is difficult to manipulate an individual vote, even by the EVM, without being detected. Besides the anonymization technique, the proposed scheme relies on standard cryptographic hashing and the concept of floating receipt to provide end-to-end verifiability that prevents coercion or vote trading.
Anonymization techniques for preserving data quality in participatory sensing
- Authors: Sabrina, Tishna , Murshed, Manzur , Iqbal, Anindya
- Date: 2016
- Type: Text , Conference paper
- Relation: 2016 IEEE 41st Conference on Local Computer Networks (LCN) p. 607-610
- Full Text: false
- Reviewed:
- Description: Participatory sensing is a revolutionary new paradigm where citizens voluntarily sense their surroundings using readily available sensing devices such as mobile phones and share this information for mutual benefit of community members. To encourage ample participation of users, ensuring their privacy is inevitable. Existing techniques that attempt to protect location privacy with spatial cloaking suffer from irrecoverable data quality degradation. To the best of our knowledge, very few works provided a solution preserving high data quality/utility at the destination server, however, suffered from unacceptable computational overhead. This paper presents an improved deterministic alternative and also a faster variant by exploiting several optimization issues. Theoretical formulations and extensive simulation results are presented to establish the applicability of our proposed techniques.