Dynamic sensor selection for target tracking in wireless sensor networks
- Authors: Armaghani, Farzaneh , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper
- Relation: IEEE 74th Vehicular Technology Conference, VTC Fall 2011; San Francisco, United States; 5th-8th September 2011 p. 1-6
- Full Text: false
- Reviewed:
- Description: Optimum selection of sensors in target tracking applications has a great potential to maintain right trade-off between energy consumption and quality of tracking. In this paper, we propose a dynamic sensor selection scheme to achieve energy efficiency while ensuring the required quality of tracking. To this end, relative information utility projection of a target on sensors' observation is used in niche overlap measurements. Niche overlap measures are used to assess the similarity in information utilities where information utility is inversely proportional to error in target's state estimation based on prior distribution. The proposed scheme is a greedy approach in which sensor nodes are selected such that the overall niche overlap of all the selected nodes is maximized until the required level of accuracy is achieved. Our simulation results show significant improvement in tracking accuracy and network's lifetime over the existing methods.
Dynamic sensors collaboration to balance the accuracy-lifetime trade-off in multiple-target tracking
- Authors: Armaghani, Farzaneh , Gondal, Iqbal , Kamruzzaman, Joarder , Green, David
- Date: 2012
- Type: Text , Conference paper
- Relation: 2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2012; Sydney, NSW; Australia; 9th-12th September 2012 p. 675-681
- Full Text: false
- Reviewed:
- Description: Complex target tracking applications require active sensor nodes to collaboratively track multiple moving targets, which can balance the trade-off between the quality of tracking and network's lifetime. In this paper, we develop a distributed sensor-selection protocol (DSSP) to activate dynamic number of sensors based on the cost metrics. Cost metrics contains energy-aware leadership cost and eagerness-based tracking cost; which selects sensors with higher energy resources and information utilities. DSSP enables an even distribution of energy consumption among the nodes to prolong the network lifetime. Our results show that the proposed scheme can significantly improve the network lifetime while maintaining the high tracking accuracy as compared to the other schemes.
Dynamic clusters graph for detecting moving targets using WSNs
- Authors: Armaghani, Farzaneh , Gondal, Iqbal , Kamruzzaman, Joarder , Green, David
- Date: 2012
- Type: Text , Conference paper
- Relation: 76th IEEE Vehicular Technology Conference, VTC Fall 2012; Quebec City, Canada; 3rd-6th September 2012 p. 1-5
- Full Text: false
- Reviewed:
- Description: Efficient target tracking applications require active sensor nodes to track a cluster of moving targets. Clustering could lead to significant cost improvement as compared to tracking individual targets. This paper presents accurate clustering of targets for both coherent and incoherent movement patterns. We propose a novel clustering algorithm that utilises an implicit dynamic time frame to assess the relational history of targets in creating a weighted graph of connected components. The proposed algorithm employs key features of localisation algorithms in target tracking, namely, estimated current and predicted locations to determine the relational directions and distances of moving targets. Our simulation results show a significant improvement on the clustering accuracy and computation time by dynamically adjusting the history-window size and predicting the relationships among targets.
Sensor selection for tracking multiple groups of targets
- Authors: Armaghani, Farzaneh , Gondal, Iqbal , Kamruzzaman, Joarder , Green, David
- Date: 2014
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 46, no. (2014), p. 36-47
- Full Text: false
- Reviewed:
- Description: Group target tracking is a challenge for sensor networks. It occurs where large numbers of closely spaced targets move together in different groups. In these applications, the sensor selection scheme plays a vital role in extending network lifetime while providing high tracking accuracy. Existing schemes cause an extreme imbalance between energy usages and tracking accuracy. They are capable of tracking only individual groups and without using prior knowledge about the groups. These problems make them impractical for group target tracking. With the aim of balancing the trade-off between lifetime and accuracy, we present a novel Multi-Sensor Group Tracking (MSGT) scheme. MSGT comprises the following steps to accomplish concurrent tracking of multiple groups: (1) Clustering to capture changes in the behavioural properties of groups, such as formation, merging, and splitting; (2) Sensor selection to activate the contributory sensors for the estimated group regions; and (3) Group tracking using the activated sensors. We develop a probabilistic decision-making strategy that triggers the clustering step adaptively with any detected change in group behavioural patterns. The sensor selection step coordinates periodic selection of leader and tracking sensor nodes in a distributed manner. We introduce cost metrics that include sensor′s energy parameters in the selection of active sensors that fully cover the group regions. The tracking step is a Bayesian modelling of the target groups which uses particle filtering algorithm to estimate the group locations. Simulation results show that our scheme achieves substantial improvements over existing approaches in terms of network lifetime and tracking accuracy.
Dynamic sensors selection for overlapped multiple-target tracking using eagerness
- Authors: Armaghani, Farzaneh , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2012
- Type: Text , Conference paper
- Relation: 76th IEEE Vehicular Technology Conference, VTC Fall 2012; Quebec City, Canada; 3rd-6th September 2012 p. 1-6
- Full Text: false
- Reviewed:
- Description: Efficient target tracking applications use active sensor nodes collaboratively to track multiple moving targets by balancing the trade-off between the quality of tracking and network's lifetime. In this paper, we propose a low-energy dynamic sensor selection (LEDS) scheme to track multiple targets by estimating energy consumption of sensors and information utility projection of the targets on sensors to calculate the eagerness in tracking. Eagerness represents the eligibility of a sensor node to be selected for tracking, considering relative profiles of other sensors and location of all the targets in its vicinity. LEDS enables an even distribution of energy consumption among the nodes to prolong their remaining energies. Our results show that the proposed scheme can significantly improve the network lifetime over the existing methods while maintaining the high tracking accuracy in congested areas where multiple concurrent targets overlap.
CAM : Congestion avoidance and mitigation in wireless sensor networks
- Authors: Bhuiyan, Mohammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2010
- Type: Text , Conference paper
- Relation: Vehicular Technology Conference (VTC 2010-Spring), 2010 IEEE 71st
- Full Text: false
- Reviewed:
LACAR : Location aided congestion aware routing in wireless sensor networks
- Authors: Bhuiyan, Mohammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2010
- Type: Text , Conference paper
- Relation: Wireless Communications and Networking Conference (WCNC), p. 1-6
- Full Text: false
- Reviewed:
- Description: Trade-off between energy-efficiency and reliability in wireless sensor networks is application dependent. Without the reliability, the extended lifetime of a network is of limited use. Due to the inherent correlation between reliability and congestion, it is necessary to reduce congestion to improve reliability. Existing congestion control algorithms in wireless sensor networks are reactive. They attempt to reduce the congestion only after its detection. In this paper, we present Location Aided Congestion Aware Routing (LACAR) protocol that proactively avoids congestion formation and improves data delivery success rate in data gathering wireless sensor networks. Location, energy and congestion information of neighbours together with the location information of the base station determine appropriate routes. Simulation results show that LACAR achieves high packet success rate in an energy-efficient way.
CODAR: Congestion and delay aware routing to detect time critical events
- Authors: Bhuiyan, Mohammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper
- Full Text: false
- Reviewed:
- Description: Reliability and timeliness are two essential requirements of successful detection of critical events in Wireless Sensor Networks (WSNs). The base station (BS) is particularly interested about reliable and timely collection of data sent by the nodes close to the ongoing event, and at that time, the data sent by other nodes have little importance. In this paper, we propose Congestion and Delay Aware Routing (CODAR) protocol that tries to route data in congestion and delay aware manners. If congestion occurs, it also mitigates congestion by utilizing an accurate data-rate adjustment. Each node collects control information from neighbours and works in a distributed manner. CODAR also puts emphasis on successful collection of these control information which eventually provides desirable performance. Experimental results show that CODAR is capable of avoiding and mitigating congestion effectively, and performs better than similar known techniques in terms of reliable and timely event detection.
Dual-channel based energy efficient event clustering and data gathering in WSNs
- Authors: Bhuiyan, Mohammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper
- Relation: 17th Asia Pacific Conference on Communications, APCC 2011; Sabah, Malaysia; 2nd-5th October 2011 p. 241-246
- Full Text: false
- Reviewed:
- Description: Wireless sensor networks (WSNs), now-a-days, are deployed in environmental data collection as well as in critical event monitoring. Successful data collection requires reliability while reliable event detection necessitates timeliness. Simultaneous data gathering and event monitoring is not well studied in literature. In this paper, we propose a system model that works on homogeneous data gathering WSNs. When an event occurs, an event cluster with a different transmission channel is formed and both data gathering and event monitoring are performed at the same time. The proposed model has a novel routing strategy with a built-in congestion control technique to provide timely delivery of event data. Experimental results show that the proposed method performs better than known similar techniques in terms of reliable data gathering and reliable timely event monitoring. It also enhances the network lifetime significantly compared to other existing methods.
I-MAC: energy efficient intelligent MAC protocol for wireless sensor networks
- Authors: Bhuiyan, Mohammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper
- Relation: 17th Asia Pacific Conference on Communications, APCC 2011; Sabah, Malaysia; 2nd-5th October 2011 p. 133-138
- Full Text: false
- Reviewed:
- Description: Energy efficiency is a vital aspect of resource constrained wireless sensor networks (WSNs). All protocols designed for WSNs must be energy aware in order to prolong the network lifetime. In this paper, we have designed a novel MAC layer protocol (I-MAC: Intelligent MAC) for WSNs. By exercising intelligent sleep and wake-up schedule, I-MAC saves energy of the resource constrained sensor nodes greatly. At the same time, I-MAC does not compromise its operational performances. Both analytical study and simulation prove that I-MAC is not only highly energy efficient but also its operational performances are better than similar protocols.
API based discrimination of ransomware and benign cryptographic programs
- Authors: Black, Paul , Sohail, Ammar , Gondal, Iqbal , Kamruzzaman, Joarder , Vamplew, Peter , Watters, Paul
- Date: 2020
- Type: Text , Conference paper
- Relation: 27th International Conference on Neural Information Processing, ICONIP 2020, Bangkok, 18 to 22 November 2020, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 12533 LNCS, p. 177-188
- Full Text: false
- Reviewed:
- Description: Ransomware is a widespread class of malware that encrypts files in a victim’s computer and extorts victims into paying a fee to regain access to their data. Previous research has proposed methods for ransomware detection using machine learning techniques. However, this research has not examined the precision of ransomware detection. While existing techniques show an overall high accuracy in detecting novel ransomware samples, previous research does not investigate the discrimination of novel ransomware from benign cryptographic programs. This is a critical, practical limitation of current research; machine learning based techniques would be limited in their practical benefit if they generated too many false positives (at best) or deleted/quarantined critical data (at worst). We examine the ability of machine learning techniques based on Application Programming Interface (API) profile features to discriminate novel ransomware from benign-cryptographic programs. This research provides a ransomware detection technique that provides improved detection accuracy and precision compared to other API profile based ransomware detection techniques while using significantly simpler features than previous dynamic ransomware detection research. © 2020, Springer Nature Switzerland AG.
Identification of fake news : a semantic driven technique for transfer domain
- Authors: Ferdush, Jannatul , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal , Das, Raj
- Date: 2023
- Type: Text , Conference paper
- Relation: 29th International Conference on Neural Information Processing, ICONIP 2022, Virtual, online, 22-26 November 2022, Communications in Computer and Information Science Vol. 1793 CCIS, p. 564-575
- Full Text: false
- Reviewed:
- Description: Fake news spreads quickly on online social media and adversely impacts political, social, religious, and economic stability. This necessitates an efficient fake news detector which is now feasible due to advances in natural language processing and artificial intelligence. However, existing fake news detection (FND) systems are built on tokenization, embedding, and structure-based feature extraction, and fail drastically in real life because of the difference in vocabulary and its distribution across various domains. This article evaluates the effectiveness of various categories of traditional features in cross-domain FND and proposes a new method. Our proposed method shows significant improvement over recent methods in the literature for cross-domain fake news detection in terms of widely used performance metrics. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Optimally parameterized wavelet packet transform for machine residual life prediction
- Authors: Gondal, Iqbal , Yaqub, Muhammad , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper , Journal article
- Relation: Australian Acoustical SocietyConference 2011: Breaking New Ground, Acoustics 2011; Gold Coast, Australia; 2nd-4th November 2011; p.1-8
- Full Text:
- Reviewed:
- Description: One of the prevalent issues in condition based maintenance (CBM) is to predict the residual life of the equipment. This paper propos-es a novel framework to predict the remnant life of the equipment, called Residual life prediction based on optimally parameterized Wavelet transform and Mute-step Support vector regression (RWMS). In optimally parameterized wavelet transform, a generalized criterion is proposed to select the wavelet decomposition level which works for all the applications and decomposition nodes are selected by characterizing their dominancy level based upon relative fault signature-signal energy contents. The prediction model is based on multi-step support vector regression (MSVR) and prediction accuracy is improved in comparison with the techniques based on support vector regression (SVR). Performance of RWMS is evaluated in terms of Root Means Square Error (RMSE), studies show that proposed algorithm predicts the residual life of the equipment accurately.
A novel vertical handover scheme for diminution in social network traffic
- Authors: Haider, Ammar , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2012
- Type: Text , Conference paper
- Full Text:
- Reviewed:
Efficient utilization of WLAN networks in the next-generation heterogeneous environments
- Authors: Haider, Ammar , Gondal, Iqbal , Kamruzzaman, Joarder , Qiu, Bin
- Date: 2010
- Type: Text , Conference paper
- Relation: Vol. , no. (2010), p.398-403
- Full Text: false
- Reviewed:
Social-connectivity-aware vertical handover for heterogeneous wireless networks
- Authors: Haider, Ammar , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Journal article
- Relation: Journal Of Network And Computer Applications Vol. 36, no. 4 (2013), p. 1131-1139
- Full Text: false
- Reviewed:
- Description: Vertical handover mechanism for a WLAN-cellular heterogeneous network could be made efficient with the use of context aware admission control strategy. Existing admission control methods aim to provide satisfactory quality of service, but rely solely on the availability of wireless resources in the target network. We propose that the admission control in WLAN should make use of social connectivity context of users in its coverage area to classify local and global traffic. In this paper, we introduce a novel Social-Connectivity-aware Vertical Handover (SCVH) scheme, which performs admission control using connectivity graph data from the online social networking services. A higher importance of visiting node for users resident in WLAN, advocates a higher priority for granting admission. We employ graph-theoretic concept of centrality to calculate the social importance of potential handing-over nodes. By giving handover precedence to higher-centrality nodes, we achieve an optimal allocation of wireless resources in addition to improved quality of service. The proposed handover strategy offers an additional advantage of reducing global social network traffic.
Dynamic dwell timer for hybrid vertical handover in 4G coupled networks
- Authors: Haider, Ammar , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper
- Full Text: false
- Reviewed:
Decentralized content sharing among tourists in visiting hotspots
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal
- Date: 2017
- Type: Text , Journal article
- Relation: Journal of Network and Computer Applications Vol. 79, no. (2017), p. 25-40
- Full Text:
- Reviewed:
- Description: Content sharing with smart mobile devices using decentralized approach enables users to share contents without the use of any fixed infrastructure, and thereby offers a free-of-cost platform that does not add to Internet traffic which, in its current state, is approaching bottleneck in its capacity. Most of the existing decentralized approaches in the literature consider spatio-temporal regularity in human movement patterns and pre-existing social relationship for the sharing scheme to work. However, such predictable movement patterns and social relationship information are not available in places like tourist spots where people visit only for a short period of time and usually meet strangers. No works exist in literature that deals with content sharing in such environment. In this work, we propose a content sharing approach for such environments. The group formation mechanism is based on users' interest score and stay probability in the individual region of interest (ROI) as well as on the availability and delivery probabilities of contents in the group. The administrator of each group is selected by taking into account its probability of stay in the ROI, connectivity with other nodes, its trustworthiness and computing and energy resources to serve the group. We have also adopted an incentive mechanism as encouragement that awards nodes for sharing and forwarding contents. We have used network simulator NS3 to perform extensive simulation on a popular tourist spot in Australia which facilitates a number of activities. The proposed approach shows promising results in sharing contents among tourists, measured in terms of content hit, delivery success rate and latency.
- Description: Content sharing with smart mobile devices using decentralized approach enables users to share contents without the use of any fixed infrastructure, and thereby offers a free-of-cost platform that does not add to Internet traffic which, in its current state, is approaching bottleneck in its capacity. Most of the existing decentralized approaches in the literature consider spatio-temporal regularity in human movement patterns and pre-existing social relationship for the sharing scheme to work. However, such predictable movement patterns and social relationship information are not available in places like tourist spots where people visit only for a short period of time and usually meet strangers. No works exist in literature that deals with content sharing in such environment. In this work, we propose a content sharing approach for such environments. The group formation mechanism is based on users' interest score and stay probability in the individual region of interest (ROI) as well as on the availability and delivery probabilities of contents in the group. The administrator of each group is selected by taking into account its probability of stay in the ROI, connectivity with other nodes, its trustworthiness and computing and energy resources to serve the group. We have also adopted an incentive mechanism as encouragement that awards nodes for sharing and forwarding contents. We have used network simulator NS3 to perform extensive simulation on a popular tourist spot in Australia which facilitates a number of activities. The proposed approach shows promising results in sharing contents among tourists, measured in terms of content hit, delivery success rate and latency. © 2016
Carry me if you can : A utility based forwarding scheme for content sharing in tourist destinations
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal
- Date: 2016
- Type: Text , Conference proceedings
- Relation: 22nd Asia-Pacific Conference on Communications, APCC 2016; Yogyakarta, Indonesia; 25th-27th August 2016 p. 261-267
- Full Text:
- Reviewed:
- Description: Message forwarding is an integral part of the decentralized content sharing process as the content delivery success highly depends on it. Existing literature employs spatio-temporal regularity of human movement pattern and pre-existing social relationship to take message forwarding decisions. However, such approaches are ineffectual in environments where those information are unavailable such as a tourist spot or camping site. In this study, we explore the message forwarding techniques in such environments considering the information that are readily available and can be gathered on the fly. We propose a utility based forwarding scheme to select the appropriate forwarder node based on co-location stay time, connectivity and available resources. A higher co-location stay time reflects that the forwarder and the destination node is likely to have more opportunistic contacts, while the connectivity and available resource ensure that the selected forwarder has sufficient neighbours and resources to carry the message forward. Simulation results suggest that the proposed approach attains high hit and success rate and low latency for successful content delivery, which is comparable to those proposed for work-place type scenarios with regular movement pattern and pre-existing relationships. © 2016 IEEE.
Content exchange among mobile tourists using users' interest and place-centric activities
- Authors: Kaisar, Shahriar , Kamruzzaman, Joarder , Karmakar, Gour , Gondal, Iqbal
- Date: 2015
- Type: Text , Conference paper
- Relation: 2015 10th International Conference on Information, Communications and Signal Processing (Icics); Singapore, Singapore; 2nd-4th December 2015 p. 1-5
- Full Text: false
- Reviewed:
- Description: In this work we investigate decentralized content exchange among tourists who are mostly strangers, depicts irregular movement patterns and most likely not to have any prior social relationship or difficult to establish any in a tourist spot. We incorporate user's interest, trustworthy online recommendations, and place-centric information to facilitate content exchange in such tourist destinations. The proposed administrator selection policy considers stay probability in activities, connectivity among nodes and their available resources. We have done extensive simulation using network simulator NS3 on a popular tourist spot in Australia that provides a number of activities. Our proposed approach shows promising results in exchanging contents among users measured in terms of content hit and delivery success rate as well as latency. The success rate is comparable to those reported in the literature for cases where social relationship exist and nodes follow regular predictable movement patterns.