Free Essay

A New Integrated Control Algorithm for Ieee 802.11g Standards

In: Computers and Technology

Submitted By yeyuan129
Words 3037
Pages 13
A New Integrated Control Algorithm for IEEE 802.11g Standards
Qian Liu, Yongxin Yan
International School Beijing University of Posts and Telecommunications Beijing, China e-mail: ee08b050@bupt.edu.cn, ee08b044@bupt.edu.cn
Abstract—Wi-Fi (Wireless Fidelity) mainly adopts IEEE 802.11g standards. And a binary exponential backoff algorithm is adopted to prevent channel collision, which also introduces reduction of the performance of the network. In this paper, an integrated control mechanism (ICM) is proposed which combines a centrally controlled approach and a distributed access mechanism to control the behavior of the system. Through this mechanism, backoff is eliminated from transmission mode, which can significantly enhance the performance of the system. Through theoretical analysis and simulation, the new mechanism can improve the throughput and reduce delay and packet loss rate. According to the results of simulation, with ICM, the throughput can have an improvement of 83.3% and the packet loss rate remains at 0 under appropriate conditions. Keywords-Wi-Fi, integrated control mechanism, centrally control, distributed access

Jing Tu, Bainan Xia
International School Beijing University of Posts and Telecommunications Beijing, China e-mail: ee08b253@bupt.edu.cn, ee08b217@bupt.edu.cn Many experts have proposed different algorithms and approaches to improve the performance of Wi-Fi. Souvik Sen, Romit Roy Choudhury and Srihari Nelakuditi transformed the contention from time domain to frequency domain using subcarrier and multiple antennas. It migrates from backoff operation to frequency domain so that backoff time is greatly reduced to one OFDM symbol time. [1] Ma Dan and Wen Jun proposed dynamic optimization algorithm based on the conflict weight by replacing the accurate measurement of the number of competition terminals with average collision count and introducing conflict weights into DCF. [2] There are many other proposals, like adaptive backoff and implicit pipelining. However, all these improve performance of Wi-Fi based on a common assumption, the application of DCF. And no matter how many improvements they have made, backoff cannot be eliminated completely. [3] II. BACKGROUND Instead of using distributed coordination function alone, we innovatively combine centrally controlled approach and distributed access mechanism together to regulate the entire system’s behavior, in which case backoff does not exist in competing for the channel. The way we realize that is the flexible use of CTS control frame. The traditional RTS/CTS mechanism is applied in this way: nodes that want to send packets send a RTS to Access Point (AP) firstly and the AP returns a broadcast CTS with the address of the node that is allowed to send packet stored in the Receiver Address (RA) field. So node can determine whether to start to send packet by comparing the RA field with its own address. That is the basic fundamental principle of RTS/CTS mechanism. [4] In our approach, only CTS control frame is needed to announce the node to send packet, which transfers the original two-way handshaking to one-way. The principle is similar. In every AP, there is a list of sequenced nodes it controls. The way nodes are sequenced is based on random number generation to guarantee fairness. When it's time for certain node, let say, N1, to send packet, the AP sends a broadcast CTS with the address of node N1 stored in the RA field. And after N1 receives the CTS, it will know it can use the channel now and then start to send packet. Thus, no backoff is necessary to avoid contention because the channel of certain duration exclusively belongs to certain node to use. Because the order and the utilization

I.

INTRODUCTION

Wi-Fi (Wireless Fidelity) is very popular and useful in WLAN communication since it was put forward. Among the IEEE 802.11 standards, 802.11b is the original standard designed to support Wi-Fi. And 802.11g and 802.11a were proposed afterwards to improve the performance of Wi-Fi with new concepts and techniques. Nowadays, 802.11g has become the most important standard for Wi-Fi, which also has backwards compatibility with 802.11b. Although various techniques are applied in 802.11g, e.g. OFDM and DSSS, to greatly improve the communication speed, one stubborn problem embedded in Wi-Fi has not been resolved yet. In Wi-Fi, to prevent collision caused by concurrent transmission, one mechanism called Distributed Coordination Function (DCF) is adopted. DCF has one important characteristic, that is, Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. This protocol introduces a binary exponential backoff mechanism which causes the underutilization of media and the waste of resources including time and bandwidth, especially at high transmission rate. Another technique used in Wi-Fi is Request-To-Send/Clear-To-Send (RTS/CTS) mechanism, which involves a two-way handshaking behavior to allow nodes to access the media. This mechanism leads to delay in transmission process. Because of these two mechanisms, performance of Wi-Fi, including throughput and delay, does not meet the expectations of people.

