http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
( Md. Abdur Razzaque ),( Choong Seon Hong ) 한국정보처리학회 2009 한국정보처리학회 학술대회논문집 Vol.16 No.1
Multipath routing in wireless sensor networks has been proven to provide with increased data delivery ratio, security, robustness to node and link failures, network throughput, etc. However, the energy cost for multiple routes construction and their maintenance is very high. This paper proposes a sink-initiated, node-disjoint multipath routing protocol for static wireless sensor networks that significantly minimizes the route construction messages and thereby saves the critical batter energy of sensor nodes. It also distributes the traffic load spatially over many nodes in the forwarding paths, which ensures balanced energy consumption in the network and thereby increases the network lifetime. The simulation results show that it decreases the routing overhead as well as the standard deviation of nodes’ residual energies.
Autonomous Traffic Engineering for Boosting Application Fidelity in Wireless Sensor Networks
RAZZAQUE, Md. Abdur,HONG, Choong Seon,LEE, Sungwon The Institute of Electronics, Information and Comm 2010 IEICE TRANSACTIONS ON COMMUNICATIONS - Vol.93 No.11
<P>This paper presents an autonomous traffic engineering framework, named ATE, a highly efficient data dissemination mechanism for multipath data forwarding in Wireless Sensor Networks (WSNs). The proposed ATE has several salient features. <I>First</I>, ATE utilizes three coordinating schemes: an incipient congestion inference scheme, an accurate link quality estimation scheme and a dynamic traffic diversion scheme. It significantly minimizes packet drops due to congestion by dynamically and adaptively controlling the data traffic over congested nodes and/or poorer quality links, and by opportunistically exploiting under-utilized nodes for traffic diversion, while minimizing the estimation and measurement overhead. <I>Second</I>, ATE can provide with high application fidelity of the network even for increasing values of bit error rates and node failures. The proposed link quality estimation and congestion inference schemes are light weight and distributed, improving the energy efficiency of the network. Autonomous Traffic Engineering has been evaluated extensively via NS-2 simulations, and the results have shown that ATE provides a better performance with minimum overhead than those of existing approaches.</P>
Energy-Aware QoS Provisioning forWireless Sensor Networks: Analysis and Protocol
무하마드마흐법알람,Md. Abdur Razzaque,Md. Mamun-Or-Rashid,홍충선 한국통신학회 2009 Journal of communications and networks Vol.11 No.4
Wireless sensor networks (WSNs) are envisioned to facilitate information gathering for various applications and depending on the application types they may require certain quality of service (QoS) guarantee for successful and guaranteed event perception. Therefore, QoS in WSNs is an important issue and two most important parameters that hinder the goal of guaranteed event perception are time-sensitive and reliable delivery of gathered information, while a minimum energy consumption is desired. In this paper, we propose an energy-aware, multi-constrained and multipathQoS provisioning mechanism forWSNs based on optimization approach. Hence, a detailed analytical analysis of reliability, delay and energy consumption is presented to formulate the optimization problem in an analytical way. A greedy algorithm is proposed to achieve the desired QoS guarantee while keeping the energy consumption minimum. Also, a simple but efficient retransmission mechanism is proposed to enhance the reliability further, while keeping the delay within delay bound. Simulation results demonstrate the effectiveness of our scheme.
ALAM, Muhammad Mahbub,HAMID, Md. Abdul,RAZZAQUE, Md. Abdur,HONG, Choong Seon The Institute of Electronics, Information and Comm 2010 IEICE TRANSACTIONS ON COMMUNICATIONS - Vol.93 No.6
<P>Broadband wireless access networks are promising technology for providing better end user services. For such networks, designing a scheduling algorithm that fairly allocates the available bandwidth to the end users and maximizes the overall network throughput is a challenging task. In this paper, we develop a centralized fair scheduling algorithm for IEEE 802.16 mesh networks that exploits the <I>spatio-temporal bandwidth reuse</I> to further enhance the network throughput. The proposed mechanism reduces the length of a transmission round by increasing the number of non-contending links that can be scheduled simultaneously. We also propose a greedy algorithm that runs in polynomial time. Performance of the proposed algorithms is evaluated by extensive simulations. Results show that our algorithms achieve higher throughput than that of the existing ones and reduce the computational complexity.</P>