- Libertad Pantoja-Hernàndez added an answer:6Can anyone recommend a collaborative tool for work with researches?
I'm remotely working with two other engineers. Our content as a database that requires data visualisation, some scripts on Python/R and article in LaTex. We use github and skype for out work, but this is not good enough. Are there any platform designed for this kind of collaboration?
For the article I strongly suggest Overleaf (it has been really helpful to work remotely with my advisors).Following
- Qi Su asked a question:NewCan anyone suggest some recent papers regarding deployment of content servers for CDN?
Can anyone suggest some recent papers regarding deployment of content servers for CDN?Following
- Kashif Naseer Qureshi added an answer:4What are the mapping parameters for quality of service?
I want to know the parameter of qos for mapping traffic from intserv to diffserv
In order for the service level management system to verify whether the specified QoS parameters are being met, the system must gather performance data from the underlying network performance monitoring system and map such data to the QoS parameters. Some QoS parameters are availability, delivery, latency, bandwidth, MTBF and MTRS.Following
- Mladen Vukašinović added an answer:5Could anyone suggest an efficient network decomposition technique to analyse the computer data communication networks?
Studying the computer and communication networks in terms of Graph structures is one of the fields of current interest. In this direction Graph algorithms are investigated to get deep into the topic of interest.
Monitoring tools for analyse the computer data communication networks you can use
NetFlow Analyzer MenageEngine.
You can download it on internet for free. And you can use for monitoring 2 interfaces free licence.
Link for demo graph.
- Yasir Karam added an answer:3Is there any efficient method in Opportunistic Routing (OR) to let the highest priority candidate node forward the received packet?
As for traditional Opportunistic routing (OR) (e.g. ExOR), the candidate node who received the packet from the upstream node will send back an ACK in the corresponding timeslot according to it's priority in the sender's candidate set.
The ACK serves the following purposes：
1. Let the sender know that there is at least one node in the candidate set have received the packet;
2. Achieve the candidate cooperation goal. As for ExOR, to let the highest priority node in the candidate set who received the packet do forwarding, every node will send an ACK in the corresponding timeslot. If a candidate node hear a higher priority node's ACK before it's timeslot, such node's ID will be added in the lower priority node's ACK. According to this method, the duplicate forwarding of a certain packet will rarely happen.
The ExOR seems not efficient as there is no need for every candidate to return back an ACK in some situation. So I propose this question to ask if there is any efficient method to achieve the candidate cooperation goal?
Use AI reasoning techniques such as automated planning, node evaluation, eager dispatching, late binding,...etcFollowing
- Sai R N added an answer:6How do I calculate energy consumed in WSN simulation in NetSim?
Can some one tell me how is energy consumption in WSN calculated. The nodes can be in transmitting or receiving or idle or in sleep ? Also how is the energy consumed by the entire network calculated ? Thanks
Thank you Haitao and AkashFollowing
- Gandhi Kishan Bipinchandra added an answer:3How do we implement Watchdog Protocol for detecting misbehaving nodes/links in Wireless Sensor Networks?
I have been trying to implement Watchdog mechanism in NS2 to detect misbehaving nodes/links in wireless sensor networks. Please guide!
i think you can use Autonomic Workload Provisioning (AWP) technique this can be helpful to you
- Priyanka Bansal asked a question:OpenResponse is not coming from drool-guvnor, How it communicate with rabbitmq?
Response is not coming from drool-guvnor, is there any setting of drool-guvnor in rabbitmq?? how these two communicates? If response is null, then what could be the various problems ?Following
- Aliyu Babale added an answer:14What is the difference between AWR, HFSS, ADS, CST?Under what circumstances and parameters is each best to be used? General Concept information about Microwave design softwares?
Hi every1. can some1 advise me on which of the tool is suitable for my work? i am working on Branch line coupler.Following
- Simar Preet Singh added an answer:2Can any one tell how can implement live migration of VM by cloudsim?
Live migration refers to the process of moving a running virtual machine or application between different physical machines without disconnecting the client or application. Memory, storage, and network connectivity of the virtual machine are transferred from the original host machine to the destination
Have any one implemented load balancing on Cloud Sim? do ping at email@example.comFollowing
- Mohammad zakaria Masoud added an answer:7What is the well position of base station in leach, leach-c and pegasis?
After your experiences, tell me what the best position of the base station in an area of 100 x 100 m, is the center, or the extremity or outside corresponding to the best density (number of nodes)?
All WSN papers that deal with clustering locate sink in the center. The locations of other nodes are random with normal distribution. this makes the center more near to most of the nodes. If you try to use K-mean algrithm to find four different clusters you will find that they located around the center.Following
- Akash Mondal added an answer:3How can I implement a bursty packet loss model using multistate Markov models?
My problem is how to implement the time where a link is not used. Example. Let us assume a two-state markov chain (Gilbert-Elliott model). Node 1 sends a packet to node 2 and this packet is lost so that the model goes to the state "last packet was lost". Now the congestion control mechanism at node 1 drops this packet (due to deadline or other parameter). After a time where the link 12 is not used, I guess that the model should come back to the state "last packet was right".
1. Is this right? Should this time be equal to a packet transmission time? Maybe it should be related to the coherence time of the channel but I guess that these models are somehow an abstraction of the physical layer.
2. Moreover, I have never read that the packet size is taken into account. Do these models take into account that all the packets have the same size?
You can use a two state markov chain for creating bursty packet loss
State 1 - packets without loss
State 2 - packets undergo loss
p is the transition probability to remain in state 1, while 1-p is the transition probability it will go from 1 to 2. q is the transition probability it will stay in state 2 while 1-q is the probability it will go from state 2 to state 1. As you increase p and q, the amount of burstiness will increase.
The packet error rate PER = 1 - ((1-BER)^Packetlength). In your calculations somewhere packet length will affect p and q.Following
- Manju Shanmugam added an answer:10Whether simulation of Disruption Tolerant Networks (DTN) can be done by using NS2? Does it requires any patch file?
Which tool will best suit DTN simulation?
Thanks Mr.Juan. Will try doing that.Following
- Bambi Jimenez added an answer:8Analytical vs Simulation results?
I am working on verifying bandwidth consumption for my proposed method with the existing related work. I have verified the same with simulation results and would now also like to verify the results analytically. How can i proceed ahead. Should i have to derive a mathematical expression and then simulate it and compare with the simulation set of results. I lack the understanding of theoretical analysis.
analytical is for the sciences (CS) while implementation is for ITFollowing
- Katumba Noah added an answer:3What is the current problem with OTP on multicloud and what are the prevention solutions? Will OTP secure data in multicloud?
Importance of OTP and Disadvantage of OTP
What is the current problem with OTP on multicloud and what are the prevention solutions? Will OTP secure data in multicloud?
Authentication is the key for information security for the reason that if the authentication mechanism is compromised, the rest of the security
measures are by passed as well password (OTP) schemes, offer available
alternative or a supplement to traditional password schemes
The approaches designed password authentication schemes enable one to
overcome guessing attack and achieve mutual authentication.
Multi factor authentication security process in provides two means of
identification, one of which is typically a physical token, such as an application and
the other of which is typically something memorized, such as a security code or password. In this context, the two factors involved are sometimes spoken of as something you have and something you know.
The need for encrypting Passwords comes from fact that we need to protect passwords of users .
The users then will be prevented from attacks like brute force attack, phishing,
Distributed Denial of Service (DDOS) through password encryption and multi factor
authentication(via One Time Password and image security at registration)
IADIS international Conference, Applied Computing 2007, Salamanca, Spain, pp. 160,167Following
- Ram Narayan Yadav added an answer:2How do I find Hamiltonian cycle in given a nice tree decompositions?
Given a nice tree decomposition of width w of graph with n vertices, HAMILTONIAN CYCLE can be solved in time w^O(w ).n. Could anyone send me the papers related to finding Hamiltonian Cycle on nice tree decomposition in time w^O(w ) · n ?
Thank you for reply but I am asking Dynamic programming on graph G of bounded tree
width to check whether G contains Hamiltonian cycle or not.Following
- Heitor Scalco Neto added an answer:4Can someone explain how the two-second time window of KDD Cup 99 works?
I'm implementing an Network Intrusion Detection System with Neural Networks.
But, to apply this method in a real network, I need a "parser".
I have a question about the two-second time windows of KDD Cup 99 (Table 3 of http://kdd.ics.uci.edu/databases/kddcup99/task.html).
How it works? I need get the last two-second of each connection or the last two-second before each connection? Or something else?
Thank you Abdullah!Following
- Gasim Alandjani added an answer:8Can someone explain the concept of cloud computing with real-time examples or analogies?How does cloud service work in the organization?
I wish to do my research in the field of Cloud Computing and Security. Kindly provide me the ideas to start up my research work. Thank You
Accessing any computer services without knowing computers physical condition or location is virtually known as cloud computing. There are other characteristics by which cloud can be distinguished. i.e. by on demand service a cloud use can one-sided get provision of using computing services, storage services, network services without going in detail and without human interaction to each service. Broad network access privilege is also available by the use of standard techniques of using heterogeneous network client include think or think client platforms. By the use of clouds companies shared their resources by resource pooling through which computing, broadband network, memory and storage resources are pooled and are available for different users for their heterogeneous nature of requirements without knowing details about physical location of these backend pooled resources. Capabilities can be automatically available to fulfilled the run-time or on demand services. To the consumer, the available capabilities are appeared as to be unlimited and can be approached at any time in quantity. Resources are automatically controlled and optimized by leveraging a metering capability at some level of abstraction which are appropriate for some services like processing storage, bandwidth and user accounts which also give a privilege to print report for resources usage by the use of histogram to ensure transparency for both consumer and service provider.Following
- Seshadri Ramaswami added an answer:2How do I use Boost Graph Library in Eclipse for C++ (Windows)?
I never used Boost libraries. I wish to know how I can use the library in my program. Do I need to install boost or use the binaries? What changes do I need to make in the Eclipse project and Eclipse settings? Thank you in advance
Please refer to:
- Yahaya Abd Rahim added an answer:1Is there a way to attain QoS without changing the EDCA parameters? Are there any other parameters that can be used for ensuring QoS?Are there any parameters or functions in routers that can be used to ensure QoS other than EDCA? EDCA parameters are MAC layer parameters and they are not modifiable. I want a way that gives similar kind of functionality or in other words a replacement to EDCA parameters like TXOP, CWmin etc.
Currently, I still using EDCA cause more comfortable and accurate.Following
- Ghulam Sarwar added an answer:4What is the bandwidth used by a unicast path?
End-to-End bandwidth used by a path it may be the sum of bandwidth of each link of the path.
Chaung and Sirbu law states that the links to reach a multicast group (MG) of size m is proportional to the size of the group. Can i say that the Bandwidth used by a MG is equal to the (Source traffic Rate * #-of-links)?Following
- Muneer Bani Yassein added an answer:2Are there open data sets available for covert channel experiments?
Are there open data sets available for covert channel experiments? or otherwise are there tools to simulate and capture the data?
Yes, a set of tested tools have been developed,, please read have a look at this reference,
- Abdelhalim Zekry added an answer:1Could someone explain me clearly the impact of the channel delay spread and the channel coherence bandwidth in the design of error correcting codes?
In the design of an error correcting code, what can be the impact of such channel parameters.
This is really a good question and it needs investigations to precisely answer it.
In order to answer it, i will stick to the basic principles and concepts of the channel performance and the channel coding.
Assume you have a communication channel that has multipath effects such that the delay spread of the symbols is Tau, The coherence bandwidth Bc = 1/ Tau. The consequence of this delay spread is the channel bandwidth is limited to certain bandwidth Bc which is termed the coherence bandwidth. It means that as the signal bandwidth is smaller than the channel coherence band width, the signal will suffer only from flat fading and the signal can be detected with correctly with very few errors. In case of that the bandwidth of the transmitted signal is greater than the coherent channel bandwidth the fading will be selective deep fading such that some signal frequencies will be severely attenuated. Such selective fading must be treated by frequency domain equalizers. Such that the channel response becomes flat at all signal frequencies.
Such frequency selective fading may be severe such that that one can not completely eliminate it by equalizers. Fast fading has also the same effect in case of
doppler spread which can be reduced by time domain equalizers. One can additionally utilize channel coding to reduce the bit error rate by detecting and correcting the errors in the bits.
There are two major types, the block codes and the convolutional codes. The convolutional codes are capable to correct discrete bit errors while Reed Solomon codes are capable to correct complete symbols and therefore are capable to combat burst errors. By adding interleaves to the the convolutional encoders they become capable to correct burst errors. To combat deep fading errors, a method capable to combat burst type error is required.
In summary ,It is so that one can use:
- Interleavers + convolutional encoders,
- Turbo encoders which are composed of two recursive convolutionl encoders with inerleaver between the outer and the inner one.
It must be said the channel coding is basically used to enhance also, the white Guassian noise channels. and consequently all types of the channels.
- Riaz Ahmed Shaikh added an answer:2Is there a formal algorithm for detecting link failures through Passive-Acknowledgement protocol for MANETs OR Wireless Sensor Networks?
Passive acknowledgement is a protocol originally proposed for MANETs to detect link failures. It says,that a node must overhear the channel to check whether its neighbor transmitted the packet or not.
You may find the following paper useful, in which authors have discussed the issue of passive acknowledgements in zigbee wireless sensor networks.
Sung, T. W., Wu, T. T., Yang, C. S., & Huang, Y. M. (2010). Reliable data broadcast for Zigbee wireless sensor networks. International journal on smart sensing and intelligent systems, 3(3), 504-520. http://www-ist.massey.ac.nz/s2is/issues/v3/n3/papers/paper11.pdfFollowing
- Walaa Ali added an answer:4What is the benefit of representing wireless sensor network as a graph?
Many papers that describe protocols for wireless sensor networks mention that the network can be represented as a graph such as unit disk graph. nodes are vertices of the graph and links between nodes are edges of the graph. I need to know if all nodes in the network know this graph in the beginning of the connection? what is confusing for me , from my knowledge i know that node know information about its direct neighbors only. how can i assume in my simulation that network with thousand of sensors , all of them have the graph that represent the whole network???
so if what i think is correct, i.e. the graph is too big and need many communication to be constructed in the beginning of the connection that mean it can't be known to all nodes in the network, what is the benefit that papers always mention that the network represented as graph????
thanks all for answering. it is now clear for meFollowing
- Sergo Shavgulidze added an answer:3Why is the definition of interleaved Gabidulin codes not similar to the definition of Reed-Solomon interleaved codes ?
interleaved Reed-Solomon codes are defined as time interleaved codes in order to benefit from the time diversity. An interleaved Gabidulin code is the direct sum of ℓ Gabidulin codes.
Rank codes (also called Gabidulin codes) are non-binary linear error-correcting codes over not Hamming (compared to Reed-Solomon codes) but rank metric.Following
- Peter T Breuer added an answer:4How can we fix problems of computer communications in a proper way?
Last decade observed a significant research effort directed towards indoor localization utilizing location fingerprinting techniques. Fingerprinting solutions generally require a pre-deployment site survey procedure during which a radio-map is constructed by laboriously collecting signal strength samples (e.g., Wi-Fi) over the whole localization area. However, such localization efforts have certain shortcomings. For example, it is time consuming, labor intensive, vulnerable to environmental changes, and the process requires certain pedigree on the surveyor that may deem the fingerprinting techniques impractical to be deployed over large areas (e.g., shopping malls, multi-storey offices/residences, etc.). Newer emerging techniques try to bypass this expensive pre-deployment effort of fingerprinting solutions altogether. They may build the radio-map through the implicit participation of the building occupants, office employee, shoppers, visitors, etc. Apart from the traditional performance comparison criteria like accuracy, precision, robustness, scalability, algorithmic complexity based on which the localization techniques were evaluated, these newer approaches warrant some additional ones. For example, whether they require an actual geographical map of the localization area, the percentage of occasional location fix to ensure reasonable accuracy, the usage of explicit/implicit user participation to construct the radio map, the usage of building landmarks (e.g., entrance, conference room, elevator, escalator, etc.) or additional sensors (e.g., accelerometer, gyroscope, compass, etc.), whether they address device heterogeneity, etc. In this article, we survey the newer emerging fingerprinting solutions that try to relieve the pre-deployment woes. We also identify some newer performance comparison criteria based on these solutions’ inherent characteristics, and apply them together with the traditional ones in order to evaluate a number of such proposed systems.Last decade observed a significant research effort directed towards indoor localization utilizing location fingerprinting techniques. Fingerprinting solutions generally require a pre-deployment site survey procedure during which a radio-map is constructed by laboriously collecting signal strength samples (e.g., Wi-Fi) over the whole localization area. However, such localization efforts have certain shortcomings. For example, it is time consuming, labor intensive, vulnerable to environmental changes, and the process requires certain pedigree on the surveyor that may deem the fingerprinting techniques impractical to be deployed over large areas (e.g., shopping malls, multi-storey offices/residences, etc.). Newer emerging techniques try to bypass this expensive pre-deployment effort of fingerprinting solutions altogether. They may build the radio-map through the implicit participation of the building occupants, office employee, shoppers, visitors, etc. Apart from the traditional performance comparison criteria like accuracy, precision, robustness, scalability, algorithmic complexity based on which the localization techniques were evaluated, these newer approaches warrant some additional ones. For example, whether they require an actual geographical map of the localization area, the percentage of occasional location fix to ensure reasonable accuracy, the usage of explicit/implicit user participation to construct the radio map, the usage of building landmarks (e.g., entrance, conference room, elevator, escalator, etc.) or additional sensors (e.g., accelerometer, gyroscope, compass, etc.), whether they address device heterogeneity, etc. In this article, we survey the newer emerging fingerprinting solutions that try to relieve the pre-deployment woes. We also identify some newer performance comparison criteria based on these solutions’ inherent characteristics, and apply them together with the traditional ones in order to evaluate a number of such proposed systems.Following
- Katumba Noah added an answer:2Which region of the network witnesses the highest buffer utilization?
As stated in the following paper,
"Balancing buffer utilization in meshes using a “restricted area” concept, by P.-J. Chuang, J.-T. Chen, and Y.-T. Jiang, in IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 8, 2002"
the region of adaptivity tends to handle the most concentrated network load which can also be translated as the highest buffer utilization.
However, according to the results presented in Fig. 6, the highest buffer utilization for unbalanced routing algorithms such as West-First or North-Last occurs at the least adaptive region of the network (i.e. West half or North half, respectively) which is really confusing.
Which one is correct, the theory or the results?
My own results obtained using the BookSim network simulator conforms to the theory. Except from the West-First results which is the same as Fig. 6(a) of the above paper.
Any explanation or hint is highly appreciated!
looked through it and believe it depends but results are more accurate west-first north-last is the least adaptive regionFollowing
- Kashif Naseer Qureshi added an answer:9What tool can generate random HTTP, FTP, Telnet, SMTP traffic for a test bed environment?
what tool can generate random realistic HTTP, FTP, Telnet, SMTP traffic for a test bed environment? I need this traffic to stimulate normal working condition of my test environment. Thanks
There are many tools available for this purpose. The selection is based on your knowledge and awareness about tool. Some tools are as follows:
- P.K. Bansal added an answer:6How can I design a primary and a secondary path from source to sink node?
refer me the code for that
Please mention which network ur refering?Following
About Computer Communications (Networks)
A computer network is a collection of computers and other hardware components interconnected by communication channels that allow sharing of resources and information.