are determined by access point, this is a centrally controlled approach. As for new node to access the media, it has to advertise itself to the access point to let AP add it to the list. And this is realized by the use of RTS control frame, the only process RTS is used with the possibility contention and backoff may happen. This is a distributed access mechanism. Since our approach is a combination of centrally controlled mechanism and distributed access mechanism, it is an integrated control mechanism (ICM). Next, we will describe our approach in details. III. NEW ALGORITHM Since access point is the core of centrally controlled approach, we focus on the behavior of AP to explain this innovative mechanism. We ideally divide the behavior of AP into two modes, access mode and transmission mode. The former is for the newly-coming nodes to add to the list of AP. The latter is for the nodes existing in the list of AP to send packet. These two modes happen alternately in the behavior of AP. And one access mode and one transmission mode constitute a period of AP’s behavior. Next, they are introduced separately. A. Access Mode At the initial stage, no nodes exist in the list of AP. So AP has to special broadcast CTS with specific address stored in the RA field to announce all the nodes that they can advertise themselves to AP now. When nodes receive the CTS, they will return with a RTS to tell the AP that they want to access the media. When the AP receives the RTS, it will put the node sending the RTS to the first place of the list and enter into the transmission mode. If there are two or more nodes needing to access the media concurrently, the RTS they send to AP will get corrupted. At this time, AP will ignore the corrupted RTS and enter into the transmission mode directly without adding any node to the list. If the node does not receive a normal

broadcast CTS for it immediately (explained later), the node knows it does not obtain the access to the media and it will generate a random number, v, in a range, let say, [1, M]. The random number indicates the next time the node tries to access the media. When the node receives v special broadcast CTSs from AP, it tries to access the media again. B. Transmission Mode AP selects the first node, let say, N0, from the node list and sends normal broadcast CTS with address of N0 stored in the RA field. After comparing the address in RA with its own address, N0 knows it’s time for it to send packet and other nodes just ignore the CTS. If N0 has packet(s) to send, it will send a packet of data to AP along with a randomly generated number in a range. If N0 still has another packet to send, the range of the random number is [0, 2n-1]. If this is the last packet, the range is [2n, 2n+m-1]. If AP successfully receives the data packet, it will send an ACK back to N0. And the number received with the data replaces the original value of N0. If N0 is a newly-added node from last access mode, the number is the value of N0. According to the amount of value of each node in the list, AP reorders the nodes. And then a new normal broadcast CTS with the address of the first node in the new list stored in the RA field is sent out for another packet transmission. If N0 has no packet to send, it will send an empty data packet along with a randomly generated number in a range, [2n, 2n+m-1]. Similarly, AP sends back an ACK if the empty data packet is received successfully. And the number with the packet replaces the original value of N0. A new ordering of nodes happens and a new normal broadcast CTS with the address of the first node in the new list stored in the RA field is sent out for another packet transmission. Sending normal CTS, waiting SIFS, receiving data packet and sending ACK constitute a cycle of transmission (Shown in Fig1). And one transmission mode contains several such cycles. When the transmission mode ends, AP enters into a new access mode to accept new nodes.

Figure 1. Access procedure in the new mechanism

The different settings of the ranges of randomly generated number with data packet and empty data packet

enforce the node with no data to send to be ordered to the end of the list in AP. And when a node sends a certain

number of empty data packets, it is removed from the list. To enter the list of AP again, it needs to wait for the access mode and retry. IV. EVALUATION According to the description of our integrated control mechanism, it can be easily seen that our approach eliminates the possibility of backoff in transmission mode and thus saves channel resources and enhances the overall throughput. Although contention may happen in access mode, it is still a great improvement compared with the original contention all the time. The reduction from twoway handshaking to one-way handshaking simplifies the transmission process. All these will result in an enhancement of performance of Wi-Fi. Besides, we can have a high control over the entire network by setting several key values, like M, n, m mentioned above. Hence, the system based on ICM is a highly controllable system with high performance. Next, simulation about this approach and a comparison between it and the original mechanism are introduced. V. SIMULATION AND COMPARISION To validate our new mechanism, we use MATLAB to simulate the performance, including throughput, system delay, and packet loss rate, of the network under our mechanism with different parameter settings. Besides, we compare it with the performance of the network under the original old mechanism to examine the improvement. A. Standard Parameter Value Variables
Scale of users Average data length(DATA) A Packet Max waiting time(LIMIT) Sending data request period(NEXT) Waiting period of access retry Random range for data packet Random range for blank packet

