Riri Fitri Sari

Evolutionary multi-objective based approach for wireless sensor network deployment

This paper is a study about deployment strategy for achieving coverage and connectivity as two fundamental issues in wireless sensor networks. To achieve the best deployment, a new approach based on elitist non-dominated sorting genetic algorithm (NSGA-II) is used. There are two objectives in this study, connectivity and coverage. We defined a fitness function to achieve the best nodes deployment. Further we performed simulation to verify and validate the deployment of wireless sensor network as an output from the proposed mechanism. Some performance parameters have been measured to investigate and analyze the proposed sensor-deployment. The simulation results show that the proposed algorithm can maintain the coverage and connectivity in a given sensing area with a relatively small number of sensor nodes.

Performance evaluation AODV routing protocol on ad hoc hybrid network testbed using PDAs

This paper presents our work on the test bed implementation of hybrid ad hoc network. In mobile ad hoc network (MANET), nodes are equipped with wireless device which provides self-managing and self-organizing capability, even when there is no network infrastructure present. Ad hoc hybrid network which enables mobile nodes to form instant communication without depending on infrastructure network can communicate with the other devices through LAN or Internet. The function of ad hoc network is very much dependent on the routing protocol that determines the path between nodes in network. ad hoc on-demand distance vector (AODV) is a kind of a reactive routing protocol for ad hoc network. This protocol is the most popular and widely used routing protocol in research and deployment. In this work, we review and implement AODV routing protocol in a testbed consisting of some PCs, laptops (using Linux Red Hat 9.0 and Fedora Core 2), and PDAs Hewlett Packard iPAQ 5550 series (using Linux Familiar v0.7.2 with Opie 1.2). We particularly focus on the AODV-UU routing protocol. We provide packages (by cross compiling) AODV for PocketPC (PDA), and evaluate the packet delivery ratio, end-to-end delay, and routing overhead of different ad-hoc hybrid network topologies. The testbed implementation result for the average packet delivery ratio is 99.57%, and the end-to-end delay is 1.004 s and the routing overhead is 1,360.36 bps.

An analytical model of A-MSDU scheme with enhanced Block ACK for IEEE 802.11n networks

Wireless Local Area Network (WLAN) has experienced substantial development both from its usage and its technological advances. The development of WLAN technology is marked by the emergence of IEEE 802.11 standard family which are b, a, g, and n. The newest IEEE 802.11n standard is aimed at improving throughput especially in MAC layer by using frame aggregate mechanism utilizing the A-MSDU and A-MPDU schemes. On the other hand, the compressed Block ACK scheme, which is an extension of the Basic Block ACK scheme in IEEE 802.11e standard, was introduced. In this paper, we propose an analytical model to investigate the throughput performance which is produced by using A-MSDU scheme and Block ACK scheme. The throughput produced by the analytical model is then compared to the throughput produced by the A-MSDU and Block ACK scheme from the NS-3 network simulator. The mathematical simulation and NS-3 simulation results show the same outcome that demonstrates the accuracy of our proposed analytical model. The simulation result has also shown that the usage of A-MSDU and Block ACK scheme simultaneously can increase the throughput in MAC layer of IEEE 802.11n.

Implementing web data extraction and making Mashup with Xtractorz

Implementing web data extraction means we can directly extract data from various web pages, where they mostly formed in an unstructured HTML format, into a new structured format such as XML or XHTML. In this paper we review the implementation of web data extraction and stages in making a Mashup. We implement web data extraction by visually extract targeted data from data sources (web pages). Afterward, we combined web data extraction with the stages of making a Mashup, e.g. data retrieval, data source modeling, data cleaning/ filtering, data integration and data visualization. Problems arise in querying data sources due to unstructured contents of web pages (HTML), we cannot directly extract data into a new structured form. To address this problem, we propose a system, called Xtractorz, that can perform web data extraction in a Mashup format. We provide a fully visual and interactive user interface with new technique and approach using PHP and AJAX as the programming languages, and MySQL as the Data Repository. Furthermore, Xtractorz enables the user to conduct their job without the need to write a script or program or even without any knowledge of computer programming. The test results shows that Xtractorz requires less number of steps in making a Mashup compared with RoboMaker and Karma.

Security and performance enhancement of AODV routing protocol

A mobile ad hoc networks MANET is a decentralized, self-organizing, infrastructure-less network and adaptive gathering of independent mobile nodes. Because of the unique characteristics of MANET, the major issues to develop a routing protocol in MANET are the security aspect and the network performance. In this paper, we propose a new secure protocol called Trust Ad Hoc On-demand Distance Vector AODV using trust mechanism. Communication packets are only sent to the trusted neighbor nodes. Trust calculation is based on the behaviors and activities information of each node. It is divided in to trust global TG and trust local TL. TG is a trust calculation based on the total of received routing packets and the total of sending routing packets. TL is a comparison between total received packets and total forwarded packets by neighbor node from specific nodes. Nodes conclude the total trust level of its neighbors by accumulating the TL and TG values. The performance of Trust AODV is evaluated under denial of service/distributed denial of service DOS/DDOS attack using network simulator NS-2. It is compared with the Trust Cross Layer Secure TCLS protocol. Simulation results show that the Trust AODV has a better performance than TCLS protocol in terms of end-to-end delay, packet delivery ratio, and overhead. Next, we improve the performance of Trust AODV using ant algorithm. The proposed protocol is called Trust AODV+Ant. The implementation of ant algorithm in the proposed secure protocol is by adding an ant agent to put the positive pheromone in the node if the node is trusted. Ant agent is represented as a routing packet. The pheromone value is saved in the routing table of the node. We modified the original routing table by adding the pheromone value field. The path communication is selected based on the pheromone concentration and the shortest path. Trust AODV+Ant is compared with simple ant routing algorithm SARA, AODV, and Trust AODV under DOS/DDOS attacks in terms of performance. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, in terms of end-to-end delay, there is no significant improvement. Copyright

