http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
( Fasee Ullah ),( Abdul Hanan Abdullah ),( Gaddafi Abdul-Salaam ),( Marina Md Arshad ),( Farhan Masud ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.12
The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient’s data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient’s data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.
Channel Allocation in Multi-radio Multi-channel Wireless Mesh Networks: A Categorized Survey
( Saleem Iqbal ),( Abdul Hanan Abdullah ),( Khalid Hussain ),( Faraz Ahsan ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.5
Wireless mesh networks are a special type of broadcast networks which cover the qualifications of both ad-hoc as well as infrastructure mode networks. These networks offer connectivity to the last mile through hop to hop communication and by comparatively reducing the cost of infrastructure in terms of wire and hardware. Channel assignment has always been the focused area for such networks specifically when using non-overlapping channels and sharing radio frequency spectrum while using multiple radios. It has always been a challenge for mesh network on impartial utilization of the resources (channels), with the increase in users. The rational utilization of multiple channels and multiple radios, not only increases the overall throughput, capacity and scalability, but also creates significant complexities for channel assignment methods. For a better understanding of research challenges, this paper discusses heuristic methods, measurements and channel utilization applications and also examines various researches that yield to overcome this problem. Finally, we highlight prospective directions of research.
( Omprakash Kaiwartya ),( Shiv Prakash ),( Abdul Hanan Abdullah ),( Ahmed Nazar Hassan ) 한국인터넷정보학회 2015 KSII Transactions on Internet and Information Syst Vol.9 No.8
Energy consumption by large computing systems has become an important research theme not only because the sources of energy are depleting fast but also due to the environmental concern. Computational grid is a huge distributed computing platform for the applications that require high end computing resources and consume enormous energy to facilitate execution of jobs. The organizations which are offering services for high end computation, are more cautious about energy consumption and taking utmost steps for saving energy. Therefore, this paper proposes a scheduling technique for Minimizing Energy consumption using Adapted Genetic Algorithm (MiE-AGA) for dependent tasks in Computational Grid (CG). In MiE-AGA, fitness function formulation for energy consumption has been mathematically formulated. An adapted genetic algorithm has been developed for minimizing energy consumption with appropriate modifications in each components of original genetic algorithm such as representation of chromosome, crossover, mutation and inversion operations. Pseudo code for MiE-AGA and its components has been developed with appropriate examples. MiE-AGA is simulated using Java based programs integrated with GridSim. Analysis of simulation results in terms of energy consumption, makespan and average utilization of resources clearly reveals that MiE-AGA effectively optimizes energy, makespan and average utilization of resources in CG. Comparative analysis of the optimization performance between MiE-AGA and the state-of-the-arts algorithms: EAMM, HEFT, Min-Min and Max-Min shows the effectiveness of the model.
OBPF: Opportunistic Beaconless Packet Forwarding Strategy for Vehicular Ad Hoc Networks
( Kashif Naseer Qureshi ),( Abdul Hanan Abdullah ),( Jaime Lloret ),( Ayman Altameem ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.5
In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors` presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.
Localization-Based System Challenges in Vehicular Ad Hoc Networks: Survey
Kashif Naseer Qureshi,Abdul Hanan Abdullah 한국산학기술학회 2014 SmartCR Vol.4 No.6
The vehicular ad hoc network is an emerging technology providing quick and cost-efficient communications in the automobile industry and great applications providing safety, driver assistance and comfort. Real-time information about a vehicle node’s position is based on assumptions acquired from various protocols and applications. One of the most popular technologies, the global positioning system (GPS), has been installed in vehicles to provide reasonable assumptions. A vehicular network depends on localization systems showing vehicle movement in critical areas. GPS systems have faced undesirable issues, such as information not always being available and not being robust enough for some applications. Different types of localization methods have been proposed, such as image/video localization, cellular localization and dead reckoning, to overcome GPS limitations. Data fusion for vehicle positioning is an emerging solution for robust and accurate techniques to replace previous techniques. In this paper, our discussion is based on localization requirements, localization applications and techniques, and the issues for vehicular ad hoc networks. Furthermore, we discuss how these localization techniques and data fusion are combined and used in safety applications to enhance network performance.
Penetration Testing and Network Auditing: Linux
Stiawan, Deris,Idris, Mohd. Yazid,Abdullah, Abdul Hanan Korea Information Processing Society 2015 Journal of information processing systems Vol.11 No.1
Along with the evolution of Internet and its new emerging services, the quantity and impact of attacks have been continuously increasing. Currently, the technical capability to attack has tended to decrease. On the contrary, performances of hacking tools are evolving, growing, simple, comprehensive, and accessible to the public. In this work, network penetration testing and auditing of the Redhat operating system (OS) are highlighted as one of the most popular OS for Internet applications. Some types of attacks are from a different side and new attack method have been attempted, such as: scanning for reconnaissance, guessing the password, gaining privileged access, and flooding the victim machine to decrease availability. Some analyses in network auditing and forensic from victim server are also presented in this paper. Our proposed system aims confirmed as hackable or not and we expect for it to be used as a reference for practitioners to protect their systems from cyber-attacks.
Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network
Qaisar Ayub,M soperi Mohd Zahid,Abdul Hanan Abdullah,Sulma Rashid 대한전기학회 2013 Journal of Electrical Engineering & Technology Vol.8 No.3
DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.