In Fig. 2, the overall throughputs of the network under new mechanism and old mechanism with different intervals of sending packet are presented. When the number of nodes is small, throughput is likely to increase as the number of nodes increases. But the speed of increasing under new mechanism is larger than that under old mechanism. When the number of nodes increases to some extent, the throughput will remain stable, in which case the throughput of the new mechanism have an improvement of 83.3% compared with throughput of the old mechanism. When we change the interval of sending a packet, the same conclusion can be obtained from the comparison between new mechanism and old mechanism. Besides, the smaller the interval of sending a packet, the faster the throughput reaches its peak.

Figure 3. Throughputs of new VS old by changing packet size

Range
0-50 19500/29500/9500 byte 50/100/400 ms 0-2 seconds 1-4T(default T=100ms) 0-1024 1025-2048

Constants
Data rate Control bit rate Length of ACK message Length of SIFs message in time Physical header length in time Mac header length Max packet length (Ethernet)

Value
54Mbps[5] 11Mbps 112 bit 10 us[6] 192 us[7] 224 bit 1500 byte[8]

In Fig. 3, we still simulate the trend of throughputs of new mechanism and old mechanism but with different sizes of packets. No matter how large the packet is, the throughput of the new mechanism is always larger than those of the old mechanism with the same size of packet. And the improvement is nearly 90% when the packet is 9500-byte long. Under the same mechanism, the throughput has slight difference with different sizes of packets. When the packet is large, the throughput is a bit larger than small packet.

B. Results of simulation

Figure 4. Average Delay new VS old by changing intervals

Figure 2. Throughputs of new VS old by changing intervals

Fig 4 plots the trend of the change of system delay as the number of nodes increases under different mechanisms and different intervals of sending packet. When the interval of sending packet is large, say 100ms or 50 ms, the system delay of the new mechanism is always smaller than that of the old mechanism. Although system delay tends to increase with increasing nodes, the slope of the new mechanism is flatter than the slope of the old mechanism,

which proves a better performance. When the interval of sending packet is small, say 10 ms, the system delay of the new mechanism is larger than that of the old mechanism in the case of a few nodes. However, when the nodes of the network increase, the system delay of the new mechanism becomes smaller than that of the old mechanism because of its relative flat slope.

whether a packet is lost. From Fig. 6, we can find out that when the timing value is large, say 400 ms or 100 ms, the packet loss rate remains at 0.00%. But when the timing value is reduced to 50 ms, some packets become lost when the number of nodes exceeds 50 and the trend of the increase of packet loss rate is rather fast. Referring to the old mechanism, the packet loss rate starts to increase from 0 when the number of nodes only reaches 18 and suffers a slow increasing afterwards. Therefore, our new mechanism performs better than the old mechanism in packet loss rate when the timing value determining whether a packet is lost is large. VI. CONCLUSION The binary exponential backoff algorithm used by DCF causes underutilization of channel and waste of resources in spite of the advantages it brings. Our integrated control mechanism flexibly applies CTS control frame and innovatively let access point determine the order of nodes to transmit packets, which eliminates backoff in transmission mode. Although contention and backoff may exist in the access mode, it does not influence the whole performance too much. And the results of simulation prove the superiority of the new mechanism over the old mechanism. The overall throughput of the network under new mechanism has an improvement of 83.3% compared with the old one. And the packet nearly suffers a loss rate of 0 under appropriate conditions. Although some drawbacks exist in our new mechanism which we will solve in future work, the ICM provides a great improvement to the performance of the network compared with the old mechanism. REFERENCES
[1] Sakurai,T. and Vu,H.L,“MAC Access Delay of IEEE 802.11 DCF” Wireless Communications, IEEE Transactions on, 2007, 6(5), p1702-1710 Wu Ruixiao and Liu Qian “A Novel Centrally Controlled Channel Access MAC Protocol for 802.11 Wireless Networks”. 2010 walking paper MIAO Yi,FENG Hao-ran. “Energy-efficient reduced collision MAC for wireless sensor networks“.Computer Engineering and Applications,2010,46(35):97-100. Feng Haoran and Zhao Qianchuang, “Modeling a typical enhanced 802. 11 DCF-based protocol DIDD in nonsaturated conditions“,Tsinghua Univ(Sci&Tech), 2009, Vol 49,No.1 pp157150 Listen (on the frequency domain) before you talk Souvik Sen, Romit Roy Choudhury, Srihari Nelakuditi Research and optimize in IEEE802.11 MAC protocol. Ma Dan, Wen Jun WU Ya-jun, HU Ai-qun, SONG Yu-bo,” Design and Implementation of WLAN Protocol Analysis System” Computer Engineering, 2008.11, Vol 34, No.22, pp 140-142 H. S. Chhaya and S. Gupta, “Performance modeling of asynchronous data transfer methods of IEEE 802.11 MAC protocol,” Proc. IEEE Symp. Wireless Networks,, IEEE Press, Dec. 2007, pp. 217-234, doi:10.1109/SCIS.2007.357670.