Consecutive group paging for LTE networks supporting machine-type communications services

Group paging is one of the mechanisms proposed to resolve the radio access network (RAN) overload problem resulted from simultaneous channel access from huge machine devices [1]. This paper presents a consecutive group paging to enhance the performance of group paging. In consecutive group paging, the base station reserves multiple paging cycles to page the same group of users consecutively such that UEs which failed in the earlier paging cycles can perform random-access procedure again in the later paging cycles. We utilize the analytical model presented in [2] to derive the performance metrics of consecutive group paging. The optimal group size, total number of reserved radio resource and the maximum number of preamble transmission are derived for each value of paging cycle threshold. The accuracy of the proposed analytical model is verified via computer simulations. Simulation results demonstrate that the proposed consecutive group paging enhances the performance of group paging.

Secure AODV Routing Protocol Based on Trust Mechanism

A mobile ad hoc network (MANET) is a wireless network with high of mobility, no fixed infrastructure and no central administration. These characteristics make MANET more vulnerable to attack. In ad hoc network, active attack i.e. DOS, and blackhole attack can easily occur. These attacks could decrease the performance of the routing protocol. In this chapter, we proposed new trust mechanism that has the ability to detect and prevent the potentials attacks into a wireless ad hoc network especially for Denial of Service (DOS) and blackhole attacks. We have proposed some modifications of AODV routing protocol with implemented a trust level calculation. Our proposed mechanism will detect the attack by calculate local and global trust parameters. When a node is suspected as an attacker, the security mechanism will isolate it from the network before communication established. To perform the trust calculation, each node should get all the activity information from his neighbor. In order to ensure the nodes can hear all the activities of his neighbors, each node will run in promiscuous mode. Simulation has been conducted using NS-2 to evaluate our proposed protocol under dos and blackhole attack. We compare the performance of our proposed protocol with existing secure routing protocol such as TCLS [14], LLSP [16], and RSRP [17]. The simulation result shows that our proposed protocols outperform other secure protocols under DOS and blackhole attack in term of packet delivery ratio, end to end delay and routing overhead. We demonstrate that the proposed protocol improves significantly the performance of secure routing protocol.

Color recognition system with augmented reality concept and finger interaction: Case study for color blind aid system

Color blindness is an anomaly which happened in retinal of eye(s) which prevent the patient to recognize or differentiate certain colors. The disability of the patient to recognize color is potential to cause problems to the patient in daily life. Color blind cannot be cured. Therefore, the only method to help color blind people to recognize or differentiate color is with a vision aid kit. In this work, color blind aid system for embedded platform based on Windows Embedded Standard 2009, .NET Framework, OpenCV library and EmguCV Wrapper developed. We create color recognition features implemented with augmented reality concept in the system. In this work, we developed a sound augmented reality concept and finger interaction between user and colored object. Test result according to system testing which has been done from 10 respondents resulting good feedback. The result of finger interaction test shows that the fingertip detection rate reaches 89.6% for skin classification method with HSV color space. Meanwhile, fingertip detection rate reaches 87.5% for skin classification method with YCbCr color space. Furthermore, color recognition rate achieved good result for the majority of tested color types.

Interactive Object and Collision Detection Algorithm Implementation on a Virtual Museum based on Croquet

3D technology has significantly been improved during the last few years, especially in OpenGL library which enable programmers to create 3D shapes easily in some applications. This technology can be applied for virtual reality. In order to implement real elements into virtual simulation, some features to be considered are graphic quality, sound quality, user ability to interact with applications, controls, and algorithms to support virtual simulation, such as collision detection. In this work croquet is used to create an interactive virtual museum. In this virtual museum, users can interact with certain objects, such as museum door, manuscript, and lift. Our virtual museum is enhanced with animated object. We also added collision detection mechanism to prevent avatar from penetrating objects. This application was tested by ten users. They appreciated the overall quality of the museum, and satisfied with the interaction of the simulated objects, as well as with the result of the collision detection.

Timebase dynamic weight for Dijkstra Algorithm implementation in route planning software

This paper reviews Dijkstra Algorithm implementation in finding the shortest path for route planning. The regular shortest path algorithms do not consider the timebase dynamic traffic condition of road network, i.e the hourly changing of traffic density. Timebase dynamic weight for Dijkstra Algorithm compute the most efficient time and minimum fuel consumption based on the real condition of the traffic profiles of the road network. The traffic profiles describe the time needed to pass the road based on time which also differs for workdays and weekend. Simulation shows the implementation of Timebase Dynamic Weight for Dijkstra Algorithm can give better cost efficiency compared with the common Shortest Distance calculation and Traffic Avoidance calculation.