1,458 research outputs found
Katakan tidak pada rasuah
Isu atau masalah rasuah menjadi topik utama sama ada di peringkat antarabangsa mahupun di peringkat dalam negara. Pertubuhan Bangsa- bangsa Bersatu menegaskan komitmen komuniti antarabangsa bertegas untuk mencegah dan mengawal rasuah melalui buku bertajuk United Nations Convention against Corruption. Hal yang sama berlaku di Malaysia. Melalui pernyataan visi oleh mantan Perdana Menteri Malaysia, Tun Dr. Mahathir bin Mohamed memberikan indikasi bahawa kerajaan Malaysia komited untuk mencapai aspirasi agar Malaysia dikenali kerana integriti dan bukannya rasuah. Justeru, tujuan penulisan bab ini adalah untuk membincangkan rasuah dari beberapa sudut termasuk perbincangan dari sudut agama Islam, faktor-faktor berlakunya gejala rasuah, dan usaha-usaha yang dijalankan di Malaysia untuk membanteras gejala rasuah. Perkara ini penting bagi mengenalpasti penjawat awam menanamkan keyakinan dalam melaksanakan tanggungjawab dengan menghindari diri daripada rasuah agar mereka sentiasa peka mengutamakan kepentingan awam
A Trustworthy and well-organized data disseminating scheme for ad-hoc wsns
Wireless Sensor Networks (WSNs) generate massive amount of live data and
events sensed through dispersedly deployed tiny sensors. This generated data
needed to be disseminate to the sink with slight consumption of network
resources. One of the ways to efficiently transmit this bulk data is gossiping.
An important consideration in gossip-based dissemination protocols is to keep
routing table up to date. Considering the inherent resource constrained nature
of adhoc wireless sensor networks, we propose a gossip based protocol that
consumes little resources. Our proposed scheme aims to keep the routing table
size R as low as possible yet it ensures that the diameter is small too. We
learned the performance of our proposed protocol through simulations. Results
show that our proposed protocol attains major improvement in network
reachability and connectivity.Comment: 12 Pages, IJCNC 201
Spatial random multiple access with multiple departure
We introduce a new model of spatial random multiple access systems with a
non-standard departure policy: all arriving messages are distributed uniformly
on a finite sphere in the space, and when a successful transmission of a single
message occurs, the transmitted message leaves the system together with all its
neighbours within a ball of a given radius centred at the message's location.
We consider three classes of protocols: centralised protocols and decentralised
protocols with either ternary or binary feedback; and analyse their stability.
Further, we discuss some asymptotic properties of stable protocols
Mobile Social Networking aided content dissemination in heterogeneous networks
Since more and more mobile applications are based on the proliferation of social information, the study of Mobile Social Net-works (MSNs) combines social sciences and wireless communications. Operating wireless networks more efficiently by exploiting social relationships between MSN users is an appealing but challenging option for network operators. An MSN-aided content dissemination technique is presented as a potential ex-tension of conventional cellular wireless net-works in order to satisfy growing data traffic. By allowing the MSN users to create a self-organized ad hoc network for spontaneously disseminating contents, the network operator may be able to reduce the operational costs and simultaneously achieve an improved network performance. In this paper, we first summarize the basic features of the MSN architecture, followed by a survey of the factors which may affect MSN-aided content dissemination. Using a case study, we demonstrate that one can save resources of the Base Station (BS) while substantially lowering content dissemination delay. Finally, other potential applications of MSN-aided content dissemination are introduced, and a range of future challenges are summarized
A comparison of epidemic algorithms in wireless sensor networks
Cataloged from PDF version of article.We consider the problem of reliable data dissemination in the context of wireless sensor networks. For some application scenarios, reliable data dissemination to all nodes is necessary for propagating code updates, queries, and other sensitive information in wireless sensor networks. Epidemic algorithms are a natural approach for reliable distribution of information in such ad hoc, decentralized, and dynamic environments. In this paper we show the applicability of epidemic algorithms in the context of wireless sensor environments, and provide a comparative performance analysis of the three variants of epidemic algorithms in terms of message delivery rate, average message latency, and messaging overhead on the network. © 2006 Elsevier B.V. All rights reserved
SPLAI: Computational Finite Element Model for Sensor Networks
Wireless sensor network refers to a group of sensors, linked by a wireless medium to perform distributed sensing task. The primary interest is their capability in monitoring the physical environment through the deployment of numerous tiny, intelligent, wireless networked sensor nodes. Our interest consists of a sensor network, which includes a few specialized nodes called processing elements that can perform some limited computational capabilities. In this paper, we propose a model called SPLAI that allows the network to compute a finite element problem where the processing elements are modeled as the nodes in the linear triangular approximation problem. Our model also considers the case of some failures of the sensors. A simulation model to visualize this network has been developed using C++ on the Windows environment
Energy managed reporting for wireless sensor networks
In this paper, we propose a technique to extend the network lifetime of a wireless sensor network, whereby each sensor node decides its individual network involvement based on its own energy resources and the information contained in each packet. The information content is ascertained through a system of rules describing prospective events in the sensed environment, and how important such events are. While the packets deemed most important are propagated by all sensor nodes, low importance packets are handled by only the nodes with high energy reserves. Results obtained from simulations depicting a wireless sensor network used to monitor pump temperature in an industrial environment have shown that a considerable increase in the network lifetime and network connectivity can be obtained. The results also show that when coupled with a form of energy harvesting, our technique can enable perpetual network operatio
QoS in wireless sensor networks: survey and approach
A wireless sensor network (WSN) is a computer wireless network composed of spatially distributed and autonomous tiny nodes -- smart dust sensors, motes -, which cooperatively monitor physical or environmental conditions. Nowadays these kinds of networks support a wide range of applications, such as target tracking, security, environmental control, habitat monitoring, source detection, source localization, vehicular and traffic monitoring, health monitoring, building and industrial monitoring, etc. Many of these applications have strong requirements for end-to-end delay and losses during data transmissions. In this work we have classified the main mechanisms that have been proposed to provide Quality of Service (QoS) in WSN at Medium Access Control (MAC) and network layers. Finally, taking into account some particularities of the studied MAC- and network-layer protocols, we have selected a real application scenario in order to show how to choose an appropriate approach for guaranteeing performance in a WSN deployed application
A label based routing protocol for wireless sensor networks
One of the challenging issues in wireless sensor networks is to acquire, process, and transmit information using the least amount of battery power; In response to this problem, a novel routing scheme for wireless sensor networks, called Information Dissemination via Label Forwarding (IDLF) , is presented. IDLF consists of three information exchanging stages. In the first stage, a label is disseminated by a source. After a sink receives the label, it replies a request to the source. By exchanging a label and request, a data path between a source and sink is formed. Finally, an actual data is transmitted through the data path. Transmitting labels and requests, instead of actual data, reduces the redundant transmissions of data packets, and thus achieves energy savings; In addition to IDLF, four energy management schemes---directional forwarding, minimum transmission around the sink, battery threshold value, and differential coding---are proposed. We compare IDLF with flooding and another wireless routing protocol named SPIN. The simulation results show that the IDLF together with four energy management schemes can save a significant amount of energy compared to the other two routings
- …