Figure 5. Packet loss rate of new VS old by changing intervals

To examine the influence of the new mechanism to packet loss rate, we plot the relationship between the packet loss rate and the number of nodes under different mechanisms and different intervals of sending packet in Fig. 5. With the same interval of sending packets, the packet loss rate of the new mechanism is obviously smaller than that of the old mechanism. Especially when the number of nodes gets large, the packet loss rate of the old mechanism becomes intolerable while the packet loss rate of the new mechanism keeps small (no more than 0.10%). When the interval of sending packet is large, say 100 ms or 50 ms, the packet loss rate of the new mechanism stays at 0.00%, which indicates a big improvement compared with the old mechanism. When the interval of sending packet becomes small, say 10 ms, the packet loss rate of the new mechanism becomes larger than 0.00% when the nodes increase, but no more than 0.10%. From this result, we can conclude that our new mechanism provides a great improvement to packet loss rate.

[2]

[3]

[4]

[5] [6] [7]

[8] Figure 6. Packet loss rate of new VS old by changing timing values

Further, we examine the performance of packet loss rate under different timing value which determines…...

Similar Documents

Free Essay

Fuzzy Control

...Fuzzy Control Kevin M. Passino Department of Electrical Engineering The Ohio State University Stephen Yurkovich Department of Electrical Engineering The Ohio State University An Imprint of Addison-Wesley Longman, Inc. Menlo Park, California • Reading, Massachusetts Don Mills, Ontaria • Sydney • Bonn • Harlow, England • Berkeley, California • Amsterdam • Mexico City ii Assistant Editor: Laura Cheu Editorial Assistant: Royden Tonomura Senior Production Editor: Teri Hyde Marketing Manager: Rob Merino Manufacturing Supervisor: Janet Weaver Art and Design Manager: Kevin Berry Cover Design: Yvo Riezebos (technical drawing by K. Passino) Text Design: Peter Vacek Design Macro Writer: William Erik Baxter Copyeditor: Brian Jones Proofreader: Holly McLean-Aldis Copyright c 1998 Addison Wesley Longman, Inc. All rights reserved. No part of this publication may be reproduced, or stored in a database or retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher. Printed in the United States of America. Printed simultaneously in Canada. Many of the designations used by manufacturers and sellers to distinguish their products are claimed as trademarks. Where those designations appear in this book, and AddisonWesley was aware of a trademark claim, the designations have been printed in initial caps or in all caps. MATLAB is a registered trademark of The......

Words: 211473 - Pages: 846

Free Essay

Control Architecture and Algorithms of Biped Robot

...Control Architecture and Algorithms of the Anthropomorphic Biped Robot Bip2000 Christine Azevedo and the BIP team INRIA - 655 Avenue de l’Europe 38330 Montbonnot, France ABSTRACT INRIA [1] and LMS [2] have designed and realized an anthropomorphic legged robot, BIP2000 (fig.1). A planar version achieves walking, and the whole robot is able to keep its balance on one foot while moving. The purpose of this paper is to present the principles and the architecture of the robot control we have used. After having presented the robotic system, and the software architecture, we will detail the principles of the robot control. We will finally present implementation issues and experimental results. Keywords: Robot Control, Biped Robots, Walking Machines. 1. DESCRIPTION OF THE SYSTEM The design of the robot was inspired from the human anthropometric data and his dynamic capabilities. We recall here only the main characteristics of BIP2000, the reader being referred to [5] and [9] for more details. Fig1. The Biped Robot BIP2000 Fig2. BIP without Pelvis 1.1 Mechanical Structure of BIP2000 Designed by the Laboratoire de Mécanique des Solides of Poitiers [2], the robot has 15 active joints (fig.3). It is able to walk forward thanks to the rotation of the ankles, knees and hips allowing the flexion/extension of the biped in the sagittal plane (fig.4). The ability of changing direction is given by the trunk, the pelvis and the 2 hips internal/external rotations. For the lateral......

