Welcome message from the dependsys 2015 program chairs
- Authors: Khan, Latifur , Kamruzzaman, Joarder , Pathan, Al Sakib Khan
- Date: 2015
- Type: Text , Conference paper
- Relation: 15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015
- Full Text: false
- Reviewed:
ACSP-Tree: A tree structure for mining behavioral patterns from wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Conference paper
- Relation: IEEE Conference on Local Computer Networks (LCN 2013) (21 October 2013 to 24 October 2013) p. 691-694
- Full Text: false
- Reviewed:
- Description: WSNs generates a large amount of data in the form of stream and mining knowledge from the stream of data can be extremely useful. Association rules mining, from the sensor data, has been studied in recent literature. However, sensor association rules mining often produces a huge number of rules, but most of them either are redundant or fail to reflect the true correlation relationship among data objects. In this paper, we address this problem and propose mining of a new type of sensor behavioral pattern called associated-correlated sensor patterns. The proposed behavioral patterns capture not only association-like co-occurrences but also the substantial temporal correlations implied by such co-occurrences in the sensor data. Here, we also use a prefix tree-based structure called associated-correlated sensor pattern-tree (ACSP-tree), which facilitates frequent pattern (FP) growth-based mining technique to generate all associated-correlated patterns from WSN data with only one scan over the sensor database. Extensive performance study shows that our approach is time and memory efficient in finding associated-correlated patterns than the existing most efficient algorithms.
Regularly frequent patterns mining from sensor data stream
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Conference paper
- Relation: International Conference on Neural Information Processing (ICONIP 2013) p. 417-424
- Full Text: false
- Reviewed:
- Description: Mining interesting and useful knowledge from the huge amount of data gathered in wireless sensor networks is a challenging task. Works reported in literature use support metric-based sensor association rule which employs the occurrence frequency of patterns as criteria. Such criteria may not be appropriate for finding significant patterns. Moreover, temporal regularity in occurrence behavior should be considered as another important measure for assessing the importance of patterns in WSNs. Frequent sensor patterns that occur after regular intervals is called regularly frequent sensor patterns. Even though mining regularly frequent sensor patterns from sensor data stream is extremely important in many real-time applications, no such algorithm has been proposed yet. In this paper, we propose a novel tree structure called Regularly Frequent Sensor Pattern-tree (RSP-tree) and an efficient mining approach for finding regularly frequent sensor patterns from WSNs. Extensive performance analyses show that our technique is time and memory efficient in finding regularly frequent sensor patterns.
Global optimal solutions to nonconvex euclidean distance geometry problems
- Authors: Ruan, Ning , Gao, David
- Date: 2012
- Type: Text , Conference paper
- Relation: 20th International Symposium on Mathematical Theory of Networks and Systems
- Full Text: false
- Reviewed:
- Description: This paper presents a canonical dual approach for solving nonconvex minimization problems in Euclidean distance geometry. The variant of this problem arises extensively in engineering and science, including computational biology, sensor network communications, database analysis, information technology, and global optimization. Due to the nonconvexity, most of these problems are NP-hard and traditional convex optimization methods can not be used directly for finding global optimal solutions. We first show that this type of nonconvex problems can be transferred to a concave maximization problem over a convex set. Then a general analytical solution is proposed by using the canonical duality theory. Applications are illustrated by network localization and minimization of Rosenbrock function. Furthermore, by using a perturbed canonical dual approach, a class of Euclidean distance problems can be converted to a unified concave maximization dual problem with zero duality gap, which can be solved by well-developed convex minimization methods.
Optimum clusters for reliable and energy efficient wireless sensor networks
- Authors: Sadat, Anwar , Karmakar, Gour
- Date: 2011
- Type: Text , Conference paper
- Relation: 2011 10th IEEE International Symposium on Network Computing and Applications (NCA) p. 342-347
- Full Text: false
- Reviewed:
- Description: One of the challenging aspects for wireless sensor network (WSN) clustering is to estimate the optimal cluster number. Most WSN clustering techniques have used an a priori value to determine the cluster number. A few techniques, available at the literature, attempted to find the optimal cluster number by energy minimization. However, due to the assumption of lossless communication, these initiatives do not always converge to the minimum energy as wireless channels are error-prone. As wireless communication is always vulnerable to the signal interference, environmental noise, and so on, it suffers from data loss. To capture the characteristics of the communication phenomenon in a real context and have better reliability, we need to embed the link quality into the cluster number determination process. To address this issue, in this paper together with the energy, we incorporate link quality metric into the theoretical underpinning to achieve an optimal cluster number analytically and finally justified the result by simulation.
Resonant frequency band estimation using adaptive wavelet decomposition level selection
- Authors: Yaqub, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper
- Relation: 2011 IEEE International Conference on Mechatronics and Automation (ICMA) p. 376-381
- Full Text: false
- Reviewed:
- Description: The vibrations induced by machine faults help in diagnosis and prognosis of the machine. It is crucial for the fault diagnostic system to extract resonant frequency band which carries useful information about the defect frequencies and contains maximum signal to noise ratio. The spectral orientation of the resonant frequency band varies with the variation in machine dynamics. The existing techniques which employ wavelet transformation to exploit the signal energy distribution among different frequency sub-bands, are based on fixed decomposition level and do not optimize the wavelet parameters according to varying machine dynamics. The proposed study develops a novel technique: Adaptive Wavelet Decomposition and Resonance Frequency Estimation (AWRE) which estimates the positioning of the resonant frequency band based on adaptive selection of the wavelet decomposition levels. The results for the simulated as well as actual vibration data demonstrate that the proposed technique estimates the bandwidth of the resonant frequency band quite effectively.
Severity invariant machine fault diagnosis
- Authors: Yaqub, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2011
- Type: Text , Conference paper
- Relation: 6th IEEE Conference on Industrial Electronics and Applications p. 21-26
- Full Text: false
- Reviewed:
- Description: Vibration signals used for abnormality detection in machine health monitoring (MHM) suffer from significant variation with fault severity. This variation causes overlap among the features belonging to different types of faults resulting in severe degradation of fault detection accuracy. This paper identifies a new problem due to severity variant features and proposes a novel adaptive training set and feature selection (ATSFS) scheme based upon the orientation of the test data. In order to build ATSFS and validate its performance, training and testing data are obtained from different severity levels. To capture the non-stationary behavior of vibration signal, robust tools such as wavelet transform (WT) for time-frequency analysis are employed. Simulation studies show that ATSFS attains high classification accuracy even if training and testing data belong to different severity levels.
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.
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.
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:
Coexistence mechanism for industrial automation network
- Authors: Yaqub, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2010
- Type: Text , Conference paper
- Relation: 12th IEEE International Conference on High Performance Computing and Communications
- Full Text: false
- Reviewed:
- Description: Increase in the number of coexisting networks in license free Industrial, Scientific and Medical (ISM) band causes interferences for industrial automation, e.g., shop floors of manufacturing facilities. In order to ensure the reliability for automation networks, interference avoidance schemes are required. This paper proposes a novel Predefined Hopping Pattern (PHP) technique for frequency hopping in ISM band, which mitigates self-interferences and static interferers as well. This technique generates optimized frequency hopping sequences which ensure sufficient frequency diversity and frequency offset among the coexisting Bluetooth piconets and exploits transmission experiences for a particular frequency in eliminating interference. Simulation studies have shown that PHP has better collision avoidance rate than well known adaptive frequency hopping (AFH) and adaptive frequency rolling (AFR) schemes.
Enhanced IEEE 802.11 by integrating multiuser dynamic OFDMA
- Authors: Ferdous, Hasan , Murshed, Manzur
- Date: 2010
- Type: Text , Conference paper
- Relation: Ninth Wireless Telecommunications Symposium p. 1-6
- Full Text: false
- Reviewed:
- Description: In this paper, we discuss the problems associated with the present contention resolution mechanism of IEEE 802.11 DCF and present a new, dynamic and robust approach to improve it. Our new MAC, using OFDMA in the physical layer, can incorporate multiple concurrent transmissions or receptions in a dynamic manner and can adjust the collision probability based on the traffic load when nodes are endowed with a single half-duplex radio only. Simulation results show that our system improves throughput by up to 40 percent, reduces collision in control messages by up to 80 percent and reduces the average delay for data transmission by up to 20 percent.
Increasing voice capacity over IEEE 802.11 WLAN using virtual access points
- Authors: Siddique, Md , Kamruzzaman, Joarder
- Date: 2010
- Type: Text , Conference paper
- Relation: Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE p. 1-6
- Full Text: false
- Reviewed:
- Description: Voice capacity over IEEE 802.11 networks can be increased with time synchronized medium access, but it is restricted to single hop networks only. We propose a collaborative mechanism that enables client nodes to carry out the time synchronization on ad hoc basis, thereby extends the time synchronized access mechanism over multiple hops, and increases voice capacity considerably. To model real scenario closely, we consider the impact of channel error and employ a Markov chain to determine delay and loss in both medium access and in queue which is then used to derive user perceived voice quality using ITU-T E-model. Our model is then used to determine voice capacity of multichannel, multihop networks. The impact of data rate, interference range, and multiple channels are also analyzed
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.
Performance analysis of vertical handoff algorithms with QoS parameter differentiation
- Authors: Sharna, Shusmita , Murshed, Manzur
- Date: 2010
- Type: Text , Conference paper
- Relation: 12th IEEE International Conference on High Performance Computing and Communications p. 623-628
- Full Text: false
- Reviewed:
- Description: Despite recent interests in developing vertical handoff decision algorithms, an essential component of the architecture of the next generation heterogeneous wireless networks, very few studies have so far reported any meaningful comparative performance analysis. This paper attempts to fill this gap in the literature by presenting a comprehensive study on the performance of three vertical handoff decision algorithms, namely, SAW (Simple Additive Weighting), TOPSIS (Technique for Order Preference by Similarity to Ideal Solution), and MDP (Markov Decision Process). We have used both analytical and simulation tools (ns-2.29) to evaluate and compare expected total QoS offerings in the mean duration of a service under different state transition probability distributions, user perception models on the importance of QoS parameters, and network switching costs. To our surprise, we have observed TOPSIS achieving the best performance despite MDP's using the optimal policy. We suspect that the user satisfiability model used in MDP to estimate link rewards might have contradicted the underlying user perception model used to estimate normalised weight of each QoS parameter, which will be investigated in future.
Query processing over distributed heterogeneous sensor networks in Future Internet : Scalable architecture and challenges
- Authors: Azad, Arman , Kamruzzaman, Joarder , Srinivasan, Bala , Alam, K. , Pervin, Shaila
- Date: 2010
- Type: Text , Conference paper
- Relation: Second International Conference on Advances in Future Internet p. 75-81
- Full Text: false
- Reviewed:
- Description: The wireless networked sensors embedded with everyday objects will become an integral part of Future Internet, where the interaction among people, computer and those objects will shift the current Internet to a new paradigm, namely the Internet of Things. The terabyte torrent of data generated by billions of sensors belonging to a large number of distributed heterogeneous sensor networks in Future Internet will only be valuable if they can be effectively used on purpose, which leads to the necessity of an Internet scale query processing framework. In this paper, firstly, we focus on the distinct challenges present in Internet scale query processing over distributed sensor networks. Then, we propose a flexible and scalable system architecture capable of handling the complex scenario that might arise from the integration of a large number of such networks in Future Internet. Finally, we discuss the overall query processing methodology over such system and present some directions on the possible solutions to a number of identified research challenges. The outcome of this paper would foster the sensor network research in Future Internet domain
Reliable and energy efficient backup clustering scheme for wireless sensor networks
- Authors: Sadat, Anwar , Karmakar, Gour , Zaslavsky, Arkady , Gaber, Mohamed
- Date: 2010
- Type: Text , Conference paper
- Relation: International Conference on Information Networking 2010 p. 248-253
- Full Text: false
- Reviewed:
- Description: Cluster-based routing protocols for wireless sensor networks have proved to be a very popular and effective innovation. They are inherently energy efficient and scalable owing to the distributed nature and hierarchical organization of sensor nodes, as well as the use of cluster heads in data reception, aggregation and transmission. However, their reliability is very limited because of the potential for sudden break down and the traffic congestion in a cluster head. A wireless communication link is also vulnerable to interference and noise. In addition, to form an optimal cluster is a NP hard problem. These problems make it very challenging to improve the reliability and energy efficiency simultaneously. To address these issues, this thesis proposes a number of clusterbased routing protocols that consider many challenging issues, such as the cluster number determination, the inter-cluster communication cost, the link quality and traffic congestion during the node clustering phase. This thesis contributes four innovative methods that improve both the reliability and energy efficiency of a wireless sensor network simultaneously. The first of these contributions is an optimum backup clustering technique, which reduces the re-clustering overhead of the network and safeguard a cluster head node from sudden break down. The second method, reliable and energy efficient inter-cluster communication, reduces the chance of a cluster head breakdown by developing routing paths that consider the optimal inter-cluster communication cost. This method also considers data loss due to poor link quality and congestion at the CH node. The third method, optimum cluster number determination technique for uniform wireless sensor network, integrates the wireless link quality factor analytically for estimating the optimal cluster number to be used in any suitable clustering protocol. Finally, joint optimization of number and allocation of clusters is introduced, which calculates the optimum cluster number at the time of node clustering. This is applicable in a wireless sensor network with both uniform and non-uniform node distributions. The performance of all the proposed methods is evaluated along with the computational complexity analysis and message overhead. To check whether the method promotes a sustainable environment, performance analysis of the backup clustering scheme has been presented for a certain portion of sensor nodes equipped with a solar cell. Statistical tests confirm that the new clustering methods exhibit significant improvements in terms of both reliability and energy efficiency over the most popular contemporary clustering protocols (e.g. HEED and only one existing backup clustering technique) with the comparable computational complexity and message overhead.
Voice over multi-channel multi-radio WLANs with power capture and imperfect channel
- Authors: Siddique, Md , Kamruzzaman, Joarder
- Date: 2010
- Type: Text , Conference paper
- Relation: 2010 IEEE Wireless Communications and Networking Conference p. 1-6
- Full Text: false
- Reviewed:
- Description: VoIP offers cheap voice communication which instigated its quick market growth. IEEE 802.11 WLANs offer cheap wireless coverage which can be used to provide VoIP service in mobile devices. But call capacity of such networks is very low compared to wired networks. To increase voice capacity in WLANs incorporation of power capture, increased data rate, and use of multiple channels are of great importance. Moreover, these networks should be carefully designed considering voice quality requirements to avoid call jitter and call drops. We propose an analytical model to estimate VoIP call capacity for multichannel WLANs with consideration for power capture, imperfect channel, and multiple network interfaces. We employed ITU-T E-model to assess voice quality which is used as the limiting factor to ensure that voice quality does not degrade in such networks. The model will be extremely helpful to network designers in planning single channel or multi-channel WLANs.
VoIP service over multihop 802.11 networks with power capture and channel noise
- Authors: Siddique, Md , Kamruzzaman, Joarder
- Date: 2010
- Type: Text , Conference paper
- Relation: 2010 IEEE International Conference on Communications p. 1-6
- Full Text: false
- Reviewed:
- Description: The quick market growth and ubiquitous acceptance of VoIP are primarily due to cheap service. VoIP services can be availed in mobile devices at a very low cost by employing IEEE 802.11 to provide last mile coverage. But call capacity is very low in these networks and call jitter occurs if voice quality requirements are not precisely met. We present a VoIP call capacity model for 802.11 networks which considers the most important real world factors like power capture and imperfect channel. Incorporating multiple channels can increase call capacity while multihop network can provide considerably large coverage. Our capacity model incorporates the effects of both multiple channels and multihop networks. We also consider the availability of multiple radio interfaces and conference call scenarios for ubiquitous applications of our model. To ensure voice quality, in addition to contention analysis, we also model the queue considering collision domain at each hop and formulate call capacity by estimating precise impairment budget over multihop.
Cooperative spectrum sensing in realistic RF environment
- Authors: Shahid, Mohammad , Kamruzzaman, Joarder
- Date: 2009
- Type: Text , Conference paper
- Relation: 20th Personal Indoor & Mobile Radio Communications Symposium 2009 (PIMRC2009) p. 2290-2294
- Full Text: false
- Reviewed:
- Description: Fixed spectrum licensing policies are unsuitable to meet RF spectrum demand by emerging technologies. Spectrum scarcity is hindering the enhancement of current services or deployment of new services operating in RF spectrum. On the contrary, many portions of the licensed spectrum remain unused or underused for significant period of time creating possibility of opportunistic spectrum access without license. Spectrum sensing is practiced in most of the existing opportunistic spectrum access methods. However, these methods consider identical fading or shadowing channels and ignore spatial variation of unlicensed users, hence fail to capture realistic scenario. We introduce an improved cooperative spectrum sensing technique which incorporates non-identical fading and shadowing, and weighs each non-licensee user's contribution appropriately considering the received power and positional displacements of the users. The proposed method demonstrates better detection accuracy and higher spectrum utilization with fewer cooperating users than other existing methods.