Words: 2364 - Pages: 10

Premium Essay

Web 2.0: the New Standard

...Web 2.0: The New Standard Allen Brooks Southern New Hampshire University IT 210 Web 2.0 is quickly becoming the new standard for internet-based content. This new implementation proves a slippery term to define, but its conceptual themes can be seen throughout the most content-rich web pages on the Internet. As an improvement upon the now surpassed web 1.0, web 2.0 provides users with an Internet “experience” rather than presenting them with a static webpage by integrating constant information updates, collective intelligence, and exploiting the immense benefits of networking effects (2007, O’Reilly). An example of the differences between webs 2.0 and 1.0 can be gleaned from a comparison of the differing approaches to the “software as a service” models of the now struggling to survive Netscape against the booming Google. In 2001, the so-called “dot com bubble” burst and destroyed a conglomerate of business in the process. While many technologists submitted that this was an indication that the Internet itself was “overhyped”, in hindsight, this collapse marked a shift in the cyber landscape (O’Reilly). Tim O’Reilly remarks that, “shakeouts typically mark the point at which an ascendant technology is ready to take [the prevailing technology’s] place at center stage” (O’Reilly). This conclusion yields some insight to the reason for the collapse: users had become bored with stagnant web content that simply presented static information in the form of sporadically......

Words: 929 - Pages: 4

Premium Essay

Third Generation Wireless Standard

... 3G Unit-1: GPRS & EDGE General Packet Radio Service (GPRS) General Packet Radio Service (GPRS) is a mobile data service available to users of GSM mobile phones. It is often described as "2.5G", that is, a technology between the second (2G) and third (3G) generations of mobile telephony. It provides moderate speed data transfer, by using unused TDMA channels in the GSM network. Originally there was some thought to extend GPRS to cover other standards, but instead those networks are being converted to use the GSM standard, so that is the only kind of network where GPRS is in use. GPRS is integrated into GSM standards releases starting with Release 97 and onwards. First it was standardised by ETSI but now that effort has been handed onto the 3GPP. GPRS is different from the older Circuit Switched Data (or CSD) connection included in GSM standards releases before Release 97 (from 1997, the year the standard was feature frozen). In CSD, a data connection establishes a circuit, and reserves the full bandwidth of that circuit during the lifetime of the connection. GPRS is packet-switched which means that multiple users share the same transmission channel, only transmitting when they have data to send. This means that the total available bandwidth can be immediately dedicated to those users who are actually sending at any given moment, providing higher utilization where users only send or receive data intermittently. Web browsing, receiving e-mails as they arrive and......

Words: 18564 - Pages: 75

Free Essay

New Techniques in Design and Analysis of Exponential Algorithm

...New Techniques in Design and Analysis of Exponential Algorithm Arshi Aftab, Shikha Mahajan and Shruti Jajoo Abstract: In this paper we first see how NP problems can be categorized and look at some examples. We then analyze the subset sum problem and prove its NP completeness. We look at various algorithms used to solve the problem and the efficiency of each algorithm. Hence we prove that subset sum problem is NP complete. Keywords: NP complete, NP hard, complexity, subset sum, exponential I. Introduction In the study of computation complexity of problems, we find out the resources required during computation like time, memory and space required. We check if the problem can be solved in polynomial time by some algorithm. An algorithm is said to be solved in polynomial time if its worst case efficiency belongs to O (p (n)) where p (n) is the polynomial of the problems input size. Problems that can be solved in polynomial time are called tractable and those that cannot be solved in polynomial time are intractable. The formal definition of NP problem is as follows: A problem is said to be Non-deterministically Polynomial (NP) if we can find a nondeterministic Turing machine that can solve the problem in a polynomial number of nondeterministic moves. Equivalent definition of NP problem: A problem is said to be NP if 1. its solution comes from a finite set of possibilities, and 2. It takes polynomial time to verify the correctness of a possible......

Words: 1436 - Pages: 6

Premium Essay

An Adaptive Differential Evolution Algorithm with Novel Mutation and Crossover Strategies for Global Numerical Optimization

...482 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS—PART B: CYBERNETICS, VOL. 42, NO. 2, APRIL 2012 An Adaptive Differential Evolution Algorithm With Novel Mutation and Crossover Strategies for Global Numerical Optimization Sk. Minhazul Islam, Swagatam Das, Member, IEEE, Saurav Ghosh, Subhrajit Roy, and Ponnuthurai Nagaratnam Suganthan, Senior Member, IEEE Abstract—Differential evolution (DE) is one of the most powerful stochastic real parameter optimizers of current interest. In this paper, we propose a new mutation strategy, a fitnessinduced parent selection scheme for the binomial crossover of DE, and a simple but effective scheme of adapting two of its most important control parameters with an objective of achieving improved performance. The new mutation operator, which we call DE/current-to-gr_best/1, is a variant of the classical DE/current-to-best/1 scheme. It uses the best of a group (whose size is q% of the population size) of randomly selected solutions from current generation to perturb the parent (target) vector, unlike DE/current-to-best/1 that always picks the best vector of the entire population to perturb the target vector. In our modified framework of recombination, a biased parent selection scheme has been incorporated by letting each mutant undergo the usual binomial crossover with one of the p top-ranked individuals from the current population and not with the target vector with the same index as used in all variants of DE. A DE variant obtained...

Words: 11062 - Pages: 45

Free Essay

Ieee

...IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 18, NO. 3, MARCH 2000 535 Performance Analysis of the IEEE 802.11 Distributed Coordination Function Giuseppe Bianchi Abstract—Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slotted exponential backoff. This paper provides a simple, but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions. The proposed analysis applies to both the packet transmission schemes employed by DCF, namely, the basic access and the RTS/CTS access mechanisms. In addition, it also applies to a combination of the two schemes, in which packets longer than a given threshold are transmitted according to the RTS/CTS mechanism. By means of the proposed model, in this paper we provide an extensive throughput performance evaluation of both access mechanisms of the 802.11 protocol. Index Terms—802.11, collision avoidance, CSMA, performance evaluation. I. INTRODUCTION N recent years, much interest has been involved in the design of wireless networks for local area communication [1], [2]. Study group 802.11 was formed under IEEE Project 802 to recommend an international standard for Wireless Local...

Words: 8526 - Pages: 35

Free Essay

Synchronous Ethernet and Ieee 1588v2 Technology White Paper

...Synchronous Ethernet and IEEE 1588v2 Technology White Paper Issue Date 01 2012-10-30 HUAWEI TECHNOLOGIES CO., LTD. Copyright © Huawei Technologies Co., Ltd. 2012. All rights reserved. No part of this document may be reproduced or transmitted in any form or by any means without prior written consent of Huawei Technologies Co., Ltd. Trademarks and Permissions and other Huawei trademarks are trademarks of Huawei Technologies Co., Ltd. All other trademarks and trade names mentioned in this document are the property of their respective holders. Notice The purchased products, services and features are stipulated by the contract made between Huawei and the customer. All or part of the products, services and features described in this document may not be within the purchase scope or the usage scope. Unless otherwise specified in the contract, all statements, information, and recommendations in this document are provided "AS IS" without warranties, guarantees or representations of any kind, either express or implied. The information in this document is subject to change without notice. Every effort has been made in the preparation of this document to ensure accuracy of the contents, but all statements, information, and recommendations in this document do not constitute a warranty of any kind, express or implied. Huawei Technologies Co., Ltd. Address: Huawei Industrial Base Bantian, Longgang Shenzhen 518129 People's Republic of China Website: http://enterprise...

Words: 5689 - Pages: 23

Free Essay

Simulation and Research on Data Fusion Algorithm of the Wireless Sensor Network Based on Ns2

...2009 World Congress on Computer Science and Information Engineering Simulation and Research on Data Fusion Algorithm of the Wireless Sensor Network Based on NS2 Junguo Zhang, Wenbin Li, Xueliang Zhao, Xiaodong Bai, Chen Chen Beijing Forestry University, 35 Qinghua East Road, Haidian District,Beijing, 100083 P.R.China information which processed by the embedded system to the user terminals by means of random selforganization wireless communication network through multi-hop relay. Thus it authentically achieves the purpose of ‘monitor anywhere and anytime’. The basic function of sensor network is gathering and sending back the information of the monitoring areas which the relevant sensor nodes are set in. But the sensor network node resources are very limited, which mainly embodies in battery capacity, processing ability, storage capacity, communication bandwidth and so on. Because of the limited monitoring range and reliability of each sensor, we have to make the monitoring areas of the sensor nodes overlapped when they are placed in order to enhance the robustness and accuracy of the information gathered by the entire network. In this case, certain redundancy in the gathered data will be inevitable. On the way of sending monitoring data by multi-hop relay to the sink nodes (or base stations) which are responsible to gather the data. It is necessary to reduce the redundant information by fusion processing. Data fusion is generally defined as......

Words: 3532 - Pages: 15

Free Essay

New Lease Accounting Standards

...Edward Logie Accounting 304_01 10/28/2015 Writing Assignment 5 New Lease Accounting Standard On October 7 the FASB held it last decision meeting on their new lease accounting convergence project. The project is a joint project between the FASB and the IASB to change how leases would be recognized. Before leases may or may not have to be recognized on the lessee’s books. The new rule would require lessee to recognize the assets no matter what. The FASB originally was looking to implement the new standard by the end of 2015, but that will not happen. The transition will most likely take place somewhere in 2019. In the article “Lease Accounting Standard New Start Date Likely 2019” they talk about the difficulties faced by companies with this change. The first being that this change comes right along with the changes in revenue recognition, making this a balancing act become for companies to update to the new standards. Second most companies are not ready to take on this change. As stated in the article “Last year Deloitte found that almost 80% of the executives it surveyed were not ready for the standard, citing the quality of data, the complexity of compliance, and a lack of confidence in IT systems as the main concerns for companies.” The reason why I picked this article is because in class we most of the time take about the reasoning and methods and accounting entries that happen with transactions and how changes in practice affect how we recognize these......

Words: 490 - Pages: 2

Premium Essay

Integrated Pest Control for Food Plants

...Pest Management Standards For Food Plants i INTRODUCTION T he National Pest Management Association is pleased to release the 2013 Pest Management Standards for Food Plants. Since 2007, these standards have been the cornerstone of NPMA’s Commercial Division activities. Of note in the 2013 revision is the move away from prescriptive instructions regarding placement and monitoring frequency of pest management devices. Instead, a more results-oriented approach to pest management, based on pest trends, inspection observations, and professional knowledge is embraced. As stated in previous editions, these standards also do not preempt local, state, provincial, and/ or federal regulations. Any service provided must comply with government regulations or statutes governing pest management, safety, and food protection. In addition, food plants may have requirements more stringent than these standards. By embracing these standards, pest management firms demonstrate the industry’s role as protectors of food and property. In addition to these standards, a comprehensive online testing site can be found at www.npmatesting.com. This website includes the study guide and other resources noted in the standards. Through this site, NPMA is working to provide the tools necessary for pest management firms to comply with the standards and raise the level of competency of pest management professionals servicing food plants. We hope that you find these standards to be a......

Words: 13153 - Pages: 53

Premium Essay

Fasb New Leasing Standard

...Focus Accounting Standards Update No. 2016-02, Leases (Topic 842) On February 25, 2016, the Financial Accounting Standards Board (FASB) issued an Accounting Standards Update (ASU) intended to improve financial reporting about leasing transactions. The ASU affects all companies and other organizations that lease assets such as real estate, airplanes, and manufacturing equipment. The ASU will require organizations that lease assets—referred to as “lessees”—to recognize on the balance sheet the assets and liabilities for the rights and obligations created by those leases. The accounting by organizations that own the assets leased by the lessee—also known as lessor accounting— will remain largely unchanged from current Generally Accepted Accounting Principles (GAAP) (Topic 840 in the Accounting Standards Codification). “The new guidance responds to requests from investors and other financial statement users for a more faithful representation of an organization’s leasing activities,” stated FASB Chair Russell G. Golden. “It ends what the U.S. Securities and Exchange Commission and other stakeholders have identified as one of the largest forms of offbalance sheet accounting, while requiring more disclosures related to leasing transactions. “The guidance also reflects the input we received during our extensive outreach with preparers, auditors, and other practitioners, whose feedback was instrumental in helping us develop a cost-effective, operational standard,” added......

Words: 1534 - Pages: 7

Premium Essay

Project Budgeting, Procurement, and Quality Integrated Change Control Plan

...Information Technology Project Management Project Budgeting, Procurement, and Quality Integrated change Control Plan TS5332 Project Budgeting, Procurement, and Quality Instructor: Thursday, July 14, 2016   Contents Triplicty Events Integrate Change Control Plan 1 Plan to Setup Change Control Board (CCB) 1 Category 1. Changes to Project Objectives 1 Category 2. Forced Modification of Scope 1 Category 3. Possible Modification of Scope – 1 Plan to Review and Approve Requested Changes 3 Change management process 4 Change Request Process Flow Requirements 4 Change Request Form and Change Management Log 5 Plan for Managing Approved Change Procedures 5 Evaluating and Authorizing Change Requests 6 Types of Change Requests 7 Status of Change Requests 7 Plan for Corrective and Preventative Action Procedures 8 Overview of CAPA 8 Corrective and Preventative Action Procedure 8 Plan for Areas that Needed to be Updated After Approved Changes Are Implemented 10 Plan for Controlling Project Quality from Standards Based on Quality Report Procedures 10 Control procedures 11 Control methods 11 Quality procedures 11 References 12 Triplicty Events Integrate Change Control Plan Plan to Setup Change Control Board (CCB) Change requests are inevitable in any project. In order to effectively manage the changes for the Triplicty project, a change control board (CCB) has been devised to review and prioritize changes presented during the......

Words: 2261 - Pages: 10

Premium Essay

Vemurafenib: a Potentially New Standard of Care?

...Vemurafenib: A Potentially New Standard of Care? Vemurafenib: A Potentially New Standard of Care? Melanoma is the most deadly form of skin cancer. Advanced metastatic melanoma, stage III or IV, has been incurable and relatively untreatable with “less than 10% of patients responding to traditional chemotherapy” regimens (PubMed Health, 2011). Progress in this area of oncology research has been very slow with the “average prognosis for patients with stage IV metastatic melanoma being 8-18 months” (Chapman., 2011). Proven research shows that the standard chemotherapy regimens don’t actually extend the lives of these patients. The standard first line treatment for late stage metastatic melanoma is dacarbazine (DTIC), used either alone as a single agent or in combination with other chemotherapy agents, and the effects have been minimal. The dacarbazine regimen usually shrinks the tumors for a temporary period, “about 3-6 months,” and then they begin to grow again. (Melanoma Skin Cancer, 2011). Recent research in the past five years has led to some targeted immunotherapy drugs like ipilimumab and peginterferon alpha-2b which have shown some promising results in helping to extend life expectancies for these patients. On August 17, 2011 the Food and Drug Administration gave some much needed hope to these patients with the approval of vemurafenib (Zelboraf). An orally administered targeted chemotherapy agent that has shown statistically significant results in “reducing the...

Words: 1737 - Pages: 7

Free Essay

Traffic Control Algorithm

...Research on the Method and Simulation of Intersection Signal Control based on Multi-agent Jian Zhang Ling Yan Yin Han Gao Song Xue-li Fang Traffic Engineering Research Institute Business School, University of Shanghai for Science and Technology Shanghai 200093, China E-mail:08zhangjian@gmail.com Abstract—On the basis of analyzing development actualities and trends of urban traffic control system, this paper applied the modeling idea and method of multi-agent, constructed an intersection agent, a section agent and a phase agent for isolated intersection control system based on multi-agent technology, studied their structure, function and each agent’s mission, and discussed the relationship among the three types of agent. By control simulating of three actual intersections, it is indicated that the control effect based on multi-agent is much better than the effect of fix-time. The results indicate that the multi-agent technology is an effective method to improve the effect of the current traffic control system, has research value and application value. Keywords-adaptive traffic signal control system; multi-agent; intersection agent; section agent; phase agent artificial intelligence technology, traffic signal control system is developing gradually in the direction of intelligent direction and integrated direction, the research on Intelligent Urban Traffic Control System based on the distribution-coordination has become a new trend[1,4]. Luckily, the agent......

Words: 3284 - Pages: 14

Warcraft : Le commencement Streaming Ultra-HD Warcraft : Le commencement Streaming Ultra-HD Warcraft : Le commencement Streaming Ultra-HD [2160p] gratuit en illimite - Le pacifique royaume d'Azeroth est au bord de la guerre alors que sa civilisation doit faire face à une redoutable race d’envahisseurs : des guerriers Orcs fuyant leur monde moribond pour en coloniser un autre. Alors qu’un portail s’ouvre pour connecter les deux mondes, ... | Стежки дорожки 1963 Mp3 | Recent geüpdate apps